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)
................
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 55K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Diffusion2D-PT-D05N150, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936800140
=====================================================================

--------------------
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-D05N150-ReachabilityFireability-00
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-01
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-02
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-03
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-04
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-05
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-06
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-07
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-08
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-09
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-10
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-11
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-12
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-13
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-14
FORMULA_NAME Diffusion2D-PT-D05N150-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1526642200927

info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D05N150 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D05N150 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Diffusion2D-PT-D05N150 @ 3569 seconds
lola: LoLA will run for 3569 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: Size of bit vector: 800
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-D05N150-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(t1_3_3_4_2) AND NOT FIREABLE(t1_4_3_3_2) AND FIREABLE(t1_1_2_2_3) AND FIREABLE(t1_5_4_5_3) AND FIREABLE(t1_3_2_2_2)))) : A (G ((FIREABLE(t1_1_4_1_3) OR FIREABLE(t1_4_4_3_4) OR FIREABLE(t1_4_5_5_5) OR NOT FIREABLE(t1_5_3_4_2) OR NOT FIREABLE(t1_4_3_4_4) OR (NOT FIREABLE(t1_1_5_2_4) AND NOT FIREABLE(t1_3_1_2_1)) OR FIREABLE(t1_3_3_4_2)))) : E (F ((FIREABLE(t1_5_4_4_3) AND FIREABLE(t1_2_2_1_1) AND NOT FIREABLE(t1_2_3_3_3) AND (FIREABLE(t1_2_3_2_4) OR FIREABLE(t1_5_4_5_3) OR FIREABLE(t1_1_4_1_5)) AND FIREABLE(t1_3_4_4_5) AND FIREABLE(t1_3_4_4_4) AND (FIREABLE(t1_2_3_2_4) OR FIREABLE(t1_1_5_2_5)) AND NOT FIREABLE(t1_1_4_2_5)))) : A (G ((NOT FIREABLE(t1_1_1_1_2) OR NOT FIREABLE(t1_3_2_4_2) OR FIREABLE(t1_4_2_5_2) OR FIREABLE(t1_3_4_3_5) OR (FIREABLE(t1_2_2_1_3) AND FIREABLE(t1_2_3_3_4)) OR FIREABLE(t1_3_3_4_4) OR FIREABLE(t1_1_3_1_4)))) : E (F ((FIREABLE(t1_4_2_3_1) AND FIREABLE(t1_2_1_3_1) AND FIREABLE(t1_5_2_5_3) AND FIREABLE(t1_2_2_1_3) AND FIREABLE(t1_2_5_3_4) AND FIREABLE(t1_1_1_1_2) AND FIREABLE(t1_1_5_2_5)))) : A (G ((FIREABLE(t1_3_4_4_5) OR NOT FIREABLE(t1_4_5_5_5) OR (NOT FIREABLE(t1_4_3_5_4) AND (FIREABLE(t1_2_4_3_4) OR FIREABLE(t1_3_2_4_3))) OR FIREABLE(t1_5_3_5_4) OR (FIREABLE(t1_3_4_4_3) AND FIREABLE(t1_2_4_3_3)) OR NOT FIREABLE(t1_1_5_1_4) OR NOT FIREABLE(t1_2_2_1_1)))) : A (G ((NOT FIREABLE(t1_3_1_2_2) OR NOT FIREABLE(t1_2_4_1_3) OR NOT FIREABLE(t1_3_4_2_4) OR NOT FIREABLE(t1_2_1_1_2) OR FIREABLE(t1_5_4_4_4) OR NOT FIREABLE(t1_3_2_3_3)))) : E (F ((FIREABLE(t1_2_4_1_4) AND FIREABLE(t1_4_3_4_2) AND FIREABLE(t1_4_5_5_5) AND NOT FIREABLE(t1_1_2_2_1) AND FIREABLE(t1_5_2_4_1)))) : A (G (((NOT FIREABLE(t1_4_4_4_5) AND FIREABLE(t1_1_2_2_2)) OR NOT FIREABLE(t1_1_4_1_3) OR (FIREABLE(t1_3_3_3_4) AND (NOT FIREABLE(t1_4_3_5_4) OR NOT FIREABLE(t1_5_4_4_3)))))) : A (G ((FIREABLE(t1_3_3_4_3) AND (NOT FIREABLE(t1_5_4_4_3) OR NOT FIREABLE(t1_1_3_2_2) OR NOT FIREABLE(t1_2_2_3_1))))) : A (G (FIREABLE(t1_3_3_2_4))) : E (F ((FIREABLE(t1_4_5_3_4) AND FIREABLE(t1_2_2_1_1) AND ((FIREABLE(t1_4_2_5_3) AND FIREABLE(t1_5_3_5_4)) OR FIREABLE(t1_2_1_3_2) OR FIREABLE(t1_5_4_4_4))))) : A (G (((NOT FIREABLE(t1_2_4_2_3) AND NOT FIREABLE(t1_4_3_5_2)) OR FIREABLE(t1_4_1_5_1) OR NOT FIREABLE(t1_4_1_5_2) OR NOT FIREABLE(t1_4_4_3_3) OR NOT FIREABLE(t1_1_2_2_1)))) : E (F ((FIREABLE(t1_4_4_5_5) AND FIREABLE(t1_2_1_3_1) AND FIREABLE(t1_4_4_4_5) AND FIREABLE(t1_3_4_2_4) AND FIREABLE(t1_1_1_2_2) AND FIREABLE(t1_5_3_5_2) AND (FIREABLE(t1_4_2_3_2) OR FIREABLE(t1_5_4_5_3))))) : E (F ((FIREABLE(t1_2_2_3_3) AND (FIREABLE(t1_5_2_4_3) OR FIREABLE(t1_1_3_2_3)) AND NOT FIREABLE(t1_3_3_2_3) AND FIREABLE(t1_3_4_4_4) AND (FIREABLE(t1_4_1_5_1) OR FIREABLE(t1_3_4_2_3)) AND NOT FIREABLE(t1_1_3_2_3)))) : E (F ((FIREABLE(t1_2_1_3_2) AND FIREABLE(t1_2_5_2_4) AND NOT FIREABLE(t1_2_2_2_3) AND NOT FIREABLE(t1_4_2_5_1) AND FIREABLE(t1_4_2_3_3) AND FIREABLE(t1_2_1_3_2))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t1_3_3_2_4)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(t1_3_3_2_4)))
lola: processed formula length: 28
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(t1_3_3_2_4)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N150-ReachabilityFireability-0.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: 151 markings, 150 edges
lola: ========================================

FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1_3_3_4_3) AND (NOT FIREABLE(t1_5_4_4_3) OR NOT FIREABLE(t1_1_3_2_2) OR NOT FIREABLE(t1_2_2_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(t1_3_3_4_3) AND (NOT FIREABLE(t1_5_4_4_3) OR NOT FIREABLE(t1_1_3_2_2) OR NOT FIREABLE(t1_2_2_3_1)))))
lola: processed formula length: 119
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 151 markings, 150 edges
lola:
FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1_3_3_4_2) AND NOT FIREABLE(t1_4_3_3_2) AND FIREABLE(t1_1_2_2_3) AND FIREABLE(t1_5_4_5_3) AND FIREABLE(t1_3_2_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t1_3_3_4_2) AND NOT FIREABLE(t1_4_3_3_2) AND FIREABLE(t1_1_2_2_3) AND FIREABLE(t1_5_4_5_3) AND FIREABLE(t1_3_2_2_2))))
lola: processed formula length: 138
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(t1_3_3_4_2) AND NOT FIREABLE(t1_4_3_3_2) AND FIREABLE(t1_1_2_2_3) AND FIREABLE(t1_5_4_5_3) AND FIREABLE(t1_3_2_2_2))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 159 markings, 159 edges

FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
rewrite Frontend/Parser/formula_rewrite.k:631lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_2_4_1_4) AND FIREABLE(t1_4_3_4_2) AND FIREABLE(t1_4_5_5_5) AND NOT FIREABLE(t1_1_2_2_1) AND FIREABLE(t1_5_2_4_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t1_2_4_1_4) AND FIREABLE(t1_4_3_4_2) AND FIREABLE(t1_4_5_5_5) AND NOT FIREABLE(t1_1_2_2_1) AND FIREABLE(t1_5_2_4_1))))
lola: processed formula length: 134
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t1_2_4_1_4) AND FIREABLE(t1_4_3_4_2) AND FIREABLE(t1_4_5_5_5) AND NOT FIREABLE(t1_1_2_2_1) AND FIREABLE(t1_5_2_4_1))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas

lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: lola: state equation: write sara problem file to Diffusion2D-PT-D05N150-ReachabilityFireability-3-0.sara
formula 0: (NOT FIREABLE(t1_3_3_4_3) OR (FIREABLE(t1_5_4_4_3) AND FIREABLE(t1_1_3_2_2) AND FIREABLE(t1_2_2_3_1)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N150-ReachabilityFireability-0.saralola: state equation: calling and running sara

lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 8 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_2_1_3_2) AND FIREABLE(t1_2_5_2_4) AND NOT FIREABLE(t1_2_2_2_3) AND NOT FIREABLE(t1_4_2_5_1) AND FIREABLE(t1_4_2_3_3) AND FIREABLE(t1_2_1_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t1_2_1_3_2) AND FIREABLE(t1_2_5_2_4) AND NOT FIREABLE(t1_2_2_2_3) AND NOT FIREABLE(t1_4_2_5_1) AND FIREABLE(t1_4_2_3_3) AND FIREABLE(t1_2_1_3_2))))
lola: processed formula length: 163
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t1_2_1_3_2) AND FIREABLE(t1_2_5_2_4) AND NOT FIREABLE(t1_2_2_2_3) AND NOT FIREABLE(t1_4_2_5_1) AND FIREABLE(t1_4_2_3_3) AND FIREABLE(t1_2_1_3_2))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1_4_4_4_5) AND FIREABLE(t1_1_2_2_2)) OR NOT FIREABLE(t1_1_4_1_3) OR (FIREABLE(t1_3_3_3_4) AND (NOT FIREABLE(t1_4_3_5_4) OR NOT FIREABLE(t1_5_4_4_3))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((NOT FIREABLE(t1_4_4_4_5) AND FIREABLE(t1_1_2_2_2)) OR NOT FIREABLE(t1_1_4_1_3) OR (FIREABLE(t1_3_3_3_4) AND (NOT FIREABLE(t1_4_3_5_4) OR NOT FIREABLE(t1_5_4_4_3))))))
lola: processed formula length: 177
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((FIREABLE(t1_4_4_4_5) OR NOT FIREABLE(t1_1_2_2_2)) AND FIREABLE(t1_1_4_1_3) AND (NOT FIREABLE(t1_3_3_3_4) OR (FIREABLE(t1_4_3_5_4) AND FIREABLE(t1_5_4_4_3))))
lola: state equation: Generated DNF with 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N150-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D05N150-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 152 markings, 151 edges

FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_4_5_3_4) AND FIREABLE(t1_2_2_1_1) AND ((FIREABLE(t1_4_2_5_3) AND FIREABLE(t1_5_3_5_4)) OR FIREABLE(t1_2_1_3_2) OR FIREABLE(t1_5_4_4_4)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t1_4_5_3_4) AND FIREABLE(t1_2_2_1_1) AND ((FIREABLE(t1_4_2_5_3) AND FIREABLE(t1_5_3_5_4)) OR FIREABLE(t1_2_1_3_2) OR FIREABLE(t1_5_4_4_4)))))
lola: processed formula length: 159
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t1_4_5_3_4) AND FIREABLE(t1_2_2_1_1) AND ((FIREABLE(t1_4_2_5_3) AND FIREABLE(t1_5_3_5_4)) OR FIREABLE(t1_2_1_3_2) OR FIREABLE(t1_5_4_4_4)))
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N150-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D05N150-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 7 edges

FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================

lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1_2_4_2_3) AND NOT FIREABLE(t1_4_3_5_2)) OR FIREABLE(t1_4_1_5_1) OR NOT FIREABLE(t1_4_1_5_2) OR NOT FIREABLE(t1_4_4_3_3) OR NOT FIREABLE(t1_1_2_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((NOT FIREABLE(t1_2_4_2_3) AND NOT FIREABLE(t1_4_3_5_2)) OR FIREABLE(t1_4_1_5_1) OR NOT FIREABLE(t1_4_1_5_2) OR NOT FIREABLE(t1_4_4_3_3) OR NOT FIREABLE(t1_1_2_2_1))))
lola: processed formula length: 177
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((FIREABLE(t1_2_4_2_3) OR FIREABLE(t1_4_3_5_2)) AND NOT FIREABLE(t1_4_1_5_1) AND FIREABLE(t1_4_1_5_2) AND FIREABLE(t1_4_4_3_3) AND FIREABLE(t1_1_2_2_1))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_3_1_2_2) OR NOT FIREABLE(t1_2_4_1_3) OR NOT FIREABLE(t1_3_4_2_4) OR NOT FIREABLE(t1_2_1_1_2) OR FIREABLE(t1_5_4_4_4) OR NOT FIREABLE(t1_3_2_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(t1_3_1_2_2) OR NOT FIREABLE(t1_2_4_1_3) OR NOT FIREABLE(t1_3_4_2_4) OR NOT FIREABLE(t1_2_1_1_2) OR FIREABLE(t1_5_4_4_4) OR NOT FIREABLE(t1_3_2_3_3))))
lola: processed formula length: 175
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(t1_3_1_2_2) AND FIREABLE(t1_2_4_1_3) AND FIREABLE(t1_3_4_2_4) AND FIREABLE(t1_2_1_1_2) AND NOT FIREABLE(t1_5_4_4_4) AND FIREABLE(t1_3_2_3_3))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N150-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola:
FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_2_2_3_3) AND (FIREABLE(t1_5_2_4_3) OR FIREABLE(t1_1_3_2_3)) AND NOT FIREABLE(t1_3_3_2_3) AND FIREABLE(t1_3_4_4_4) AND (FIREABLE(t1_4_1_5_1) OR FIREABLE(t1_3_4_2_3)) AND NOT FIREABLE(t1_1_3_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t1_2_2_3_3) AND (FIREABLE(t1_5_2_4_3) OR FIREABLE(t1_1_3_2_3)) AND NOT FIREABLE(t1_3_3_2_3) AND FIREABLE(t1_3_4_4_4) AND (FIREABLE(t1_4_1_5_1) OR FIREABLE(t1_3_4_2_3)) AND NOT FIREABLE(t1_1_3_2_3))))
lola: processed formula length: 217
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t1_2_2_3_3) AND (FIREABLE(t1_5_2_4_3) OR FIREABLE(t1_1_3_2_3)) AND NOT FIREABLE(t1_3_3_2_3) AND FIREABLE(t1_3_4_4_4) AND (FIREABLE(t1_4_1_5_1) OR FIREABLE(t1_3_4_2_3)) AND NOT FIREABLE(t1_1_3_2_3))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N150-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 152 markings, 151 edges
lola: ========================================

FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_4_2_3_1) AND FIREABLE(t1_2_1_3_1) AND FIREABLE(t1_5_2_5_3) AND FIREABLE(t1_2_2_1_3) AND FIREABLE(t1_2_5_3_4) AND FIREABLE(t1_1_1_1_2) AND FIREABLE(t1_1_5_2_5))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t1_4_2_3_1) AND FIREABLE(t1_2_1_3_1) AND FIREABLE(t1_5_2_5_3) AND FIREABLE(t1_2_2_1_3) AND FIREABLE(t1_2_5_3_4) AND FIREABLE(t1_1_1_1_2) AND FIREABLE(t1_1_5_2_5))))
lola: processed formula length: 180
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t1_4_2_3_1) AND FIREABLE(t1_2_1_3_1) AND FIREABLE(t1_5_2_5_3) AND FIREABLE(t1_2_2_1_3) AND FIREABLE(t1_2_5_3_4) AND FIREABLE(t1_1_1_1_2) AND FIREABLE(t1_1_5_2_5))
lola: state equation: Generated DNF with 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N150-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 23 edges

FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_4_4_5_5) AND FIREABLE(t1_2_1_3_1) AND FIREABLE(t1_4_4_4_5) AND FIREABLE(t1_3_4_2_4) AND FIREABLE(t1_1_1_2_2) AND FIREABLE(t1_5_3_5_2) AND (FIREABLE(t1_4_2_3_2) OR FIREABLE(t1_5_4_5_3)))))
lola: sara: try reading problem file Diffusion2D-PT-D05N150-ReachabilityFireability-10-0.sara.
========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t1_4_4_5_5) AND FIREABLE(t1_2_1_3_1) AND FIREABLE(t1_4_4_4_5) AND FIREABLE(t1_3_4_2_4) AND FIREABLE(t1_1_1_2_2) AND FIREABLE(t1_5_3_5_2) AND (FIREABLE(t1_4_2_3_2) OR FIREABLE(t1_5_4_5_3)))))
lola: processed formula length: 207
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t1_4_4_5_5) AND FIREABLE(t1_2_1_3_1) AND FIREABLE(t1_4_4_4_5) AND FIREABLE(t1_3_4_2_4) AND FIREABLE(t1_1_1_2_2) AND FIREABLE(t1_5_3_5_2) AND (FIREABLE(t1_4_2_3_2) OR FIREABLE(t1_5_4_5_3)))
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 16 edges
lola: state equation: write sara problem file to Diffusion2D-PT-D05N150-ReachabilityFireability-11-0.sara
lola: ========================================

FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1_1_4_1_3) OR FIREABLE(t1_4_4_3_4) OR FIREABLE(t1_4_5_5_5) OR NOT FIREABLE(t1_5_3_4_2) OR NOT FIREABLE(t1_4_3_4_4) OR (NOT FIREABLE(t1_1_5_2_4) AND NOT FIREABLE(t1_3_1_2_1)) OR FIREABLE(t1_3_3_4_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(t1_1_4_1_3) OR FIREABLE(t1_4_4_3_4) OR FIREABLE(t1_4_5_5_5) OR NOT FIREABLE(t1_5_3_4_2) OR NOT FIREABLE(t1_4_3_4_4) OR (NOT FIREABLE(t1_1_5_2_4) AND NOT FIREABLE(t1_3_1_2_1)) OR FIREABLE(t1_3_3_4_2))))
lola: processed formula length: 223
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t1_1_4_1_3) AND NOT FIREABLE(t1_4_4_3_4) AND NOT FIREABLE(t1_4_5_5_5) AND FIREABLE(t1_5_3_4_2) AND FIREABLE(t1_4_3_4_4) AND (FIREABLE(t1_1_5_2_4) OR FIREABLE(t1_3_1_2_1)) AND NOT FIREABLE(t1_3_3_4_2))
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N150-ReachabilityFireability-12-0.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: 156 markings, 157 edges
lola: ========================================


FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_1_1_1_2) OR NOT FIREABLE(t1_3_2_4_2) OR FIREABLE(t1_4_2_5_2) OR FIREABLE(t1_3_4_3_5) OR (FIREABLE(t1_2_2_1_3) AND FIREABLE(t1_2_3_3_4)) OR FIREABLE(t1_3_3_4_4) OR FIREABLE(t1_1_3_1_4))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(t1_1_1_1_2) OR NOT FIREABLE(t1_3_2_4_2) OR FIREABLE(t1_4_2_5_2) OR FIREABLE(t1_3_4_3_5) OR (FIREABLE(t1_2_2_1_3) AND FIREABLE(t1_2_3_3_4)) OR FIREABLE(t1_3_3_4_4) OR FIREABLE(t1_1_3_1_4))))
lola: processed formula length: 215
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(t1_1_1_1_2) AND FIREABLE(t1_3_2_4_2) AND NOT FIREABLE(t1_4_2_5_2) AND NOT FIREABLE(t1_3_4_3_5) AND (NOT FIREABLE(t1_2_2_1_3) OR NOT FIREABLE(t1_2_3_3_4)) AND NOT FIREABLE(t1_3_3_4_4) AND NOT FIREABLE(t1_1_3_1_4))
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N150-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 152 markings, 151 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_5_4_4_3) AND FIREABLE(t1_2_2_1_1) AND NOT FIREABLE(t1_2_3_3_3) AND (FIREABLE(t1_2_3_2_4) OR FIREABLE(t1_5_4_5_3) OR FIREABLE(t1_1_4_1_5)) AND FIREABLE(t1_3_4_4_5) AND FIREABLE(t1_3_4_4_4) AND (FIREABLE(t1_2_3_2_4) OR FIREABLE(t1_1_5_2_5)) AND NOT FIREABLE(t1_1_4_2_5))))
lola: ========================================
lola: SUBTASK
sara: try reading problem file Diffusion2D-PT-D05N150-ReachabilityFireability-13-0.sara.
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t1_5_4_4_3) AND FIREABLE(t1_2_2_1_1) AND NOT FIREABLE(t1_2_3_3_3) AND (FIREABLE(t1_2_3_2_4) OR FIREABLE(t1_5_4_5_3) OR FIREABLE(t1_1_4_1_5)) AND FIREABLE(t1_3_4_4_5) AND FIREABLE(t1_3_4_4_4) AND (FIREABLE(t1_2_3_2_4) OR FIREABLE(t1_1_5_2_5)) AND NOT FIREABLE(t1_1_4_2_5))))
lola: processed formula length: 292
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t1_5_4_4_3) AND FIREABLE(t1_2_2_1_1) AND NOT FIREABLE(t1_2_3_3_3) AND (FIREABLE(t1_2_3_2_4) OR FIREABLE(t1_5_4_5_3) OR FIREABLE(t1_1_4_1_5)) AND FIREABLE(t1_3_4_4_5) AND FIREABLE(t1_3_4_4_4) AND (FIREABLE(t1_2_3_2_4) OR FIREABLE(t1_1_5_2_5)) AND NOT FIREABLE(t1_1_4_2_5))
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N150-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file Diffusion2D-PT-D05N150-ReachabilityFireability-14-0.sara.
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1_3_4_4_5) OR NOT FIREABLE(t1_4_5_5_5) OR (NOT FIREABLE(t1_4_3_5_4) AND (FIREABLE(t1_2_4_3_4) OR FIREABLE(t1_3_2_4_3))) OR FIREABLE(t1_5_3_5_4) OR (FIREABLE(t1_3_4_4_3) AND FIREABLE(t1_2_4_3_3)) OR NOT FIREABLE(t1_1_5_1_4) OR NOT FIREABLE(t1_2_2_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(t1_3_4_4_5) OR NOT FIREABLE(t1_4_5_5_5) OR (NOT FIREABLE(t1_4_3_5_4) AND (FIREABLE(t1_2_4_3_4) OR FIREABLE(t1_3_2_4_3))) OR FIREABLE(t1_5_3_5_4) OR (FIREABLE(t1_3_4_4_3) AND FIREABLE(t1_2_4_3_3)) OR NOT FIREABLE(t1_1_5_1_4) OR NOT FIREABLE(t1_2_2_1_1))))
lola: processed formula length: 277
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D05N150-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t1_3_4_4_5) AND FIREABLE(t1_4_5_5_5) AND (FIREABLE(t1_4_3_5_4) OR (NOT FIREABLE(t1_2_4_3_4) AND NOT FIREABLE(t1_3_2_4_3))) AND NOT FIREABLE(t1_5_3_5_4) AND (NOT FIREABLE(t1_3_4_4_3) OR NOT FIREABLE(t1_2_4_3_3)) AND FIREABLE(t1_1_5_1_4) AND FIREABLE(t1_2_2_1_1))
lola: state equation: Generated DNF with 30 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N150-ReachabilityFireability-15-0.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: 304 markings, 304 edges
lola: ========================================

FORMULA Diffusion2D-PT-D05N150-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no yes no no yes no no no yes yes yes yes no
lola:
preliminary result: yes no yes no yes no no yes no no no yes yes yes yes no
lola: memory consumption: 14732 KB
lola: time consumption: 0 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from 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-D05N150"
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/Diffusion2D-PT-D05N150.tgz
mv Diffusion2D-PT-D05N150 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is Diffusion2D-PT-D05N150, 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 r076-blw3-152649936800140"
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 ;