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_MultiwaySync-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650000225
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496363712142


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


checking for too many tokens
===========================================================================================
S_MultiwaySync-PT-none: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_MultiwaySync-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: 694/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 222 places, 472 transitions, 197 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 547 transition conflict sets
lola: TASK
lola: reading formula from MultiwaySync-PT-none-ReachabilityFireability.task
lola: E (F ((FIREABLE(t457) OR ((FIREABLE(t428) OR FIREABLE(t121) OR NOT FIREABLE(t378)) AND (FIREABLE(t262) OR FIREABLE(t78) OR (FIREABLE(t18) AND FIREABLE(t457))))))) : E (F (((FIREABLE(t421) AND FIREABLE(t63) AND NOT FIREABLE(t394) AND FIREABLE(t145) AND NOT FIREABLE(t68)) OR FIREABLE(t39)))) : E (F (FIREABLE(t270))) : E (F ((FIREABLE(t27) OR (FIREABLE(t97) AND FIREABLE(t95))))) : E (F ((FIREABLE(t167) AND FIREABLE(t335) AND (FIREABLE(t392) OR FIREABLE(t420)) AND NOT FIREABLE(t463) AND FIREABLE(t205)))) : E (F (FIREABLE(t108))) : A (G ((FIREABLE(t358) OR FIREABLE(t471) OR FIREABLE(t98) OR (NOT FIREABLE(t45) AND (FIREABLE(t240) OR FIREABLE(t324))) OR NOT FIREABLE(t53) OR FIREABLE(t229)))) : E (F ((NOT FIREABLE(t370) AND (FIREABLE(t244) OR FIREABLE(t456))))) : E (F ((FIREABLE(t416) AND (FIREABLE(t359) OR FIREABLE(t266)) AND (FIREABLE(t225) OR FIREABLE(t240))))) : A (G (((FIREABLE(t28) AND (NOT FIREABLE(t400) OR NOT FIREABLE(t214))) OR (NOT FIREABLE(t95) AND (NOT FIREABLE(t11) OR NOT FIREABLE(t140)))))) : E (F (((FIREABLE(t468) AND FIREABLE(t342)) OR (FIREABLE(t43) AND FIREABLE(t467))))) : E (F (((FIREABLE(t303) OR FIREABLE(t114)) AND FIREABLE(t177) AND NOT FIREABLE(t457) AND NOT FIREABLE(t195)))) : E (F ((FIREABLE(t39) AND ((FIREABLE(t329) AND FIREABLE(t123)) OR NOT FIREABLE(t6)) AND NOT FIREABLE(t442) AND NOT FIREABLE(t87) AND (FIREABLE(t191) OR (FIREABLE(t100) AND FIREABLE(t263)))))) : E (F ((FIREABLE(t249) AND FIREABLE(t420) AND FIREABLE(t321) AND FIREABLE(t23) AND (FIREABLE(t364) OR FIREABLE(t249) OR FIREABLE(t208)) AND FIREABLE(t50) AND FIREABLE(t275)))) : E (F ((NOT FIREABLE(t375) AND NOT FIREABLE(t170) AND FIREABLE(t107) AND NOT FIREABLE(t220)))) : A (G (((FIREABLE(t345) AND NOT FIREABLE(t308)) OR FIREABLE(t239) OR NOT FIREABLE(t467) OR NOT FIREABLE(t463) OR (NOT FIREABLE(t222) AND NOT FIREABLE(t184)))))
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 ((FIREABLE(t457) OR ((FIREABLE(t428) OR FIREABLE(t121) OR NOT FIREABLE(t378)) AND (FIREABLE(t262) OR FIREABLE(t78) OR (FIREABLE(t18) AND FIREABLE(t457)))))))
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 28 bytes per marking, with 27 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 41 literals and 13 conjunctive subformulas
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t421) AND FIREABLE(t63) AND NOT FIREABLE(t394) AND FIREABLE(t145) AND NOT FIREABLE(t68)) OR FIREABLE(t39))))
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 28 bytes per marking, with 27 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 13 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to MultiwaySync-PT-none-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t270)))
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 28 bytes per marking, with 27 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 MultiwaySync-PT-none-ReachabilityFireability-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t27) OR (FIREABLE(t97) AND FIREABLE(t95)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file MultiwaySync-PT-none-ReachabilityFireability.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 27 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to MultiwaySync-PT-none-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t167) AND FIREABLE(t335) AND (FIREABLE(t392) OR FIREABLE(t420)) AND NOT FIREABLE(t463) AND FIREABLE(t205))))
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 28 bytes per marking, with 27 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)
sara: try reading problem file MultiwaySync-PT-none-ReachabilityFireability-3.sara.
lola: RUNNING
lola: state equation: Generated DNF with 32 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to MultiwaySync-PT-none-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file MultiwaySync-PT-none-ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara is running 0 secs || 948259 markings, 3113184 edges, 189652 markings/sec, 0 secs
lola: sara is running 5 secs || 1877477 markings, 6354399 edges, 185844 markings/sec, 5 secs
lola: sara is running 10 secs || 2763586 markings, 9525851 edges, 177222 markings/sec, 10 secs
sara: warning, failure of lp_solve (at job 60)
lola: sara is running 15 secs || 3632610 markings, 12440648 edges, 173805 markings/sec, 15 secs
lola: sara is running 20 secs || 4543146 markings, 15590807 edges, 182107 markings/sec, 20 secs
lola: sara is running 25 secs || 5413305 markings, 18692424 edges, 174032 markings/sec, 25 secs
lola: sara is running 30 secs || 6247013 markings, 21743528 edges, 166742 markings/sec, 30 secs
lola: sara is running 35 secs || 7044939 markings, 24743703 edges, 159585 markings/sec, 35 secs
lola: sara is running 40 secs || 7817197 markings, 27724791 edges, 154452 markings/sec, 40 secs
lola: sara is running 45 secs || 8558174 markings, 30695789 edges, 148195 markings/sec, 45 secs
lola: sara is running 50 secs || 9240554 markings, 33679199 edges, 136476 markings/sec, 50 secs
lola: sara is running 55 secs || 9365319 markings, 37846313 edges, 24953 markings/sec, 55 secs
lola: sara is running 60 secs || 9370224 markings, 42418184 edges, 981 markings/sec, 60 secs
lola: sara is running 65 secs || 9373317 markings, 46882407 edges, 619 markings/sec, 65 secs
lola: sara is running 70 secs || 9375618 markings, 51511070 edges, 460 markings/sec, 70 secs
lola: sara is running 75 secs || 9377515 markings, 56251215 edges, 379 markings/sec, 75 secs
lola: sara is running 80 secs || 9378762 markings, 61059301 edges, 249 markings/sec, 80 secs
lola: sara is running 85 secs || 9379953 markings, 65968407 edges, 238 markings/sec, 85 secs
lola: sara is running 90 secs || 9380413 markings, 71132584 edges, 92 markings/sec, 90 secs
lola: sara is running 95 secs || 9668191 markings, 75612997 edges, 57556 markings/sec, 95 secs
lola: sara is running 100 secs || 10385038 markings, 77998619 edges, 143369 markings/sec, 100 secs
lola: sara is running 105 secs || 11065392 markings, 80389153 edges, 136071 markings/sec, 105 secs
lola: sara is running 110 secs || 11758115 markings, 82864991 edges, 138545 markings/sec, 110 secs
lola: sara is running 115 secs || 12519616 markings, 85653239 edges, 152300 markings/sec, 115 secs
lola: sara is running 120 secs || 13281201 markings, 88505325 edges, 152317 markings/sec, 120 secs
lola: sara is running 125 secs || 14006748 markings, 91288215 edges, 145109 markings/sec, 125 secs
lola: sara is running 130 secs || 14697734 markings, 94023182 edges, 138197 markings/sec, 130 secs
lola: sara is running 135 secs || 15349266 markings, 96738625 edges, 130306 markings/sec, 135 secs
lola: sara is running 140 secs || 15739769 markings, 99944819 edges, 78101 markings/sec, 140 secs
lola: sara is running 145 secs || 15747018 markings, 103935023 edges, 1450 markings/sec, 145 secs
lola: sara is running 150 secs || 15750612 markings, 108183204 edges, 719 markings/sec, 150 secs
lola: sara is running 155 secs || 15753182 markings, 112463436 edges, 514 markings/sec, 155 secs
lola: sara is running 160 secs || 15755272 markings, 116977039 edges, 418 markings/sec, 160 secs
lola: sara is running 165 secs || 15756803 markings, 121578947 edges, 306 markings/sec, 165 secs
lola: sara is running 170 secs || 15758155 markings, 126214058 edges, 270 markings/sec, 170 secs
lola: sara is running 175 secs || 15758952 markings, 130924716 edges, 159 markings/sec, 175 secs
lola: sara is running 180 secs || 15759522 markings, 135852027 edges, 114 markings/sec, 180 secs
lola: sara is running 185 secs || 16034125 markings, 139929622 edges, 54921 markings/sec, 185 secs
lola: sara is running 190 secs || 16730164 markings, 142357666 edges, 139208 markings/sec, 190 secs
lola: sara is running 195 secs || 17403667 markings, 144840660 edges, 134701 markings/sec, 195 secs
lola: sara is running 200 secs || 18043994 markings, 147228198 edges, 128065 markings/sec, 200 secs
lola: sara is running 205 secs || 18768579 markings, 149995254 edges, 144917 markings/sec, 205 secs
lola: sara is running 210 secs || 19458059 markings, 152684398 edges, 137896 markings/sec, 210 secs
lola: sara is running 215 secs || 20152959 markings, 155443886 edges, 138980 markings/sec, 215 secs
lola: sara is running 220 secs || 20814094 markings, 158139158 edges, 132227 markings/sec, 220 secs
lola: sara is running 225 secs || 21429648 markings, 160737151 edges, 123111 markings/sec, 225 secs
lola: sara is running 230 secs || 22020608 markings, 163460570 edges, 118192 markings/sec, 230 secs
lola: sara is running 235 secs || 22121609 markings, 167335397 edges, 20200 markings/sec, 235 secs
lola: sara is running 240 secs || 22126245 markings, 171561256 edges, 927 markings/sec, 240 secs
lola: sara is running 245 secs || 22129392 markings, 175968396 edges, 629 markings/sec, 245 secs
lola: sara is running 250 secs || 22131603 markings, 180496916 edges, 442 markings/sec, 250 secs
lola: sara is running 255 secs || 22133477 markings, 185128517 edges, 375 markings/sec, 255 secs
lola: sara is running 260 secs || 22134797 markings, 189842181 edges, 264 markings/sec, 260 secs
lola: sara is running 265 secs || 22135824 markings, 194587333 edges, 205 markings/sec, 265 secs
lola: sara is running 270 secs || 22136608 markings, 199543806 edges, 157 markings/sec, 270 secs
lola: sara is running 275 secs || 22136822 markings, 204801309 edges, 43 markings/sec, 275 secs
lola: sara is running 280 secs || 22876698 markings, 207300545 edges, 147975 markings/sec, 280 secs
lola: sara is running 285 secs || 23591469 markings, 209772247 edges, 142954 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 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t108)))
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 28 bytes per marking, with 27 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 MultiwaySync-PT-none-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file MultiwaySync-PT-none-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 7)

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t358) OR FIREABLE(t471) OR FIREABLE(t98) OR (NOT FIREABLE(t45) AND (FIREABLE(t240) OR FIREABLE(t324))) OR NOT FIREABLE(t53) OR FIREABLE(t229))))
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 28 bytes per marking, with 27 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 68 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to MultiwaySync-PT-none-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t370) AND (FIREABLE(t244) OR FIREABLE(t456)))))
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 28 bytes per marking, with 27 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t416) AND (FIREABLE(t359) OR FIREABLE(t266)) AND (FIREABLE(t225) OR FIREABLE(t240)))))
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 28 bytes per marking, with 27 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 MultiwaySync-PT-none-ReachabilityFireability-6.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 22 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t28) AND (NOT FIREABLE(t400) OR NOT FIREABLE(t214))) OR (NOT FIREABLE(t95) AND (NOT FIREABLE(t11) OR NOT FIREABLE(t140))))))
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 28 bytes per marking, with 27 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 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t468) AND FIREABLE(t342)) OR (FIREABLE(t43) AND FIREABLE(t467)))))
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 28 bytes per marking, with 27 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 MultiwaySync-PT-none-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file MultiwaySync-PT-none-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t303) OR FIREABLE(t114)) AND FIREABLE(t177) AND NOT FIREABLE(t457) AND NOT FIREABLE(t195))))
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 28 bytes per marking, with 27 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 26 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t39) AND ((FIREABLE(t329) AND FIREABLE(t123)) OR NOT FIREABLE(t6)) AND NOT FIREABLE(t442) AND NOT FIREABLE(t87) AND (FIREABLE(t191) OR (FIREABLE(t100) AND FIREABLE(t263))))))
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 28 bytes per marking, with 27 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 60 literals and 8 conjunctive subformulas
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t249) AND FIREABLE(t420) AND FIREABLE(t321) AND FIREABLE(t23) AND (FIREABLE(t364) OR FIREABLE(t249) OR FIREABLE(t208)) AND FIREABLE(t50) AND FIREABLE(t275))))
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 28 bytes per marking, with 27 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 35 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to MultiwaySync-PT-none-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1622 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t375) AND NOT FIREABLE(t170) AND FIREABLE(t107) AND NOT FIREABLE(t220))))
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 28 bytes per marking, with 27 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to MultiwaySync-PT-none-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file MultiwaySync-PT-none-ReachabilityFireability-14.sara.

sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 6)
sara: warning, failure of lp_solve (at job 6)
sara: warning, failure of lp_solve (at job 6)
sara: warning, failure of lp_solve (at job 6)

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: subprocess 15 will run for 3244 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t345) AND NOT FIREABLE(t308)) OR FIREABLE(t239) OR NOT FIREABLE(t467) OR NOT FIREABLE(t463) OR (NOT FIREABLE(t222) AND NOT FIREABLE(t184)))))
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 28 bytes per marking, with 27 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: 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 53 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to MultiwaySync-PT-none-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file MultiwaySync-PT-none-ReachabilityFireability-15.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: RESULT
lola:
SUMMARY: yes yes yes yes unknown yes no yes yes no yes yes yes yes yes yes
FORMULA MultiwaySync-PT-none-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MultiwaySync-PT-none-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496364008261

--------------------
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_MultiwaySync-PT-none"
export BK_EXAMINATION="ReachabilityFireability"
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_MultiwaySync-PT-none.tgz
mv S_MultiwaySync-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_MultiwaySync-PT-none, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-blw7-149441650000225"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;