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 Diffusion2D-PT-D05N010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309200358
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494635417365


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ Diffusion2D-PT-D05N010 @ 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: 169/65536 symbol table entries, 4 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 144 transitions, 24 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D05N010-ReachabilityCardinality.task
lola: A (G ((1 <= cAMP__3_3_))) : A (G (((cAMP__1_4_ <= 2) OR (cAMP__4_1_ <= 2) OR ((cAMP__5_3_ + 1 <= cAMP__1_1_) AND (cAMP__4_4_ <= 2))))) : E (F (((cAMP__3_3_ <= 2) AND (cAMP__1_1_ <= 2) AND (cAMP__3_1_ + 1 <= cAMP__5_5_)))) : E (F (((cAMP__3_2_ <= cAMP__3_5_) AND (cAMP__1_1_ <= cAMP__3_4_) AND (3 <= cAMP__4_1_) AND (cAMP__2_1_ <= cAMP__3_5_)))) : A (G (((cAMP__3_1_ <= cAMP__1_2_) OR (2 <= cAMP__3_3_)))) : E (F (((3 <= cAMP__3_2_) AND (1 <= cAMP__2_4_) AND (3 <= cAMP__2_5_) AND (2 <= cAMP__5_4_)))) : E (F (((cAMP__1_1_ <= cAMP__1_5_) AND (cAMP__1_3_ <= cAMP__1_5_) AND (3 <= cAMP__5_2_) AND (cAMP__3_4_ <= cAMP__3_2_) AND (2 <= cAMP__3_4_) AND ((cAMP__3_5_ <= cAMP__4_5_) OR (3 <= cAMP__1_4_))))) : A (G (((1 <= cAMP__5_1_) OR (cAMP__4_3_ <= cAMP__3_1_) OR (cAMP__5_3_ <= 1) OR ((cAMP__4_2_ <= cAMP__3_2_) AND (2 <= cAMP__4_4_) AND (1 <= cAMP__5_5_))))) : E (F ((((cAMP__3_2_ <= cAMP__4_5_) OR (cAMP__3_4_ <= cAMP__2_5_)) AND ((1 <= cAMP__4_3_) OR (cAMP__4_5_ <= cAMP__5_2_)) AND (((2 <= cAMP__5_1_) AND (3 <= cAMP__5_3_)) OR ((cAMP__4_5_ <= cAMP__4_3_) AND (3 <= cAMP__2_5_)))))) : A (G (((cAMP__4_3_ <= 2) OR (cAMP__4_1_ + 1 <= cAMP__3_3_) OR (cAMP__2_5_ <= cAMP__2_3_)))) : A (G ((((cAMP__2_4_ <= cAMP__1_5_) AND (cAMP__4_1_ <= cAMP__1_2_)) OR (cAMP__1_4_ <= 0) OR ((cAMP__3_4_ <= cAMP__2_1_) AND (cAMP__4_4_ <= cAMP__1_1_)) OR ((1 <= cAMP__5_1_) AND (1 <= cAMP__1_1_))))) : E (F (((2 <= cAMP__4_1_) AND (3 <= cAMP__2_2_)))) : E (F (((cAMP__1_5_ <= cAMP__3_3_) AND (((cAMP__2_4_ <= cAMP__1_1_) AND (3 <= cAMP__1_2_)) OR (3 <= cAMP__1_3_))))) : E (F (((cAMP__5_4_ <= cAMP__1_1_) AND (cAMP__2_5_ <= cAMP__1_2_) AND (3 <= cAMP__3_4_) AND (1 <= cAMP__1_5_) AND ((cAMP__2_1_ <= 2) OR (cAMP__1_4_ <= 1))))) : A (G (((cAMP__4_4_ <= cAMP__5_4_) OR (2 <= cAMP__3_3_) OR (cAMP__2_2_ <= cAMP__1_5_)))) : A (G ((cAMP__1_3_ <= 1)))
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 ((1 <= cAMP__3_3_)))
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 96 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N010-ReachabilityCardinality.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 (((cAMP__1_4_ <= 2) OR (cAMP__4_1_ <= 2) OR ((cAMP__5_3_ + 1 <= cAMP__1_1_) AND (cAMP__4_4_ <= 2)))))
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 96 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 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N010-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__3_3_ <= 2) AND (cAMP__1_1_ <= 2) AND (cAMP__3_1_ + 1 <= cAMP__5_5_))))
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 96 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 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N010-ReachabilityCardinality-2.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 (((cAMP__3_2_ <= cAMP__3_5_) AND (cAMP__1_1_ <= cAMP__3_4_) AND (3 <= cAMP__4_1_) AND (cAMP__2_1_ <= cAMP__3_5_))))
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 96 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: state equation: write sara problem file to Diffusion2D-PT-D05N010-ReachabilityCardinality-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: A (G (((cAMP__3_1_ <= cAMP__1_2_) OR (2 <= cAMP__3_3_))))
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 96 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N010-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: lola: produced by: state space
state equation: calling and running sara
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__3_2_) AND (1 <= cAMP__2_4_) AND (3 <= cAMP__2_5_) AND (2 <= cAMP__5_4_))))
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 96 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: state equation: write sara problem file to Diffusion2D-PT-D05N010-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: calling and running sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__1_1_ <= cAMP__1_5_) AND (cAMP__1_3_ <= cAMP__1_5_) AND (3 <= cAMP__5_2_) AND (cAMP__3_4_ <= cAMP__3_2_) AND (2 <= cAMP__3_4_) AND ((cAMP__3_5_ <= cAMP__4_5_) OR (3 <= cAMP__1_4_)))))
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 96 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
sara: try reading problem file Diffusion2D-PT-D05N010-ReachabilityCardinality-4.sara.
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= cAMP__5_1_) OR (cAMP__4_3_ <= cAMP__3_1_) OR (cAMP__5_3_ <= 1) OR ((cAMP__4_2_ <= cAMP__3_2_) AND (2 <= cAMP__4_4_) AND (1 <= cAMP__5_5_)))))
lola: ========================================
lola: SUBTASK
sara: lola: try reading problem file Diffusion2D-PT-D05N010-ReachabilityCardinality-5.sara.
checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N010-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__3_2_ <= cAMP__4_5_) OR (cAMP__3_4_ <= cAMP__2_5_)) AND ((1 <= cAMP__4_3_) OR (cAMP__4_5_ <= cAMP__5_2_)) AND (((2 <= cAMP__5_1_) AND (3 <= cAMP__5_3_)) OR ((cAMP__4_5_ <= cAMP__4_3_) AND (3 <= cAMP__2_5_))))))
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 96 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 8 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N010-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__4_3_ <= 2) OR (cAMP__4_1_ + 1 <= cAMP__3_3_) OR (cAMP__2_5_ <= cAMP__2_3_))))
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 96 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 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N010-ReachabilityCardinality-9.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 Diffusion2D-PT-D05N010-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((cAMP__2_4_ <= cAMP__1_5_) AND (cAMP__4_1_ <= cAMP__1_2_)) OR (cAMP__1_4_ <= 0) OR ((cAMP__3_4_ <= cAMP__2_1_) AND (cAMP__4_4_ <= cAMP__1_1_)) OR ((1 <= cAMP__5_1_) AND (1 <= cAMP__1_1_)))))
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 96 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 8 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N010-ReachabilityCardinality-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 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__4_1_) AND (3 <= cAMP__2_2_))))
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 96 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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__1_5_ <= cAMP__3_3_) AND (((cAMP__2_4_ <= cAMP__1_1_) AND (3 <= cAMP__1_2_)) OR (3 <= cAMP__1_3_)))))
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 96 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 5 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.

lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)

lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__5_4_ <= cAMP__1_1_) AND (cAMP__2_5_ <= cAMP__1_2_) AND (3 <= cAMP__3_4_) AND (1 <= cAMP__1_5_) AND ((cAMP__2_1_ <= 2) OR (cAMP__1_4_ <= 1)))))
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 96 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 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__4_4_ <= cAMP__5_4_) OR (2 <= cAMP__3_3_) OR (cAMP__2_2_ <= cAMP__1_5_))))
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 96 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 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to Diffusion2D-PT-D05N010-ReachabilityCardinality-14.sara
lola: lola: ========================================
subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__1_3_ <= 1)))
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 96 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 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: state equation: write sara problem file to Diffusion2D-PT-D05N010-ReachabilityCardinality-15.sara
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: calling and running sara
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes no yes yes no yes no no yes yes yes no no
sara: try reading problem file Diffusion2D-PT-D05N010-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

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

BK_STOP 1494635417633

--------------------
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="Diffusion2D-PT-D05N010"
export BK_EXAMINATION="ReachabilityCardinality"
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/Diffusion2D-PT-D05N010.tgz
mv Diffusion2D-PT-D05N010 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 Diffusion2D-PT-D05N010, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r018-ebro-149436309200358"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;