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=6 -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=6
Computing reachable states... 6858 states
Reachable states exploration and model construction done in 0.095 secs.
Sorting reachable states list...
Time for model construction: 0.135 seconds.
Type: CTMC
States: 6858 (1 initial)
Transitions: 28907
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.005 seconds)
Starting Prob0...
Prob0 took 0.004 seconds.
Starting Prob1...
Prob1 took 0.005 seconds.
target=1, yes=288, no=5110, maybe=1460
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 376 iterations, 3432880 multiplications and 0.149 seconds.
Probabilistic reachability took 0.171 seconds.
Probability of reaching BSCC 1: 0.00915838029616384
Computing probability of reaching BSCC 2
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.004 seconds.
target=1, yes=162, no=5760, maybe=936
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 212 iterations, 1283872 multiplications and 0.049 seconds.
Probabilistic reachability took 0.053 seconds.
Probability of reaching BSCC 2: 1.958495217837682E-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=144, no=4714, maybe=2000
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 406 iterations, 4993800 multiplications and 0.184 seconds.
Probabilistic reachability took 0.187 seconds.
Probability of reaching BSCC 3: 4.7171299214381497E-4
Computing probability of reaching BSCC 4
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.002 seconds.
target=1, yes=288, no=5110, maybe=1460
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 250 iterations, 2282500 multiplications and 0.079 seconds.
Probabilistic reachability took 0.081 seconds.
Probability of reaching BSCC 4: 0.002629658902116039
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=96, no=5430, maybe=1332
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 410 iterations, 3454660 multiplications and 0.117 seconds.
Probabilistic reachability took 0.118 seconds.
Probability of reaching BSCC 5: 1.393585417891039E-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=54, no=6052, maybe=752
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 267 iterations, 1361700 multiplications and 0.039 seconds.
Probabilistic reachability took 0.039 seconds.
Probability of reaching BSCC 6: 1.3103712470586378E-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=48, no=5178, maybe=1632
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 445 iterations, 4626220 multiplications and 0.152 seconds.
Probabilistic reachability took 0.153 seconds.
Probability of reaching BSCC 7: 7.130559774281787E-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=96, no=5758, maybe=1004
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 303 iterations, 1987074 multiplications and 0.06 seconds.
Probabilistic reachability took 0.061 seconds.
Probability of reaching BSCC 8: 1.6216325766531175E-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=96, no=5430, maybe=1332
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 409 iterations, 3446234 multiplications and 0.108 seconds.
Probabilistic reachability took 0.109 seconds.
Probability of reaching BSCC 9: 0.0401353328259023
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=54, no=6244, maybe=560
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 266 iterations, 1068788 multiplications and 0.027 seconds.
Probabilistic reachability took 0.028 seconds.
Probability of reaching BSCC 10: 3.7741890514604277E-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=48, no=5178, maybe=1632
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 444 iterations, 4615824 multiplications and 0.151 seconds.
Probabilistic reachability took 0.152 seconds.
Probability of reaching BSCC 11: 0.0020536046103466392
Computing probability of reaching BSCC 12
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=96, no=6114, maybe=648
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 302 iterations, 1334236 multiplications and 0.034 seconds.
Probabilistic reachability took 0.034 seconds.
Probability of reaching BSCC 12: 0.0046701961756696175
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=96, no=5758, maybe=1004
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 404 iterations, 2649432 multiplications and 0.076 seconds.
Probabilistic reachability took 0.076 seconds.
Probability of reaching BSCC 13: 4.12712104990099E-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=54, no=6052, maybe=752
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 247 iterations, 1259700 multiplications and 0.035 seconds.
Probabilistic reachability took 0.036 seconds.
Probability of reaching BSCC 14: 9.109006128542815E-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=48, no=5178, maybe=1632
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 418 iterations, 4345528 multiplications and 0.139 seconds.
Probabilistic reachability took 0.14 seconds.
Probability of reaching BSCC 15: 3.0189291707572065E-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=96, no=5430, maybe=1332
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 265 iterations, 2232890 multiplications and 0.074 seconds.
Probabilistic reachability took 0.075 seconds.
Probability of reaching BSCC 16: 1.6980168545374716E-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=32, no=5950, maybe=876
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 434 iterations, 2540636 multiplications and 0.071 seconds.
Probabilistic reachability took 0.072 seconds.
Probability of reaching BSCC 17: 6.523714120521004E-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=18, no=6240, maybe=600
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 288 iterations, 1230336 multiplications and 0.031 seconds.
Probabilistic reachability took 0.031 seconds.
Probability of reaching BSCC 18: 7.763516661339682E-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=16, no=5546, maybe=1296
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 459 iterations, 3956580 multiplications and 0.12 seconds.
Probabilistic reachability took 0.121 seconds.
Probability of reaching BSCC 19: 4.6267331195676125E-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=32, no=5950, maybe=876
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 315 iterations, 1844010 multiplications and 0.051 seconds.
Probabilistic reachability took 0.052 seconds.
Probability of reaching BSCC 20: 1.1388193704826258E-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=32, no=5950, maybe=876
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 433 iterations, 2534782 multiplications and 0.067 seconds.
Probabilistic reachability took 0.067 seconds.
Probability of reaching BSCC 21: 1.8788343168323703E-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=18, no=6328, maybe=512
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 287 iterations, 1084286 multiplications and 0.024 seconds.
Probabilistic reachability took 0.025 seconds.
Probability of reaching BSCC 22: 2.2360662823247403E-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=16, no=5546, maybe=1296
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 458 iterations, 3947960 multiplications and 0.117 seconds.
Probabilistic reachability took 0.117 seconds.
Probability of reaching BSCC 23: 1.3325016120929072E-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=32, no=6178, maybe=648
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 314 iterations, 1387252 multiplications and 0.037 seconds.
Probabilistic reachability took 0.038 seconds.
Probability of reaching BSCC 24: 3.279736528581008E-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=96, no=6114, maybe=648
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 403 iterations, 1780454 multiplications and 0.046 seconds.
Probabilistic reachability took 0.047 seconds.
Probability of reaching BSCC 25: 0.11886015857734847
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=54, no=6244, maybe=560
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 246 iterations, 988428 multiplications and 0.024 seconds.
Probabilistic reachability took 0.025 seconds.
Probability of reaching BSCC 26: 2.6236514080725127E-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=48, no=5178, maybe=1632
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 417 iterations, 4335132 multiplications and 0.136 seconds.
Probabilistic reachability took 0.137 seconds.
Probability of reaching BSCC 27: 0.008694624789149152
Computing probability of reaching BSCC 28
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.001 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=96, no=5430, maybe=1332
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 264 iterations, 2224464 multiplications and 0.07 seconds.
Probabilistic reachability took 0.071 seconds.
Probability of reaching BSCC 28: 0.048903519222367735
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=32, no=6178, maybe=648
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 433 iterations, 1912994 multiplications and 0.052 seconds.
Probabilistic reachability took 0.052 seconds.
Probability of reaching BSCC 29: 1.8788200429286866E-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=18, no=6328, maybe=512
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 287 iterations, 1084286 multiplications and 0.026 seconds.
Probabilistic reachability took 0.026 seconds.
Probability of reaching BSCC 30: 2.2361102829742462E-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=16, no=5546, maybe=1296
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 458 iterations, 3947960 multiplications and 0.114 seconds.
Probabilistic reachability took 0.115 seconds.
Probability of reaching BSCC 31: 1.3325165799054855E-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=32, no=5950, maybe=876
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 314 iterations, 1838156 multiplications and 0.051 seconds.
Probabilistic reachability took 0.052 seconds.
Probability of reaching BSCC 32: 3.2798547235185206E-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=32, no=6178, maybe=648
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 432 iterations, 1908576 multiplications and 0.048 seconds.
Probabilistic reachability took 0.048 seconds.
Probability of reaching BSCC 33: 0.5411015116253705
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=18, no=6380, maybe=460
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 286 iterations, 1011296 multiplications and 0.021 seconds.
Probabilistic reachability took 0.022 seconds.
Probability of reaching BSCC 34: 6.440597746006542E-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=16, no=5546, maybe=1296
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 457 iterations, 3939340 multiplications and 0.117 seconds.
Probabilistic reachability took 0.117 seconds.
Probability of reaching BSCC 35: 0.03837654874380938
Computing probability of reaching BSCC 36
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=32, no=6178, maybe=648
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 313 iterations, 1382834 multiplications and 0.035 seconds.
Probabilistic reachability took 0.035 seconds.
Probability of reaching BSCC 36: 0.0944579942630439
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:
50:(1,0,0,0,0,7,false,false,false)=0.00915838029616384
51:(1,0,0,0,0,7,false,false,true)=1.958495217837682E-7
52:(1,0,0,0,0,7,false,true,false)=4.7171299214381497E-4
53:(1,0,0,0,0,7,false,true,true)=0.002629658902116039
156:(1,0,0,1,0,7,false,false,false)=1.393585417891039E-5
157:(1,0,0,1,0,7,false,false,true)=1.3103712470586378E-10
158:(1,0,0,1,0,7,false,true,false)=7.130559774281787E-7
159:(1,0,0,1,0,7,false,true,true)=1.6216325766531175E-6
262:(1,0,0,2,0,7,false,false,false)=0.0401353328259023
263:(1,0,0,2,0,7,false,false,true)=3.7741890514604277E-7
264:(1,0,0,2,0,7,false,true,false)=0.0020536046103466392
265:(1,0,0,2,0,7,false,true,true)=0.0046701961756696175
904:(1,1,0,0,0,7,false,false,false)=4.12712104990099E-5
905:(1,1,0,0,0,7,false,false,true)=9.109006128542815E-10
906:(1,1,0,0,0,7,false,true,false)=3.0189291707572065E-6
907:(1,1,0,0,0,7,false,true,true)=1.6980168545374716E-5
1010:(1,1,0,1,0,7,false,false,false)=6.523714120521004E-8
1011:(1,1,0,1,0,7,false,false,true)=7.763516661339682E-13
1012:(1,1,0,1,0,7,false,true,false)=4.6267331195676125E-9
1013:(1,1,0,1,0,7,false,true,true)=1.1388193704826258E-8
1116:(1,1,0,2,0,7,false,false,false)=1.8788343168323703E-4
1117:(1,1,0,2,0,7,false,false,true)=2.2360662823247403E-9
1118:(1,1,0,2,0,7,false,true,false)=1.3325016120929072E-5
1119:(1,1,0,2,0,7,false,true,true)=3.279736528581008E-5
1758:(1,2,0,0,0,7,false,false,false)=0.11886015857734847
1759:(1,2,0,0,0,7,false,false,true)=2.6236514080725127E-6
1760:(1,2,0,0,0,7,false,true,false)=0.008694624789149152
1761:(1,2,0,0,0,7,false,true,true)=0.048903519222367735
1864:(1,2,0,1,0,7,false,false,false)=1.8788200429286866E-4
1865:(1,2,0,1,0,7,false,false,true)=2.2361102829742462E-9
1866:(1,2,0,1,0,7,false,true,false)=1.3325165799054855E-5
1867:(1,2,0,1,0,7,false,true,true)=3.2798547235185206E-5
1970:(1,2,0,2,0,7,false,false,false)=0.5411015116253705
1971:(1,2,0,2,0,7,false,false,true)=6.440597746006542E-6
1972:(1,2,0,2,0,7,false,true,false)=0.03837654874380938
1973:(1,2,0,2,0,7,false,true,true)=0.0944579942630439
Time for steady-state probability computation: 2.833 seconds.