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 420K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 17K 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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 255K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Diffusion2D-PT-D10N200, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936900203
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526669363996

info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D10N200 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D10N200 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Diffusion2D-PT-D10N200 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 784/65536 symbol table entries, 37 collisions
lola: preprocessing...
lola: Size of bit vector: 3200
lola: finding significant places
lola: 100 places, 684 transitions, 99 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 100 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D10N200-ReachabilityFireability.task
lola: E (F (((FIREABLE(t1_10_2_9_3) AND FIREABLE(t1_7_4_6_3) AND FIREABLE(t1_2_7_1_6) AND FIREABLE(t1_2_3_1_4)) OR (FIREABLE(t1_4_5_4_4) AND FIREABLE(t1_10_9_9_10) AND FIREABLE(t1_9_1_8_2)) OR (FIREABLE(t1_10_5_10_6) AND FIREABLE(t1_2_10_1_10))))) : E (F ((FIREABLE(t1_7_2_8_3) AND FIREABLE(t1_1_3_1_4)))) : E (F (FIREABLE(t1_1_3_1_2))) : E (F (FIREABLE(t1_1_6_2_7))) : E (F (((FIREABLE(t1_4_8_3_7) OR FIREABLE(t1_5_8_4_8)) AND (FIREABLE(t1_3_6_3_7) OR ((FIREABLE(t1_9_2_9_1) OR FIREABLE(t1_1_2_1_1)) AND NOT FIREABLE(t1_5_8_5_9)))))) : A (G ((NOT FIREABLE(t1_4_2_5_3) OR NOT FIREABLE(t1_7_7_7_6)))) : E (F ((NOT FIREABLE(t1_7_5_8_5) AND NOT FIREABLE(t1_1_5_1_4) AND FIREABLE(t1_7_8_6_9) AND (FIREABLE(t1_4_10_4_9) OR FIREABLE(t1_3_8_4_9)) AND NOT FIREABLE(t1_1_3_2_4) AND FIREABLE(t1_7_2_6_1)))) : E (F ((FIREABLE(t1_7_8_8_9) AND FIREABLE(t1_10_3_9_3) AND NOT FIREABLE(t1_7_8_6_7)))) : E (F ((NOT FIREABLE(t1_4_10_3_9) AND NOT FIREABLE(t1_6_6_7_7)))) : E (F ((FIREABLE(t1_5_2_6_2) AND FIREABLE(t1_4_8_4_7) AND NOT FIREABLE(t1_4_4_5_5)))) : A (G ((NOT FIREABLE(t1_4_2_3_3) OR NOT FIREABLE(t1_8_9_9_9) OR NOT FIREABLE(t1_3_4_4_5) OR ((FIREABLE(t1_8_5_9_6) OR (FIREABLE(t1_9_10_8_10) AND FIREABLE(t1_8_7_9_8))) AND (NOT FIREABLE(t1_10_4_9_5) OR NOT FIREABLE(t1_9_6_9_5)))))) : E (F ((FIREABLE(t1_9_3_10_3) AND FIREABLE(t1_7_3_6_3) AND FIREABLE(t1_1_8_2_7)))) : E (F ((FIREABLE(t1_5_7_4_6) AND FIREABLE(t1_10_6_9_6)))) : E (F ((FIREABLE(t1_9_5_8_4) AND FIREABLE(t1_7_8_8_9)))) : E (F (((FIREABLE(t1_6_2_7_2) AND FIREABLE(t1_9_1_8_1) AND NOT FIREABLE(t1_8_9_9_8) AND FIREABLE(t1_3_10_2_10)) OR FIREABLE(t1_10_1_9_1)))) : E (F ((FIREABLE(t1_5_7_5_6) AND FIREABLE(t1_7_10_8_9))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_1_3_1_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_1_3_1_2)))
lola: processed formula length: 28
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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_1_3_1_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola:
FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityFireability-0.sara
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_1_6_2_7)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t1_1_6_2_7)))
lola: processed formula length: 28
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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_1_6_2_7)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_7_2_8_3) AND FIREABLE(t1_1_3_1_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_7_2_8_3) AND FIREABLE(t1_1_3_1_4))))
lola: processed formula length: 55
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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_7_2_8_3) AND FIREABLE(t1_1_3_1_4))
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: 10 markings, 9 edges
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityFireability-2-0.sara

FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_4_2_5_3) OR NOT FIREABLE(t1_7_7_7_6))))
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_2_5_3) OR NOT FIREABLE(t1_7_7_7_6))))
lola: processed formula length: 63
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-5 FALSE 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 ((NOT FIREABLE(t1_4_10_3_9) AND NOT FIREABLE(t1_6_6_7_7))))
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_4_10_3_9) AND NOT FIREABLE(t1_6_6_7_7))))
lola: processed formula length: 64
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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_4_10_3_9) AND NOT FIREABLE(t1_6_6_7_7))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 201 markings, 200 edges
lola: ========================================
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-8 TRUE 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: E (F ((FIREABLE(t1_5_7_4_6) AND FIREABLE(t1_10_6_9_6))))
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_5_7_4_6) AND FIREABLE(t1_10_6_9_6))))
lola: processed formula length: 56
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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_7_4_6) AND FIREABLE(t1_10_6_9_6))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_9_5_8_4) AND FIREABLE(t1_7_8_8_9))))
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_9_5_8_4) AND FIREABLE(t1_7_8_8_9))))
lola: processed formula length: 55
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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_9_5_8_4) AND FIREABLE(t1_7_8_8_9))
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: 6 markings, 5 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_5_7_5_6) AND FIREABLE(t1_7_10_8_9))))
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_5_7_5_6) AND FIREABLE(t1_7_10_8_9))))
lola: processed formula length: 56
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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_7_5_6) AND FIREABLE(t1_7_10_8_9))
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: 6 markings, 6 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-15 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: E (F ((FIREABLE(t1_7_8_8_9) AND FIREABLE(t1_10_3_9_3) AND NOT FIREABLE(t1_7_8_6_7))))
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_7_8_8_9) AND FIREABLE(t1_10_3_9_3) AND NOT FIREABLE(t1_7_8_6_7))))
lola: processed formula length: 85
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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_7_8_8_9) AND FIREABLE(t1_10_3_9_3) AND NOT FIREABLE(t1_7_8_6_7))
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-D10N200-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_5_2_6_2) AND FIREABLE(t1_4_8_4_7) AND NOT FIREABLE(t1_4_4_5_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_5_2_6_2) AND FIREABLE(t1_4_8_4_7) AND NOT FIREABLE(t1_4_4_5_5))))
lola: processed formula length: 84
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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_2_6_2) AND FIREABLE(t1_4_8_4_7) AND NOT FIREABLE(t1_4_4_5_5))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_9_3_10_3) AND FIREABLE(t1_7_3_6_3) AND FIREABLE(t1_1_8_2_7))))
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_9_3_10_3) AND FIREABLE(t1_7_3_6_3) AND FIREABLE(t1_1_8_2_7))))
lola: processed formula length: 81
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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_9_3_10_3) AND FIREABLE(t1_7_3_6_3) AND FIREABLE(t1_1_8_2_7))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 48 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1_6_2_7_2) AND FIREABLE(t1_9_1_8_1) AND NOT FIREABLE(t1_8_9_9_8) AND FIREABLE(t1_3_10_2_10)) OR FIREABLE(t1_10_1_9_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_6_2_7_2) AND FIREABLE(t1_9_1_8_1) AND NOT FIREABLE(t1_8_9_9_8) AND FIREABLE(t1_3_10_2_10)) OR FIREABLE(t1_10_1_9_1))))
lola: processed formula length: 139
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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)
sara: try reading problem file Diffusion2D-PT-D10N200-ReachabilityFireability-10-0.sara.
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_6_2_7_2) AND FIREABLE(t1_9_1_8_1) AND NOT FIREABLE(t1_8_9_9_8) AND FIREABLE(t1_3_10_2_10)) OR FIREABLE(t1_10_1_9_1))
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: 7 markings, 6 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1_4_8_3_7) OR FIREABLE(t1_5_8_4_8)) AND (FIREABLE(t1_3_6_3_7) OR ((FIREABLE(t1_9_2_9_1) OR FIREABLE(t1_1_2_1_1)) AND NOT FIREABLE(t1_5_8_5_9))))))
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_8_3_7) OR FIREABLE(t1_5_8_4_8)) AND (FIREABLE(t1_3_6_3_7) OR ((FIREABLE(t1_9_2_9_1) OR FIREABLE(t1_1_2_1_1)) AND NOT FIREABLE(t1_5_8_5_9))))))
lola: processed formula length: 167
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 8 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1_7_5_8_5) AND NOT FIREABLE(t1_1_5_1_4) AND FIREABLE(t1_7_8_6_9) AND (FIREABLE(t1_4_10_4_9) OR FIREABLE(t1_3_8_4_9)) AND NOT FIREABLE(t1_1_3_2_4) AND FIREABLE(t1_7_2_6_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 ((NOT FIREABLE(t1_7_5_8_5) AND NOT FIREABLE(t1_1_5_1_4) AND FIREABLE(t1_7_8_6_9) AND (FIREABLE(t1_4_10_4_9) OR FIREABLE(t1_3_8_4_9)) AND NOT FIREABLE(t1_1_3_2_4) AND FIREABLE(t1_7_2_6_1))))
lola: processed formula length: 195
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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_7_5_8_5) AND NOT FIREABLE(t1_1_5_1_4) AND FIREABLE(t1_7_8_6_9) AND (FIREABLE(t1_4_10_4_9) OR FIREABLE(t1_3_8_4_9)) AND NOT FIREABLE(t1_1_3_2_4) AND FIREABLE(t1_7_2_6_1))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N200-ReachabilityFireability-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
sara:
lola: place or transition ordering is non-deterministic
========================================
FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_4_2_3_3) OR NOT FIREABLE(t1_8_9_9_9) OR NOT FIREABLE(t1_3_4_4_5) OR ((FIREABLE(t1_8_5_9_6) OR (FIREABLE(t1_9_10_8_10) AND FIREABLE(t1_8_7_9_8))) AND (NOT FIREABLE(t1_10_4_9_5) OR NOT FIREABLE(t1_9_6_9_5))))))
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_2_3_3) OR NOT FIREABLE(t1_8_9_9_9) OR NOT FIREABLE(t1_3_4_4_5) OR ((FIREABLE(t1_8_5_9_6) OR (FIREABLE(t1_9_10_8_10) AND FIREABLE(t1_8_7_9_8))) AND (NOT FIREABLE(t1_10_4_9_5) OR NOT FIREABLE(t1_9_6_9_5))))))
lola: processed formula length: 236
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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_2_3_3) AND FIREABLE(t1_8_9_9_9) AND FIREABLE(t1_3_4_4_5) AND ((NOT FIREABLE(t1_8_5_9_6) AND (NOT FIREABLE(t1_9_10_8_10) OR NOT FIREABLE(t1_8_7_9_8))) OR (FIREABLE(t1_10_4_9_5) AND FIREABLE(t1_9_6_9_5))))
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N200-ReachabilityFireability-14-0.sara.

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1806 markings, 3404 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1_10_2_9_3) AND FIREABLE(t1_7_4_6_3) AND FIREABLE(t1_2_7_1_6) AND FIREABLE(t1_2_3_1_4)) OR (FIREABLE(t1_4_5_4_4) AND FIREABLE(t1_10_9_9_10) AND FIREABLE(t1_9_1_8_2)) OR (FIREABLE(t1_10_5_10_6) AND FIREABLE(t1_2_10_1_10)))))
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_10_2_9_3) AND FIREABLE(t1_7_4_6_3) AND FIREABLE(t1_2_7_1_6) AND FIREABLE(t1_2_3_1_4)) OR (FIREABLE(t1_4_5_4_4) AND FIREABLE(t1_10_9_9_10) AND FIREABLE(t1_9_1_8_2)) OR (FIREABLE(t1_10_5_10_6) AND FIREABLE(t1_2_10_1_10)))))
lola: processed formula length: 243
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-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_10_2_9_3) AND FIREABLE(t1_7_4_6_3) AND FIREABLE(t1_2_7_1_6) AND FIREABLE(t1_2_3_1_4)) OR (FIREABLE(t1_4_5_4_4) AND FIREABLE(t1_10_9_9_10) AND FIREABLE(t1_9_1_8_2)) OR (FIREABLE(t1_10_5_10_6) AND FIREABLE(t1_2_10_1_10)))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola:
FORMULA Diffusion2D-PT-D10N200-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no yes no yes yes no yes yes yes yes yes
lola:
preliminary result: yes yes yes yes yes no yes no yes yes no yes yes yes yes yes

lola: memory consumption: 15168 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-D10N200"
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-D10N200.tgz
mv Diffusion2D-PT-D10N200 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-D10N200, 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-152649936900203"
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 ;