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 428K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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 7.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-D10N150, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936900194
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526665699364

info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D10N150 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D10N150 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ Diffusion2D-PT-D10N150 @ 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-D10N150-ReachabilityCardinality.task
lola: E (F (((cAMP__3_1_ <= 1) AND (cAMP__8_7_ + 1 <= cAMP__6_5_) AND ((3 <= cAMP__9_3_) OR (2 <= cAMP__9_3_)) AND (cAMP__7_6_ <= 2)))) : A (G (((((cAMP__10_8_ <= cAMP__10_1_) OR (3 <= cAMP__3_2_)) AND (cAMP__9_7_ + 1 <= cAMP__7_10_)) OR (cAMP__10_1_ <= 0)))) : A (G ((cAMP__1_3_ <= 1))) : E (F (((cAMP__2_6_ <= cAMP__5_2_) AND (3 <= cAMP__9_2_) AND (cAMP__4_10_ + 1 <= cAMP__2_7_) AND (1 <= cAMP__4_10_) AND (cAMP__5_7_ <= 1)))) : A (G (((cAMP__4_2_ <= 2) OR (1 <= cAMP__5_2_)))) : E (F ((2 <= cAMP__9_9_))) : E (F (((((3 <= cAMP__4_10_) AND (2 <= cAMP__4_4_)) OR (3 <= cAMP__10_3_)) AND ((2 <= cAMP__1_7_) OR (cAMP__9_7_ <= cAMP__2_10_) OR ((cAMP__7_8_ <= cAMP__2_1_) AND (2 <= cAMP__7_10_)))))) : E (F ((3 <= cAMP__5_9_))) : E (F (((cAMP__10_9_ <= 0) AND (cAMP__7_3_ + 1 <= cAMP__7_6_) AND (2 <= cAMP__7_4_)))) : A (G ((((cAMP__8_10_ + 1 <= cAMP__1_1_) OR (cAMP__5_2_ <= 1)) AND ((cAMP__7_5_ <= 0) OR (cAMP__1_10_ <= 0))))) : A (G (((cAMP__3_6_ <= cAMP__6_4_) OR ((cAMP__5_4_ <= cAMP__7_8_) AND ((cAMP__5_3_ <= cAMP__5_2_) OR (cAMP__1_5_ <= cAMP__6_7_)))))) : E (F (((cAMP__2_4_ + 1 <= cAMP__2_5_) AND (cAMP__5_10_ + 1 <= cAMP__4_9_) AND (2 <= cAMP__3_3_)))) : E (F ((2 <= cAMP__9_2_))) : E (F (((cAMP__4_5_ <= 2) AND (cAMP__4_3_ <= 0) AND (cAMP__6_6_ + 1 <= cAMP__2_8_)))) : E (F ((3 <= cAMP__4_3_))) : E (F ((3 <= cAMP__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: A (G ((cAMP__1_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__1_3_ <= 1)))
lola: processed formula length: 25
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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: (2 <= cAMP__1_3_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N150-ReachabilityCardinality-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: 66 markings, 162 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N150-ReachabilityCardinality-2 FALSE 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: E (F ((2 <= cAMP__9_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 ((2 <= cAMP__9_9_)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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__9_9_)
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: 41 markings, 85 edges

FORMULA Diffusion2D-PT-D10N150-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cAMP__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 ((3 <= cAMP__5_9_)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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__5_9_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N150-ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N150-ReachabilityCardinality-2-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-D10N150-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__9_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 ((2 <= cAMP__9_2_)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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__9_2_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N150-ReachabilityCardinality-3-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: 39 markings, 83 edges
lola: ========================================

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

FORMULA Diffusion2D-PT-D10N150-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 ((3 <= cAMP__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 ((3 <= cAMP__8_9_)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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_9_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N150-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N150-ReachabilityCardinality-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 93 markings, 200 edges
lola:
FORMULA Diffusion2D-PT-D10N150-ReachabilityCardinality-15 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__4_2_ <= 2) OR (1 <= cAMP__5_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__4_2_ <= 2) OR (1 <= cAMP__5_2_))))
lola: processed formula length: 49
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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__4_2_) AND (cAMP__5_2_ <= 0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N150-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N150-ReachabilityCardinality-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 566 markings, 1672 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N150-ReachabilityCardinality-4 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: E (F (((cAMP__10_9_ <= 0) AND (cAMP__7_3_ + 1 <= cAMP__7_6_) AND (2 <= cAMP__7_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__10_9_ <= 0) AND (cAMP__7_3_ + 1 <= cAMP__7_6_) AND (2 <= cAMP__7_4_))))
lola: processed formula length: 85
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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__10_9_ <= 0) AND (cAMP__7_3_ + 1 <= cAMP__7_6_) AND (2 <= cAMP__7_4_))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N150-ReachabilityCardinality-7-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: 8 markings, 9 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N150-ReachabilityCardinality-8 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 (((cAMP__4_5_ <= 2) AND (cAMP__4_3_ <= 0) AND (cAMP__6_6_ + 1 <= cAMP__2_8_))))
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__4_5_ <= 2) AND (cAMP__4_3_ <= 0) AND (cAMP__6_6_ + 1 <= cAMP__2_8_))))
lola: processed formula length: 84
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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__4_5_ <= 2) AND (cAMP__4_3_ <= 0) AND (cAMP__6_6_ + 1 <= cAMP__2_8_))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N150-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N150-ReachabilityCardinality-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 159 markings, 163 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N150-ReachabilityCardinality-13 TRUE 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: A (G (((((cAMP__10_8_ <= cAMP__10_1_) OR (3 <= cAMP__3_2_)) AND (cAMP__9_7_ + 1 <= cAMP__7_10_)) OR (cAMP__10_1_ <= 0))))
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_8_ <= cAMP__10_1_) OR (3 <= cAMP__3_2_)) AND (cAMP__9_7_ + 1 <= cAMP__7_10_)) OR (cAMP__10_1_ <= 0))))
lola: processed formula length: 123
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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__10_1_ + 1 <= cAMP__10_8_) AND (cAMP__3_2_ <= 2)) OR (cAMP__7_10_ <= cAMP__9_7_)) AND (1 <= cAMP__10_1_))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N150-ReachabilityCardinality-9-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: 6 markings, 5 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N150-ReachabilityCardinality-1 FALSE 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 (((cAMP__3_1_ <= 1) AND (cAMP__8_7_ + 1 <= cAMP__6_5_) AND ((3 <= cAMP__9_3_) OR (2 <= cAMP__9_3_)) AND (cAMP__7_6_ <= 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 (((cAMP__3_1_ <= 1) AND (cAMP__8_7_ + 1 <= cAMP__6_5_) AND ((3 <= cAMP__9_3_) OR (2 <= cAMP__9_3_)) AND (cAMP__7_6_ <= 2))))
lola: processed formula length: 130
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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_1_ <= 1) AND (cAMP__8_7_ + 1 <= cAMP__6_5_) AND ((3 <= cAMP__9_3_) OR (2 <= cAMP__9_3_)) AND (cAMP__7_6_ <= 2))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N150-ReachabilityCardinality-10-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: 34 markings, 65 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N150-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((cAMP__8_10_ + 1 <= cAMP__1_1_) OR (cAMP__5_2_ <= 1)) AND ((cAMP__7_5_ <= 0) OR (cAMP__1_10_ <= 0)))))
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_ + 1 <= cAMP__1_1_) OR (cAMP__5_2_ <= 1)) AND ((cAMP__7_5_ <= 0) OR (cAMP__1_10_ <= 0)))))
lola: processed formula length: 112
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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__1_1_ <= cAMP__8_10_) AND (2 <= cAMP__5_2_)) OR ((1 <= cAMP__7_5_) AND (1 <= cAMP__1_10_)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N150-ReachabilityCardinality-11-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: 38 markings, 85 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N150-ReachabilityCardinality-9 FALSE 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__2_4_ + 1 <= cAMP__2_5_) AND (cAMP__5_10_ + 1 <= cAMP__4_9_) AND (2 <= cAMP__3_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 (((cAMP__2_4_ + 1 <= cAMP__2_5_) AND (cAMP__5_10_ + 1 <= cAMP__4_9_) AND (2 <= cAMP__3_3_))))
lola: processed formula length: 98
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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_4_ + 1 <= cAMP__2_5_) AND (cAMP__5_10_ + 1 <= cAMP__4_9_) AND (2 <= cAMP__3_3_))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N150-ReachabilityCardinality-12-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: 72 markings, 164 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N150-ReachabilityCardinality-11 TRUE 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: E (F (((cAMP__2_6_ <= cAMP__5_2_) AND (3 <= cAMP__9_2_) AND (cAMP__4_10_ + 1 <= cAMP__2_7_) AND (1 <= cAMP__4_10_) AND (cAMP__5_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_6_ <= cAMP__5_2_) AND (3 <= cAMP__9_2_) AND (cAMP__4_10_ + 1 <= cAMP__2_7_) AND (1 <= cAMP__4_10_) AND (cAMP__5_7_ <= 1))))
lola: processed formula length: 139
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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_6_ <= cAMP__5_2_) AND (3 <= cAMP__9_2_) AND (cAMP__4_10_ + 1 <= cAMP__2_7_) AND (1 <= cAMP__4_10_) AND (cAMP__5_7_ <= 1))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N150-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N150-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 654 markings, 1815 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N150-ReachabilityCardinality-3 TRUE 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: A (G (((cAMP__3_6_ <= cAMP__6_4_) OR ((cAMP__5_4_ <= cAMP__7_8_) AND ((cAMP__5_3_ <= cAMP__5_2_) OR (cAMP__1_5_ <= cAMP__6_7_))))))
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_6_ <= cAMP__6_4_) OR ((cAMP__5_4_ <= cAMP__7_8_) AND ((cAMP__5_3_ <= cAMP__5_2_) OR (cAMP__1_5_ <= cAMP__6_7_))))))
lola: processed formula length: 133
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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_4_ + 1 <= cAMP__3_6_) AND ((cAMP__7_8_ + 1 <= cAMP__5_4_) OR ((cAMP__5_2_ + 1 <= cAMP__5_3_) AND (cAMP__6_7_ + 1 <= cAMP__1_5_))))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N150-ReachabilityCardinality-14-0.sara
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-D10N150-ReachabilityCardinality-10 FALSE 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: E (F (((((3 <= cAMP__4_10_) AND (2 <= cAMP__4_4_)) OR (3 <= cAMP__10_3_)) AND ((2 <= cAMP__1_7_) OR (cAMP__9_7_ <= cAMP__2_10_) OR ((cAMP__7_8_ <= cAMP__2_1_) AND (2 <= cAMP__7_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 (((((3 <= cAMP__4_10_) AND (2 <= cAMP__4_4_)) OR (3 <= cAMP__10_3_)) AND ((2 <= cAMP__1_7_) OR (cAMP__9_7_ <= cAMP__2_10_) OR ((cAMP__7_8_ <= cAMP__2_1_) AND (2 <= cAMP__7_10_))))))
lola: processed formula length: 189
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N150-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__4_10_) AND (2 <= cAMP__4_4_)) OR (3 <= cAMP__10_3_)) AND ((2 <= cAMP__1_7_) OR (cAMP__9_7_ <= cAMP__2_10_) OR ((cAMP__7_8_ <= cAMP__2_1_) AND (2 <= cAMP__7_10_))))
lola: state equation: Generated DNF with 17 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N150-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N150-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 191 markings, 480 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N150-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes no yes yes yes yes no no yes yes yes yes yes
lola:
preliminary result: yes no no yes no yes yes yes yes no no yes yes yes yes yes
lola: memory consumption: 24944 KB
lola: time consumption: 1 seconds

BK_STOP 1526665700046

--------------------
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-D10N150"
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-D10N150.tgz
mv Diffusion2D-PT-D10N150 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-D10N150, 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-152649936900194"
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 ;