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 Solitaire-PT-SqrCT5x5, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008300108
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494932238228


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ Solitaire-PT-SqrCT5x5 @ 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: 135/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 51 places, 84 transitions, 26 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 85 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-SqrCT5x5-ReachabilityFireability.task
lola: E (F (((NOT FIREABLE(down44) OR NOT FIREABLE(left44)) AND FIREABLE(right36) AND FIREABLE(right53) AND (FIREABLE(right44) OR FIREABLE(left24) OR FIREABLE(right36))))) : A (G ((NOT FIREABLE(right34) OR NOT FIREABLE(right32) OR NOT FIREABLE(left46) OR NOT FIREABLE(up32) OR (NOT FIREABLE(left54) AND NOT FIREABLE(up24) AND NOT FIREABLE(up56))))) : A (G ((NOT FIREABLE(right24) OR NOT FIREABLE(left45) OR (NOT FIREABLE(left54) AND NOT FIREABLE(down64)) OR (NOT FIREABLE(left46) AND NOT FIREABLE(down33))))) : A (G ((NOT FIREABLE(right63) OR NOT FIREABLE(up23) OR NOT FIREABLE(up34) OR NOT FIREABLE(down65) OR FIREABLE(left25)))) : A (G ((NOT FIREABLE(left52) OR NOT FIREABLE(down53)))) : E (F ((FIREABLE(up32) AND FIREABLE(right56) AND FIREABLE(right34) AND FIREABLE(up65) AND NOT FIREABLE(right24)))) : E (F ((NOT FIREABLE(left53) AND NOT FIREABLE(down65) AND FIREABLE(left24) AND (FIREABLE(up45) OR FIREABLE(up52)) AND (FIREABLE(up32) OR FIREABLE(up54)) AND NOT FIREABLE(right35) AND NOT FIREABLE(right55)))) : A (G ((NOT FIREABLE(left46) OR NOT FIREABLE(left65) OR (FIREABLE(up43) AND FIREABLE(left32) AND (FIREABLE(left63) OR FIREABLE(left56))) OR NOT FIREABLE(up65)))) : A (G ((NOT FIREABLE(left35) OR NOT FIREABLE(up56)))) : A (G ((NOT FIREABLE(up42) OR NOT FIREABLE(right32) OR NOT FIREABLE(left64) OR NOT FIREABLE(down36)))) : E (F ((FIREABLE(down56) AND FIREABLE(left43) AND FIREABLE(up54)))) : E (F ((FIREABLE(right24) AND FIREABLE(left63) AND (FIREABLE(up42) OR FIREABLE(left33)) AND FIREABLE(up53) AND FIREABLE(right52)))) : E (F ((((FIREABLE(left34) AND FIREABLE(left23)) OR (FIREABLE(left25) AND FIREABLE(down36))) AND FIREABLE(right24) AND FIREABLE(down52) AND FIREABLE(left63)))) : E (F ((FIREABLE(down33) OR FIREABLE(down32) OR FIREABLE(down53)))) : A (G (((FIREABLE(right46) AND NOT FIREABLE(left52)) OR (FIREABLE(up63) AND (FIREABLE(down65) OR FIREABLE(down35))) OR (FIREABLE(down56) AND (NOT FIREABLE(down43) OR FIREABLE(up23)))))) : A (G (((FIREABLE(left53) AND FIREABLE(up44) AND NOT FIREABLE(right64) AND FIREABLE(right54) AND FIREABLE(left44) AND NOT FIREABLE(down25)) OR NOT FIREABLE(right46))))
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 (((NOT FIREABLE(down44) OR NOT FIREABLE(left44)) AND FIREABLE(right36) AND FIREABLE(right53) AND (FIREABLE(right44) OR FIREABLE(left24) OR FIREABLE(right36)))))
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 104 bytes per marking, with 0 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 151 literals and 13 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to Solitaire-PT-SqrCT5x5-ReachabilityFireability.sara
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(right34) OR NOT FIREABLE(right32) OR NOT FIREABLE(left46) OR NOT FIREABLE(up32) OR (NOT FIREABLE(left54) AND NOT FIREABLE(up24) AND NOT FIREABLE(up56)))))
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 104 bytes per marking, with 0 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 53 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrCT5x5-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrCT5x5-ReachabilityFireability.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(right24) OR NOT FIREABLE(left45) OR (NOT FIREABLE(left54) AND NOT FIREABLE(down64)) OR (NOT FIREABLE(left46) AND NOT FIREABLE(down33)))))
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 104 bytes per marking, with 0 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 4 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrCT5x5-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrCT5x5-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
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 ((NOT FIREABLE(right63) OR NOT FIREABLE(up23) OR NOT FIREABLE(up34) OR NOT FIREABLE(down65) OR FIREABLE(left25))))
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 104 bytes per marking, with 0 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 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrCT5x5-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrCT5x5-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
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 ((NOT FIREABLE(left52) OR NOT FIREABLE(down53))))
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 104 bytes per marking, with 0 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 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrCT5x5-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrCT5x5-ReachabilityFireability-4.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(up32) AND FIREABLE(right56) AND FIREABLE(right34) AND FIREABLE(up65) AND NOT FIREABLE(right24))))
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 104 bytes per marking, with 0 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 45 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrCT5x5-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrCT5x5-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(left53) AND NOT FIREABLE(down65) AND FIREABLE(left24) AND (FIREABLE(up45) OR FIREABLE(up52)) AND (FIREABLE(up32) OR FIREABLE(up54)) AND NOT FIREABLE(right35) AND NOT FIREABLE(right55))))
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 104 bytes per marking, with 0 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 1728 literals and 108 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrCT5x5-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrCT5x5-ReachabilityFireability-6.sara.
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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(left46) OR NOT FIREABLE(left65) OR (FIREABLE(up43) AND FIREABLE(left32) AND (FIREABLE(left63) OR FIREABLE(left56))) OR NOT FIREABLE(up65))))
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 104 bytes per marking, with 0 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 91 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to Solitaire-PT-SqrCT5x5-ReachabilityFireability-7.sara
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(left35) OR NOT FIREABLE(up56))))
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 104 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: ========================================
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 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to Solitaire-PT-SqrCT5x5-ReachabilityFireability-8.sara
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: state equation: calling and running sara
========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(up42) OR NOT FIREABLE(right32) OR NOT FIREABLE(left64) OR NOT FIREABLE(down36))))
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 104 bytes per marking, with 0 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 15 literals and 1 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 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: sara: try reading problem file Solitaire-PT-SqrCT5x5-ReachabilityFireability-8.sara.
...considering subproblem: E (F ((FIREABLE(down56) AND FIREABLE(left43) AND FIREABLE(up54))))
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 104 bytes per marking, with 0 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 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrCT5x5-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrCT5x5-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(right24) AND FIREABLE(left63) AND (FIREABLE(up42) OR FIREABLE(left33)) AND FIREABLE(up53) AND FIREABLE(right52))))
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 104 bytes per marking, with 0 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 38 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrCT5x5-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrCT5x5-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(left34) AND FIREABLE(left23)) OR (FIREABLE(left25) AND FIREABLE(down36))) AND FIREABLE(right24) AND FIREABLE(down52) AND FIREABLE(left63))))
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 104 bytes per marking, with 0 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 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrCT5x5-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrCT5x5-ReachabilityFireability-12.sara.
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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(down33) OR FIREABLE(down32) OR FIREABLE(down53))))
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 104 bytes per marking, with 0 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 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Solitaire-PT-SqrCT5x5-ReachabilityFireability-13.sara
lola: The predicate is reachable.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(right46) AND NOT FIREABLE(left52)) OR (FIREABLE(up63) AND (FIREABLE(down65) OR FIREABLE(down35))) OR (FIREABLE(down56) AND (NOT FIREABLE(down43) OR FIREABLE(up23))))))
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 104 bytes per marking, with 0 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(left53) AND FIREABLE(up44) AND NOT FIREABLE(right64) AND FIREABLE(right54) AND FIREABLE(left44) AND NOT FIREABLE(down25)) OR NOT FIREABLE(right46))))
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 104 bytes per marking, with 0 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: ========================================
lola: state equation: Generated DNF with 57 literals and 13 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes no yes no no no no no yes yes no no
sara: try reading problem file Solitaire-PT-SqrCT5x5-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic

FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrCT5x5-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494932239484

--------------------
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="Solitaire-PT-SqrCT5x5"
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/Solitaire-PT-SqrCT5x5.tgz
mv Solitaire-PT-SqrCT5x5 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 Solitaire-PT-SqrCT5x5, 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 r078-ebro-149441008300108"
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 ;