About the Execution of LoLA for DLCshifumi-PT-6a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1096.900 | 1143801.00 | 2288621.00 | 200.00 | TFFTFTTTFFFFFFTT | 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-6a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309400520
=====================================================================
--------------------
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-6a-ReachabilityCardinality-0
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-1
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-10
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-11
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-12
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-13
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-14
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-15
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-2
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-3
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-4
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-5
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-6
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-7
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-8
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1494648097847
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ DLCshifumi-PT-6a @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 29504/65536 symbol table entries, 13256 collisions
lola: preprocessing...
lola: finding significant places
lola: 3568 places, 25936 transitions, 1153 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 22565 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-6a-ReachabilityCardinality.task
lola: A (G (((p3305 + 1 <= p3219) OR (p824 <= 1) OR (3 <= p733)))) : E (F ((2 <= p2813))) : E (F (((2 <= p1034) AND (1 <= p232)))) : E (F (((2 <= p2801) OR ((1 <= p1659) AND (p2825 <= p1294) AND (2 <= p2632))))) : E (F (((3 <= p319) AND (3 <= p1970)))) : E (F ((3 <= p1373))) : E (F ((((3 <= p1816) OR (p2405 <= p1055)) AND (3 <= p2661) AND ((p1979 + 1 <= p1241) OR (p2965 + 1 <= p1946))))) : E (F ((3 <= p1177))) : E (F ((((p2773 <= p1569) AND (1 <= p883) AND (p221 <= p3172)) OR ((3 <= p306) AND (1 <= p595) AND ((3 <= p2418) OR (3 <= p1517)))))) : A (G (((p403 <= p1652) AND ((p1199 <= 1) OR ((p1121 <= p57) AND (3 <= p234)))))) : E (F ((((2 <= p474) AND (p1842 <= 2)) OR (3 <= p2936)))) : A (G ((p3411 <= 2))) : E (F ((3 <= p560))) : A (G (((1 <= p1447) OR (p2716 <= p3115) OR (p1486 + 1 <= p3224) OR (((p1051 <= p1016) OR (p1120 <= p2244)) AND (2 <= p1223))))) : A (G ((p3066 <= 1))) : A (G (((p1954 <= p1481) OR (p504 <= 0) OR ((p3450 <= 0) AND (p935 + 1 <= p1906)))))
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 (((p3305 + 1 <= p3219) OR (p824 <= 1) OR (3 <= p733))))
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 148 bytes per marking, with 31 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-6a-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 653 markings, 5183 edges, 131 markings/sec, 0 secs
lola: sara is running 5 secs || 1325 markings, 11020 edges, 134 markings/sec, 5 secs
lola: sara is running 10 secs || 2046 markings, 18682 edges, 144 markings/sec, 10 secs
lola: sara is running 15 secs || 2766 markings, 26538 edges, 144 markings/sec, 15 secs
lola: sara is running 20 secs || 3503 markings, 35527 edges, 147 markings/sec, 20 secs
lola: sara is running 25 secs || 4246 markings, 44744 edges, 149 markings/sec, 25 secs
lola: sara is running 30 secs || 4984 markings, 54148 edges, 148 markings/sec, 30 secs
lola: sara is running 35 secs || 5665 markings, 62561 edges, 136 markings/sec, 35 secs
lola: sara is running 40 secs || 6330 markings, 70897 edges, 133 markings/sec, 40 secs
lola: sara is running 45 secs || 7023 markings, 79235 edges, 139 markings/sec, 45 secs
lola: sara is running 50 secs || 7761 markings, 89157 edges, 148 markings/sec, 50 secs
lola: sara is running 55 secs || 8502 markings, 98674 edges, 148 markings/sec, 55 secs
lola: sara is running 60 secs || 9237 markings, 107629 edges, 147 markings/sec, 60 secs
lola: sara is running 65 secs || 9967 markings, 116450 edges, 146 markings/sec, 65 secs
lola: sara is running 70 secs || 10678 markings, 125551 edges, 142 markings/sec, 70 secs
lola: sara is running 75 secs || 11401 markings, 134933 edges, 145 markings/sec, 75 secs
lola: sara is running 80 secs || 12134 markings, 144314 edges, 147 markings/sec, 80 secs
lola: sara is running 85 secs || 12872 markings, 153557 edges, 148 markings/sec, 85 secs
lola: sara is running 90 secs || 13612 markings, 162986 edges, 148 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 14343 markings, 171809 edges, 146 markings/sec, 95 secs
lola: sara is running 100 secs || 15060 markings, 180612 edges, 143 markings/sec, 100 secs
lola: sara is running 105 secs || 15780 markings, 190472 edges, 144 markings/sec, 105 secs
lola: sara is running 110 secs || 16510 markings, 199299 edges, 146 markings/sec, 110 secs
lola: sara is running 115 secs || 17249 markings, 208538 edges, 148 markings/sec, 115 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 227 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p2813)))
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 148 bytes per marking, with 31 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-6a-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p1034) AND (1 <= p232))))
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 148 bytes per marking, with 31 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-6a-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 761 markings, 6150 edges, 152 markings/sec, 0 secs
lola: sara is running 5 secs || 1521 markings, 15531 edges, 152 markings/sec, 5 secs
lola: sara is running 10 secs || 2277 markings, 21885 edges, 151 markings/sec, 10 secs
lola: sara is running 15 secs || 3003 markings, 30147 edges, 145 markings/sec, 15 secs
lola: sara is running 20 secs || 3731 markings, 39954 edges, 146 markings/sec, 20 secs
lola: sara is running 25 secs || 4459 markings, 49024 edges, 146 markings/sec, 25 secs
lola: sara is running 30 secs || 5182 markings, 58078 edges, 145 markings/sec, 30 secs
lola: sara is running 35 secs || 5903 markings, 67114 edges, 144 markings/sec, 35 secs
lola: sara is running 40 secs || 6621 markings, 75951 edges, 144 markings/sec, 40 secs
lola: sara is running 45 secs || 7349 markings, 85022 edges, 146 markings/sec, 45 secs
lola: sara is running 50 secs || 8083 markings, 94117 edges, 147 markings/sec, 50 secs
lola: sara is running 55 secs || 8827 markings, 103252 edges, 149 markings/sec, 55 secs
lola: sara is running 60 secs || 9563 markings, 112549 edges, 147 markings/sec, 60 secs
lola: sara is running 65 secs || 10296 markings, 121643 edges, 147 markings/sec, 65 secs
lola: sara is running 70 secs || 11023 markings, 130512 edges, 145 markings/sec, 70 secs
lola: sara is running 75 secs || 11746 markings, 139566 edges, 145 markings/sec, 75 secs
lola: sara is running 80 secs || 12475 markings, 148448 edges, 146 markings/sec, 80 secs
lola: sara is running 85 secs || 13219 markings, 157773 edges, 149 markings/sec, 85 secs
lola: sara is running 90 secs || 13965 markings, 166917 edges, 149 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 14701 markings, 176214 edges, 147 markings/sec, 95 secs
lola: sara is running 100 secs || 15429 markings, 185091 edges, 146 markings/sec, 100 secs
lola: sara is running 105 secs || 16151 markings, 194137 edges, 144 markings/sec, 105 secs
lola: sara is running 110 secs || 16879 markings, 203018 edges, 146 markings/sec, 110 secs
lola: sara is running 115 secs || 17617 markings, 212128 edges, 148 markings/sec, 115 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p2801) OR ((1 <= p1659) AND (p2825 <= p1294) AND (2 <= p2632)))))
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 148 bytes per marking, with 31 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-6a-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 436 markings, 37476 edges, 87 markings/sec, 0 secs
lola: sara is running 5 secs || 866 markings, 75180 edges, 86 markings/sec, 5 secs
lola: sara is running 10 secs || 1295 markings, 112658 edges, 86 markings/sec, 10 secs
lola: sara is running 15 secs || 1772 markings, 157798 edges, 95 markings/sec, 15 secs
lola: sara is running 20 secs || 2263 markings, 205757 edges, 98 markings/sec, 20 secs
lola: sara is running 25 secs || 2749 markings, 255194 edges, 97 markings/sec, 25 secs
lola: sara is running 30 secs || 3229 markings, 302919 edges, 96 markings/sec, 30 secs
lola: sara is running 35 secs || 3697 markings, 347135 edges, 94 markings/sec, 35 secs
lola: sara is running 40 secs || 4167 markings, 393110 edges, 94 markings/sec, 40 secs
lola: sara is running 45 secs || 4639 markings, 440836 edges, 94 markings/sec, 45 secs
lola: sara is running 50 secs || 5118 markings, 487731 edges, 96 markings/sec, 50 secs
lola: sara is running 55 secs || 5593 markings, 532453 edges, 95 markings/sec, 55 secs
lola: sara is running 60 secs || 6055 markings, 577205 edges, 92 markings/sec, 60 secs
lola: sara is running 65 secs || 6507 markings, 623311 edges, 90 markings/sec, 65 secs
lola: sara is running 70 secs || 6958 markings, 668556 edges, 90 markings/sec, 70 secs
lola: sara is running 75 secs || 7410 markings, 713216 edges, 90 markings/sec, 75 secs
lola: sara is running 80 secs || 7860 markings, 757581 edges, 90 markings/sec, 80 secs
lola: sara is running 85 secs || 8316 markings, 802791 edges, 91 markings/sec, 85 secs
lola: sara is running 90 secs || 8774 markings, 847843 edges, 92 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 9220 markings, 890493 edges, 89 markings/sec, 95 secs
lola: sara is running 100 secs || 9671 markings, 933205 edges, 90 markings/sec, 100 secs
lola: sara is running 105 secs || 10102 markings, 976934 edges, 86 markings/sec, 105 secs
lola: sara is running 110 secs || 10544 markings, 1018608 edges, 88 markings/sec, 110 secs
lola: sara is running 115 secs || 10987 markings, 1063204 edges, 89 markings/sec, 115 secs
lola: sara is running 120 secs || 11440 markings, 1108067 edges, 91 markings/sec, 120 secs
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 263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p319) AND (3 <= p1970))))
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 148 bytes per marking, with 31 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-6a-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 435 markings, 4412 edges, 87 markings/sec, 0 secs
lola: sara is running 5 secs || 864 markings, 9658 edges, 86 markings/sec, 5 secs
lola: sara is running 10 secs || 1288 markings, 15294 edges, 85 markings/sec, 10 secs
lola: sara is running 15 secs || 1708 markings, 21864 edges, 84 markings/sec, 15 secs
lola: sara is running 20 secs || 2135 markings, 28174 edges, 85 markings/sec, 20 secs
lola: sara is running 25 secs || 2564 markings, 35625 edges, 86 markings/sec, 25 secs
lola: sara is running 30 secs || 2997 markings, 42096 edges, 87 markings/sec, 30 secs
lola: sara is running 35 secs || 3420 markings, 48766 edges, 85 markings/sec, 35 secs
lola: sara is running 40 secs || 3829 markings, 56140 edges, 82 markings/sec, 40 secs
lola: sara is running 45 secs || 4256 markings, 62397 edges, 85 markings/sec, 45 secs
lola: sara is running 50 secs || 4688 markings, 69292 edges, 86 markings/sec, 50 secs
lola: sara is running 55 secs || 5126 markings, 76769 edges, 88 markings/sec, 55 secs
lola: sara is running 60 secs || 5563 markings, 83250 edges, 87 markings/sec, 60 secs
lola: sara is running 65 secs || 5996 markings, 90382 edges, 87 markings/sec, 65 secs
lola: sara is running 70 secs || 6424 markings, 97773 edges, 86 markings/sec, 70 secs
lola: sara is running 75 secs || 6855 markings, 104233 edges, 86 markings/sec, 75 secs
lola: sara is running 80 secs || 7283 markings, 111535 edges, 86 markings/sec, 80 secs
lola: sara is running 85 secs || 7717 markings, 118571 edges, 87 markings/sec, 85 secs
lola: sara is running 90 secs || 8155 markings, 125483 edges, 88 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 8586 markings, 132753 edges, 86 markings/sec, 95 secs
lola: sara is running 100 secs || 9010 markings, 139378 edges, 85 markings/sec, 100 secs
lola: sara is running 105 secs || 9439 markings, 146256 edges, 86 markings/sec, 105 secs
lola: sara is running 110 secs || 9871 markings, 153525 edges, 86 markings/sec, 110 secs
lola: sara is running 115 secs || 10311 markings, 160204 edges, 88 markings/sec, 115 secs
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 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p1373)))
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 148 bytes per marking, with 31 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-6a-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p1816) OR (p2405 <= p1055)) AND (3 <= p2661) AND ((p1979 + 1 <= p1241) OR (p2965 + 1 <= p1946)))))
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 148 bytes per marking, with 31 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-6a-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 758 markings, 5512 edges, 152 markings/sec, 0 secs
lola: sara is running 5 secs || 1506 markings, 11830 edges, 150 markings/sec, 5 secs
lola: sara is running 10 secs || 2245 markings, 18973 edges, 148 markings/sec, 10 secs
lola: sara is running 15 secs || 2977 markings, 27149 edges, 146 markings/sec, 15 secs
lola: sara is running 20 secs || 3726 markings, 35297 edges, 150 markings/sec, 20 secs
lola: sara is running 25 secs || 4470 markings, 43044 edges, 149 markings/sec, 25 secs
lola: sara is running 30 secs || 5203 markings, 51304 edges, 147 markings/sec, 30 secs
lola: sara is running 35 secs || 5928 markings, 59549 edges, 145 markings/sec, 35 secs
lola: sara is running 40 secs || 6661 markings, 66876 edges, 147 markings/sec, 40 secs
lola: sara is running 45 secs || 7400 markings, 75911 edges, 148 markings/sec, 45 secs
lola: sara is running 50 secs || 8148 markings, 83451 edges, 150 markings/sec, 50 secs
lola: sara is running 55 secs || 8893 markings, 91714 edges, 149 markings/sec, 55 secs
lola: sara is running 60 secs || 9613 markings, 99873 edges, 144 markings/sec, 60 secs
lola: sara is running 65 secs || 10350 markings, 107373 edges, 147 markings/sec, 65 secs
lola: sara is running 70 secs || 11077 markings, 115200 edges, 145 markings/sec, 70 secs
lola: sara is running 75 secs || 11803 markings, 123381 edges, 145 markings/sec, 75 secs
lola: sara is running 80 secs || 12534 markings, 130859 edges, 146 markings/sec, 80 secs
lola: sara is running 85 secs || 13255 markings, 138476 edges, 144 markings/sec, 85 secs
lola: sara is running 90 secs || 13981 markings, 146845 edges, 145 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 14701 markings, 154105 edges, 144 markings/sec, 95 secs
lola: sara is running 100 secs || 15422 markings, 161895 edges, 144 markings/sec, 100 secs
lola: sara is running 105 secs || 16146 markings, 169885 edges, 145 markings/sec, 105 secs
lola: sara is running 110 secs || 16880 markings, 177384 edges, 147 markings/sec, 110 secs
lola: sara is running 115 secs || 17605 markings, 185380 edges, 145 markings/sec, 115 secs
lola: sara is running 120 secs || 18344 markings, 193798 edges, 148 markings/sec, 120 secs
lola: sara is running 125 secs || 19092 markings, 201337 edges, 150 markings/sec, 125 secs
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 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p1177)))
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 148 bytes per marking, with 31 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-6a-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 510 markings, 4157 edges, 102 markings/sec, 0 secs
lola: sara is running 5 secs || 1014 markings, 10500 edges, 101 markings/sec, 5 secs
lola: sara is running 10 secs || 1510 markings, 17625 edges, 99 markings/sec, 10 secs
lola: sara is running 15 secs || 2001 markings, 23232 edges, 98 markings/sec, 15 secs
lola: sara is running 20 secs || 2500 markings, 30909 edges, 100 markings/sec, 20 secs
lola: sara is running 25 secs || 3000 markings, 39396 edges, 100 markings/sec, 25 secs
lola: sara is running 30 secs || 3497 markings, 47690 edges, 99 markings/sec, 30 secs
lola: sara is running 35 secs || 3985 markings, 55009 edges, 98 markings/sec, 35 secs
lola: sara is running 40 secs || 4472 markings, 63259 edges, 97 markings/sec, 40 secs
lola: sara is running 45 secs || 4962 markings, 70919 edges, 98 markings/sec, 45 secs
lola: sara is running 50 secs || 5460 markings, 79393 edges, 100 markings/sec, 50 secs
lola: sara is running 55 secs || 5956 markings, 87681 edges, 99 markings/sec, 55 secs
lola: sara is running 60 secs || 6450 markings, 95022 edges, 99 markings/sec, 60 secs
lola: sara is running 65 secs || 6929 markings, 103256 edges, 96 markings/sec, 65 secs
lola: sara is running 70 secs || 7406 markings, 110868 edges, 95 markings/sec, 70 secs
lola: sara is running 75 secs || 7882 markings, 118525 edges, 95 markings/sec, 75 secs
lola: sara is running 80 secs || 8364 markings, 126387 edges, 96 markings/sec, 80 secs
lola: sara is running 85 secs || 8848 markings, 134211 edges, 97 markings/sec, 85 secs
lola: sara is running 90 secs || 9337 markings, 142292 edges, 98 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 9821 markings, 150163 edges, 97 markings/sec, 95 secs
lola: sara is running 100 secs || 10305 markings, 157845 edges, 97 markings/sec, 100 secs
lola: sara is running 105 secs || 10785 markings, 165658 edges, 96 markings/sec, 105 secs
lola: sara is running 110 secs || 11269 markings, 173718 edges, 97 markings/sec, 110 secs
lola: sara is running 115 secs || 11756 markings, 181403 edges, 97 markings/sec, 115 secs
lola: sara is running 120 secs || 12245 markings, 189296 edges, 98 markings/sec, 120 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p2773 <= p1569) AND (1 <= p883) AND (p221 <= p3172)) OR ((3 <= p306) AND (1 <= p595) AND ((3 <= p2418) OR (3 <= p1517))))))
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 148 bytes per marking, with 31 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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-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 397 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p403 <= p1652) AND ((p1199 <= 1) OR ((p1121 <= p57) AND (3 <= p234))))))
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 148 bytes per marking, with 31 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 399 markings, 1316 edges, 80 markings/sec, 0 secs
lola: sara is running 5 secs || 801 markings, 2857 edges, 80 markings/sec, 5 secs
lola: sara is running 10 secs || 1195 markings, 4767 edges, 79 markings/sec, 10 secs
lola: sara is running 15 secs || 1610 markings, 7533 edges, 83 markings/sec, 15 secs
lola: sara is running 20 secs || 2033 markings, 9932 edges, 85 markings/sec, 20 secs
lola: sara is running 25 secs || 2443 markings, 13090 edges, 82 markings/sec, 25 secs
lola: sara is running 30 secs || 2864 markings, 15633 edges, 84 markings/sec, 30 secs
lola: sara is running 35 secs || 3266 markings, 18064 edges, 80 markings/sec, 35 secs
lola: sara is running 40 secs || 3660 markings, 20107 edges, 79 markings/sec, 40 secs
lola: sara is running 45 secs || 4095 markings, 22501 edges, 87 markings/sec, 45 secs
lola: sara is running 50 secs || 4523 markings, 26097 edges, 86 markings/sec, 50 secs
lola: sara is running 55 secs || 4936 markings, 29013 edges, 83 markings/sec, 55 secs
lola: sara is running 60 secs || 5356 markings, 30765 edges, 84 markings/sec, 60 secs
lola: sara is running 65 secs || 5780 markings, 32885 edges, 85 markings/sec, 65 secs
lola: sara is running 70 secs || 6218 markings, 35247 edges, 88 markings/sec, 70 secs
lola: sara is running 75 secs || 6634 markings, 37788 edges, 83 markings/sec, 75 secs
lola: sara is running 80 secs || 7076 markings, 40587 edges, 88 markings/sec, 80 secs
lola: sara is running 85 secs || 7497 markings, 42776 edges, 84 markings/sec, 85 secs
lola: sara is running 90 secs || 7926 markings, 44697 edges, 86 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 8339 markings, 46255 edges, 83 markings/sec, 95 secs
lola: sara is running 100 secs || 8750 markings, 49764 edges, 82 markings/sec, 100 secs
lola: sara is running 105 secs || 9181 markings, 52017 edges, 86 markings/sec, 105 secs
lola: sara is running 110 secs || 9601 markings, 54667 edges, 84 markings/sec, 110 secs
lola: sara is running 115 secs || 10016 markings, 56984 edges, 83 markings/sec, 115 secs
lola: sara is running 120 secs || 10444 markings, 60201 edges, 86 markings/sec, 120 secs
lola: sara is running 125 secs || 10868 markings, 62753 edges, 85 markings/sec, 125 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p474) AND (p1842 <= 2)) OR (3 <= p2936))))
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 148 bytes per marking, with 31 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 DLCshifumi-PT-6a-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 762 markings, 5739 edges, 152 markings/sec, 0 secs
lola: sara is running 5 secs || 1511 markings, 13246 edges, 150 markings/sec, 5 secs
lola: sara is running 10 secs || 2249 markings, 21952 edges, 148 markings/sec, 10 secs
lola: sara is running 15 secs || 2982 markings, 28932 edges, 147 markings/sec, 15 secs
lola: sara is running 20 secs || 3729 markings, 38715 edges, 149 markings/sec, 20 secs
lola: sara is running 25 secs || 4481 markings, 48323 edges, 150 markings/sec, 25 secs
lola: sara is running 30 secs || 5223 markings, 57505 edges, 148 markings/sec, 30 secs
lola: sara is running 35 secs || 5955 markings, 65894 edges, 146 markings/sec, 35 secs
lola: sara is running 40 secs || 6688 markings, 74674 edges, 147 markings/sec, 40 secs
lola: sara is running 45 secs || 7429 markings, 83862 edges, 148 markings/sec, 45 secs
lola: sara is running 50 secs || 8177 markings, 93457 edges, 150 markings/sec, 50 secs
lola: sara is running 55 secs || 8931 markings, 102690 edges, 151 markings/sec, 55 secs
lola: sara is running 60 secs || 9681 markings, 111355 edges, 150 markings/sec, 60 secs
lola: sara is running 65 secs || 10421 markings, 121112 edges, 148 markings/sec, 65 secs
lola: sara is running 70 secs || 11157 markings, 130646 edges, 147 markings/sec, 70 secs
lola: sara is running 75 secs || 11892 markings, 139802 edges, 147 markings/sec, 75 secs
lola: sara is running 80 secs || 12636 markings, 148241 edges, 149 markings/sec, 80 secs
lola: sara is running 85 secs || 13387 markings, 157097 edges, 150 markings/sec, 85 secs
lola: sara is running 90 secs || 14141 markings, 166346 edges, 151 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 14887 markings, 175921 edges, 149 markings/sec, 95 secs
lola: sara is running 100 secs || 15634 markings, 185129 edges, 149 markings/sec, 100 secs
lola: sara is running 105 secs || 16373 markings, 193753 edges, 148 markings/sec, 105 secs
lola: sara is running 110 secs || 17107 markings, 203475 edges, 147 markings/sec, 110 secs
lola: sara is running 115 secs || 17854 markings, 213060 edges, 149 markings/sec, 115 secs
lola: sara is running 120 secs || 18609 markings, 222302 edges, 151 markings/sec, 120 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3411 <= 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 148 bytes per marking, with 31 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-6a-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 630 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p560)))
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 148 bytes per marking, with 31 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-6a-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 568 markings, 4956 edges, 114 markings/sec, 0 secs
lola: sara is running 5 secs || 1126 markings, 12016 edges, 112 markings/sec, 5 secs
lola: sara is running 10 secs || 1675 markings, 19846 edges, 110 markings/sec, 10 secs
lola: sara is running 15 secs || 2218 markings, 26044 edges, 109 markings/sec, 15 secs
lola: sara is running 20 secs || 2772 markings, 34490 edges, 111 markings/sec, 20 secs
lola: sara is running 25 secs || 3323 markings, 42927 edges, 110 markings/sec, 25 secs
lola: sara is running 30 secs || 3875 markings, 51554 edges, 110 markings/sec, 30 secs
lola: sara is running 35 secs || 4421 markings, 60486 edges, 109 markings/sec, 35 secs
lola: sara is running 40 secs || 4970 markings, 68919 edges, 110 markings/sec, 40 secs
lola: sara is running 45 secs || 5526 markings, 77936 edges, 111 markings/sec, 45 secs
lola: sara is running 50 secs || 6086 markings, 86598 edges, 112 markings/sec, 50 secs
lola: sara is running 55 secs || 6643 markings, 95249 edges, 111 markings/sec, 55 secs
lola: sara is running 60 secs || 7191 markings, 103997 edges, 110 markings/sec, 60 secs
lola: sara is running 65 secs || 7731 markings, 112578 edges, 108 markings/sec, 65 secs
lola: sara is running 70 secs || 8271 markings, 120967 edges, 108 markings/sec, 70 secs
lola: sara is running 75 secs || 8804 markings, 129521 edges, 107 markings/sec, 75 secs
lola: sara is running 80 secs || 9343 markings, 137674 edges, 108 markings/sec, 80 secs
lola: sara is running 85 secs || 9886 markings, 146829 edges, 109 markings/sec, 85 secs
lola: sara is running 90 secs || 10436 markings, 155065 edges, 110 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 10981 markings, 163862 edges, 109 markings/sec, 95 secs
lola: sara is running 100 secs || 11530 markings, 172430 edges, 110 markings/sec, 100 secs
lola: sara is running 105 secs || 12074 markings, 181208 edges, 109 markings/sec, 105 secs
lola: sara is running 110 secs || 12627 markings, 189651 edges, 111 markings/sec, 110 secs
lola: sara is running 115 secs || 13181 markings, 198288 edges, 111 markings/sec, 115 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 798 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p1447) OR (p2716 <= p3115) OR (p1486 + 1 <= p3224) OR (((p1051 <= p1016) OR (p1120 <= p2244)) AND (2 <= p1223)))))
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 148 bytes per marking, with 31 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 9 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-13.sara
lola: subprocess 14 will run for 1198 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3066 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: state equation: calling and running saralola:
========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-13.sara.
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-6a-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 2396 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1954 <= p1481) OR (p504 <= 0) OR ((p3450 <= 0) AND (p935 + 1 <= p1906)))))
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 148 bytes per marking, with 31 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no no yes yes no yes no yes yes yes
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494649241648
--------------------
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-6a"
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-6a.tgz
mv DLCshifumi-PT-6a 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-6a, 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-149436309400520"
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 ;