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-3254
Executing tool lola
Input is Echo-PT-d02r19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264100268
=====================================================================

--------------------
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 Echo-PT-d02r19-ReachabilityCardinality-0
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-1
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-10
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-11
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-12
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-13
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-14
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-15
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-3
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-4
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-5
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-6
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-7
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-8
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1494688659238


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ Echo-PT-d02r19 @ 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: 6185/65536 symbol table entries, 806 collisions
lola: preprocessing...
lola: finding significant places
lola: 3455 places, 2730 transitions, 1726 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5448 transition conflict sets
lola: TASK
lola: reading formula from Echo-PT-d02r19-ReachabilityCardinality.task
lola: E (F (((p2849 <= 1) AND (p248 + 1 <= p2664) AND (p2250 + 1 <= p72)))) : A (G ((((2 <= p2460) AND (3 <= p110)) OR (p1614 <= p393) OR (p697 <= p1854)))) : A (G (((p2265 <= p509) OR ((p2918 <= p1162) AND (p720 <= 2))))) : A (G ((p666 <= 1))) : E (F (((p2727 + 1 <= p1296) AND (p1147 <= 0) AND ((p2170 <= p1325) OR (1 <= p1901) OR (p1303 <= p1513))))) : E (F (((2 <= p3348) AND (p1027 + 1 <= p2792)))) : A (G (((2 <= p3249) OR (p3300 <= 2)))) : E (F (((2 <= p1651) OR ((3 <= p1975) AND (1 <= p1374) AND (p756 <= p593))))) : E (F ((1 <= p744))) : A (G (((2 <= p3436) OR (p827 <= p2685)))) : A (G (((1 <= p3396) AND (p817 <= p1315)))) : A (G (((p1846 + 1 <= p2940) OR ((p3024 <= 1) AND (p197 <= 2))))) : E (F (((p711 + 1 <= p3117) AND (p1390 + 1 <= p3348) AND (((p1287 <= p314) AND (3 <= p3313)) OR (2 <= p80))))) : E (F ((2 <= p1239))) : E (F (((p1131 <= p2780) AND (3 <= p1431)))) : E (F ((((p1099 + 1 <= p2051) AND ((p2156 <= p542) OR (p2155 <= p2126))) OR ((p2239 <= p55) AND (3 <= p2737)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2849 <= 1) AND (p248 + 1 <= p2664) AND (p2250 + 1 <= p72))))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p2460) AND (3 <= p110)) OR (p1614 <= p393) OR (p697 <= p1854))))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2265 <= p509) OR ((p2918 <= p1162) AND (p720 <= 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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p666 <= 1)))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2727 + 1 <= p1296) AND (p1147 <= 0) AND ((p2170 <= p1325) OR (1 <= p1901) OR (p1303 <= p1513)))))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 618451 markings, 996771 edges, 123690 markings/sec, 0 secs
lola: sara is running 5 secs || 1060845 markings, 2080901 edges, 88479 markings/sec, 5 secs
lola: sara is running 10 secs || 1558096 markings, 3151834 edges, 99450 markings/sec, 10 secs
lola: sara is running 15 secs || 1983606 markings, 3906805 edges, 85102 markings/sec, 15 secs
lola: sara is running 20 secs || 2376204 markings, 4985594 edges, 78520 markings/sec, 20 secs
lola: sara is running 25 secs || 2913799 markings, 6024632 edges, 107519 markings/sec, 25 secs
lola: sara is running 30 secs || 3319060 markings, 7099407 edges, 81052 markings/sec, 30 secs
lola: sara is running 35 secs || 3789661 markings, 8079568 edges, 94120 markings/sec, 35 secs
lola: sara is running 40 secs || 4382352 markings, 9125530 edges, 118538 markings/sec, 40 secs
lola: sara is running 45 secs || 4871235 markings, 10180382 edges, 97777 markings/sec, 45 secs
lola: sara is running 50 secs || 5309960 markings, 11277941 edges, 87745 markings/sec, 50 secs
lola: sara is running 55 secs || 5870959 markings, 12296674 edges, 112200 markings/sec, 55 secs
lola: sara is running 60 secs || 6287186 markings, 13373419 edges, 83245 markings/sec, 60 secs
lola: sara is running 65 secs || 6828097 markings, 14406969 edges, 108182 markings/sec, 65 secs
lola: sara is running 70 secs || 7322208 markings, 15461883 edges, 98822 markings/sec, 70 secs
lola: sara is running 75 secs || 7809261 markings, 16488603 edges, 97411 markings/sec, 75 secs
lola: sara is running 80 secs || 8336184 markings, 17543591 edges, 105385 markings/sec, 80 secs
lola: sara is running 85 secs || 8878639 markings, 18588334 edges, 108491 markings/sec, 85 secs
lola: sara is running 90 secs || 9279097 markings, 19696136 edges, 80092 markings/sec, 90 secs
lola: sara is running 95 secs || 9803246 markings, 20731374 edges, 104830 markings/sec, 95 secs
lola: sara is running 100 secs || 10160105 markings, 21836933 edges, 71372 markings/sec, 100 secs
lola: sara is running 105 secs || 10509857 markings, 22923297 edges, 69950 markings/sec, 105 secs
lola: sara is running 110 secs || 10771649 markings, 24045871 edges, 52358 markings/sec, 110 secs
lola: sara is running 115 secs || 10987244 markings, 25173420 edges, 43119 markings/sec, 115 secs
lola: sara is running 120 secs || 11167306 markings, 26296724 edges, 36012 markings/sec, 120 secs
lola: sara is running 125 secs || 11328228 markings, 27419887 edges, 32184 markings/sec, 125 secs
lola: sara is running 130 secs || 11482146 markings, 28582502 edges, 30784 markings/sec, 130 secs
lola: sara is running 135 secs || 11803431 markings, 29678241 edges, 64257 markings/sec, 135 secs
lola: sara is running 140 secs || 12269436 markings, 30705331 edges, 93201 markings/sec, 140 secs
lola: sara is running 145 secs || 12567155 markings, 31797124 edges, 59544 markings/sec, 145 secs
lola: sara is running 150 secs || 12934437 markings, 32849922 edges, 73456 markings/sec, 150 secs
lola: sara is running 155 secs || 13210276 markings, 33849961 edges, 55168 markings/sec, 155 secs
lola: sara is running 160 secs || 13486551 markings, 34947412 edges, 55255 markings/sec, 160 secs
lola: sara is running 165 secs || 13864785 markings, 35973805 edges, 75647 markings/sec, 165 secs
lola: sara is running 170 secs || 14122794 markings, 36927852 edges, 51602 markings/sec, 170 secs
lola: sara is running 175 secs || 14593799 markings, 37977415 edges, 94201 markings/sec, 175 secs
lola: sara is running 180 secs || 14821436 markings, 39051178 edges, 45527 markings/sec, 180 secs
lola: sara is running 185 secs || 15047014 markings, 40108545 edges, 45116 markings/sec, 185 secs
lola: sara is running 190 secs || 15375869 markings, 41221522 edges, 65771 markings/sec, 190 secs
lola: sara is running 195 secs || 16000093 markings, 42224700 edges, 124845 markings/sec, 195 secs
lola: sara is running 200 secs || 16418925 markings, 43275771 edges, 83766 markings/sec, 200 secs
lola: sara is running 205 secs || 16938772 markings, 44313754 edges, 103969 markings/sec, 205 secs
lola: sara is running 210 secs || 17462449 markings, 45310354 edges, 104735 markings/sec, 210 secs
lola: sara is running 215 secs || 17862675 markings, 46380107 edges, 80045 markings/sec, 215 secs
lola: sara is running 220 secs || 18491240 markings, 47372237 edges, 125713 markings/sec, 220 secs
lola: sara is running 225 secs || 18875170 markings, 48415296 edges, 76786 markings/sec, 225 secs
lola: sara is running 230 secs || 19371208 markings, 49362340 edges, 99208 markings/sec, 230 secs
lola: sara is running 235 secs || 19991477 markings, 50343732 edges, 124054 markings/sec, 235 secs
lola: sara is running 240 secs || 20397163 markings, 51394273 edges, 81137 markings/sec, 240 secs
lola: sara is running 245 secs || 20945218 markings, 52406965 edges, 109611 markings/sec, 245 secs
lola: sara is running 250 secs || 21429051 markings, 53403763 edges, 96767 markings/sec, 250 secs
lola: sara is running 255 secs || 21832632 markings, 54439251 edges, 80716 markings/sec, 255 secs
lola: sara is running 260 secs || 22417445 markings, 55413393 edges, 116963 markings/sec, 260 secs
lola: sara is running 265 secs || 22817347 markings, 56429641 edges, 79980 markings/sec, 265 secs
lola: sara is running 270 secs || 23354040 markings, 57444569 edges, 107339 markings/sec, 270 secs
lola: sara is running 275 secs || 23849525 markings, 58183150 edges, 99097 markings/sec, 275 secs
lola: sara is running 280 secs || 24263845 markings, 59262940 edges, 82864 markings/sec, 280 secs
lola: sara is running 285 secs || 24789332 markings, 60285529 edges, 105097 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p3348) AND (p1027 + 1 <= p2792))))
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 216 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p3249) OR (p3300 <= 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 216 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityCardinality-6.sara
lola: The predicate is invariant.
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: lola: ========================================
...considering subproblem: E (F (((2 <= p1651) OR ((3 <= p1975) AND (1 <= p1374) AND (p756 <= p593)))))
state equation: calling and running sara
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityCardinality-6.sara.
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 Echo-PT-d02r19-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara is running 0 secs || 682664 markings, 687694 edges, 136533 markings/sec, 0 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 404 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p744)))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 9 will run for 462 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p3436) OR (p827 <= p2685))))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p3396) AND (p817 <= p1315))))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 647 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1846 + 1 <= p2940) OR ((p3024 <= 1) AND (p197 <= 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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 54146 markings, 218252 edges, 10829 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 808 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p711 + 1 <= p3117) AND (p1390 + 1 <= p3348) AND (((p1287 <= p314) AND (3 <= p3313)) OR (2 <= p80)))))
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 216 bytes per marking, with 2 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1075 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p1239)))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1611 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1131 <= p2780) AND (3 <= p1431))))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3219 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1099 + 1 <= p2051) AND ((p2156 <= p542) OR (p2155 <= p2126))) OR ((p2239 <= p55) AND (3 <= p2737)))))
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 216 bytes per marking, with 2 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 3 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes unknown no yes no yes no no yes no no no yes
FORMULA Echo-PT-d02r19-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494688980817

--------------------
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="Echo-PT-d02r19"
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/Echo-PT-d02r19.tgz
mv Echo-PT-d02r19 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is Echo-PT-d02r19, 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 r028-blw3-149440264100268"
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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;