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

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

=== Now, execution of the tool begins

BK_START 1494931600208


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ Solitaire-PT-FrnNC7x7 @ 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: 166/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 74 places, 92 transitions, 37 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 184 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-FrnNC7x7-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(left74) OR NOT FIREABLE(left36) OR NOT FIREABLE(down47) OR NOT FIREABLE(left32) OR NOT FIREABLE(up44) OR NOT FIREABLE(left64)))) : E (F (((NOT FIREABLE(down35) OR NOT FIREABLE(right25)) AND FIREABLE(left56) AND (FIREABLE(down25) OR FIREABLE(up32))))) : A (G ((NOT FIREABLE(up25) OR NOT FIREABLE(down36) OR NOT FIREABLE(down64) OR NOT FIREABLE(right24)))) : E (F ((FIREABLE(down23) AND FIREABLE(right33) AND (FIREABLE(up34) OR FIREABLE(right54)) AND FIREABLE(up52) AND (FIREABLE(up33) OR FIREABLE(left42))))) : A (G ((NOT FIREABLE(down63) OR FIREABLE(left64) OR NOT FIREABLE(right64)))) : A (G ((FIREABLE(right56) OR FIREABLE(left23) OR NOT FIREABLE(up43)))) : E (F ((FIREABLE(down44) AND NOT FIREABLE(up46) AND FIREABLE(down25) AND FIREABLE(right65)))) : E (F ((FIREABLE(right43) AND FIREABLE(left44) AND FIREABLE(left36) AND NOT FIREABLE(down35) AND (NOT FIREABLE(up23) OR NOT FIREABLE(right14) OR NOT FIREABLE(up55) OR (FIREABLE(left74) AND FIREABLE(down24)))))) : E (F ((FIREABLE(right32) AND FIREABLE(left24) AND FIREABLE(right46) AND (NOT FIREABLE(down64) OR NOT FIREABLE(up63)) AND (NOT FIREABLE(right56) OR NOT FIREABLE(down45)) AND (NOT FIREABLE(right56) OR NOT FIREABLE(up24))))) : E (F ((FIREABLE(left43) AND FIREABLE(left32) AND (FIREABLE(down42) OR FIREABLE(down34) OR FIREABLE(up55))))) : E (F ((FIREABLE(up42) AND (NOT FIREABLE(left25) OR NOT FIREABLE(left52)) AND FIREABLE(right33)))) : A (G ((FIREABLE(up63) OR FIREABLE(left53) OR (NOT FIREABLE(up41) AND FIREABLE(right52)) OR NOT FIREABLE(down24) OR NOT FIREABLE(right25) OR FIREABLE(down54) OR FIREABLE(up55) OR (FIREABLE(left63) AND FIREABLE(left36))))) : A (G ((NOT FIREABLE(left46) OR NOT FIREABLE(right74)))) : E (F ((FIREABLE(left43) AND FIREABLE(up64) AND FIREABLE(down32)))) : E (F ((NOT FIREABLE(down43) OR FIREABLE(right23) OR FIREABLE(up45) OR NOT FIREABLE(up25)))) : E (F (NOT FIREABLE(up32)))
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(left74) OR NOT FIREABLE(left36) OR NOT FIREABLE(down47) OR NOT FIREABLE(left32) OR NOT FIREABLE(up44) OR NOT FIREABLE(left64))))
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 18 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(down35) OR NOT FIREABLE(right25)) AND FIREABLE(left56) AND (FIREABLE(down25) OR FIREABLE(up32)))))
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 70 literals and 10 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability.sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(up25) OR NOT FIREABLE(down36) OR NOT FIREABLE(down64) OR NOT FIREABLE(right24))))
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 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: ========================================
state equation: calling and running sara
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(down23) AND FIREABLE(right33) AND (FIREABLE(up34) OR FIREABLE(right54)) AND FIREABLE(up52) AND (FIREABLE(up33) OR FIREABLE(left42)))))
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 60 literals and 4 conjunctive subformulas
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-2.sara.
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

