PRISM
=====
Version: 4.8.1
Date: Fri Sep 13 10:51:36 GMT+01:00 2024
Hostname: r23m0215.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=7 -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=7
Computing reachable states... 7703 states
Reachable states exploration and model construction done in 0.099 secs.
Sorting reachable states list...
Time for model construction: 0.143 seconds.
Type: CTMC
States: 7703 (1 initial)
Transitions: 32474
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=324, no=5739, maybe=1640
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 377 iterations, 3866512 multiplications and 0.175 seconds.
Probabilistic reachability took 0.199 seconds.
Probability of reaching BSCC 1: 0.009158372657547107
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=180, no=6474, maybe=1049
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 212 iterations, 1439480 multiplications and 0.046 seconds.
Probabilistic reachability took 0.049 seconds.
Probability of reaching BSCC 2: 1.9584924222167286E-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=162, no=5292, maybe=2249
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 407 iterations, 5628810 multiplications and 0.203 seconds.
Probabilistic reachability took 0.206 seconds.
Probability of reaching BSCC 3: 4.717126451442633E-4
Computing probability of reaching BSCC 4
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.016 seconds.
Starting Prob1...
Prob1 took 0.002 seconds.
target=1, yes=324, no=5739, maybe=1640
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 251 iterations, 2574256 multiplications and 0.086 seconds.
Probabilistic reachability took 0.104 seconds.
Probability of reaching BSCC 4: 0.0026296561320550732
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=108, no=6099, maybe=1496
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 411 iterations, 3889704 multiplications and 0.12 seconds.
Probabilistic reachability took 0.122 seconds.
Probability of reaching BSCC 5: 1.393584230398436E-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=60, no=6800, maybe=843
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 267 iterations, 1527240 multiplications and 0.043 seconds.
Probabilistic reachability took 0.043 seconds.
Probability of reaching BSCC 6: 1.310368894939779E-10
Computing probability of reaching BSCC 7
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.001 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=54, no=5814, maybe=1835
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 446 iterations, 5212848 multiplications and 0.175 seconds.
Probabilistic reachability took 0.176 seconds.
Probability of reaching BSCC 7: 7.130554598215759E-7
Computing probability of reaching BSCC 8
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=108, no=6467, maybe=1128
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 304 iterations, 2239872 multiplications and 0.071 seconds.
Probabilistic reachability took 0.072 seconds.
Probability of reaching BSCC 8: 1.621630236524243E-6
Computing probability of reaching BSCC 9
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.001 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=108, no=6099, maybe=1496
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 410 iterations, 3880240 multiplications and 0.129 seconds.
Probabilistic reachability took 0.13 seconds.
Probability of reaching BSCC 9: 0.040135298635758106
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=60, no=7014, maybe=629
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 266 iterations, 1200724 multiplications and 0.03 seconds.
Probabilistic reachability took 0.032 seconds.
Probability of reaching BSCC 10: 3.7741823293488323E-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=54, no=5814, maybe=1835
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 445 iterations, 5201160 multiplications and 0.175 seconds.
Probabilistic reachability took 0.176 seconds.
Probability of reaching BSCC 11: 0.0020536031196310336
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=108, no=6867, maybe=728
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 303 iterations, 1504092 multiplications and 0.041 seconds.
Probabilistic reachability took 0.042 seconds.
Probability of reaching BSCC 12: 0.004670189435967428
Computing probability of reaching BSCC 13
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=108, no=6467, maybe=1128
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 405 iterations, 2984040 multiplications and 0.091 seconds.
Probabilistic reachability took 0.092 seconds.
Probability of reaching BSCC 13: 4.1271166628404364E-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=60, no=6800, maybe=843
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 247 iterations, 1412840 multiplications and 0.045 seconds.
Probabilistic reachability took 0.045 seconds.
Probability of reaching BSCC 14: 9.108990997123231E-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=54, no=5814, maybe=1835
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 419 iterations, 4897272 multiplications and 0.163 seconds.
Probabilistic reachability took 0.164 seconds.
Probability of reaching BSCC 15: 3.0189267293845863E-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=108, no=6099, maybe=1496
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 266 iterations, 2517424 multiplications and 0.081 seconds.
Probabilistic reachability took 0.082 seconds.
Probability of reaching BSCC 16: 1.6980148903131792E-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=36, no=6683, maybe=984
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 435 iterations, 2860560 multiplications and 0.08 seconds.
Probabilistic reachability took 0.082 seconds.
Probability of reaching BSCC 17: 6.523707078975038E-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=20, no=7010, maybe=673
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 288 iterations, 1380672 multiplications and 0.036 seconds.
Probabilistic reachability took 0.036 seconds.
Probability of reaching BSCC 18: 7.763501519862718E-13
Computing probability of reaching BSCC 19
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.001 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=18, no=6228, maybe=1457
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 460 iterations, 4457400 multiplications and 0.134 seconds.
Probabilistic reachability took 0.135 seconds.
Probability of reaching BSCC 19: 4.626729524384377E-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=36, no=6683, maybe=984
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 316 iterations, 2078016 multiplications and 0.059 seconds.
Probabilistic reachability took 0.06 seconds.
Probability of reaching BSCC 20: 1.138817643006481E-8
Computing probability of reaching BSCC 21
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=36, no=6683, maybe=984
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 434 iterations, 2853984 multiplications and 0.081 seconds.
Probabilistic reachability took 0.082 seconds.
Probability of reaching BSCC 21: 1.8788322894162972E-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=20, no=7108, maybe=575
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 287 iterations, 1218028 multiplications and 0.028 seconds.
Probabilistic reachability took 0.029 seconds.
Probability of reaching BSCC 22: 2.236061952019358E-9
Computing probability of reaching BSCC 23
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.001 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=18, no=6228, maybe=1457
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 459 iterations, 4447710 multiplications and 0.136 seconds.
Probabilistic reachability took 0.137 seconds.
Probability of reaching BSCC 23: 1.332500576674097E-5
Computing probability of reaching BSCC 24
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.001 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=36, no=6939, maybe=728
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 315 iterations, 1563660 multiplications and 0.043 seconds.
Probabilistic reachability took 0.044 seconds.
Probability of reaching BSCC 24: 3.279731553402396E-5
Computing probability of reaching BSCC 25
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=108, no=6867, maybe=728
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 404 iterations, 2005456 multiplications and 0.054 seconds.
Probabilistic reachability took 0.055 seconds.
Probability of reaching BSCC 25: 0.11886003222832152
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=60, no=7014, maybe=629
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 246 iterations, 1110444 multiplications and 0.031 seconds.
Probabilistic reachability took 0.032 seconds.
Probability of reaching BSCC 26: 2.6236470861389004E-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=54, no=5814, maybe=1835
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 418 iterations, 4885584 multiplications and 0.167 seconds.
Probabilistic reachability took 0.168 seconds.
Probability of reaching BSCC 27: 0.008694617757825113
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=108, no=6099, maybe=1496
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 265 iterations, 2507960 multiplications and 0.079 seconds.
Probabilistic reachability took 0.08 seconds.
Probability of reaching BSCC 28: 0.0489034631132413
Computing probability of reaching BSCC 29
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=36, no=6939, maybe=728
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 434 iterations, 2154376 multiplications and 0.055 seconds.
Probabilistic reachability took 0.056 seconds.
Probability of reaching BSCC 29: 1.8788180149357218E-4
Computing probability of reaching BSCC 30
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=20, no=7108, maybe=575
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 287 iterations, 1218028 multiplications and 0.028 seconds.
Probabilistic reachability took 0.029 seconds.
Probability of reaching BSCC 30: 2.236105952581853E-9
Computing probability of reaching BSCC 31
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=18, no=6228, maybe=1457
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 459 iterations, 4447710 multiplications and 0.13 seconds.
Probabilistic reachability took 0.131 seconds.
Probability of reaching BSCC 31: 1.332515544467768E-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=36, no=6683, maybe=984
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 315 iterations, 2071440 multiplications and 0.057 seconds.
Probabilistic reachability took 0.057 seconds.
Probability of reaching BSCC 32: 3.2798497834280866E-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=36, no=6939, maybe=728
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 433 iterations, 2149412 multiplications and 0.054 seconds.
Probabilistic reachability took 0.054 seconds.
Probability of reaching BSCC 33: 0.5411009277213447
Computing probability of reaching BSCC 34
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=20, no=7166, maybe=517
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 286 iterations, 1136564 multiplications and 0.025 seconds.
Probabilistic reachability took 0.026 seconds.
Probability of reaching BSCC 34: 6.4405853645016625E-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=18, no=6228, maybe=1457
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 458 iterations, 4438020 multiplications and 0.129 seconds.
Probabilistic reachability took 0.13 seconds.
Probability of reaching BSCC 35: 0.038376518923029325
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=36, no=6939, maybe=728
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 314 iterations, 1558696 multiplications and 0.038 seconds.
Probabilistic reachability took 0.039 seconds.
Probability of reaching BSCC 36: 0.09445785198585407
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.001 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:
57:(1,0,0,0,0,8,false,false,false)=0.009158372657547107
58:(1,0,0,0,0,8,false,false,true)=1.9584924222167286E-7
59:(1,0,0,0,0,8,false,true,false)=4.717126451442633E-4
60:(1,0,0,0,0,8,false,true,true)=0.0026296561320550732
176:(1,0,0,1,0,8,false,false,false)=1.393584230398436E-5
177:(1,0,0,1,0,8,false,false,true)=1.310368894939779E-10
178:(1,0,0,1,0,8,false,true,false)=7.130554598215759E-7
179:(1,0,0,1,0,8,false,true,true)=1.621630236524243E-6
295:(1,0,0,2,0,8,false,false,false)=0.040135298635758106
296:(1,0,0,2,0,8,false,false,true)=3.7741823293488323E-7
297:(1,0,0,2,0,8,false,true,false)=0.0020536031196310336
298:(1,0,0,2,0,8,false,true,true)=0.004670189435967428
1016:(1,1,0,0,0,8,false,false,false)=4.1271166628404364E-5
1017:(1,1,0,0,0,8,false,false,true)=9.108990997123231E-10
1018:(1,1,0,0,0,8,false,true,false)=3.0189267293845863E-6
1019:(1,1,0,0,0,8,false,true,true)=1.6980148903131792E-5
1135:(1,1,0,1,0,8,false,false,false)=6.523707078975038E-8
1136:(1,1,0,1,0,8,false,false,true)=7.763501519862718E-13
1137:(1,1,0,1,0,8,false,true,false)=4.626729524384377E-9
1138:(1,1,0,1,0,8,false,true,true)=1.138817643006481E-8
1254:(1,1,0,2,0,8,false,false,false)=1.8788322894162972E-4
1255:(1,1,0,2,0,8,false,false,true)=2.236061952019358E-9
1256:(1,1,0,2,0,8,false,true,false)=1.332500576674097E-5
1257:(1,1,0,2,0,8,false,true,true)=3.279731553402396E-5
1975:(1,2,0,0,0,8,false,false,false)=0.11886003222832152
1976:(1,2,0,0,0,8,false,false,true)=2.6236470861389004E-6
1977:(1,2,0,0,0,8,false,true,false)=0.008694617757825113
1978:(1,2,0,0,0,8,false,true,true)=0.0489034631132413
2094:(1,2,0,1,0,8,false,false,false)=1.8788180149357218E-4
2095:(1,2,0,1,0,8,false,false,true)=2.236105952581853E-9
2096:(1,2,0,1,0,8,false,true,false)=1.332515544467768E-5
2097:(1,2,0,1,0,8,false,true,true)=3.2798497834280866E-5
2213:(1,2,0,2,0,8,false,false,false)=0.5411009277213447
2214:(1,2,0,2,0,8,false,false,true)=6.4405853645016625E-6
2215:(1,2,0,2,0,8,false,true,false)=0.038376518923029325
2216:(1,2,0,2,0,8,false,true,true)=0.09445785198585407
Time for steady-state probability computation: 3.272 seconds.