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 S_Solitaire-PT-FrnCT7x7, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464000090
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496560033299


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


checking for too many tokens
===========================================================================================
S_Solitaire-PT-FrnCT7x7: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_Solitaire-PT-FrnCT7x7 @ 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: 167/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 75 places, 92 transitions, 37 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 93 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(down36) OR NOT FIREABLE(left64) OR (NOT FIREABLE(down36) AND NOT FIREABLE(left35)) OR NOT FIREABLE(down41)))) : A (G ((NOT FIREABLE(down47) OR NOT FIREABLE(up63) OR NOT FIREABLE(up32) OR FIREABLE(up56)))) : A (G (((NOT FIREABLE(right65) AND NOT FIREABLE(left42)) OR NOT FIREABLE(down63) OR NOT FIREABLE(left23) OR NOT FIREABLE(up45) OR NOT FIREABLE(right63)))) : A (G ((NOT FIREABLE(right53) OR NOT FIREABLE(up63) OR FIREABLE(up33) OR (NOT FIREABLE(down42) AND NOT FIREABLE(right34) AND FIREABLE(down33))))) : E (F ((FIREABLE(left64) AND FIREABLE(left63) AND NOT FIREABLE(up43) AND NOT FIREABLE(down56) AND ((FIREABLE(right24) AND FIREABLE(down23) AND (FIREABLE(right45) OR FIREABLE(right63))) OR FIREABLE(up35))))) : E (F ((FIREABLE(down36) AND FIREABLE(down33) AND NOT FIREABLE(down63) AND FIREABLE(left36)))) : E (F ((FIREABLE(right74) AND FIREABLE(right63) AND FIREABLE(left36) AND FIREABLE(left43) AND FIREABLE(down32) AND (FIREABLE(up56) OR FIREABLE(up54) OR (FIREABLE(right34) AND FIREABLE(left25)))))) : E (F ((FIREABLE(right35) AND FIREABLE(right56) AND NOT FIREABLE(down47) AND FIREABLE(left54) AND FIREABLE(up41) AND NOT FIREABLE(right33) AND (FIREABLE(up34) OR FIREABLE(left33)) AND FIREABLE(right65)))) : A (G ((NOT FIREABLE(down25) OR NOT FIREABLE(down44) OR NOT FIREABLE(down64) OR NOT FIREABLE(down24) OR FIREABLE(right65)))) : A (G ((NOT FIREABLE(down36) OR NOT FIREABLE(up42) OR FIREABLE(down63) OR (FIREABLE(right54) AND FIREABLE(left35) AND FIREABLE(down41) AND FIREABLE(up45))))) : E (F ((FIREABLE(left65) AND ((FIREABLE(up25) AND FIREABLE(up23) AND FIREABLE(up54)) OR ((FIREABLE(up36) OR FIREABLE(left23)) AND FIREABLE(down36)))))) : E (F (((FIREABLE(left63) OR FIREABLE(up53)) AND FIREABLE(left65)))) : A (G ((NOT FIREABLE(right24) OR NOT FIREABLE(right44) OR NOT FIREABLE(up42) OR NOT FIREABLE(right23)))) : A (G (((NOT FIREABLE(left44) AND NOT FIREABLE(left53)) OR (NOT FIREABLE(right43) AND NOT FIREABLE(left63)) OR NOT FIREABLE(right52) OR NOT FIREABLE(down43) OR NOT FIREABLE(down64)))) : E (F ((FIREABLE(up64) AND FIREABLE(right43) AND FIREABLE(down24)))) : E (F (FIREABLE(left36)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(down36) OR NOT FIREABLE(left64) OR (NOT FIREABLE(down36) AND NOT FIREABLE(left35)) OR NOT FIREABLE(down41))))
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 148 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 32 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(down47) OR NOT FIREABLE(up63) OR NOT FIREABLE(up32) OR 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 148 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 39 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability.sara
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(right65) AND NOT FIREABLE(left42)) OR NOT FIREABLE(down63) OR NOT FIREABLE(left23) OR NOT FIREABLE(up45) OR NOT FIREABLE(right63))))
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 148 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-FrnCT7x7-ReachabilityFireability-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: ========================================
subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(right53) OR NOT FIREABLE(up63) OR FIREABLE(up33) OR (NOT FIREABLE(down42) AND NOT FIREABLE(right34) AND 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 148 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 168 literals and 15 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(left64) AND FIREABLE(left63) AND NOT FIREABLE(up43) AND NOT FIREABLE(down56) AND ((FIREABLE(right24) AND FIREABLE(down23) AND (FIREABLE(right45) OR FIREABLE(right63))) OR FIREABLE(up35)))))
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 148 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 390 literals and 21 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-4.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(down36) AND FIREABLE(down33) AND NOT FIREABLE(down63) AND FIREABLE(left36))))
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 148 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 39 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-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 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(right74) AND FIREABLE(right63) AND FIREABLE(left36) AND FIREABLE(left43) AND FIREABLE(down32) AND (FIREABLE(up56) OR FIREABLE(up54) OR (FIREABLE(right34) AND FIREABLE(left25))))))
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 148 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 76 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-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: E (F ((FIREABLE(right35) AND FIREABLE(right56) AND NOT FIREABLE(down47) AND FIREABLE(left54) AND FIREABLE(up41) AND NOT FIREABLE(right33) AND (FIREABLE(up34) OR FIREABLE(left33)) AND FIREABLE(right65))))
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 148 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 208 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-7.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 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(down25) OR NOT FIREABLE(down44) OR NOT FIREABLE(down64) OR NOT FIREABLE(down24) OR FIREABLE(right65))))
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 148 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 51 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-8.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 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(down36) OR NOT FIREABLE(up42) OR FIREABLE(down63) OR (FIREABLE(right54) AND FIREABLE(left35) AND FIREABLE(down41) AND FIREABLE(up45)))))
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 148 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: state equation: Generated DNF with 360 literals and 36 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-9.sara
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(left65) AND ((FIREABLE(up25) AND FIREABLE(up23) AND FIREABLE(up54)) OR ((FIREABLE(up36) OR FIREABLE(left23)) AND FIREABLE(down36))))))
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 148 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 3 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-10.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 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(left63) OR FIREABLE(up53)) AND FIREABLE(left65))))
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 148 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 16 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-11.sara
lola: The predicate is reachable.
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=-1)
lola: lola: state equation: calling and running sara
========================================
lola: lola: ...considering subproblem: A (G ((NOT FIREABLE(right24) OR NOT FIREABLE(right44) OR NOT FIREABLE(up42) OR NOT FIREABLE(right23))))
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 148 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 16 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-12.sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-11.sara.
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-12.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: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1178 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(left44) AND NOT FIREABLE(left53)) OR (NOT FIREABLE(right43) AND NOT FIREABLE(left63)) OR NOT FIREABLE(right52) OR NOT FIREABLE(down43) OR NOT FIREABLE(down64))))
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 148 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 80 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-13.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 14 will run for 1767 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(up64) AND FIREABLE(right43) AND FIREABLE(down24))))
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 148 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-14.sara
lola: The predicate is reachable.
lola: subprocess 15 will run for 3534 seconds at most (--localtimelimit=-1)
lola: lola: state equation: calling and running saralola:
========================================
========================================
lola: ...considering subproblem: E (F (FIREABLE(left36)))
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 148 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 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-15.sara
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: no no no no no yes yes yes yes no yes yes yes no yes yes
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-14.sara.
lola: ========================================
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496560039562

--------------------
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_Solitaire-PT-FrnCT7x7"
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_Solitaire-PT-FrnCT7x7.tgz
mv S_Solitaire-PT-FrnCT7x7 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 S_Solitaire-PT-FrnCT7x7, 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 r158-ebro-149443464000090"
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 ;