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 EnergyBus-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264200322
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494695324319


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ EnergyBus-PT-none @ 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: 4587/65536 symbol table entries, 981 collisions
lola: preprocessing...
lola: finding significant places
lola: 157 places, 4430 transitions, 134 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1049 transition conflict sets
lola: TASK
lola: reading formula from EnergyBus-PT-none-ReachabilityCardinality.task
lola: E (F (((p119 + 1 <= p44) AND ((p19 <= p150) OR (p61 <= 0))))) : A (G (((p39 <= p20) OR ((2 <= p48) AND (p16 <= p50) AND ((3 <= p107) OR (p143 <= p45)))))) : A (G (((p49 <= p11) OR (p58 <= p41) OR ((p48 <= p134) AND (p71 <= p82)) OR (2 <= p117)))) : A (G ((p94 <= p107))) : A (G (((p53 <= 1) OR ((p38 <= p135) AND ((3 <= p118) OR (p82 <= p28)))))) : E (F (((p32 <= p78) AND (3 <= p11)))) : A (G (((p68 <= p48) OR (2 <= p24) OR (p112 <= p39)))) : A (G ((p83 <= p87))) : E (F (((2 <= p41) OR ((1 <= p83) AND (2 <= p73) AND ((p72 <= p60) OR (p139 <= p108)))))) : E (F ((p107 + 1 <= p121))) : E (F (((p28 <= 1) AND (3 <= p15) AND ((1 <= p149) OR (p23 + 1 <= p142))))) : A (G ((p83 <= p98))) : E (F ((1 <= p140))) : A (G ((p145 <= p51))) : E (F (((2 <= p82) AND (p104 <= p11) AND (p3 <= 2) AND ((p50 <= p136) OR (1 <= p10)) AND (p122 <= p140)))) : A (G (((p15 <= p134) OR ((p30 <= p41) AND (p75 <= p126) AND (p8 <= p26) AND (p105 <= p120)))))
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 (((p119 + 1 <= p44) AND ((p19 <= p150) OR (p61 <= 0)))))
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 20 bytes per marking, with 26 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 EnergyBus-PT-none-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 (((p39 <= p20) OR ((2 <= p48) AND (p16 <= p50) AND ((3 <= p107) OR (p143 <= p45))))))
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 20 bytes per marking, with 26 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 3 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-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 (((p49 <= p11) OR (p58 <= p41) OR ((p48 <= p134) AND (p71 <= p82)) OR (2 <= p117))))
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 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-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 ((p94 <= p107)))
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 20 bytes per marking, with 26 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 EnergyBus-PT-none-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p53 <= 1) OR ((p38 <= p135) AND ((3 <= p118) OR (p82 <= p28))))))
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 20 bytes per marking, with 26 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 EnergyBus-PT-none-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 5014 markings, 8741 edges, 1003 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 10780 markings, 21712 edges, 1153 markings/sec, 5 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p32 <= p78) AND (3 <= p11))))
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 20 bytes per marking, with 26 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 EnergyBus-PT-none-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 4379 markings, 10625 edges, 876 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 8745 markings, 20750 edges, 873 markings/sec, 5 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p68 <= p48) OR (2 <= p24) OR (p112 <= p39))))
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 20 bytes per marking, with 26 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 EnergyBus-PT-none-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 25830 markings, 78357 edges, 5166 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 56109 markings, 176981 edges, 6056 markings/sec, 5 secs
lola: sara is running 10 secs || 73947 markings, 230427 edges, 3568 markings/sec, 10 secs
lola: sara is running 15 secs || 95871 markings, 297158 edges, 4385 markings/sec, 15 secs
lola: sara is running 20 secs || 117456 markings, 364216 edges, 4317 markings/sec, 20 secs
sara: warning, failure of lp_solve (at job 844)
lola: sara is running 25 secs || 136826 markings, 424955 edges, 3874 markings/sec, 25 secs
lola: sara is running 30 secs || 158161 markings, 488756 edges, 4267 markings/sec, 30 secs
lola: sara is running 35 secs || 173552 markings, 538895 edges, 3078 markings/sec, 35 secs
lola: sara is running 40 secs || 191384 markings, 593495 edges, 3566 markings/sec, 40 secs
lola: sara is running 45 secs || 217710 markings, 673715 edges, 5265 markings/sec, 45 secs
lola: sara is running 50 secs || 235517 markings, 728281 edges, 3561 markings/sec, 50 secs
lola: sara is running 55 secs || 259315 markings, 804414 edges, 4760 markings/sec, 55 secs
lola: sara is running 60 secs || 282201 markings, 875297 edges, 4577 markings/sec, 60 secs
lola: sara is running 65 secs || 307296 markings, 955671 edges, 5019 markings/sec, 65 secs
lola: sara is running 70 secs || 332018 markings, 1033659 edges, 4944 markings/sec, 70 secs
lola: sara is running 75 secs || 356036 markings, 1111770 edges, 4804 markings/sec, 75 secs
lola: sara is running 80 secs || 375765 markings, 1170616 edges, 3946 markings/sec, 80 secs
lola: sara is running 85 secs || 401727 markings, 1249078 edges, 5192 markings/sec, 85 secs
lola: sara is running 90 secs || 419061 markings, 1299326 edges, 3467 markings/sec, 90 secs
lola: sara is running 95 secs || 441259 markings, 1370655 edges, 4440 markings/sec, 95 secs
lola: sara is running 100 secs || 462723 markings, 1436352 edges, 4293 markings/sec, 100 secs
lola: sara is running 105 secs || 482702 markings, 1495972 edges, 3996 markings/sec, 105 secs
lola: sara is running 110 secs || 502278 markings, 1556636 edges, 3915 markings/sec, 110 secs
lola: sara is running 115 secs || 524501 markings, 1624192 edges, 4445 markings/sec, 115 secs
lola: sara is running 120 secs || 548198 markings, 1696436 edges, 4739 markings/sec, 120 secs
lola: sara is running 125 secs || 565989 markings, 1750288 edges, 3558 markings/sec, 125 secs
lola: sara is running 130 secs || 582932 markings, 1805465 edges, 3389 markings/sec, 130 secs
lola: sara is running 135 secs || 597863 markings, 1850873 edges, 2986 markings/sec, 135 secs
lola: sara is running 140 secs || 623872 markings, 1934116 edges, 5202 markings/sec, 140 secs
lola: sara is running 145 secs || 641293 markings, 1988456 edges, 3484 markings/sec, 145 secs
lola: sara is running 150 secs || 666768 markings, 2067199 edges, 5095 markings/sec, 150 secs
lola: sara is running 155 secs || 696892 markings, 2163584 edges, 6025 markings/sec, 155 secs
lola: sara is running 160 secs || 726210 markings, 2260108 edges, 5864 markings/sec, 160 secs
lola: sara is running 165 secs || 730910 markings, 2276285 edges, 940 markings/sec, 165 secs
lola: sara is running 170 secs || 753221 markings, 2349205 edges, 4462 markings/sec, 170 secs
lola: sara is running 175 secs || 767503 markings, 2391070 edges, 2856 markings/sec, 175 secs
lola: sara is running 180 secs || 792747 markings, 2466918 edges, 5049 markings/sec, 180 secs
lola: sara is running 185 secs || 817976 markings, 2542349 edges, 5046 markings/sec, 185 secs
lola: sara is running 190 secs || 831934 markings, 2585372 edges, 2792 markings/sec, 190 secs
lola: sara is running 195 secs || 848001 markings, 2639493 edges, 3213 markings/sec, 195 secs
lola: sara is running 200 secs || 866942 markings, 2700046 edges, 3788 markings/sec, 200 secs
lola: sara is running 205 secs || 884254 markings, 2752310 edges, 3462 markings/sec, 205 secs
lola: sara is running 210 secs || 910182 markings, 2836423 edges, 5186 markings/sec, 210 secs
lola: sara is running 215 secs || 939428 markings, 2927668 edges, 5849 markings/sec, 215 secs
lola: sara is running 220 secs || 964511 markings, 3006234 edges, 5017 markings/sec, 220 secs
lola: sara is running 225 secs || 987818 markings, 3080349 edges, 4661 markings/sec, 225 secs
lola: sara is running 230 secs || 1014353 markings, 3166206 edges, 5307 markings/sec, 230 secs
lola: sara is running 235 secs || 1029202 markings, 3215108 edges, 2970 markings/sec, 235 secs
lola: sara is running 240 secs || 1045744 markings, 3269662 edges, 3308 markings/sec, 240 secs
lola: sara is running 245 secs || 1071881 markings, 3354759 edges, 5227 markings/sec, 245 secs
lola: sara is running 250 secs || 1102022 markings, 3454358 edges, 6028 markings/sec, 250 secs
lola: sara is running 255 secs || 1123849 markings, 3524803 edges, 4365 markings/sec, 255 secs
lola: sara is running 260 secs || 1143891 markings, 3587970 edges, 4008 markings/sec, 260 secs
lola: sara is running 265 secs || 1156641 markings, 3628924 edges, 2550 markings/sec, 265 secs
lola: sara is running 270 secs || 1175489 markings, 3687876 edges, 3770 markings/sec, 270 secs
lola: sara is running 275 secs || 1194079 markings, 3751024 edges, 3718 markings/sec, 275 secs
lola: sara is running 280 secs || 1213859 markings, 3815665 edges, 3956 markings/sec, 280 secs
lola: sara is running 285 secs || 1240263 markings, 3901780 edges, 5281 markings/sec, 285 secs
lola: sara is running 290 secs || 1261193 markings, 3962167 edges, 4186 markings/sec, 290 secs
lola: sara is running 295 secs || 1286700 markings, 4041180 edges, 5101 markings/sec, 295 secs
lola: sara is running 300 secs || 1313550 markings, 4130585 edges, 5370 markings/sec, 300 secs
lola: sara is running 305 secs || 1332867 markings, 4194572 edges, 3863 markings/sec, 305 secs
lola: sara is running 310 secs || 1361690 markings, 4288775 edges, 5765 markings/sec, 310 secs
lola: sara is running 315 secs || 1391531 markings, 4389170 edges, 5968 markings/sec, 315 secs
lola: sara is running 320 secs || 1416748 markings, 4469590 edges, 5043 markings/sec, 320 secs
lola: sara is running 325 secs || 1436090 markings, 4531716 edges, 3868 markings/sec, 325 secs
lola: sara is running 330 secs || 1455676 markings, 4589084 edges, 3917 markings/sec, 330 secs
lola: sara is running 335 secs || 1475270 markings, 4652493 edges, 3919 markings/sec, 335 secs
lola: sara is running 340 secs || 1499464 markings, 4728174 edges, 4839 markings/sec, 340 secs
lola: sara is running 345 secs || 1523237 markings, 4805565 edges, 4755 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p83 <= p87)))
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 20 bytes per marking, with 26 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 EnergyBus-PT-none-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 23446 markings, 43810 edges, 4689 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 394 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p41) OR ((1 <= p83) AND (2 <= p73) AND ((p72 <= p60) OR (p139 <= p108))))))
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 20 bytes per marking, with 26 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 3 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 35693 markings, 109762 edges, 7139 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 70778 markings, 214636 edges, 7017 markings/sec, 5 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p107 + 1 <= p121)))
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 20 bytes per marking, with 26 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 EnergyBus-PT-none-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-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 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p28 <= 1) AND (3 <= p15) AND ((1 <= p149) OR (p23 + 1 <= p142)))))
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 20 bytes per marking, with 26 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 EnergyBus-PT-none-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 5260 markings, 8062 edges, 1052 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 8473 markings, 11912 edges, 643 markings/sec, 5 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 627 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p83 <= p98)))
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 20 bytes per marking, with 26 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 EnergyBus-PT-none-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 784 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p140)))
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 20 bytes per marking, with 26 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 EnergyBus-PT-none-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1045 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p145 <= p51)))
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 20 bytes per marking, with 26 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 EnergyBus-PT-none-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1568 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p82) AND (p104 <= p11) AND (p3 <= 2) AND ((p50 <= p136) OR (1 <= p10)) AND (p122 <= p140))))
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 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 32099 markings, 71552 edges, 6420 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 63661 markings, 141534 edges, 6312 markings/sec, 5 secs
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 3125 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p15 <= p134) OR ((p30 <= p41) AND (p75 <= p126) AND (p8 <= p26) AND (p105 <= p120)))))
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 20 bytes per marking, with 26 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 EnergyBus-PT-none-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes no unknown no no yes no no yes no no no
FORMULA EnergyBus-PT-none-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494695739089

--------------------
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="EnergyBus-PT-none"
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/EnergyBus-PT-none.tgz
mv EnergyBus-PT-none 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 EnergyBus-PT-none, 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-149440264200322"
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 ;