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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936900201
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526669226172

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 ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ 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-ReachabilityCardinality.task
lola: A (G (((cAMP__10_7_ <= cAMP__7_10_) OR (cAMP__1_10_ <= cAMP__8_9_) OR (cAMP__1_2_ + 1 <= cAMP__5_6_) OR (cAMP__2_9_ <= cAMP__3_8_) OR (cAMP__1_8_ <= cAMP__9_7_) OR (cAMP__8_7_ <= cAMP__4_10_) OR (3 <= cAMP__3_1_)))) : A (G (((1 <= cAMP__9_7_) OR (cAMP__1_7_ <= cAMP__2_10_)))) : E (F ((3 <= cAMP__8_4_))) : A (G (((cAMP__8_10_ <= 2) OR (cAMP__8_3_ + 1 <= cAMP__3_4_) OR (cAMP__6_8_ <= cAMP__8_2_)))) : A (G ((cAMP__8_2_ <= 2))) : A (G (((cAMP__4_4_ <= cAMP__5_3_) OR (1 <= cAMP__3_2_) OR (cAMP__8_3_ <= cAMP__1_4_)))) : E (F (((cAMP__7_4_ + 1 <= cAMP__2_5_) AND (cAMP__8_6_ <= 0) AND (cAMP__8_8_ + 1 <= cAMP__5_1_)))) : E (F ((2 <= cAMP__2_4_))) : E (F ((2 <= cAMP__8_10_))) : A (G ((cAMP__10_4_ + 1 <= cAMP__6_6_))) : E (F ((cAMP__2_9_ + 1 <= cAMP__7_1_))) : A (G (((cAMP__9_6_ <= cAMP__4_7_) OR (2 <= cAMP__10_1_) OR ((cAMP__5_3_ <= cAMP__3_6_) AND (1 <= cAMP__8_3_)) OR ((cAMP__5_8_ <= cAMP__6_4_) AND (cAMP__8_6_ <= cAMP__10_9_)) OR (cAMP__5_5_ + 1 <= cAMP__5_8_)))) : A (G ((cAMP__3_1_ <= cAMP__7_2_))) : E (F ((((cAMP__3_5_ <= cAMP__7_2_) OR (cAMP__7_6_ <= cAMP__1_1_)) AND (cAMP__5_10_ + 1 <= cAMP__6_2_) AND ((2 <= cAMP__5_7_) OR (3 <= cAMP__3_2_)) AND (cAMP__5_9_ <= 1)))) : E (F ((3 <= cAMP__2_9_))) : E (F (((cAMP__3_4_ + 1 <= cAMP__1_2_) AND (cAMP__8_1_ + 1 <= cAMP__1_2_) AND ((cAMP__6_10_ + 1 <= cAMP__10_4_) OR (cAMP__8_4_ + 1 <= cAMP__9_4_)))))
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 ((3 <= cAMP__8_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 ((3 <= cAMP__8_4_)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: (3 <= cAMP__8_4_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N200-ReachabilityCardinality-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-D10N200-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__8_2_ <= 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 ((cAMP__8_2_ <= 2)))
lola: processed formula length: 25
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: (3 <= cAMP__8_2_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N200-ReachabilityCardinality-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 428 markings, 1266 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityCardinality-4 FALSE 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 ((2 <= cAMP__2_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 ((2 <= cAMP__2_4_)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: (2 <= cAMP__2_4_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-2-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 58 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityCardinality-7 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: E (F ((2 <= cAMP__8_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 ((2 <= cAMP__8_10_)))
lola: processed formula length: 26
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: (2 <= cAMP__8_10_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-3-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 76 markings, 181 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityCardinality-8 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 ((3 <= cAMP__2_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 ((3 <= cAMP__2_9_)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: (3 <= cAMP__2_9_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N200-ReachabilityCardinality-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 213 markings, 567 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityCardinality-14 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 ((cAMP__2_9_ + 1 <= cAMP__7_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 ((cAMP__2_9_ + 1 <= cAMP__7_1_)))
lola: processed formula length: 38
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: (cAMP__2_9_ + 1 <= cAMP__7_1_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-5-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-ReachabilityCardinality-10 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: A (G ((cAMP__3_1_ <= cAMP__7_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 ((cAMP__3_1_ <= cAMP__7_2_)))
lola: processed formula length: 34
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: (cAMP__7_2_ + 1 <= cAMP__3_1_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-6-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: 10 markings, 11 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityCardinality-12 FALSE 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: A (G ((cAMP__10_4_ + 1 <= cAMP__6_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 ((cAMP__10_4_ + 1 <= cAMP__6_6_)))
lola: processed formula length: 39
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: (cAMP__6_6_ <= cAMP__10_4_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N200-ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 201 markings, 200 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityCardinality-9 FALSE 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 (((1 <= cAMP__9_7_) OR (cAMP__1_7_ <= cAMP__2_10_))))
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 (((1 <= cAMP__9_7_) OR (cAMP__1_7_ <= cAMP__2_10_))))
lola: processed formula length: 59
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: ((cAMP__9_7_ <= 0) AND (cAMP__2_10_ + 1 <= cAMP__1_7_))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 8 edges
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-8-0.sara

FORMULA Diffusion2D-PT-D10N200-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file Diffusion2D-PT-D10N200-ReachabilityCardinality-8-0.sara.
lola: ...considering subproblem: A (G (((cAMP__8_10_ <= 2) OR (cAMP__8_3_ + 1 <= cAMP__3_4_) OR (cAMP__6_8_ <= cAMP__8_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 (((cAMP__8_10_ <= 2) OR (cAMP__8_3_ + 1 <= cAMP__3_4_) OR (cAMP__6_8_ <= cAMP__8_2_))))
lola: processed formula length: 94
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: ((3 <= cAMP__8_10_) AND (cAMP__3_4_ <= cAMP__8_3_) AND (cAMP__8_2_ + 1 <= cAMP__6_8_))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 79 markings, 174 edges

FORMULA Diffusion2D-PT-D10N200-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__4_4_ <= cAMP__5_3_) OR (1 <= cAMP__3_2_) OR (cAMP__8_3_ <= cAMP__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 (((cAMP__4_4_ <= cAMP__5_3_) OR (1 <= cAMP__3_2_) OR (cAMP__8_3_ <= cAMP__1_4_))))
lola: processed formula length: 89
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: ((cAMP__5_3_ + 1 <= cAMP__4_4_) AND (cAMP__3_2_ <= 0) AND (cAMP__1_4_ + 1 <= cAMP__8_3_))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas

FORMULA Diffusion2D-PT-D10N200-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-10-0.sara
sara: place or transition ordering is non-deterministic

lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__7_4_ + 1 <= cAMP__2_5_) AND (cAMP__8_6_ <= 0) AND (cAMP__8_8_ + 1 <= cAMP__5_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 (((cAMP__7_4_ + 1 <= cAMP__2_5_) AND (cAMP__8_6_ <= 0) AND (cAMP__8_8_ + 1 <= cAMP__5_1_))))
lola: processed formula length: 97
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: ========================================
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: ((cAMP__7_4_ + 1 <= cAMP__2_5_) AND (cAMP__8_6_ <= 0) AND (cAMP__8_8_ + 1 <= cAMP__5_1_))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N200-ReachabilityCardinality-11-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-D10N200-ReachabilityCardinality-6 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 (((cAMP__3_4_ + 1 <= cAMP__1_2_) AND (cAMP__8_1_ + 1 <= cAMP__1_2_) AND ((cAMP__6_10_ + 1 <= cAMP__10_4_) OR (cAMP__8_4_ + 1 <= cAMP__9_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 (((cAMP__3_4_ + 1 <= cAMP__1_2_) AND (cAMP__8_1_ + 1 <= cAMP__1_2_) AND ((cAMP__6_10_ + 1 <= cAMP__10_4_) OR (cAMP__8_4_ + 1 <= cAMP__9_4_)))))
lola: processed formula length: 149
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: ((cAMP__3_4_ + 1 <= cAMP__1_2_) AND (cAMP__8_1_ + 1 <= cAMP__1_2_) AND ((cAMP__6_10_ + 1 <= cAMP__10_4_) OR (cAMP__8_4_ + 1 <= cAMP__9_4_)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityCardinality-15 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 ((((cAMP__3_5_ <= cAMP__7_2_) OR (cAMP__7_6_ <= cAMP__1_1_)) AND (cAMP__5_10_ + 1 <= cAMP__6_2_) AND ((2 <= cAMP__5_7_) OR (3 <= cAMP__3_2_)) AND (cAMP__5_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 ((((cAMP__3_5_ <= cAMP__7_2_) OR (cAMP__7_6_ <= cAMP__1_1_)) AND (cAMP__5_10_ + 1 <= cAMP__6_2_) AND ((2 <= cAMP__5_7_) OR (3 <= cAMP__3_2_)) AND (cAMP__5_9_ <= 1))))
lola: processed formula length: 173
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: (((cAMP__3_5_ <= cAMP__7_2_) OR (cAMP__7_6_ <= cAMP__1_1_)) AND (cAMP__5_10_ + 1 <= cAMP__6_2_) AND ((2 <= cAMP__5_7_) OR (3 <= cAMP__3_2_)) AND (cAMP__5_9_ <= 1))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N200-ReachabilityCardinality-13-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-D10N200-ReachabilityCardinality-13 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 (((cAMP__9_6_ <= cAMP__4_7_) OR (2 <= cAMP__10_1_) OR ((cAMP__5_3_ <= cAMP__3_6_) AND (1 <= cAMP__8_3_)) OR ((cAMP__5_8_ <= cAMP__6_4_) AND (cAMP__8_6_ <= cAMP__10_9_)) OR (cAMP__5_5_ + 1 <= cAMP__5_8_))))
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 (((cAMP__9_6_ <= cAMP__4_7_) OR (2 <= cAMP__10_1_) OR ((cAMP__5_3_ <= cAMP__3_6_) AND (1 <= cAMP__8_3_)) OR ((cAMP__5_8_ <= cAMP__6_4_) AND (cAMP__8_6_ <= cAMP__10_9_)) OR (cAMP__5_5_ + 1 <= cAMP__5_8_))))
lola: processed formula length: 214
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: ((cAMP__4_7_ + 1 <= cAMP__9_6_) AND (cAMP__10_1_ <= 1) AND ((cAMP__3_6_ + 1 <= cAMP__5_3_) OR (cAMP__8_3_ <= 0)) AND ((cAMP__6_4_ + 1 <= cAMP__5_8_) OR (cAMP__10_9_ + 1 <= cAMP__8_6_)) AND (cAMP__5_8_ <= cAMP__5_5_))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N200-ReachabilityCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityCardinality-11 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: A (G (((cAMP__10_7_ <= cAMP__7_10_) OR (cAMP__1_10_ <= cAMP__8_9_) OR (cAMP__1_2_ + 1 <= cAMP__5_6_) OR (cAMP__2_9_ <= cAMP__3_8_) OR (cAMP__1_8_ <= cAMP__9_7_) OR (cAMP__8_7_ <= cAMP__4_10_) OR (3 <= cAMP__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 (((cAMP__10_7_ <= cAMP__7_10_) OR (cAMP__1_10_ <= cAMP__8_9_) OR (cAMP__1_2_ + 1 <= cAMP__5_6_) OR (cAMP__2_9_ <= cAMP__3_8_) OR (cAMP__1_8_ <= cAMP__9_7_) OR (cAMP__8_7_ <= cAMP__4_10_) OR (3 <= cAMP__3_1_))))
lola: processed formula length: 221
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N200-ReachabilityCardinality.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: ((cAMP__7_10_ + 1 <= cAMP__10_7_) AND (cAMP__8_9_ + 1 <= cAMP__1_10_) AND (cAMP__5_6_ <= cAMP__1_2_) AND (cAMP__3_8_ + 1 <= cAMP__2_9_) AND (cAMP__9_7_ + 1 <= cAMP__1_8_) AND (cAMP__4_10_ + 1 <= cAMP__8_7_) AND (cAMP__3_1_ <= 2))
lola: state equation: Generated DNF with 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N200-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N200-ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA Diffusion2D-PT-D10N200-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no no yes yes yes no yes no no yes yes yes
lola:
preliminary result: no no yes no no no yes yes yes no yes no no yes yes yes
lola: memory consumption: 24488 KB
lola: time consumption: 1 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="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-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 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 r076-blw3-152649936900201"
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 ;