Storm.ddbisim

Benchmark
Model:consensus v.1 (MDP)
Parameter(s)N = 4, K = 4
Property:steps_min (exp-reward)
Invocation (ddbisim)
/home/tq429871/storm/build/bin/storm --prism /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/mdp/consensus/consensus.4.prism --prop /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/mdp/consensus/consensus.props steps_min --constants K=4 --engine dd-to-sparse --bisimulation --sylvan:maxmem 4096 --sylvan:threads 4 --timemem
Symbolic bisimulation with sparse quotient and sylvan using 4GB memory
Execution
Walltime:1.607370376586914s
Return code:0
Relative Error:0.000113879296875
Log
Storm 1.6.2

Date: Sat Sep  5 20:45:53 2020
Command line arguments: --prism /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/mdp/consensus/consensus.4.prism --prop /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/mdp/consensus/consensus.props steps_min --constants K=4 --engine dd-to-sparse --bisimulation '--sylvan:maxmem' 4096 '--sylvan:threads' 4 --timemem
Current working directory: /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks

Time for model input parsing: 0.003s.

Time for model construction: 0.463s.

-------------------------------------------------------------- 
Model type: 	MDP (symbolic)
States: 	43136 (107 nodes)
Transitions: 	144352 (2336 nodes)
Choices: 	115840
Reward Models:  steps
Variables: 	rows: 9 meta variables (18 DD variables), columns: 9 meta variables (18 DD variables), nondeterminism: 4 meta variables (4 DD variables)
Labels: 	6
   * deadlock -> 0 state(s) (1 nodes)
   * init -> 1 state(s) (19 nodes)
   * agree
   * all_coins_equal_0
   * all_coins_equal_1
   * finished
-------------------------------------------------------------- 

Time for model preprocessing: 0.987s.

-------------------------------------------------------------- 
Model type: 	MDP (sparse)
States: 	1119
Transitions: 	4559
Choices: 	3658
Reward Models:  steps
State Labels: 	4 labels
   * ((((pc1 = 3) & (pc2 = 3)) & (pc3 = 3)) & (pc4 = 3)) -> 1 item(s)
   * finished -> 1 item(s)
   * init -> 1 item(s)
   * deadlock -> 0 item(s)
Choice Labels: 	none
-------------------------------------------------------------- 

Model checking property "steps_min": R[exp]{"steps"}min=? [F "finished"] ...
Result (for initial states): 768.0874593
Time for model checking: 0.086s.

Performance statistics:
  * peak memory usage: 2917MB
  * CPU time: 4.278s
  * wallclock time: 1.554s