Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is DES-PT-50a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309200324
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494632155609


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ DES-PT-50a @ 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: 585/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 314 places, 271 transitions, 255 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 296 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-50a-ReachabilityFireability.task
lola: E (F (((FIREABLE(t100) AND FIREABLE(t115)) OR (((FIREABLE(t16) AND FIREABLE(t173)) OR (FIREABLE(t15) AND FIREABLE(t53))) AND NOT FIREABLE(t175))))) : A (G ((FIREABLE(t238) OR (FIREABLE(t31) AND FIREABLE(t258) AND NOT FIREABLE(t232)) OR NOT FIREABLE(t70)))) : E (F ((FIREABLE(t26) AND FIREABLE(t180) AND ((FIREABLE(t75) AND FIREABLE(t207)) OR (FIREABLE(t158) AND FIREABLE(t96)) OR FIREABLE(t89))))) : E (F ((NOT FIREABLE(t22) AND NOT FIREABLE(t97) AND FIREABLE(t197) AND FIREABLE(t82)))) : A (G ((NOT FIREABLE(t215) OR NOT FIREABLE(t114) OR (FIREABLE(t159) AND (FIREABLE(t38) OR FIREABLE(t131))) OR (FIREABLE(t252) AND FIREABLE(t185) AND (FIREABLE(t227) OR FIREABLE(t95) OR FIREABLE(t40)))))) : E (F ((FIREABLE(t181) AND FIREABLE(t90)))) : E (F (FIREABLE(t130))) : A (G (NOT FIREABLE(t49))) : E (F (FIREABLE(t48))) : A (G (((FIREABLE(t6) AND FIREABLE(t46)) OR NOT FIREABLE(t74) OR FIREABLE(t135) OR FIREABLE(t148)))) : A (G ((NOT FIREABLE(t90) OR NOT FIREABLE(t131) OR FIREABLE(t206) OR (FIREABLE(t133) AND (FIREABLE(t126) OR FIREABLE(t130) OR FIREABLE(t247)))))) : A (G (((NOT FIREABLE(t170) AND NOT FIREABLE(t211) AND FIREABLE(t11)) OR NOT FIREABLE(t168)))) : E (F (((NOT FIREABLE(t210) OR NOT FIREABLE(t112) OR FIREABLE(t195)) AND FIREABLE(t58)))) : A (G (((NOT FIREABLE(t53) OR NOT FIREABLE(t217) OR (NOT FIREABLE(t202) AND NOT FIREABLE(t174))) AND ((NOT FIREABLE(t231) AND NOT FIREABLE(t205)) OR (NOT FIREABLE(t142) AND NOT FIREABLE(t84)))))) : E (F (((NOT FIREABLE(t230) OR NOT FIREABLE(t123) OR (NOT FIREABLE(t140) AND NOT FIREABLE(t223))) AND FIREABLE(t34)))) : E (F (FIREABLE(t68)))
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(t100) AND FIREABLE(t115)) OR (((FIREABLE(t16) AND FIREABLE(t173)) OR (FIREABLE(t15) AND FIREABLE(t53))) AND NOT FIREABLE(t175)))))
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 32 bytes per marking, with 1 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 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 609614 markings, 1467539 edges, 121923 markings/sec, 0 secs
lola: sara is running 5 secs || 1207054 markings, 2963144 edges, 119488 markings/sec, 5 secs
lola: sara is running 10 secs || 1773415 markings, 4514285 edges, 113272 markings/sec, 10 secs
lola: sara is running 15 secs || 2383437 markings, 5925853 edges, 122004 markings/sec, 15 secs
lola: sara is running 20 secs || 2954384 markings, 7464143 edges, 114189 markings/sec, 20 secs
lola: sara is running 25 secs || 3545124 markings, 8951859 edges, 118148 markings/sec, 25 secs
lola: sara is running 30 secs || 4167984 markings, 10357235 edges, 124572 markings/sec, 30 secs
lola: sara is running 35 secs || 4732251 markings, 11915857 edges, 112853 markings/sec, 35 secs
lola: sara is running 40 secs || 5308550 markings, 13411831 edges, 115260 markings/sec, 40 secs
lola: sara is running 45 secs || 5922606 markings, 14752281 edges, 122811 markings/sec, 45 secs
lola: sara is running 50 secs || 6477864 markings, 16289026 edges, 111052 markings/sec, 50 secs
lola: sara is running 55 secs || 7019966 markings, 17854631 edges, 108420 markings/sec, 55 secs
lola: sara is running 60 secs || 7589379 markings, 19274679 edges, 113883 markings/sec, 60 secs
lola: sara is running 65 secs || 8156896 markings, 20731035 edges, 113503 markings/sec, 65 secs
lola: sara is running 70 secs || 8728961 markings, 22166062 edges, 114413 markings/sec, 70 secs
lola: sara is running 75 secs || 9282126 markings, 23720344 edges, 110633 markings/sec, 75 secs
lola: sara is running 80 secs || 9813808 markings, 25273274 edges, 106336 markings/sec, 80 secs
lola: sara is running 85 secs || 10324905 markings, 26871882 edges, 102219 markings/sec, 85 secs
lola: sara is running 90 secs || 10863127 markings, 28315451 edges, 107644 markings/sec, 90 secs
lola: sara is running 95 secs || 11394274 markings, 29731960 edges, 106229 markings/sec, 95 secs
lola: sara is running 100 secs || 11923150 markings, 31186677 edges, 105775 markings/sec, 100 secs
lola: sara is running 105 secs || 12460521 markings, 32665801 edges, 107474 markings/sec, 105 secs
lola: sara is running 110 secs || 12969114 markings, 34203740 edges, 101719 markings/sec, 110 secs
lola: sara is running 115 secs || 13473891 markings, 35784652 edges, 100955 markings/sec, 115 secs
lola: sara is running 120 secs || 13952477 markings, 37382345 edges, 95717 markings/sec, 120 secs
lola: sara is running 125 secs || 14466111 markings, 38855615 edges, 102727 markings/sec, 125 secs
lola: sara is running 130 secs || 14992436 markings, 40281959 edges, 105265 markings/sec, 130 secs
lola: sara is running 135 secs || 15495332 markings, 41737042 edges, 100579 markings/sec, 135 secs
lola: sara is running 140 secs || 16012244 markings, 43162440 edges, 103382 markings/sec, 140 secs
lola: sara is running 145 secs || 16520878 markings, 44611762 edges, 101727 markings/sec, 145 secs
lola: sara is running 150 secs || 17018183 markings, 46145167 edges, 99461 markings/sec, 150 secs
lola: sara is running 155 secs || 17480010 markings, 47678404 edges, 92365 markings/sec, 155 secs
lola: sara is running 160 secs || 17967248 markings, 49209749 edges, 97448 markings/sec, 160 secs
lola: sara is running 165 secs || 18450768 markings, 50801279 edges, 96704 markings/sec, 165 secs
lola: sara is running 170 secs || 18931040 markings, 52169587 edges, 96054 markings/sec, 170 secs
lola: sara is running 175 secs || 19437845 markings, 53572276 edges, 101361 markings/sec, 175 secs
lola: sara is running 180 secs || 19928647 markings, 54988121 edges, 98160 markings/sec, 180 secs
lola: sara is running 185 secs || 20431193 markings, 56390479 edges, 100509 markings/sec, 185 secs
lola: sara is running 190 secs || 20934222 markings, 57810165 edges, 100606 markings/sec, 190 secs
lola: sara is running 195 secs || 21423375 markings, 59231926 edges, 97831 markings/sec, 195 secs
lola: sara is running 200 secs || 21925904 markings, 60625941 edges, 100506 markings/sec, 200 secs
lola: sara is running 205 secs || 22406535 markings, 61971228 edges, 96126 markings/sec, 205 secs
lola: sara is running 210 secs || 22856482 markings, 63264739 edges, 89989 markings/sec, 210 secs
lola: sara is running 215 secs || 23321923 markings, 64788821 edges, 93088 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t238) OR (FIREABLE(t31) AND FIREABLE(t258) AND NOT FIREABLE(t232)) OR NOT FIREABLE(t70))))
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 32 bytes per marking, with 1 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 60 literals and 14 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability.sara.
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 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t26) AND FIREABLE(t180) AND ((FIREABLE(t75) AND FIREABLE(t207)) OR (FIREABLE(t158) AND FIREABLE(t96)) OR FIREABLE(t89)))))
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 32 bytes per marking, with 1 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 25 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ...considering subproblem: E (F ((NOT FIREABLE(t22) AND NOT FIREABLE(t97) AND FIREABLE(t197) AND FIREABLE(t82))))========================================

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 32 bytes per marking, with 1 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 18 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t215) OR NOT FIREABLE(t114) OR (FIREABLE(t159) AND (FIREABLE(t38) OR FIREABLE(t131))) OR (FIREABLE(t252) AND FIREABLE(t185) AND (FIREABLE(t227) OR FIREABLE(t95) OR FIREABLE(t40))))))
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 32 bytes per marking, with 1 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 528 literals and 64 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t181) AND FIREABLE(t90))))
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 32 bytes per marking, with 1 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 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t130)))
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 32 bytes per marking, with 1 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 DES-PT-50a-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t49)))
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 32 bytes per marking, with 1 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 DES-PT-50a-ReachabilityFireability-7.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 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t48)))
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 32 bytes per marking, with 1 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 DES-PT-50a-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t6) AND FIREABLE(t46)) OR NOT FIREABLE(t74) OR FIREABLE(t135) OR FIREABLE(t148))))
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 32 bytes per marking, with 1 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 80 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-9.sara.
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 10 will run for 552 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t90) OR NOT FIREABLE(t131) OR FIREABLE(t206) OR (FIREABLE(t133) AND (FIREABLE(t126) OR FIREABLE(t130) OR FIREABLE(t247))))))
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 32 bytes per marking, with 1 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 44 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t170) AND NOT FIREABLE(t211) AND FIREABLE(t11)) OR NOT FIREABLE(t168))))
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 32 bytes per marking, with 1 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 17 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-11.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: subprocess 12 will run for 828 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t210) OR NOT FIREABLE(t112) OR FIREABLE(t195)) AND FIREABLE(t58))))
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 32 bytes per marking, with 1 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 21 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 13 will run for 1105 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t53) OR NOT FIREABLE(t217) OR (NOT FIREABLE(t202) AND NOT FIREABLE(t174))) AND ((NOT FIREABLE(t231) AND NOT FIREABLE(t205)) OR (NOT FIREABLE(t142) AND NOT FIREABLE(t84))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: lola: ========================================
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: state equation: calling and running sara
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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 30 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-13.sara
lola: ========================================
sara: try reading problem file DES-PT-50a-ReachabilityFireability-12.sara.
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
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 14 will run for 1657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t230) OR NOT FIREABLE(t123) OR (NOT FIREABLE(t140) AND NOT FIREABLE(t223))) AND FIREABLE(t34))))
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 32 bytes per marking, with 1 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 40 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50a-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 15 will run for 3314 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t68)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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 DES-PT-50a-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50a-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no yes no yes yes no yes no yes no yes no yes yes
FORMULA DES-PT-50a-ReachabilityFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50a-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494632382107

--------------------
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="DES-PT-50a"
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/DES-PT-50a.tgz
mv DES-PT-50a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is DES-PT-50a, 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 r018-ebro-149436309200324"
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 ;