About the Execution of LoLA for DLCshifumi-PT-4b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 749.930 | 811486.00 | 1624598.00 | 142.60 | ?TFFFFFTTFFFFTTT | 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 DLCshifumi-PT-4b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309400493
=====================================================================
--------------------
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 DLCshifumi-PT-4b-ReachabilityCardinality-0
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-1
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-10
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-11
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-12
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-13
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-14
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-15
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-2
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-3
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-4
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-5
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-6
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-7
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-8
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1494645898322
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ DLCshifumi-PT-4b @ 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: 36356/65536 symbol table entries, 13849 collisions
lola: preprocessing...
lola: finding significant places
lola: 15015 places, 21341 transitions, 14324 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 28617 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-4b-ReachabilityCardinality.task
lola: A (G (((p4383 + 1 <= p8543) OR (p259 <= 1) OR ((3 <= p2207) AND (2 <= p14674) AND ((p1241 <= p5433) OR (1 <= p7513)))))) : E (F ((1 <= p12883))) : E (F (((3 <= p14898) OR (1 <= p11697)))) : A (G (((p4295 <= p9789) OR (p8651 <= p889)))) : A (G ((p7577 <= p7024))) : E (F ((3 <= p11234))) : A (G ((((p2730 <= 1) AND (p7577 + 1 <= p2099)) OR ((p11066 <= p6232) AND (p6275 <= p14431))))) : E (F ((((p8551 + 1 <= p9340) OR (p2747 + 1 <= p3617)) AND ((p5497 <= 1) OR (1 <= p3744))))) : E (F (((1 <= p14646) OR (1 <= p13727)))) : E (F (((p8492 + 1 <= p5853) OR (2 <= p1840)))) : A (G ((p2761 <= p100))) : A (G ((((p3667 + 1 <= p11887) AND (p10649 <= 0)) OR (p59 <= p2714)))) : E (F ((((p10238 <= p10948) OR (p8752 <= p9316)) AND ((p7696 <= p9829) OR (p5400 <= p9253)) AND (3 <= p5234)))) : E (F (((3 <= p3701) AND (p7865 + 1 <= p11450) AND (p11174 <= p8425)))) : A (G ((((p3216 <= p8677) AND ((p11575 <= p2267) OR (2 <= p7175))) OR (p11130 <= p7064)))) : E (F ((1 <= p364)))
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 (((p4383 + 1 <= p8543) OR (p259 <= 1) OR ((3 <= p2207) AND (2 <= p14674) AND ((p1241 <= p5433) OR (1 <= p7513))))))
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 1792 bytes per marking, with 12 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 14913 markings, 16870 edges, 2983 markings/sec, 0 secs
lola: sara is running 5 secs || 31804 markings, 35935 edges, 3378 markings/sec, 5 secs
lola: sara is running 10 secs || 51252 markings, 57882 edges, 3890 markings/sec, 10 secs
lola: sara is running 15 secs || 74376 markings, 83986 edges, 4625 markings/sec, 15 secs
lola: sara is running 20 secs || 102268 markings, 115477 edges, 5578 markings/sec, 20 secs
lola: sara is running 25 secs || 128271 markings, 144825 edges, 5201 markings/sec, 25 secs
lola: sara is running 30 secs || 158525 markings, 179029 edges, 6051 markings/sec, 30 secs
lola: sara is running 35 secs || 190950 markings, 216964 edges, 6485 markings/sec, 35 secs
lola: sara is running 40 secs || 225017 markings, 258455 edges, 6813 markings/sec, 40 secs
lola: sara is running 45 secs || 258615 markings, 299386 edges, 6720 markings/sec, 45 secs
lola: sara is running 50 secs || 291783 markings, 339785 edges, 6634 markings/sec, 50 secs
lola: sara is running 55 secs || 324397 markings, 379431 edges, 6523 markings/sec, 55 secs
lola: sara is running 60 secs || 356617 markings, 418688 edges, 6444 markings/sec, 60 secs
lola: sara is running 65 secs || 388483 markings, 457486 edges, 6373 markings/sec, 65 secs
lola: sara is running 70 secs || 420146 markings, 495998 edges, 6333 markings/sec, 70 secs
lola: sara is running 75 secs || 451615 markings, 534339 edges, 6294 markings/sec, 75 secs
lola: sara is running 80 secs || 482784 markings, 572261 edges, 6234 markings/sec, 80 secs
lola: sara is running 85 secs || 513697 markings, 609910 edges, 6183 markings/sec, 85 secs
lola: sara is running 90 secs || 544331 markings, 647220 edges, 6127 markings/sec, 90 secs
lola: sara is running 95 secs || 574792 markings, 684236 edges, 6092 markings/sec, 95 secs
lola: sara is running 100 secs || 604906 markings, 720965 edges, 6023 markings/sec, 100 secs
lola: sara is running 105 secs || 634710 markings, 757228 edges, 5961 markings/sec, 105 secs
lola: sara is running 110 secs || 664098 markings, 792929 edges, 5878 markings/sec, 110 secs
lola: sara is running 115 secs || 693637 markings, 828763 edges, 5908 markings/sec, 115 secs
lola: sara is running 120 secs || 723012 markings, 864322 edges, 5875 markings/sec, 120 secs
lola: sara is running 125 secs || 752289 markings, 899836 edges, 5855 markings/sec, 125 secs
lola: sara is running 130 secs || 780858 markings, 934500 edges, 5714 markings/sec, 130 secs
lola: sara is running 135 secs || 809453 markings, 969109 edges, 5719 markings/sec, 135 secs
lola: sara is running 140 secs || 837613 markings, 1003276 edges, 5632 markings/sec, 140 secs
lola: sara is running 145 secs || 859165 markings, 1029420 edges, 4310 markings/sec, 145 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 150 secs || 883810 markings, 1059296 edges, 4929 markings/sec, 150 secs
lola: sara is running 155 secs || 910545 markings, 1091615 edges, 5347 markings/sec, 155 secs
lola: sara is running 160 secs || 936639 markings, 1123280 edges, 5219 markings/sec, 160 secs
lola: sara is running 165 secs || 961751 markings, 1153708 edges, 5022 markings/sec, 165 secs
lola: sara is running 170 secs || 985892 markings, 1183248 edges, 4828 markings/sec, 170 secs
lola: sara is running 175 secs || 1010611 markings, 1213292 edges, 4944 markings/sec, 175 secs
lola: sara is running 180 secs || 1035546 markings, 1243665 edges, 4987 markings/sec, 180 secs
lola: sara is running 185 secs || 1058285 markings, 1271304 edges, 4548 markings/sec, 185 secs
lola: sara is running 190 secs || 1080974 markings, 1298688 edges, 4538 markings/sec, 190 secs
lola: sara is running 195 secs || 1103284 markings, 1325922 edges, 4462 markings/sec, 195 secs
lola: sara is running 200 secs || 1125832 markings, 1353161 edges, 4510 markings/sec, 200 secs
lola: sara is running 205 secs || 1149015 markings, 1381358 edges, 4637 markings/sec, 205 secs
lola: sara is running 210 secs || 1172484 markings, 1409685 edges, 4694 markings/sec, 210 secs
lola: sara is running 215 secs || 1196490 markings, 1438862 edges, 4801 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p12883)))
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 1792 bytes per marking, with 12 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 DLCshifumi-PT-4b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p14898) OR (1 <= p11697))))
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 1792 bytes per marking, with 12 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 8933 markings, 10523 edges, 1787 markings/sec, 0 secs
lola: sara is running 5 secs || 18021 markings, 21183 edges, 1818 markings/sec, 5 secs
lola: sara is running 10 secs || 27165 markings, 31897 edges, 1829 markings/sec, 10 secs
lola: sara is running 15 secs || 37295 markings, 43970 edges, 2026 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p4295 <= p9789) OR (p8651 <= p889))))
lola: ========================================
lola: SUBTASK
lola: 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 1792 bytes per marking, with 12 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 DLCshifumi-PT-4b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p7577 <= p7024)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 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 DLCshifumi-PT-4b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p11234)))
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 1792 bytes per marking, with 12 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 DLCshifumi-PT-4b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p2730 <= 1) AND (p7577 + 1 <= p2099)) OR ((p11066 <= p6232) AND (p6275 <= p14431)))))
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 1792 bytes per marking, with 12 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 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p8551 + 1 <= p9340) OR (p2747 + 1 <= p3617)) AND ((p5497 <= 1) OR (1 <= p3744)))))
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 1792 bytes per marking, with 12 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 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 411 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p14646) OR (1 <= p13727))))
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 1792 bytes per marking, with 12 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 470 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p8492 + 1 <= p5853) OR (2 <= p1840))))
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 1792 bytes per marking, with 12 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 548 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2761 <= p100)))
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 1792 bytes per marking, with 12 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 DLCshifumi-PT-4b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 6995 markings, 8797 edges, 1399 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p3667 + 1 <= p11887) AND (p10649 <= 0)) OR (p59 <= p2714))))
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 1792 bytes per marking, with 12 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 DLCshifumi-PT-4b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p10238 <= p10948) OR (p8752 <= p9316)) AND ((p7696 <= p9829) OR (p5400 <= p9253)) AND (3 <= p5234))))
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 1792 bytes per marking, with 12 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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 14193 markings, 16016 edges, 2839 markings/sec, 0 secs
lola: sara is running 5 secs || 32997 markings, 37926 edges, 3761 markings/sec, 5 secs
lola: sara is running 10 secs || 53579 markings, 62153 edges, 4116 markings/sec, 10 secs
lola: sara is running 15 secs || 75006 markings, 87469 edges, 4285 markings/sec, 15 secs
lola: sara is running 20 secs || 92632 markings, 108094 edges, 3525 markings/sec, 20 secs
lola: sara is running 25 secs || 114161 markings, 133498 edges, 4306 markings/sec, 25 secs
lola: sara is running 30 secs || 137038 markings, 160404 edges, 4575 markings/sec, 30 secs
lola: sara is running 35 secs || 160018 markings, 187218 edges, 4596 markings/sec, 35 secs
lola: sara is running 40 secs || 183205 markings, 215010 edges, 4637 markings/sec, 40 secs
lola: sara is running 45 secs || 206119 markings, 241840 edges, 4583 markings/sec, 45 secs
lola: sara is running 50 secs || 228077 markings, 267627 edges, 4392 markings/sec, 50 secs
lola: sara is running 55 secs || 249950 markings, 293287 edges, 4375 markings/sec, 55 secs
lola: sara is running 60 secs || 270385 markings, 317179 edges, 4087 markings/sec, 60 secs
lola: sara is running 65 secs || 291897 markings, 342350 edges, 4302 markings/sec, 65 secs
lola: sara is running 70 secs || 312643 markings, 366665 edges, 4149 markings/sec, 70 secs
lola: sara is running 75 secs || 333942 markings, 391784 edges, 4260 markings/sec, 75 secs
lola: sara is running 80 secs || 354833 markings, 416282 edges, 4178 markings/sec, 80 secs
lola: sara is running 85 secs || 375794 markings, 440968 edges, 4192 markings/sec, 85 secs
lola: sara is running 90 secs || 395824 markings, 464612 edges, 4006 markings/sec, 90 secs
lola: sara is running 95 secs || 415856 markings, 488078 edges, 4006 markings/sec, 95 secs
lola: sara is running 100 secs || 436452 markings, 512251 edges, 4119 markings/sec, 100 secs
lola: sara is running 105 secs || 457137 markings, 536705 edges, 4137 markings/sec, 105 secs
lola: sara is running 110 secs || 478567 markings, 561911 edges, 4286 markings/sec, 110 secs
lola: sara is running 115 secs || 500484 markings, 587521 edges, 4383 markings/sec, 115 secs
lola: sara is running 120 secs || 522578 markings, 613496 edges, 4419 markings/sec, 120 secs
lola: sara is running 125 secs || 544873 markings, 639730 edges, 4459 markings/sec, 125 secs
lola: sara is running 130 secs || 566503 markings, 665044 edges, 4326 markings/sec, 130 secs
lola: sara is running 135 secs || 587853 markings, 690031 edges, 4270 markings/sec, 135 secs
lola: sara is running 140 secs || 609351 markings, 715403 edges, 4300 markings/sec, 140 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 145 secs || 630279 markings, 739899 edges, 4186 markings/sec, 145 secs
lola: sara is running 150 secs || 650966 markings, 764145 edges, 4137 markings/sec, 150 secs
lola: sara is running 155 secs || 673041 markings, 790127 edges, 4415 markings/sec, 155 secs
lola: sara is running 160 secs || 694128 markings, 814820 edges, 4217 markings/sec, 160 secs
lola: sara is running 165 secs || 714607 markings, 838847 edges, 4096 markings/sec, 165 secs
lola: sara is running 170 secs || 735485 markings, 863398 edges, 4176 markings/sec, 170 secs
lola: sara is running 175 secs || 755259 markings, 886488 edges, 3955 markings/sec, 175 secs
lola: sara is running 180 secs || 775580 markings, 910450 edges, 4064 markings/sec, 180 secs
lola: sara is running 185 secs || 796013 markings, 934417 edges, 4087 markings/sec, 185 secs
lola: sara is running 190 secs || 815964 markings, 957699 edges, 3990 markings/sec, 190 secs
lola: sara is running 195 secs || 836946 markings, 982397 edges, 4196 markings/sec, 195 secs
lola: sara is running 200 secs || 857724 markings, 1006786 edges, 4156 markings/sec, 200 secs
lola: sara is running 205 secs || 878157 markings, 1030762 edges, 4087 markings/sec, 205 secs
lola: sara is running 210 secs || 899220 markings, 1055523 edges, 4213 markings/sec, 210 secs
lola: sara is running 215 secs || 919679 markings, 1079445 edges, 4092 markings/sec, 215 secs
lola: sara is running 220 secs || 939286 markings, 1102541 edges, 3921 markings/sec, 220 secs
lola: sara is running 225 secs || 959551 markings, 1126385 edges, 4053 markings/sec, 225 secs
lola: sara is running 230 secs || 978514 markings, 1148482 edges, 3793 markings/sec, 230 secs
lola: sara is running 235 secs || 998493 markings, 1172025 edges, 3996 markings/sec, 235 secs
lola: sara is running 240 secs || 1018007 markings, 1194943 edges, 3903 markings/sec, 240 secs
lola: sara is running 245 secs || 1037098 markings, 1217226 edges, 3818 markings/sec, 245 secs
lola: sara is running 250 secs || 1057061 markings, 1240779 edges, 3993 markings/sec, 250 secs
lola: sara is running 255 secs || 1076897 markings, 1263960 edges, 3967 markings/sec, 255 secs
lola: sara is running 260 secs || 1096262 markings, 1286696 edges, 3873 markings/sec, 260 secs
lola: sara is running 265 secs || 1117143 markings, 1311277 edges, 4176 markings/sec, 265 secs
lola: sara is running 270 secs || 1135821 markings, 1333054 edges, 3736 markings/sec, 270 secs
lola: sara is running 275 secs || 1156573 markings, 1357490 edges, 4150 markings/sec, 275 secs
lola: sara is running 280 secs || 1176394 markings, 1380838 edges, 3964 markings/sec, 280 secs
lola: sara is running 285 secs || 1195976 markings, 1403804 edges, 3916 markings/sec, 285 secs
lola: sara is running 290 secs || 1215673 markings, 1427051 edges, 3939 markings/sec, 290 secs
lola: sara is running 295 secs || 1235896 markings, 1450664 edges, 4045 markings/sec, 295 secs
lola: sara is running 300 secs || 1256074 markings, 1474173 edges, 4036 markings/sec, 300 secs
lola: sara is running 305 secs || 1276961 markings, 1498889 edges, 4177 markings/sec, 305 secs
lola: sara is running 310 secs || 1296264 markings, 1521506 edges, 3861 markings/sec, 310 secs
lola: sara is running 315 secs || 1316245 markings, 1544862 edges, 3996 markings/sec, 315 secs
lola: sara is running 320 secs || 1337096 markings, 1569298 edges, 4170 markings/sec, 320 secs
lola: sara is running 325 secs || 1355617 markings, 1591049 edges, 3704 markings/sec, 325 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 984 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p3701) AND (p7865 + 1 <= p11450) AND (p11174 <= p8425))))
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 1792 bytes per marking, with 12 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 DLCshifumi-PT-4b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 25207 markings, 26774 edges, 5041 markings/sec, 0 secs
lola: sara is running 5 secs || 42440 markings, 45782 edges, 3447 markings/sec, 5 secs
lola: sara is running 10 secs || 57843 markings, 62848 edges, 3081 markings/sec, 10 secs
lola: sara is running 15 secs || 73487 markings, 80003 edges, 3129 markings/sec, 15 secs
lola: sara is running 20 secs || 86782 markings, 94602 edges, 2659 markings/sec, 20 secs
lola: sara is running 25 secs || 99036 markings, 108100 edges, 2451 markings/sec, 25 secs
lola: sara is running 30 secs || 109728 markings, 119728 edges, 2138 markings/sec, 30 secs
lola: sara is running 35 secs || 119907 markings, 130795 edges, 2036 markings/sec, 35 secs
lola: sara is running 40 secs || 130369 markings, 142205 edges, 2092 markings/sec, 40 secs
lola: sara is running 45 secs || 140039 markings, 152751 edges, 1934 markings/sec, 45 secs
lola: sara is running 50 secs || 149871 markings, 163487 edges, 1966 markings/sec, 50 secs
lola: sara is running 55 secs || 159882 markings, 174381 edges, 2002 markings/sec, 55 secs
lola: sara is running 60 secs || 170056 markings, 185447 edges, 2035 markings/sec, 60 secs
lola: sara is running 65 secs || 180252 markings, 196547 edges, 2039 markings/sec, 65 secs
lola: sara is running 70 secs || 190058 markings, 207284 edges, 1961 markings/sec, 70 secs
lola: sara is running 75 secs || 200456 markings, 218602 edges, 2080 markings/sec, 75 secs
lola: sara is running 80 secs || 210212 markings, 229249 edges, 1951 markings/sec, 80 secs
lola: sara is running 85 secs || 220105 markings, 240047 edges, 1979 markings/sec, 85 secs
lola: sara is running 90 secs || 230239 markings, 251089 edges, 2027 markings/sec, 90 secs
lola: sara is running 95 secs || 240513 markings, 262250 edges, 2055 markings/sec, 95 secs
lola: sara is running 100 secs || 250337 markings, 273015 edges, 1965 markings/sec, 100 secs
lola: sara is running 105 secs || 260585 markings, 284159 edges, 2050 markings/sec, 105 secs
lola: sara is running 110 secs || 271134 markings, 295646 edges, 2110 markings/sec, 110 secs
lola: sara is running 115 secs || 280923 markings, 306325 edges, 1958 markings/sec, 115 secs
lola: sara is running 120 secs || 290901 markings, 317224 edges, 1996 markings/sec, 120 secs
lola: sara is running 125 secs || 301023 markings, 328243 edges, 2024 markings/sec, 125 secs
lola: sara is running 130 secs || 311247 markings, 339362 edges, 2045 markings/sec, 130 secs
lola: sara is running 135 secs || 321132 markings, 350192 edges, 1977 markings/sec, 135 secs
lola: sara is running 140 secs || 331386 markings, 361333 edges, 2051 markings/sec, 140 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 145 secs || 342146 markings, 373073 edges, 2152 markings/sec, 145 secs
lola: sara is running 150 secs || 351481 markings, 383242 edges, 1867 markings/sec, 150 secs
lola: sara is running 155 secs || 361393 markings, 394071 edges, 1982 markings/sec, 155 secs
lola: sara is running 160 secs || 371459 markings, 405024 edges, 2013 markings/sec, 160 secs
lola: sara is running 165 secs || 381449 markings, 415897 edges, 1998 markings/sec, 165 secs
lola: sara is running 170 secs || 391082 markings, 426376 edges, 1927 markings/sec, 170 secs
lola: sara is running 175 secs || 401527 markings, 437738 edges, 2089 markings/sec, 175 secs
lola: sara is running 180 secs || 412133 markings, 449285 edges, 2121 markings/sec, 180 secs
lola: sara is running 185 secs || 422744 markings, 460851 edges, 2122 markings/sec, 185 secs
lola: sara is running 190 secs || 432623 markings, 471638 edges, 1976 markings/sec, 190 secs
lola: sara is running 195 secs || 443543 markings, 483575 edges, 2184 markings/sec, 195 secs
lola: sara is running 200 secs || 453756 markings, 494742 edges, 2043 markings/sec, 200 secs
lola: sara is running 205 secs || 463808 markings, 505704 edges, 2010 markings/sec, 205 secs
lola: sara is running 210 secs || 474001 markings, 516819 edges, 2039 markings/sec, 210 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p3216 <= p8677) AND ((p11575 <= p2267) OR (2 <= p7175))) OR (p11130 <= p7064))))
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 1792 bytes per marking, with 12 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 11656 markings, 12862 edges, 2331 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2731 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p364)))
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 1792 bytes per marking, with 12 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 DLCshifumi-PT-4b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown yes yes no no no no yes yes yes no no no no no yes
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494646709808
--------------------
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="DLCshifumi-PT-4b"
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/DLCshifumi-PT-4b.tgz
mv DLCshifumi-PT-4b 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 DLCshifumi-PT-4b, 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-149436309400493"
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 ;