PRISM

Benchmark
Model:wlan v.1 (MDP)
Parameter(s)MAX_BACKOFF = 5, COL = 0
Property:cost_min (exp-reward)
Invocation (specific)
./fix-syntax ./prism --javamaxmem 11g wlan.5.prism wlan.props --property cost_min -const COL=0 -sparse
Select best engine
Execution
Walltime:95.72304034233093s
Return code:0
Relative Error:0.0
Log
PRISM
=====

Version: 4.4.dev
Date: Tue Dec 11 01:22:51 CET 2018
Hostname: qcomp2019
Memory limits: cudd=1g, java(heap)=1g
Command line: prism --javamaxmem 11g wlan.5.prism wlan.props --property cost_min -const COL=0 -sparse

Parsing model file "wlan.5.prism"...

Parsing properties file "wlan.props"...

7 properties:
(1) "collisions": Pmax=? [ F col=COL ]
(2) "cost_max": R{"cost"}max=? [ F s1=12&s2=12 ]
(3) "cost_min": R{"cost"}min=? [ F s1=12&s2=12 ]
(4) "num_collisions": R{"collisions"}max=? [ F s1=12&s2=12 ]
(5) "sent": P>=1 [ F s1=12&s2=12 ]
(6) "time_max": R{"time"}max=? [ F s1=12&s2=12 ]
(7) "time_min": R{"time"}min=? [ F s1=12&s2=12 ]

Type:        MDP
Modules:     medium station1 station2 
Variables:   col c1 c2 x1 s1 slot1 backoff1 bc1 x2 s2 slot2 backoff2 bc2 

---------------------------------------------------------------------

Model checking: "cost_min": R{"cost"}min=? [ F s1=12&s2=12 ]
Model constants: COL=0

Building model...
Model constants: COL=0

Computing reachable states...

Reachability (BFS): 170 iterations in 0.34 seconds (average 0.001988, setup 0.00)

Time for model construction: 0.496 seconds.

Type:        MDP
States:      1295218 (1 initial)
Transitions: 2929960
Choices:     1646074

Transition matrix: 17250 nodes (7 terminal), 2929960 minterms, vars: 45r/45c/7nd

Prob0A: 1565 iterations in 21.04 seconds (average 0.013442, setup 0.00)

Prob1E: 1566 iterations in 21.61 seconds (average 0.013801, setup 0.00)

Warning: PRISM hasn't checked for zero-reward loops.
Your minimum rewards may be too low...

goal = 1, inf = 0, maybe = 1295217

Computing remaining rewards...
Engine: Sparse

Building sparse matrix (transitions)... [n=1295218, nc=1646073, nnz=2929959, k=3] [44.8 MB]
Building sparse matrix (transition rewards)... [n=1295218, nc=1646073, nnz=328891, k=3] [15.0 MB]
Creating vector for state rewards... [9.9 MB]
Creating vector for inf... [9.9 MB]
Allocating iteration vectors... [2 x 9.9 MB]
TOTAL: [99.3 MB]

Starting iterations...
Iteration 156: max relative diff=0.362500, 5.00 sec so far
Iteration 312: max relative diff=0.219697, 10.01 sec so far
Iteration 469: max relative diff=0.156757, 15.02 sec so far
Iteration 626: max relative diff=0.122363, 20.04 sec so far
Iteration 785: max relative diff=0.100000, 25.07 sec so far
Iteration 945: max relative diff=0.084548, 30.09 sec so far
Iteration 1107: max relative diff=0.073048, 35.10 sec so far
Iteration 1271: max relative diff=0.064159, 40.13 sec so far
Iteration 1436: max relative diff=0.057199, 45.14 sec so far

Iterative method: 1580 iterations in 51.67 seconds (average 0.031332, setup 2.17)

Value in the initial state: 7625.0

Time for model checking: 94.404 seconds.

Result: 7625.0 (value in the initial state)


Overall running time: 95.482 seconds.

---------------------------------------------------------------------

Note: There was 1 warning during computation.