About the Execution of LoLA for DES-PT-20b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7961.630 | 772885.00 | 1547322.00 | 147.60 | FTT?TTTFFFFFFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is DES-PT-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309100277
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-0
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-1
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-15
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-3
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-4
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-5
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-6
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-7
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-8
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1494628327723
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ DES-PT-20b @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 671/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 360 places, 311 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 408 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-20b-ReachabilityCardinality.task
lola: A (G ((((p305 <= 1) OR (2 <= p146)) AND (p166 <= p42)))) : E (F (((1 <= p169) OR ((p8 + 1 <= p282) AND (p260 + 1 <= p352))))) : A (G ((p175 <= p267))) : E (F (((p46 + 1 <= p282) AND ((3 <= p75) OR (1 <= p105)) AND (p201 <= p321) AND (2 <= p342) AND ((3 <= p188) OR (p171 <= p212))))) : E (F ((3 <= p165))) : E (F (((p168 <= 1) AND (2 <= p252)))) : E (F (((p159 <= p317) AND (2 <= p202) AND (p316 + 1 <= p182) AND ((3 <= p37) OR (3 <= p87))))) : E (F (((p237 + 1 <= p139) AND (p292 <= 0) AND (p253 <= 1) AND (p317 + 1 <= p48)))) : A (G ((p267 <= p295))) : E (F ((1 <= p230))) : A (G ((((p278 <= 1) OR (p263 <= 2)) AND ((p119 + 1 <= p274) OR (p96 <= 2))))) : A (G (((3 <= p90) OR (p259 <= p357) OR (p60 <= p77) OR (p244 <= p234) OR ((2 <= p233) AND (p121 <= p240))))) : E (F ((1 <= p197))) : E (F ((1 <= p16))) : E (F (((1 <= p234) AND (p350 <= p127)))) : E (F (((2 <= p6) AND (1 <= p242) AND (p333 <= p147))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p305 <= 1) OR (2 <= p146)) AND (p166 <= p42))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p169) OR ((p8 + 1 <= p282) AND (p260 + 1 <= p352)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p175 <= p267)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p46 + 1 <= p282) AND ((3 <= p75) OR (1 <= p105)) AND (p201 <= p321) AND (2 <= p342) AND ((3 <= p188) OR (p171 <= p212)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p165)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p168 <= 1) AND (2 <= p252))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p159 <= p317) AND (2 <= p202) AND (p316 + 1 <= p182) AND ((3 <= p37) OR (3 <= p87)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p237 + 1 <= p139) AND (p292 <= 0) AND (p253 <= 1) AND (p317 + 1 <= p48))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p267 <= p295)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p230)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p278 <= 1) OR (p263 <= 2)) AND ((p119 + 1 <= p274) OR (p96 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p90) OR (p259 <= p357) OR (p60 <= p77) OR (p244 <= p234) OR ((2 <= p233) AND (p121 <= p240)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: ========================================
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 623248 markings, 1424735 edges, 124650 markings/sec, 0 secs
lola: sara is running 5 secs || 1248814 markings, 2822911 edges, 125113 markings/sec, 5 secs
lola: sara is running 10 secs || 1879362 markings, 4171401 edges, 126110 markings/sec, 10 secs
lola: sara is running 15 secs || 2516462 markings, 5443315 edges, 127420 markings/sec, 15 secs
lola: sara is running 20 secs || 3120729 markings, 6815580 edges, 120853 markings/sec, 20 secs
lola: sara is running 25 secs || 3844720 markings, 8062582 edges, 144798 markings/sec, 25 secs
lola: sara is running 30 secs || 4593098 markings, 9274869 edges, 149676 markings/sec, 30 secs
lola: sara is running 35 secs || 5256545 markings, 10520401 edges, 132689 markings/sec, 35 secs
lola: sara is running 40 secs || 6109185 markings, 11701116 edges, 170528 markings/sec, 40 secs
lola: sara is running 45 secs || 7015757 markings, 12857690 edges, 181314 markings/sec, 45 secs
lola: sara is running 50 secs || 7697391 markings, 14035104 edges, 136327 markings/sec, 50 secs
lola: sara is running 55 secs || 8352045 markings, 15213731 edges, 130931 markings/sec, 55 secs
lola: sara is running 60 secs || 9033808 markings, 16419391 edges, 136353 markings/sec, 60 secs
lola: sara is running 65 secs || 9703358 markings, 17608825 edges, 133910 markings/sec, 65 secs
lola: sara is running 70 secs || 10353569 markings, 18786378 edges, 130042 markings/sec, 70 secs
lola: sara is running 75 secs || 11013842 markings, 19946491 edges, 132055 markings/sec, 75 secs
lola: sara is running 80 secs || 11643277 markings, 21094185 edges, 125887 markings/sec, 80 secs
lola: sara is running 85 secs || 12282703 markings, 22219296 edges, 127885 markings/sec, 85 secs
lola: sara is running 90 secs || 12893134 markings, 23333581 edges, 122086 markings/sec, 90 secs
lola: sara is running 95 secs || 13516596 markings, 24429567 edges, 124692 markings/sec, 95 secs
lola: sara is running 100 secs || 14122802 markings, 25524837 edges, 121241 markings/sec, 100 secs
lola: sara is running 105 secs || 14760497 markings, 26627657 edges, 127539 markings/sec, 105 secs
lola: sara is running 110 secs || 15435020 markings, 27764629 edges, 134905 markings/sec, 110 secs
lola: sara is running 115 secs || 16085459 markings, 28882789 edges, 130088 markings/sec, 115 secs
lola: sara is running 120 secs || 16714489 markings, 30037518 edges, 125806 markings/sec, 120 secs
lola: sara is running 125 secs || 17368664 markings, 31141296 edges, 130835 markings/sec, 125 secs
lola: sara is running 130 secs || 18013562 markings, 32298759 edges, 128980 markings/sec, 130 secs
lola: sara is running 135 secs || 18650332 markings, 33561974 edges, 127354 markings/sec, 135 secs
lola: sara is running 140 secs || 19188544 markings, 34829565 edges, 107642 markings/sec, 140 secs
lola: sara is running 145 secs || 19724857 markings, 36088554 edges, 107263 markings/sec, 145 secs
lola: sara is running 150 secs || 20264304 markings, 37295708 edges, 107889 markings/sec, 150 secs
lola: sara is running 155 secs || 20813463 markings, 38576407 edges, 109832 markings/sec, 155 secs
lola: sara is running 160 secs || 21400020 markings, 39754621 edges, 117311 markings/sec, 160 secs
lola: sara is running 165 secs || 21963923 markings, 40971848 edges, 112781 markings/sec, 165 secs
lola: sara is running 170 secs || 22507626 markings, 42047463 edges, 108741 markings/sec, 170 secs
lola: sara is running 175 secs || 23100176 markings, 43090854 edges, 118510 markings/sec, 175 secs
lola: sara is running 180 secs || 23737738 markings, 44044228 edges, 127512 markings/sec, 180 secs
lola: sara is running 185 secs || 24376016 markings, 45071763 edges, 127656 markings/sec, 185 secs
lola: sara is running 190 secs || 25016043 markings, 46296632 edges, 128005 markings/sec, 190 secs
lola: sara is running 195 secs || 25568741 markings, 47587396 edges, 110540 markings/sec, 195 secs
lola: sara is running 200 secs || 26099535 markings, 48802947 edges, 106159 markings/sec, 200 secs
lola: sara is running 205 secs || 26631637 markings, 50000795 edges, 106420 markings/sec, 205 secs
lola: sara is running 210 secs || 27187083 markings, 51175948 edges, 111089 markings/sec, 210 secs
lola: sara is running 215 secs || 27800754 markings, 52323043 edges, 122734 markings/sec, 215 secs
lola: sara is running 220 secs || 28388202 markings, 53628781 edges, 117490 markings/sec, 220 secs
lola: sara is running 225 secs || 28967376 markings, 54791359 edges, 115835 markings/sec, 225 secs
lola: sara is running 230 secs || 29571812 markings, 55948915 edges, 120887 markings/sec, 230 secs
lola: sara is running 235 secs || 30166603 markings, 57085802 edges, 118958 markings/sec, 235 secs
lola: sara is running 240 secs || 30936258 markings, 58290743 edges, 153931 markings/sec, 240 secs
lola: sara is running 245 secs || 31849721 markings, 59488464 edges, 182693 markings/sec, 245 secs
lola: sara is running 250 secs || 32709212 markings, 60711893 edges, 171898 markings/sec, 250 secs
lola: sara is running 255 secs || 33559229 markings, 61923342 edges, 170003 markings/sec, 255 secs
lola: sara is running 260 secs || 34285702 markings, 63007545 edges, 145295 markings/sec, 260 secs
lola: sara is running 265 secs || 34917784 markings, 64109807 edges, 126416 markings/sec, 265 secs
lola: sara is running 270 secs || 35518880 markings, 65294063 edges, 120219 markings/sec, 270 secs
lola: sara is running 275 secs || 36431801 markings, 66428045 edges, 182584 markings/sec, 275 secs
lola: sara is running 280 secs || 37469831 markings, 67502356 edges, 207606 markings/sec, 280 secs
lola: sara is running 285 secs || 38535869 markings, 68596248 edges, 213208 markings/sec, 285 secs
lola: sara is running 290 secs || 39575123 markings, 69660736 edges, 207851 markings/sec, 290 secs
lola: sara is running 295 secs || 40598982 markings, 70726655 edges, 204772 markings/sec, 295 secs
lola: sara is running 300 secs || 41422240 markings, 71900672 edges, 164652 markings/sec, 300 secs
lola: sara is running 305 secs || 42093679 markings, 72984851 edges, 134288 markings/sec, 305 secs
lola: sara is running 310 secs || 42947655 markings, 74188552 edges, 170795 markings/sec, 310 secs
lola: sara is running 315 secs || 43749847 markings, 75359645 edges, 160438 markings/sec, 315 secs
lola: sara is running 320 secs || 44547402 markings, 76514501 edges, 159511 markings/sec, 320 secs
lola: sara is running 325 secs || 45264152 markings, 77604767 edges, 143350 markings/sec, 325 secs
lola: sara is running 330 secs || 45881028 markings, 78695059 edges, 123375 markings/sec, 330 secs
lola: sara is running 335 secs || 46545647 markings, 79795370 edges, 132924 markings/sec, 335 secs
lola: sara is running 340 secs || 47137880 markings, 80917365 edges, 118447 markings/sec, 340 secs
lola: sara is running 345 secs || 47870758 markings, 82079401 edges, 146576 markings/sec, 345 secs
lola: sara is running 350 secs || 48498998 markings, 83234645 edges, 125648 markings/sec, 350 secs
lola: sara is running 355 secs || 49120096 markings, 84360012 edges, 124220 markings/sec, 355 secs
lola: sara is running 360 secs || 49764514 markings, 85443031 edges, 128884 markings/sec, 360 secs
lola: sara is running 365 secs || 50305941 markings, 86582302 edges, 108285 markings/sec, 365 secs
lola: sara is running 370 secs || 50825137 markings, 87814480 edges, 103839 markings/sec, 370 secs
lola: sara is running 375 secs || 51297146 markings, 88977761 edges, 94402 markings/sec, 375 secs
lola: sara is running 380 secs || 51950272 markings, 90095860 edges, 130625 markings/sec, 380 secs
lola: sara is running 385 secs || 52558650 markings, 91209076 edges, 121676 markings/sec, 385 secs
lola: sara is running 390 secs || 53186246 markings, 92286968 edges, 125519 markings/sec, 390 secs
lola: sara is running 395 secs || 53722269 markings, 93410354 edges, 107205 markings/sec, 395 secs
lola: sara is running 400 secs || 54245711 markings, 94635597 edges, 104688 markings/sec, 400 secs
lola: sara is running 405 secs || 54698856 markings, 95805288 edges, 90629 markings/sec, 405 secs
lola: sara is running 410 secs || 55361674 markings, 96892152 edges, 132564 markings/sec, 410 secs
lola: sara is running 415 secs || 55954357 markings, 97980439 edges, 118537 markings/sec, 415 secs
lola: sara is running 420 secs || 56566180 markings, 99043558 edges, 122365 markings/sec, 420 secs
lola: sara is running 425 secs || 57086848 markings, 100128525 edges, 104134 markings/sec, 425 secs
lola: sara is running 430 secs || 57584697 markings, 101308893 edges, 99570 markings/sec, 430 secs
lola: sara is running 435 secs || 58035201 markings, 102429821 edges, 90101 markings/sec, 435 secs
lola: sara is running 440 secs || 58675077 markings, 103530530 edges, 127975 markings/sec, 440 secs
lola: sara is running 445 secs || 59267189 markings, 104617400 edges, 118422 markings/sec, 445 secs
lola: sara is running 450 secs || 59894027 markings, 105655679 edges, 125368 markings/sec, 450 secs
lola: sara is running 455 secs || 60408034 markings, 106760725 edges, 102801 markings/sec, 455 secs
lola: sara is running 460 secs || 60896591 markings, 107944289 edges, 97711 markings/sec, 460 secs
lola: sara is running 465 secs || 61384684 markings, 109019037 edges, 97619 markings/sec, 465 secs
lola: sara is running 470 secs || 61967024 markings, 110055664 edges, 116468 markings/sec, 470 secs
lola: sara is running 475 secs || 62503243 markings, 111116328 edges, 107244 markings/sec, 475 secs
lola: sara is running 480 secs || 62986086 markings, 112179749 edges, 96569 markings/sec, 480 secs
lola: sara is running 485 secs || 63621559 markings, 113207774 edges, 127095 markings/sec, 485 secs
lola: sara is running 490 secs || 64131974 markings, 114298651 edges, 102083 markings/sec, 490 secs
lola: sara is running 495 secs || 64603809 markings, 115400736 edges, 94367 markings/sec, 495 secs
lola: sara is running 500 secs || 65171156 markings, 116440586 edges, 113469 markings/sec, 500 secs
lola: sara is running 505 secs || 65876310 markings, 117513693 edges, 141031 markings/sec, 505 secs
lola: sara is running 510 secs || 66554263 markings, 118484203 edges, 135591 markings/sec, 510 secs
lola: sara is running 515 secs || 67161910 markings, 119411691 edges, 121529 markings/sec, 515 secs
lola: sara is running 520 secs || 67644071 markings, 120514930 edges, 96432 markings/sec, 520 secs
lola: sara is running 525 secs || 68220434 markings, 121472694 edges, 115273 markings/sec, 525 secs
lola: sara is running 530 secs || 68767309 markings, 122588969 edges, 109375 markings/sec, 530 secs
lola: sara is running 535 secs || 69310087 markings, 123745236 edges, 108556 markings/sec, 535 secs
lola: sara is running 540 secs || 70066568 markings, 124883902 edges, 151296 markings/sec, 540 secs
lola: sara is running 545 secs || 70612582 markings, 125978956 edges, 109203 markings/sec, 545 secs
lola: sara is running 550 secs || 71177722 markings, 127077785 edges, 113028 markings/sec, 550 secs
lola: sara is running 555 secs || 71744890 markings, 128220622 edges, 113434 markings/sec, 555 secs
lola: sara is running 560 secs || 72317186 markings, 129378847 edges, 114459 markings/sec, 560 secs
lola: sara is running 565 secs || 72898099 markings, 130507508 edges, 116183 markings/sec, 565 secs
lola: sara is running 570 secs || 73428164 markings, 131620425 edges, 106013 markings/sec, 570 secs
lola: sara is running 575 secs || 74009095 markings, 132714853 edges, 116186 markings/sec, 575 secs
lola: sara is running 580 secs || 74672989 markings, 133806127 edges, 132779 markings/sec, 580 secs
lola: sara is running 585 secs || 75313222 markings, 134873452 edges, 128047 markings/sec, 585 secs
lola: sara is running 590 secs || 75948913 markings, 135953324 edges, 127138 markings/sec, 590 secs
lola: sara is running 595 secs || 76647252 markings, 137078593 edges, 139668 markings/sec, 595 secs
lola: sara is running 600 secs || 77225868 markings, 138222376 edges, 115723 markings/sec, 600 secs
lola: sara is running 605 secs || 78075903 markings, 139386719 edges, 170007 markings/sec, 605 secs
lola: sara is running 610 secs || 79176695 markings, 140489189 edges, 220158 markings/sec, 610 secs
lola: sara is running 615 secs || 80011223 markings, 141651508 edges, 166906 markings/sec, 615 secs
lola: sara is running 620 secs || 80850731 markings, 142845485 edges, 167902 markings/sec, 620 secs
lola: sara is running 625 secs || 81695007 markings, 144047227 edges, 168855 markings/sec, 625 secs
lola: sara is running 630 secs || 82404382 markings, 145196413 edges, 141875 markings/sec, 630 secs
lola: sara is running 635 secs || 83022938 markings, 146239923 edges, 123711 markings/sec, 635 secs
lola: sara is running 640 secs || 83645200 markings, 147313710 edges, 124452 markings/sec, 640 secs
lola: sara is running 645 secs || 84253112 markings, 148341549 edges, 121582 markings/sec, 645 secs
lola: sara is running 650 secs || 84960857 markings, 149465577 edges, 141549 markings/sec, 650 secs
lola: sara is running 655 secs || 85484473 markings, 150633272 edges, 104723 markings/sec, 655 secs
lola: sara is running 660 secs || 86309021 markings, 151782025 edges, 164910 markings/sec, 660 secs
lola: sara is running 665 secs || 87123100 markings, 152917120 edges, 162816 markings/sec, 665 secs
lola: sara is running 670 secs || 87935161 markings, 154049116 edges, 162412 markings/sec, 670 secs
lola: sara is running 675 secs || 88572404 markings, 155118169 edges, 127449 markings/sec, 675 secs
lola: sara is running 680 secs || 89159319 markings, 156220551 edges, 117383 markings/sec, 680 secs
lola: sara is running 685 secs || 89745867 markings, 157428894 edges, 117310 markings/sec, 685 secs
lola: sara is running 690 secs || 90740801 markings, 158492858 edges, 198987 markings/sec, 690 secs
lola: sara is running 695 secs || 91801416 markings, 159558914 edges, 212123 markings/sec, 695 secs
lola: sara is running 700 secs || 92839170 markings, 160634496 edges, 207551 markings/sec, 700 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p197)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-12.sara
lola: ========================================
lola: subprocess 13 will run for 943 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 641057 markings, 1331257 edges, 128211 markings/sec, 0 secs
lola: sara is running 5 secs || 1187103 markings, 2687511 edges, 109209 markings/sec, 5 secs
lola: sara is running 10 secs || 1761783 markings, 3995133 edges, 114936 markings/sec, 10 secs
lola: sara is running 15 secs || 2328410 markings, 5281717 edges, 113325 markings/sec, 15 secs
lola: sara is running 20 secs || 2881500 markings, 6534234 edges, 110618 markings/sec, 20 secs
lola: sara is running 25 secs || 3418765 markings, 7773006 edges, 107453 markings/sec, 25 secs
lola: sara is running 30 secs || 3947479 markings, 9061450 edges, 105743 markings/sec, 30 secs
lola: sara is running 35 secs || 4496382 markings, 10307588 edges, 109781 markings/sec, 35 secs
lola: sara is running 40 secs || 5038193 markings, 11532091 edges, 108362 markings/sec, 40 secs
lola: sara is running 45 secs || 5560908 markings, 12710429 edges, 104543 markings/sec, 45 secs
lola: sara is running 50 secs || 6063954 markings, 13957877 edges, 100609 markings/sec, 50 secs
lola: sara is running 55 secs || 6593682 markings, 15155874 edges, 105946 markings/sec, 55 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1383 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p234) AND (p350 <= p127))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2767 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p6) AND (1 <= p242) AND (p333 <= p147))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no yes no yes yes unknown yes yes yes no
FORMULA DES-PT-20b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494629100608
--------------------
content from stderr:
----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-20b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is DES-PT-20b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r018-ebro-149436309100277"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;