Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is DLCround-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-csrt-149580962000378
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496545935378


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


checking for too many tokens
===========================================================================================
DLCround-PT-12b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ DLCround-PT-12b @ 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: 12684/65536 symbol table entries, 3783 collisions
lola: preprocessing...
lola: finding significant places
lola: 4848 places, 7836 transitions, 4571 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 11364 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-12b-ReachabilityFireability.task
lola: E (F ((((FIREABLE(t1780) AND FIREABLE(t799) AND FIREABLE(t1994)) OR (FIREABLE(t6113) AND FIREABLE(t569) AND (FIREABLE(t4498) OR FIREABLE(t986)))) AND (FIREABLE(t1671) OR FIREABLE(t2098) OR FIREABLE(t2386) OR (NOT FIREABLE(t4622) AND FIREABLE(t1232)))))) : E (F (FIREABLE(t139))) : E (F ((((FIREABLE(t4999) OR FIREABLE(t7392)) AND NOT FIREABLE(t4795) AND (NOT FIREABLE(t4113) OR NOT FIREABLE(t3769))) OR FIREABLE(t2800)))) : E (F ((FIREABLE(t3169) OR (FIREABLE(t4188) AND FIREABLE(t1798))))) : E (F (FIREABLE(t5323))) : A (G ((NOT FIREABLE(t3433) OR (FIREABLE(t2398) AND FIREABLE(t4749))))) : A (G ((NOT FIREABLE(t436) OR NOT FIREABLE(t5502) OR NOT FIREABLE(t6630) OR NOT FIREABLE(t7510) OR FIREABLE(t5579)))) : E (F (FIREABLE(t4127))) : E (F ((NOT FIREABLE(t7826) AND FIREABLE(t4652)))) : E (F ((NOT FIREABLE(t4916) AND NOT FIREABLE(t3275) AND FIREABLE(t2549) AND FIREABLE(t2846)))) : A (G (((NOT FIREABLE(t3255) OR NOT FIREABLE(t5108) OR (NOT FIREABLE(t7042) AND NOT FIREABLE(t5279))) AND NOT FIREABLE(t6328)))) : E (F ((FIREABLE(t6260) OR (FIREABLE(t5986) AND FIREABLE(t2423) AND (FIREABLE(t2258) OR FIREABLE(t2135)) AND NOT FIREABLE(t3927) AND NOT FIREABLE(t1161))))) : E (F (FIREABLE(t2631))) : A (G (NOT FIREABLE(t1202))) : E (F ((FIREABLE(t7396) AND FIREABLE(t3377) AND NOT FIREABLE(t5898) AND NOT FIREABLE(t2100) AND NOT FIREABLE(t5768)))) : E (F ((FIREABLE(t3245) AND FIREABLE(t4194))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t1780) AND FIREABLE(t799) AND FIREABLE(t1994)) OR (FIREABLE(t6113) AND FIREABLE(t569) AND (FIREABLE(t4498) OR FIREABLE(t986)))) AND (FIREABLE(t1671) OR FIREABLE(t2098) OR FIREABLE(t2386) OR (NOT FIREABLE(t4622) AND FIREABLE(t1232))))))
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 572 bytes per marking, with 5 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 59 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t139)))
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 572 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t4999) OR FIREABLE(t7392)) AND NOT FIREABLE(t4795) AND (NOT FIREABLE(t4113) OR NOT FIREABLE(t3769))) OR FIREABLE(t2800))))
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 572 bytes per marking, with 5 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 33 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3169) OR (FIREABLE(t4188) AND FIREABLE(t1798)))))
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 572 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t5323)))
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 572 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t3433) OR (FIREABLE(t2398) AND FIREABLE(t4749)))))
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 572 bytes per marking, with 5 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t436) OR NOT FIREABLE(t5502) OR NOT FIREABLE(t6630) OR NOT FIREABLE(t7510) OR FIREABLE(t5579))))
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 572 bytes per marking, with 5 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: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityFireability-6.sara.
lola: sara is running 0 secs || 54417 markings, 62002 edges, 10883 markings/sec, 0 secs
lola: sara is running 5 secs || 103793 markings, 118747 edges, 9875 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 156142 markings, 178761 edges, 10470 markings/sec, 10 secs

lola: sara is running 15 secs || 209719 markings, 238874 edges, 10715 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t4127)))
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 572 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 439 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t7826) AND FIREABLE(t4652))))
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 572 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityFireability-8.sara.
lola: sara is running 0 secs || 30055 markings, 35641 edges, 6011 markings/sec, 0 secs
lola: sara is running 5 secs || 60922 markings, 72278 edges, 6173 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 91043 markings, 108065 edges, 6024 markings/sec, 10 secs
lola: sara is running 15 secs || 119757 markings, 143317 edges, 5743 markings/sec, 15 secs
lola: sara is running 20 secs || 148483 markings, 178662 edges, 5745 markings/sec, 20 secs
lola: sara is running 25 secs || 176676 markings, 214021 edges, 5639 markings/sec, 25 secs
lola: sara is running 30 secs || 205358 markings, 250005 edges, 5736 markings/sec, 30 secs
lola: sara is running 35 secs || 234180 markings, 285863 edges, 5764 markings/sec, 35 secs

lola: sara is running 40 secs || 263136 markings, 322340 edges, 5791 markings/sec, 40 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t4916) AND NOT FIREABLE(t3275) AND FIREABLE(t2549) AND FIREABLE(t2846))))
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 572 bytes per marking, with 5 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t3255) OR NOT FIREABLE(t5108) OR (NOT FIREABLE(t7042) AND NOT FIREABLE(t5279))) AND NOT FIREABLE(t6328))))
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 572 bytes per marking, with 5 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: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 694 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t6260) OR (FIREABLE(t5986) AND FIREABLE(t2423) AND (FIREABLE(t2258) OR FIREABLE(t2135)) AND NOT FIREABLE(t3927) AND NOT FIREABLE(t1161)))))
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 572 bytes per marking, with 5 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 14 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 867 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t2631)))
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 572 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1157 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t1202)))
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 572 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1735 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t7396) AND FIREABLE(t3377) AND NOT FIREABLE(t5898) AND NOT FIREABLE(t2100) AND NOT FIREABLE(t5768))))
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 572 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3245) AND FIREABLE(t4194))))
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 572 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no yes yes yes yes no yes yes no yes yes
lola: ========================================
FORMULA DLCround-PT-12b-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496546004835

--------------------
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="DLCround-PT-12b"
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/DLCround-PT-12b.tgz
mv DLCround-PT-12b execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is DLCround-PT-12b, 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 r178-csrt-149580962000378"
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 ;