PRISM
=====
Version: 4.8.1
Date: Fri Sep 13 10:51:37 GMT+01:00 2024
Hostname: n23m0111.hpc.itc.rwth-aachen.de
Memory limits: cudd=1g, java(heap)=1g
Command line: prism /rwthfs/rz/clusterevts/evt-benchmarking/benchmarks/dtmc/nand/nand.prism -const 'N=20,K=2' -steadystate -explicit -relative -epsilon 0.001
Parsing model file "/rwthfs/rz/clusterevts/evt-benchmarking/benchmarks/dtmc/nand/nand.prism"...
Type: DTMC
Modules: multiplex
Variables: u c s z zx zy x y
---------------------------------------------------------------------
Computing steady-state probabilities...
Building model...
Model constants: N=20,K=2
Computing reachable states... 154942 states
Reachable states exploration and model construction done in 0.29 secs.
Sorting reachable states list...
Time for model construction: 0.368 seconds.
Type: DTMC
States: 154942 (1 initial)
Transitions: 239832
Computing probability of reaching BSCC 1
Starting probabilistic reachability...
Calculating predecessor relation for discrete-time Markov chain... done (0.039 seconds)
Starting Prob0...
Prob0 took 0.038 seconds.
Starting Prob1...
Prob1 took 0.048 seconds.
target=1, yes=2, no=9400, maybe=145540
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 90492868 multiplications and 0.462 seconds.
Probabilistic reachability took 0.599 seconds.
Probability of reaching BSCC 1: 0.01950192884867444
Computing probability of reaching BSCC 2
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.013 seconds.
Starting Prob1...
Prob1 took 0.024 seconds.
target=1, yes=2, no=7844, maybe=147096
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 91460882 multiplications and 0.438 seconds.
Probabilistic reachability took 0.475 seconds.
Probability of reaching BSCC 2: 0.013160936798735376
Computing probability of reaching BSCC 3
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.029 seconds.
Starting Prob1...
Prob1 took 0.032 seconds.
target=1, yes=2, no=11538, maybe=143402
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 89161548 multiplications and 0.429 seconds.
Probabilistic reachability took 0.492 seconds.
Probability of reaching BSCC 3: 0.039592209274794066
Computing probability of reaching BSCC 4
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.016 seconds.
Starting Prob1...
Prob1 took 0.032 seconds.
target=1, yes=2, no=6898, maybe=148042
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 92048748 multiplications and 0.439 seconds.
Probabilistic reachability took 0.487 seconds.
Probability of reaching BSCC 4: 0.006897002956642634
Computing probability of reaching BSCC 5
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.013 seconds.
Starting Prob1...
Prob1 took 0.024 seconds.
target=1, yes=2, no=6580, maybe=148360
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 92246040 multiplications and 0.44 seconds.
Probabilistic reachability took 0.478 seconds.
Probability of reaching BSCC 5: 0.004152060631915435
Computing probability of reaching BSCC 6
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.012 seconds.
Starting Prob1...
Prob1 took 0.023 seconds.
target=1, yes=2, no=14220, maybe=140720
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 87490180 multiplications and 0.422 seconds.
Probabilistic reachability took 0.458 seconds.
Probability of reaching BSCC 6: 0.049954807566940596
Computing probability of reaching BSCC 7
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.013 seconds.
Starting Prob1...
Prob1 took 0.023 seconds.
target=1, yes=2, no=6898, maybe=148042
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 92048748 multiplications and 0.439 seconds.
Probabilistic reachability took 0.475 seconds.
Probability of reaching BSCC 7: 0.0022179707967974567
Computing probability of reaching BSCC 8
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.013 seconds.
Starting Prob1...
Prob1 took 0.026 seconds.
target=1, yes=2, no=7844, maybe=147096
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 91460882 multiplications and 0.438 seconds.
Probabilistic reachability took 0.478 seconds.
Probability of reaching BSCC 8: 0.001222912899285796
Computing probability of reaching BSCC 9
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.012 seconds.
Starting Prob1...
Prob1 took 0.022 seconds.
target=1, yes=2, no=17398, maybe=137542
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 85508438 multiplications and 0.415 seconds.
Probabilistic reachability took 0.449 seconds.
Probability of reaching BSCC 9: 0.10859632001545615
Computing probability of reaching BSCC 10
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.012 seconds.
Starting Prob1...
Prob1 took 0.021 seconds.
target=1, yes=2, no=21014, maybe=133926
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 83252412 multiplications and 0.407 seconds.
Probabilistic reachability took 0.44 seconds.
Probability of reaching BSCC 10: 0.10583400386517827
Computing probability of reaching BSCC 11
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.011 seconds.
Starting Prob1...
Prob1 took 0.021 seconds.
target=1, yes=2, no=25000, maybe=129940
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 80764608 multiplications and 0.398 seconds.
Probabilistic reachability took 0.43 seconds.
Probability of reaching BSCC 11: 0.2347884594479158
Computing probability of reaching BSCC 12
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.013 seconds.
Starting Prob1...
Prob1 took 0.022 seconds.
target=1, yes=2, no=9400, maybe=145540
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 90492868 multiplications and 0.433 seconds.
Probabilistic reachability took 0.468 seconds.
Probability of reaching BSCC 12: 6.33610637115426E-4
Computing probability of reaching BSCC 13
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.012 seconds.
Starting Prob1...
Prob1 took 0.023 seconds.
target=1, yes=2, no=11538, maybe=143402
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 89161548 multiplications and 0.429 seconds.
Probabilistic reachability took 0.464 seconds.
Probability of reaching BSCC 13: 3.206405315196103E-4
Computing probability of reaching BSCC 14
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.012 seconds.
Starting Prob1...
Prob1 took 0.023 seconds.
target=1, yes=2, no=14220, maybe=140720
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 87490180 multiplications and 0.399 seconds.
Probabilistic reachability took 0.434 seconds.
Probability of reaching BSCC 14: 1.5337011070286875E-4
Computing probability of reaching BSCC 15
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.011 seconds.
Starting Prob1...
Prob1 took 0.022 seconds.
target=1, yes=2, no=17398, maybe=137542
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 85508438 multiplications and 0.37 seconds.
Probabilistic reachability took 0.404 seconds.
Probability of reaching BSCC 15: 6.896581234734908E-5
Computing probability of reaching BSCC 16
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.01 seconds.
Starting Prob1...
Prob1 took 0.021 seconds.
target=1, yes=2, no=29278, maybe=125662
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 78093948 multiplications and 0.347 seconds.
Probabilistic reachability took 0.378 seconds.
Probability of reaching BSCC 16: 0.13320405583077588
Computing probability of reaching BSCC 17
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.011 seconds.
Starting Prob1...
Prob1 took 0.021 seconds.
target=1, yes=2, no=21014, maybe=133926
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 83252412 multiplications and 0.363 seconds.
Probabilistic reachability took 0.395 seconds.
Probability of reaching BSCC 17: 2.8360879575218537E-5
Computing probability of reaching BSCC 18
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.01 seconds.
Starting Prob1...
Prob1 took 0.021 seconds.
target=1, yes=2, no=25000, maybe=129940
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 80764608 multiplications and 0.356 seconds.
Probabilistic reachability took 0.388 seconds.
Probability of reaching BSCC 18: 1.0253308592874502E-5
Computing probability of reaching BSCC 19
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.01 seconds.
Starting Prob1...
Prob1 took 0.022 seconds.
target=1, yes=2, no=29278, maybe=125662
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 78093948 multiplications and 0.347 seconds.
Probabilistic reachability took 0.379 seconds.
Probability of reaching BSCC 19: 2.9987752427316236E-6
Computing probability of reaching BSCC 20
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.01 seconds.
Starting Prob1...
Prob1 took 0.021 seconds.
target=1, yes=2, no=33760, maybe=121180
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 75295770 multiplications and 0.338 seconds.
Probabilistic reachability took 0.369 seconds.
Probability of reaching BSCC 20: 5.628752562345137E-7
Computing probability of reaching BSCC 21
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.01 seconds.
Starting Prob1...
Prob1 took 0.021 seconds.
target=1, yes=2, no=33760, maybe=121180
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 75295770 multiplications and 0.339 seconds.
Probabilistic reachability took 0.37 seconds.
Probability of reaching BSCC 21: 0.2796585681365343
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.001 seconds.
Computing steady-state probabilities for BSCC 3
Starting value iteration...
Power method: 1 iterations in 0.001 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.001 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.001 seconds.
Computing steady-state probabilities for BSCC 9
Starting value iteration...
Power method: 1 iterations in 0.001 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.001 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.001 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.001 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.001 seconds.
Printing steady-state probabilities in plain text format below:
154921:(5,20,4,0,0,0,0,0)=0.2796585681365343
154922:(5,20,4,1,0,0,0,0)=0.13320405583077588
154923:(5,20,4,2,0,0,0,0)=0.2347884594479158
154924:(5,20,4,3,0,0,0,0)=0.10583400386517827
154925:(5,20,4,4,0,0,0,0)=0.10859632001545615
154926:(5,20,4,5,0,0,0,0)=0.049954807566940596
154927:(5,20,4,6,0,0,0,0)=0.039592209274794066
154928:(5,20,4,7,0,0,0,0)=0.01950192884867444
154929:(5,20,4,8,0,0,0,0)=0.013160936798735376
154930:(5,20,4,9,0,0,0,0)=0.006897002956642634
154931:(5,20,4,10,0,0,0,0)=0.004152060631915435
154932:(5,20,4,11,0,0,0,0)=0.0022179707967974567
154933:(5,20,4,12,0,0,0,0)=0.001222912899285796
154934:(5,20,4,13,0,0,0,0)=6.33610637115426E-4
154935:(5,20,4,14,0,0,0,0)=3.206405315196103E-4
154936:(5,20,4,15,0,0,0,0)=1.5337011070286875E-4
154937:(5,20,4,16,0,0,0,0)=6.896581234734908E-5
154938:(5,20,4,17,0,0,0,0)=2.8360879575218537E-5
154939:(5,20,4,18,0,0,0,0)=1.0253308592874502E-5
154940:(5,20,4,19,0,0,0,0)=2.9987752427316236E-6
154941:(5,20,4,20,0,0,0,0)=5.628752562345137E-7
Time for steady-state probability computation: 9.403 seconds.