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

--------------------
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 1496367847320


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_EnergyBus-PT-none: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_EnergyBus-PT-none: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_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
sara: try reading problem file EnergyBus-PT-none-ReachabilityCardinality.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 || 5008 markings, 8728 edges, 1002 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 10409 markings, 20611 edges, 1080 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 || 4300 markings, 10419 edges, 860 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 8574 markings, 20334 edges, 855 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 || 25979 markings, 79046 edges, 5196 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 56112 markings, 176985 edges, 6027 markings/sec, 5 secs
lola: sara is running 10 secs || 73576 markings, 229352 edges, 3493 markings/sec, 10 secs
lola: sara is running 15 secs || 95173 markings, 295219 edges, 4319 markings/sec, 15 secs
lola: sara is running 20 secs || 117392 markings, 364006 edges, 4444 markings/sec, 20 secs
sara: warning, failure of lp_solve (at job 844)
lola: sara is running 25 secs || 135617 markings, 420984 edges, 3645 markings/sec, 25 secs
lola: sara is running 30 secs || 156617 markings, 483840 edges, 4200 markings/sec, 30 secs
lola: sara is running 35 secs || 172057 markings, 534557 edges, 3088 markings/sec, 35 secs
lola: sara is running 40 secs || 189253 markings, 586884 edges, 3439 markings/sec, 40 secs
lola: sara is running 45 secs || 215187 markings, 665683 edges, 5187 markings/sec, 45 secs
lola: sara is running 50 secs || 232930 markings, 720662 edges, 3549 markings/sec, 50 secs
lola: sara is running 55 secs || 254698 markings, 788188 edges, 4354 markings/sec, 55 secs
lola: sara is running 60 secs || 277475 markings, 861269 edges, 4555 markings/sec, 60 secs
lola: sara is running 65 secs || 302532 markings, 941452 edges, 5011 markings/sec, 65 secs
lola: sara is running 70 secs || 323954 markings, 1009746 edges, 4284 markings/sec, 70 secs
lola: sara is running 75 secs || 349547 markings, 1089703 edges, 5119 markings/sec, 75 secs
lola: sara is running 80 secs || 370888 markings, 1156124 edges, 4268 markings/sec, 80 secs
lola: sara is running 85 secs || 392492 markings, 1221405 edges, 4321 markings/sec, 85 secs
lola: sara is running 90 secs || 416147 markings, 1290974 edges, 4731 markings/sec, 90 secs
lola: sara is running 95 secs || 439054 markings, 1363182 edges, 4581 markings/sec, 95 secs
lola: sara is running 100 secs || 457100 markings, 1418835 edges, 3609 markings/sec, 100 secs
lola: sara is running 105 secs || 478808 markings, 1484916 edges, 4342 markings/sec, 105 secs
lola: sara is running 110 secs || 494301 markings, 1531551 edges, 3099 markings/sec, 110 secs
lola: sara is running 115 secs || 517442 markings, 1603100 edges, 4628 markings/sec, 115 secs
lola: sara is running 120 secs || 538602 markings, 1666827 edges, 4232 markings/sec, 120 secs
lola: sara is running 125 secs || 559848 markings, 1732201 edges, 4249 markings/sec, 125 secs
lola: sara is running 130 secs || 573377 markings, 1773284 edges, 2706 markings/sec, 130 secs
lola: sara is running 135 secs || 592403 markings, 1834026 edges, 3805 markings/sec, 135 secs
lola: sara is running 140 secs || 612998 markings, 1899653 edges, 4119 markings/sec, 140 secs
lola: sara is running 145 secs || 634420 markings, 1967388 edges, 4284 markings/sec, 145 secs
lola: sara is running 150 secs || 654750 markings, 2031861 edges, 4066 markings/sec, 150 secs
lola: sara is running 155 secs || 684992 markings, 2127449 edges, 6048 markings/sec, 155 secs
lola: sara is running 160 secs || 714907 markings, 2222882 edges, 5983 markings/sec, 160 secs
lola: sara is running 165 secs || 727275 markings, 2264172 edges, 2474 markings/sec, 165 secs
lola: sara is running 170 secs || 740027 markings, 2306984 edges, 2550 markings/sec, 170 secs
lola: sara is running 175 secs || 759862 markings, 2368811 edges, 3967 markings/sec, 175 secs
lola: sara is running 180 secs || 782991 markings, 2439258 edges, 4626 markings/sec, 180 secs
lola: sara is running 185 secs || 800234 markings, 2489979 edges, 3449 markings/sec, 185 secs
lola: sara is running 190 secs || 821280 markings, 2551933 edges, 4209 markings/sec, 190 secs
lola: sara is running 195 secs || 843041 markings, 2623488 edges, 4352 markings/sec, 195 secs
lola: sara is running 200 secs || 856186 markings, 2665986 edges, 2629 markings/sec, 200 secs
lola: sara is running 205 secs || 873282 markings, 2718911 edges, 3419 markings/sec, 205 secs
lola: sara is running 210 secs || 895724 markings, 2791706 edges, 4488 markings/sec, 210 secs
lola: sara is running 215 secs || 920864 markings, 2870245 edges, 5028 markings/sec, 215 secs
lola: sara is running 220 secs || 944735 markings, 2943500 edges, 4774 markings/sec, 220 secs
lola: sara is running 225 secs || 973088 markings, 3031867 edges, 5671 markings/sec, 225 secs
lola: sara is running 230 secs || 998056 markings, 3114055 edges, 4994 markings/sec, 230 secs
lola: sara is running 235 secs || 1015120 markings, 3169037 edges, 3413 markings/sec, 235 secs
lola: sara is running 240 secs || 1032289 markings, 3225799 edges, 3434 markings/sec, 240 secs
lola: sara is running 245 secs || 1048243 markings, 3276698 edges, 3191 markings/sec, 245 secs
lola: sara is running 250 secs || 1077714 markings, 3374372 edges, 5894 markings/sec, 250 secs
lola: sara is running 255 secs || 1107263 markings, 3470419 edges, 5910 markings/sec, 255 secs
lola: sara is running 260 secs || 1128932 markings, 3541238 edges, 4334 markings/sec, 260 secs
lola: sara is running 265 secs || 1144170 markings, 3589005 edges, 3048 markings/sec, 265 secs
lola: sara is running 270 secs || 1159469 markings, 3637900 edges, 3060 markings/sec, 270 secs
lola: sara is running 275 secs || 1176467 markings, 3690840 edges, 3400 markings/sec, 275 secs
lola: sara is running 280 secs || 1194418 markings, 3752438 edges, 3590 markings/sec, 280 secs
lola: sara is running 285 secs || 1216015 markings, 3821274 edges, 4319 markings/sec, 285 secs
lola: sara is running 290 secs || 1241618 markings, 3905284 edges, 5121 markings/sec, 290 secs
lola: sara is running 295 secs || 1263228 markings, 3967461 edges, 4322 markings/sec, 295 secs
lola: sara is running 300 secs || 1288515 markings, 4046886 edges, 5057 markings/sec, 300 secs
lola: sara is running 305 secs || 1313608 markings, 4130890 edges, 5019 markings/sec, 305 secs
lola: sara is running 310 secs || 1333769 markings, 4197329 edges, 4032 markings/sec, 310 secs
lola: sara is running 315 secs || 1361687 markings, 4288768 edges, 5584 markings/sec, 315 secs
lola: sara is running 320 secs || 1391261 markings, 4387633 edges, 5915 markings/sec, 320 secs
lola: sara is running 325 secs || 1416318 markings, 4468159 edges, 5011 markings/sec, 325 secs
lola: sara is running 330 secs || 1435700 markings, 4530360 edges, 3876 markings/sec, 330 secs
lola: sara is running 335 secs || 1454159 markings, 4584044 edges, 3692 markings/sec, 335 secs
lola: sara is running 340 secs || 1474724 markings, 4650719 edges, 4113 markings/sec, 340 secs
lola: sara is running 345 secs || 1495909 markings, 4718500 edges, 4237 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 || 22699 markings, 42428 edges, 4540 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 || 35336 markings, 108719 edges, 7067 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 69770 markings, 211688 edges, 6887 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 || 4850 markings, 7604 edges, 970 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 8052 markings, 11412 edges, 640 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 || 32155 markings, 71704 edges, 6431 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 63084 markings, 140237 edges, 6186 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 1496368262776

--------------------
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="S_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/S_EnergyBus-PT-none.tgz
mv S_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 S_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 r108-blw3-149441612300322"
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 ;