PRISM
=====
Version: 4.8.1
Date: Fri Sep 13 10:51:34 GMT+01:00 2024
Hostname: r23m0213.hpc.itc.rwth-aachen.de
Memory limits: cudd=1g, java(heap)=1g
Command line: prism /rwthfs/rz/clusterevts/evt-benchmarking/benchmarks/ctmc/embedded/embedded.prism -const MAX_COUNT=5 -steadystate -explicit -relative -epsilon 0.001
Parsing model file "/rwthfs/rz/clusterevts/evt-benchmarking/benchmarks/ctmc/embedded/embedded.prism"...
Type: CTMC
Modules: sensors proci actuators proco procm bus
Variables: s i a o m count comp reqi reqo
---------------------------------------------------------------------
Computing steady-state probabilities...
Building model...
Model constants: MAX_COUNT=5
Computing reachable states... 6013 states
Reachable states exploration and model construction done in 0.073 secs.
Sorting reachable states list...
Time for model construction: 0.103 seconds.
Type: CTMC
States: 6013 (1 initial)
Transitions: 25340
Building embedded DTMC...
Doing steady-state computation in embedded DTMC (with exit-rate weighting for BSCC probabilities)...
Computing probability of reaching BSCC 1
Starting probabilistic reachability...
Calculating predecessor relation for discrete-time Markov chain... done (0.004 seconds)
Starting Prob0...
Prob0 took 0.003 seconds.
Starting Prob1...
Prob1 took 0.004 seconds.
target=1, yes=252, no=4481, maybe=1280
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 375 iterations, 3001500 multiplications and 0.11 seconds.
Probabilistic reachability took 0.127 seconds.
Probability of reaching BSCC 1: 0.00915840317280815
Computing probability of reaching BSCC 2
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.001 seconds.
Starting Prob1...
Prob1 took 0.002 seconds.
target=1, yes=144, no=5046, maybe=823
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 212 iterations, 1128264 multiplications and 0.031 seconds.
Probabilistic reachability took 0.035 seconds.
Probability of reaching BSCC 2: 1.9585035218060688E-7
Computing probability of reaching BSCC 3
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.002 seconds.
target=1, yes=126, no=4136, maybe=1751
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 405 iterations, 4361850 multiplications and 0.147 seconds.
Probabilistic reachability took 0.149 seconds.
Probability of reaching BSCC 3: 4.7171402251580533E-4
Computing probability of reaching BSCC 4
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=252, no=4481, maybe=1280
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 249 iterations, 1992996 multiplications and 0.059 seconds.
Probabilistic reachability took 0.06 seconds.
Probability of reaching BSCC 4: 0.002629668137876643
Computing probability of reaching BSCC 5
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=84, no=4761, maybe=1168
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 409 iterations, 3021692 multiplications and 0.085 seconds.
Probabilistic reachability took 0.086 seconds.
Probability of reaching BSCC 5: 1.3935889700675317E-5
Computing probability of reaching BSCC 6
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=48, no=5304, maybe=661
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 267 iterations, 1196160 multiplications and 0.031 seconds.
Probabilistic reachability took 0.031 seconds.
Probability of reaching BSCC 6: 1.3103782323816793E-10
Computing probability of reaching BSCC 7
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=42, no=4542, maybe=1429
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 444 iterations, 4042176 multiplications and 0.122 seconds.
Probabilistic reachability took 0.122 seconds.
Probability of reaching BSCC 7: 7.130575139794596E-7
Computing probability of reaching BSCC 8
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=84, no=5049, maybe=880
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 302 iterations, 1735896 multiplications and 0.046 seconds.
Probabilistic reachability took 0.046 seconds.
Probability of reaching BSCC 8: 1.6216402350369927E-6
Computing probability of reaching BSCC 9
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=84, no=4761, maybe=1168
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 408 iterations, 3014304 multiplications and 0.083 seconds.
Probabilistic reachability took 0.084 seconds.
Probability of reaching BSCC 9: 0.04013543511917961
Computing probability of reaching BSCC 10
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=48, no=5474, maybe=491
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 266 iterations, 936852 multiplications and 0.02 seconds.
Probabilistic reachability took 0.02 seconds.
Probability of reaching BSCC 10: 3.7742090152328005E-7
Computing probability of reaching BSCC 11
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=42, no=4542, maybe=1429
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 443 iterations, 4033072 multiplications and 0.118 seconds.
Probabilistic reachability took 0.118 seconds.
Probability of reaching BSCC 11: 0.0020536090356400843
Computing probability of reaching BSCC 12
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=84, no=5361, maybe=568
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 301 iterations, 1165472 multiplications and 0.027 seconds.
Probabilistic reachability took 0.028 seconds.
Probability of reaching BSCC 12: 0.0046702182319588075
Computing probability of reaching BSCC 13
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=84, no=5049, maybe=880
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 403 iterations, 2316444 multiplications and 0.063 seconds.
Probabilistic reachability took 0.063 seconds.
Probability of reaching BSCC 13: 4.127134186259512E-5
Computing probability of reaching BSCC 14
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=48, no=5304, maybe=661
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 247 iterations, 1106560 multiplications and 0.027 seconds.
Probabilistic reachability took 0.027 seconds.
Probability of reaching BSCC 14: 9.10905105061119E-10
Computing probability of reaching BSCC 15
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.001 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=42, no=4542, maybe=1429
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 417 iterations, 3796368 multiplications and 0.113 seconds.
Probabilistic reachability took 0.114 seconds.
Probability of reaching BSCC 15: 3.0189364255417495E-6
Computing probability of reaching BSCC 16
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=84, no=4761, maybe=1168
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 264 iterations, 1950432 multiplications and 0.057 seconds.
Probabilistic reachability took 0.057 seconds.
Probability of reaching BSCC 16: 1.6980232892614173E-5
Computing probability of reaching BSCC 17
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=28, no=5217, maybe=768
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 433 iterations, 2222156 multiplications and 0.057 seconds.
Probabilistic reachability took 0.058 seconds.
Probability of reaching BSCC 17: 6.523735170319059E-8
Computing probability of reaching BSCC 18
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=16, no=5470, maybe=527
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 288 iterations, 1080000 multiplications and 0.024 seconds.
Probabilistic reachability took 0.024 seconds.
Probability of reaching BSCC 18: 7.763561618926571E-13
Computing probability of reaching BSCC 19
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=14, no=4864, maybe=1135
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 458 iterations, 3457900 multiplications and 0.097 seconds.
Probabilistic reachability took 0.098 seconds.
Probability of reaching BSCC 19: 4.626743799970645E-9
Computing probability of reaching BSCC 20
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=28, no=5217, maybe=768
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 314 iterations, 1611448 multiplications and 0.043 seconds.
Probabilistic reachability took 0.044 seconds.
Probability of reaching BSCC 20: 1.1388249574332441E-8
Computing probability of reaching BSCC 21
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=28, no=5217, maybe=768
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 432 iterations, 2217024 multiplications and 0.055 seconds.
Probabilistic reachability took 0.055 seconds.
Probability of reaching BSCC 21: 1.8788403786398282E-4
Computing probability of reaching BSCC 22
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=16, no=5548, maybe=449
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 287 iterations, 950544 multiplications and 0.019 seconds.
Probabilistic reachability took 0.019 seconds.
Probability of reaching BSCC 22: 2.2360791401286376E-9
Computing probability of reaching BSCC 23
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=14, no=4864, maybe=1135
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 457 iterations, 3450350 multiplications and 0.094 seconds.
Probabilistic reachability took 0.094 seconds.
Probability of reaching BSCC 23: 1.3325046880670787E-5
Computing probability of reaching BSCC 24
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=28, no=5417, maybe=568
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 313 iterations, 1211936 multiplications and 0.027 seconds.
Probabilistic reachability took 0.027 seconds.
Probability of reaching BSCC 24: 3.279752619059845E-5
Computing probability of reaching BSCC 25
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=84, no=5361, maybe=568
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 402 iterations, 1556544 multiplications and 0.034 seconds.
Probabilistic reachability took 0.034 seconds.
Probability of reaching BSCC 25: 0.11886053691158084
Computing probability of reaching BSCC 26
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=48, no=5474, maybe=491
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 246 iterations, 866412 multiplications and 0.019 seconds.
Probabilistic reachability took 0.019 seconds.
Probability of reaching BSCC 26: 2.623664239345286E-6
Computing probability of reaching BSCC 27
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=42, no=4542, maybe=1429
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 416 iterations, 3787264 multiplications and 0.111 seconds.
Probabilistic reachability took 0.112 seconds.
Probability of reaching BSCC 27: 0.00869464568332706
Computing probability of reaching BSCC 28
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=84, no=4761, maybe=1168
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 263 iterations, 1943044 multiplications and 0.056 seconds.
Probabilistic reachability took 0.057 seconds.
Probability of reaching BSCC 28: 0.048903704077583245
Computing probability of reaching BSCC 29
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=28, no=5417, maybe=568
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 432 iterations, 1672704 multiplications and 0.037 seconds.
Probabilistic reachability took 0.038 seconds.
Probability of reaching BSCC 29: 1.8788261053823257E-4
Computing probability of reaching BSCC 30
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=16, no=5548, maybe=449
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 287 iterations, 950544 multiplications and 0.019 seconds.
Probabilistic reachability took 0.019 seconds.
Probability of reaching BSCC 30: 2.2361231410354153E-9
Computing probability of reaching BSCC 31
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=14, no=4864, maybe=1135
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 457 iterations, 3450350 multiplications and 0.094 seconds.
Probabilistic reachability took 0.094 seconds.
Probability of reaching BSCC 31: 1.332519655921095E-5
Computing probability of reaching BSCC 32
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=28, no=5217, maybe=768
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 313 iterations, 1606316 multiplications and 0.041 seconds.
Probabilistic reachability took 0.041 seconds.
Probability of reaching BSCC 32: 3.279870778623149E-5
Computing probability of reaching BSCC 33
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=28, no=5417, maybe=568
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 431 iterations, 1668832 multiplications and 0.037 seconds.
Probabilistic reachability took 0.037 seconds.
Probability of reaching BSCC 33: 0.5411032574583222
Computing probability of reaching BSCC 34
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=16, no=5594, maybe=403
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 286 iterations, 886028 multiplications and 0.017 seconds.
Probabilistic reachability took 0.018 seconds.
Probability of reaching BSCC 34: 6.440634510602542E-6
Computing probability of reaching BSCC 35
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=14, no=4864, maybe=1135
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 456 iterations, 3442800 multiplications and 0.093 seconds.
Probabilistic reachability took 0.093 seconds.
Probability of reaching BSCC 35: 0.03837663733358008
Computing probability of reaching BSCC 36
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=28, no=5417, maybe=568
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 312 iterations, 1208064 multiplications and 0.03 seconds.
Probabilistic reachability took 0.031 seconds.
Probability of reaching BSCC 36: 0.09445845665301231
Computing steady-state probabilities for BSCC 1
Starting value iteration...
Power method: 1 iterations in 0.003 seconds.
Computing steady-state probabilities for BSCC 2
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 3
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 4
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 5
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 6
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 7
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 8
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 9
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 10
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 11
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 12
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 13
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 14
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 15
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 16
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 17
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 18
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 19
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 20
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 21
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 22
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 23
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 24
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 25
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 26
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 27
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 28
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 29
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 30
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 31
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 32
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 33
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 34
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 35
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 36
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Printing steady-state probabilities in plain text format below:
43:(1,0,0,0,0,6,false,false,false)=0.00915840317280815
44:(1,0,0,0,0,6,false,false,true)=1.9585035218060688E-7
45:(1,0,0,0,0,6,false,true,false)=4.7171402251580533E-4
46:(1,0,0,0,0,6,false,true,true)=0.002629668137876643
136:(1,0,0,1,0,6,false,false,false)=1.3935889700675317E-5
137:(1,0,0,1,0,6,false,false,true)=1.3103782323816793E-10
138:(1,0,0,1,0,6,false,true,false)=7.130575139794596E-7
139:(1,0,0,1,0,6,false,true,true)=1.6216402350369927E-6
229:(1,0,0,2,0,6,false,false,false)=0.04013543511917961
230:(1,0,0,2,0,6,false,false,true)=3.7742090152328005E-7
231:(1,0,0,2,0,6,false,true,false)=0.0020536090356400843
232:(1,0,0,2,0,6,false,true,true)=0.0046702182319588075
792:(1,1,0,0,0,6,false,false,false)=4.127134186259512E-5
793:(1,1,0,0,0,6,false,false,true)=9.10905105061119E-10
794:(1,1,0,0,0,6,false,true,false)=3.0189364255417495E-6
795:(1,1,0,0,0,6,false,true,true)=1.6980232892614173E-5
885:(1,1,0,1,0,6,false,false,false)=6.523735170319059E-8
886:(1,1,0,1,0,6,false,false,true)=7.763561618926571E-13
887:(1,1,0,1,0,6,false,true,false)=4.626743799970645E-9
888:(1,1,0,1,0,6,false,true,true)=1.1388249574332441E-8
978:(1,1,0,2,0,6,false,false,false)=1.8788403786398282E-4
979:(1,1,0,2,0,6,false,false,true)=2.2360791401286376E-9
980:(1,1,0,2,0,6,false,true,false)=1.3325046880670787E-5
981:(1,1,0,2,0,6,false,true,true)=3.279752619059845E-5
1541:(1,2,0,0,0,6,false,false,false)=0.11886053691158084
1542:(1,2,0,0,0,6,false,false,true)=2.623664239345286E-6
1543:(1,2,0,0,0,6,false,true,false)=0.00869464568332706
1544:(1,2,0,0,0,6,false,true,true)=0.048903704077583245
1634:(1,2,0,1,0,6,false,false,false)=1.8788261053823257E-4
1635:(1,2,0,1,0,6,false,false,true)=2.2361231410354153E-9
1636:(1,2,0,1,0,6,false,true,false)=1.332519655921095E-5
1637:(1,2,0,1,0,6,false,true,true)=3.279870778623149E-5
1727:(1,2,0,2,0,6,false,false,false)=0.5411032574583222
1728:(1,2,0,2,0,6,false,false,true)=6.440634510602542E-6
1729:(1,2,0,2,0,6,false,true,false)=0.03837663733358008
1730:(1,2,0,2,0,6,false,true,true)=0.09445845665301231
Time for steady-state probability computation: 2.22 seconds.