PRISM
=====
Version: 4.8.1
Date: Fri Sep 13 10:51:36 GMT+01:00 2024
Hostname: r23m0217.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=8 -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=8
Computing reachable states... 8548 states
Reachable states exploration and model construction done in 0.092 secs.
Sorting reachable states list...
Time for model construction: 0.132 seconds.
Type: CTMC
States: 8548 (1 initial)
Transitions: 36041
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.007 seconds)
Starting Prob0...
Prob0 took 0.004 seconds.
Starting Prob1...
Prob1 took 0.006 seconds.
target=1, yes=360, no=6368, maybe=1820
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 378 iterations, 4302396 multiplications and 0.176 seconds.
Probabilistic reachability took 0.201 seconds.
Probability of reaching BSCC 1: 0.00915837014404767
Computing probability of reaching BSCC 2
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.002 seconds.
target=1, yes=198, no=7188, maybe=1162
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 212 iterations, 1595088 multiplications and 0.051 seconds.
Probabilistic reachability took 0.053 seconds.
Probability of reaching BSCC 2: 1.9584914810892497E-7
Computing probability of reaching BSCC 3
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.001 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=180, no=5870, maybe=2498
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 408 iterations, 6266880 multiplications and 0.216 seconds.
Probabilistic reachability took 0.219 seconds.
Probability of reaching BSCC 3: 4.717125290659701E-4
Computing probability of reaching BSCC 4
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=360, no=6368, maybe=1820
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 252 iterations, 2868264 multiplications and 0.091 seconds.
Probabilistic reachability took 0.092 seconds.
Probability of reaching BSCC 4: 0.00262965557150851
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=120, no=6768, maybe=1660
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 412 iterations, 4326824 multiplications and 0.132 seconds.
Probabilistic reachability took 0.133 seconds.
Probability of reaching BSCC 5: 1.3935838363759905E-5
Computing probability of reaching BSCC 6
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=66, no=7548, maybe=934
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 267 iterations, 1692780 multiplications and 0.049 seconds.
Probabilistic reachability took 0.05 seconds.
Probability of reaching BSCC 6: 1.310368102967009E-10
Computing probability of reaching BSCC 7
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=60, no=6450, maybe=2038
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 447 iterations, 5802060 multiplications and 0.19 seconds.
Probabilistic reachability took 0.192 seconds.
Probability of reaching BSCC 7: 7.130552866782659E-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=120, no=7176, maybe=1252
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 305 iterations, 2494290 multiplications and 0.077 seconds.
Probabilistic reachability took 0.077 seconds.
Probability of reaching BSCC 8: 1.6216297097981407E-6
Computing probability of reaching BSCC 9
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=120, no=6768, maybe=1660
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 411 iterations, 4316322 multiplications and 0.132 seconds.
Probabilistic reachability took 0.133 seconds.
Probability of reaching BSCC 9: 0.04013528729753044
Computing probability of reaching BSCC 10
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=66, no=7784, maybe=698
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 266 iterations, 1332660 multiplications and 0.034 seconds.
Probabilistic reachability took 0.035 seconds.
Probability of reaching BSCC 10: 3.7741800660231054E-7
Computing probability of reaching BSCC 11
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=60, no=6450, maybe=2038
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 446 iterations, 5789080 multiplications and 0.183 seconds.
Probabilistic reachability took 0.184 seconds.
Probability of reaching BSCC 11: 0.0020536026209755157
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=120, no=7620, maybe=808
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 304 iterations, 1675040 multiplications and 0.045 seconds.
Probabilistic reachability took 0.046 seconds.
Probability of reaching BSCC 12: 0.0046701879188702795
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=120, no=7176, maybe=1252
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 406 iterations, 3320268 multiplications and 0.098 seconds.
Probabilistic reachability took 0.098 seconds.
Probability of reaching BSCC 13: 4.127115215840239E-5
Computing probability of reaching BSCC 14
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=66, no=7548, maybe=934
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 247 iterations, 1565980 multiplications and 0.045 seconds.
Probabilistic reachability took 0.046 seconds.
Probability of reaching BSCC 14: 9.10898590055902E-10
Computing probability of reaching BSCC 15
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=60, no=6450, maybe=2038
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 420 iterations, 5451600 multiplications and 0.177 seconds.
Probabilistic reachability took 0.178 seconds.
Probability of reaching BSCC 15: 3.0189259120142327E-6
Computing probability of reaching BSCC 16
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=120, no=6768, maybe=1660
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 267 iterations, 2804034 multiplications and 0.088 seconds.
Probabilistic reachability took 0.089 seconds.
Probability of reaching BSCC 16: 1.698014452035351E-5
Computing probability of reaching BSCC 17
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=40, no=7416, maybe=1092
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 436 iterations, 3181928 multiplications and 0.092 seconds.
Probabilistic reachability took 0.092 seconds.
Probability of reaching BSCC 17: 6.523704742076783E-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=22, no=7780, maybe=746
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 288 iterations, 1531008 multiplications and 0.041 seconds.
Probabilistic reachability took 0.041 seconds.
Probability of reaching BSCC 18: 7.763496420573678E-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=20, no=6910, maybe=1618
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 461 iterations, 4960360 multiplications and 0.143 seconds.
Probabilistic reachability took 0.145 seconds.
Probability of reaching BSCC 19: 4.626728320674909E-9
Computing probability of reaching BSCC 20
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=40, no=7416, maybe=1092
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 317 iterations, 2313466 multiplications and 0.065 seconds.
Probabilistic reachability took 0.065 seconds.
Probability of reaching BSCC 20: 1.1388172307080929E-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=40, no=7416, maybe=1092
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 435 iterations, 3174630 multiplications and 0.087 seconds.
Probabilistic reachability took 0.087 seconds.
Probability of reaching BSCC 21: 1.8788316169378284E-4
Computing probability of reaching BSCC 22
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=22, no=7888, maybe=638
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 287 iterations, 1351770 multiplications and 0.033 seconds.
Probabilistic reachability took 0.034 seconds.
Probability of reaching BSCC 22: 2.2360604937138434E-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=20, no=6910, maybe=1618
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 460 iterations, 4949600 multiplications and 0.144 seconds.
Probabilistic reachability took 0.144 seconds.
Probability of reaching BSCC 23: 1.3325002300038051E-5
Computing probability of reaching BSCC 24
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=40, no=7700, maybe=808
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 316 iterations, 1741160 multiplications and 0.046 seconds.
Probabilistic reachability took 0.047 seconds.
Probability of reaching BSCC 24: 3.279730365940495E-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=120, no=7620, maybe=808
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 405 iterations, 2231550 multiplications and 0.058 seconds.
Probabilistic reachability took 0.058 seconds.
Probability of reaching BSCC 25: 0.11885999055391688
Computing probability of reaching BSCC 26
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=66, no=7784, maybe=698
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 246 iterations, 1232460 multiplications and 0.032 seconds.
Probabilistic reachability took 0.033 seconds.
Probability of reaching BSCC 26: 2.6236456304641985E-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=60, no=6450, maybe=2038
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 419 iterations, 5438620 multiplications and 0.171 seconds.
Probabilistic reachability took 0.172 seconds.
Probability of reaching BSCC 27: 0.008694615403807554
Computing probability of reaching BSCC 28
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=120, no=6768, maybe=1660
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 266 iterations, 2793532 multiplications and 0.086 seconds.
Probabilistic reachability took 0.087 seconds.
Probability of reaching BSCC 28: 0.0489034509453418
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=40, no=7700, maybe=808
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 435 iterations, 2396850 multiplications and 0.063 seconds.
Probabilistic reachability took 0.064 seconds.
Probability of reaching BSCC 29: 1.8788173418973265E-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=22, no=7888, maybe=638
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 287 iterations, 1351770 multiplications and 0.033 seconds.
Probabilistic reachability took 0.034 seconds.
Probability of reaching BSCC 30: 2.23610449424692E-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=20, no=6910, maybe=1618
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 460 iterations, 4949600 multiplications and 0.144 seconds.
Probabilistic reachability took 0.144 seconds.
Probability of reaching BSCC 31: 1.332515197799849E-5
Computing probability of reaching BSCC 32
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.001 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=40, no=7416, maybe=1092
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 316 iterations, 2306168 multiplications and 0.065 seconds.
Probabilistic reachability took 0.066 seconds.
Probability of reaching BSCC 32: 3.2798486306208797E-5
Computing probability of reaching BSCC 33
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=40, no=7700, maybe=808
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 434 iterations, 2391340 multiplications and 0.062 seconds.
Probabilistic reachability took 0.063 seconds.
Probability of reaching BSCC 33: 0.5411007340439669
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=22, no=7952, maybe=574
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 286 iterations, 1261832 multiplications and 0.03 seconds.
Probabilistic reachability took 0.031 seconds.
Probability of reaching BSCC 34: 6.4405811948922865E-6
Computing probability of reaching BSCC 35
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=20, no=6910, maybe=1618
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 459 iterations, 4938840 multiplications and 0.143 seconds.
Probabilistic reachability took 0.144 seconds.
Probability of reaching BSCC 35: 0.03837650893893683
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=40, no=7700, maybe=808
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 315 iterations, 1735650 multiplications and 0.046 seconds.
Probabilistic reachability took 0.047 seconds.
Probability of reaching BSCC 36: 0.094457818782561
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:
64:(1,0,0,0,0,9,false,false,false)=0.00915837014404767
65:(1,0,0,0,0,9,false,false,true)=1.9584914810892497E-7
66:(1,0,0,0,0,9,false,true,false)=4.717125290659701E-4
67:(1,0,0,0,0,9,false,true,true)=0.00262965557150851
196:(1,0,0,1,0,9,false,false,false)=1.3935838363759905E-5
197:(1,0,0,1,0,9,false,false,true)=1.310368102967009E-10
198:(1,0,0,1,0,9,false,true,false)=7.130552866782659E-7
199:(1,0,0,1,0,9,false,true,true)=1.6216297097981407E-6
328:(1,0,0,2,0,9,false,false,false)=0.04013528729753044
329:(1,0,0,2,0,9,false,false,true)=3.7741800660231054E-7
330:(1,0,0,2,0,9,false,true,false)=0.0020536026209755157
331:(1,0,0,2,0,9,false,true,true)=0.0046701879188702795
1128:(1,1,0,0,0,9,false,false,false)=4.127115215840239E-5
1129:(1,1,0,0,0,9,false,false,true)=9.10898590055902E-10
1130:(1,1,0,0,0,9,false,true,false)=3.0189259120142327E-6
1131:(1,1,0,0,0,9,false,true,true)=1.698014452035351E-5
1260:(1,1,0,1,0,9,false,false,false)=6.523704742076783E-8
1261:(1,1,0,1,0,9,false,false,true)=7.763496420573678E-13
1262:(1,1,0,1,0,9,false,true,false)=4.626728320674909E-9
1263:(1,1,0,1,0,9,false,true,true)=1.1388172307080929E-8
1392:(1,1,0,2,0,9,false,false,false)=1.8788316169378284E-4
1393:(1,1,0,2,0,9,false,false,true)=2.2360604937138434E-9
1394:(1,1,0,2,0,9,false,true,false)=1.3325002300038051E-5
1395:(1,1,0,2,0,9,false,true,true)=3.279730365940495E-5
2192:(1,2,0,0,0,9,false,false,false)=0.11885999055391688
2193:(1,2,0,0,0,9,false,false,true)=2.6236456304641985E-6
2194:(1,2,0,0,0,9,false,true,false)=0.008694615403807554
2195:(1,2,0,0,0,9,false,true,true)=0.0489034509453418
2324:(1,2,0,1,0,9,false,false,false)=1.8788173418973265E-4
2325:(1,2,0,1,0,9,false,false,true)=2.23610449424692E-9
2326:(1,2,0,1,0,9,false,true,false)=1.332515197799849E-5
2327:(1,2,0,1,0,9,false,true,true)=3.2798486306208797E-5
2456:(1,2,0,2,0,9,false,false,false)=0.5411007340439669
2457:(1,2,0,2,0,9,false,false,true)=6.4405811948922865E-6
2458:(1,2,0,2,0,9,false,true,false)=0.03837650893893683
2459:(1,2,0,2,0,9,false,true,true)=0.094457818782561
Time for steady-state probability computation: 3.475 seconds.