sara: warning, failure of lp_solve (at job 244)
lola: sara is running 0 secs || 499289 markings, 1881148 edges, 99858 markings/sec, 0 secs
lola: sara is running 5 secs || 947006 markings, 3769606 edges, 89543 markings/sec, 5 secs
lola: sara is running 10 secs || 1375685 markings, 5651253 edges, 85736 markings/sec, 10 secs
lola: sara is running 15 secs || 1797393 markings, 7530367 edges, 84342 markings/sec, 15 secs
lola: sara is running 20 secs || 2197629 markings, 9287422 edges, 80047 markings/sec, 20 secs
lola: sara is running 25 secs || 2583793 markings, 11089389 edges, 77233 markings/sec, 25 secs
lola: sara is running 30 secs || 2955538 markings, 12883480 edges, 74349 markings/sec, 30 secs
lola: sara is running 35 secs || 3308779 markings, 14629629 edges, 70648 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(down63) OR FIREABLE(left64) OR NOT FIREABLE(right64))))
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 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-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 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(right56) OR FIREABLE(left23) OR NOT FIREABLE(up43))))
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 45 literals and 9 conjunctive subformulas
lola: SUBRESULT
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-5.sara
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=-1)
========================================
lola: ========================================
lola: lola: state equation: calling and running sara
...considering subproblem: E (F ((FIREABLE(down44) AND NOT FIREABLE(up46) AND FIREABLE(down25) 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 30 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-5.sara.
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(right43) AND FIREABLE(left44) AND FIREABLE(left36) AND NOT FIREABLE(down35) AND (NOT FIREABLE(up23) OR NOT FIREABLE(right14) OR NOT FIREABLE(up55) OR (FIREABLE(left74) 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)
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-6.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=-1)
state equation: Generated DNF with 230 literals and 20 conjunctive subformulaslola:
========================================lola:
========================================
lola: ...considering subproblem: E (F ((FIREABLE(right32) AND FIREABLE(left24) AND FIREABLE(right46) AND (NOT FIREABLE(down64) OR NOT FIREABLE(up63)) AND (NOT FIREABLE(right56) OR NOT FIREABLE(down45)) AND (NOT FIREABLE(right56) OR NOT FIREABLE(up24)))))
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 2160 literals and 180 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-8.sara
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 126)

lola: sara is running 0 secs || 477528 markings, 1909407 edges, 95506 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 498 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(left43) AND FIREABLE(left32) AND (FIREABLE(down42) OR FIREABLE(down34) OR FIREABLE(up55)))))
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 27 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-9.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 10 will run for 581 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(up42) AND (NOT FIREABLE(left25) OR NOT FIREABLE(left52)) AND FIREABLE(right33))))
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 42 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-10.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 11 will run for 697 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(up63) OR FIREABLE(left53) OR (NOT FIREABLE(up41) AND FIREABLE(right52)) OR NOT FIREABLE(down24) OR NOT FIREABLE(right25) OR FIREABLE(down54) OR FIREABLE(up55) OR (FIREABLE(left63) AND FIREABLE(left36)))))
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 24300 literals and 1944 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 526584 markings, 1905754 edges, 105317 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 870 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(left46) OR NOT FIREABLE(right74))))
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 6 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-12.sara
lola: The predicate is not invariant.
lola: lola: state equation: calling and running sara========================================

lola: subprocess 13 will run for 1160 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(left43) AND FIREABLE(up64) AND FIREABLE(down32))))
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 9 literals and 1 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-FrnNC7x7-ReachabilityFireability-13.sara
lola: ========================================
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-12.sara.
lola: subprocess 14 will run for 1741 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(down43) OR FIREABLE(right23) OR FIREABLE(up45) OR NOT FIREABLE(up25))))
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 8 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-FrnNC7x7-ReachabilityFireability-14.sara
lola: ========================================
lola: subprocess 15 will run for 3482 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(up32)))
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 3 literals and 3 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-FrnNC7x7-ReachabilityFireability-15.sara
lola: RESULT
lola:
SUMMARY: no yes no yes yes no yes yes yes yes no yes no yes yes yes
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494931658599

--------------------
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-FrnNC7x7"
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-FrnNC7x7.tgz
mv Solitaire-PT-FrnNC7x7 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-FrnNC7x7, 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-149441008300099"
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 ;