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 3.2M
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 15K 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.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K 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.3K 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.9K 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 3.0M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Diffusion2D-PT-D30N010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649937000234
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526683879986

info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D30N010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D30N010 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ Diffusion2D-PT-D30N010 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7744/65536 symbol table entries, 1051 collisions
lola: preprocessing...
lola: Size of bit vector: 28800
lola: finding significant places
lola: 900 places, 6844 transitions, 899 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 900 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D30N010-CTLCardinality.task
lola: E (F ((3 <= cAMP__21_22_))) : E (F (E (F (((cAMP__4_28_ <= cAMP__1_3_) AND (2 <= cAMP__23_25_)))))) : A (G ((cAMP__18_28_ <= 1))) : E (F (E (((2 <= cAMP__30_2_) U (3 <= cAMP__18_10_))))) : A (G ((E (F ((2 <= cAMP__5_30_))) AND ((cAMP__8_1_ <= 0) AND (cAMP__23_23_ <= cAMP__28_23_))))) : A (G ((cAMP__11_19_ <= cAMP__15_17_))) : A (G (E (G ((cAMP__1_19_ <= 0))))) : (NOT(E (F (((cAMP__5_27_ <= cAMP__30_10_) AND (3 <= cAMP__29_25_))))) AND (A (((2 <= cAMP__9_24_) U (1 <= cAMP__10_8_))) OR (cAMP__1_13_ <= cAMP__22_3_))) : A (G ((cAMP__10_18_ <= cAMP__26_13_))) : E (F (((1 <= cAMP__4_17_) AND (((1 <= cAMP__15_25_) AND (3 <= cAMP__9_8_)) OR (1 <= cAMP__9_20_))))) : ((2 <= cAMP__21_9_) OR E (F (((cAMP__11_16_ + 1 <= cAMP__29_7_) AND (cAMP__7_13_ <= 0))))) : E (F ((2 <= cAMP__17_2_))) : A (G ((((3 <= cAMP__17_15_) AND (3 <= cAMP__28_1_)) OR ((3 <= cAMP__27_23_) AND (3 <= cAMP__5_29_)) OR (cAMP__26_23_ <= cAMP__14_20_)))) : E (F ((((cAMP__18_5_ + 1 <= cAMP__25_16_) AND ((1 <= cAMP__25_10_) OR (2 <= cAMP__28_21_))) OR ((2 <= cAMP__30_26_) AND (1 <= cAMP__28_10_) AND (cAMP__14_1_ + 1 <= cAMP__8_22_))))) : (NOT(((((1 <= cAMP__30_2_) AND (3 <= cAMP__30_17_)) OR ((1 <= cAMP__19_30_) AND (1 <= cAMP__30_8_))) OR E (F ((3 <= cAMP__26_20_))))) AND NOT(A (G ((3 <= cAMP__25_8_))))) : A (G (((2 <= cAMP__24_19_) OR (3 <= cAMP__6_11_) OR ((cAMP__3_23_ <= cAMP__26_8_) AND (cAMP__1_20_ <= cAMP__1_16_)) OR (3 <= cAMP__14_14_))))
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cAMP__21_22_)))
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__21_22_)))
lola: processed formula length: 27
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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__21_22_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6080 markings, 20705 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N010-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__18_28_ <= 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__18_28_ <= 1)))
lola: processed formula length: 27
lola: 18 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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__18_28_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1486 markings, 4996 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N010-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cAMP__18_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__18_10_)))
lola: processed formula length: 27
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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__18_10_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4622 markings, 15385 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N010-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__1_19_ <= 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__1_19_ <= 0)))
lola: processed formula length: 26
lola: 18 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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: (1 <= cAMP__1_19_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-3-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
FORMULA Diffusion2D-PT-D30N010-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= cAMP__17_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__17_2_)))
lola: processed formula length: 26
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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__17_2_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1689 markings, 6068 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N010-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__10_18_ <= cAMP__26_13_)))
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_18_ <= cAMP__26_13_)))
lola: processed formula length: 38
lola: 18 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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__26_13_ + 1 <= cAMP__10_18_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N010-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__11_19_ <= cAMP__15_17_)))
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__11_19_ <= cAMP__15_17_)))
lola: processed formula length: 38
lola: 18 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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__15_17_ + 1 <= cAMP__11_19_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-6-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-D30N010-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__4_28_ <= cAMP__1_3_) AND (2 <= cAMP__23_25_))))
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_28_ <= cAMP__1_3_) AND (2 <= cAMP__23_25_))))
lola: processed formula length: 61
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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_28_ <= cAMP__1_3_) AND (2 <= cAMP__23_25_))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 734 markings, 2369 edges

FORMULA Diffusion2D-PT-D30N010-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= cAMP__4_17_) AND (((1 <= cAMP__15_25_) AND (3 <= cAMP__9_8_)) OR (1 <= cAMP__9_20_)))))
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 (((1 <= cAMP__4_17_) AND (((1 <= cAMP__15_25_) AND (3 <= cAMP__9_8_)) OR (1 <= cAMP__9_20_)))))
lola: processed formula length: 101
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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: ((1 <= cAMP__4_17_) AND (((1 <= cAMP__15_25_) AND (3 <= cAMP__9_8_)) OR (1 <= cAMP__9_20_)))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 287 markings, 905 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N010-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= cAMP__17_15_) AND (3 <= cAMP__28_1_)) OR ((3 <= cAMP__27_23_) AND (3 <= cAMP__5_29_)) OR (cAMP__26_23_ <= cAMP__14_20_))))
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 ((((3 <= cAMP__17_15_) AND (3 <= cAMP__28_1_)) OR ((3 <= cAMP__27_23_) AND (3 <= cAMP__5_29_)) OR (cAMP__26_23_ <= cAMP__14_20_))))
lola: processed formula length: 138
lola: 18 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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__17_15_ <= 2) OR (cAMP__28_1_ <= 2)) AND ((cAMP__27_23_ <= 2) OR (cAMP__5_29_ <= 2)) AND (cAMP__14_20_ + 1 <= cAMP__26_23_))
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-9-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.

FORMULA Diffusion2D-PT-D30N010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= cAMP__24_19_) OR (3 <= cAMP__6_11_) OR ((cAMP__3_23_ <= cAMP__26_8_) AND (cAMP__1_20_ <= cAMP__1_16_)) OR (3 <= cAMP__14_14_))))
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 (((2 <= cAMP__24_19_) OR (3 <= cAMP__6_11_) OR ((cAMP__3_23_ <= cAMP__26_8_) AND (cAMP__1_20_ <= cAMP__1_16_)) OR (3 <= cAMP__14_14_))))
lola: processed formula length: 144
lola: 18 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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__24_19_ <= 1) AND (cAMP__6_11_ <= 2) AND ((cAMP__26_8_ + 1 <= cAMP__3_23_) OR (cAMP__1_16_ + 1 <= cAMP__1_20_)) AND (cAMP__14_14_ <= 2))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-10-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-D30N010-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 705 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__18_5_ + 1 <= cAMP__25_16_) AND ((1 <= cAMP__25_10_) OR (2 <= cAMP__28_21_))) OR ((2 <= cAMP__30_26_) AND (1 <= cAMP__28_10_) AND (cAMP__14_1_ + 1 <= cAMP__8_22_)))))
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__18_5_ + 1 <= cAMP__25_16_) AND ((1 <= cAMP__25_10_) OR (2 <= cAMP__28_21_))) OR ((2 <= cAMP__30_26_) AND (1 <= cAMP__28_10_) AND (cAMP__14_1_ + 1 <= cAMP__8_22_)))))
lola: processed formula length: 182
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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__18_5_ + 1 <= cAMP__25_16_) AND ((1 <= cAMP__25_10_) OR (2 <= cAMP__28_21_))) OR ((2 <= cAMP__30_26_) AND (1 <= cAMP__28_10_) AND (cAMP__14_1_ + 1 <= cAMP__8_22_)))
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 546 markings, 1789 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N010-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= cAMP__21_9_) OR E (F (((cAMP__11_16_ + 1 <= cAMP__29_7_) AND (cAMP__7_13_ <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= cAMP__21_9_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= cAMP__21_9_)
lola: processed formula length: 18
lola: 16 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__11_16_ + 1 <= cAMP__29_7_) AND (cAMP__7_13_ <= 0))))
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__11_16_ + 1 <= cAMP__29_7_) AND (cAMP__7_13_ <= 0))))
lola: processed formula length: 66
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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__11_16_ + 1 <= cAMP__29_7_) AND (cAMP__7_13_ <= 0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Diffusion2D-PT-D30N010-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((cAMP__30_2_ <= 0) OR (cAMP__30_17_ <= 2)) AND ((cAMP__19_30_ <= 0) OR (cAMP__30_8_ <= 0))) AND (A (G ((cAMP__26_20_ <= 2))) AND E (F ((cAMP__25_8_ <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((cAMP__30_2_ <= 0) OR (cAMP__30_17_ <= 2)) AND ((cAMP__19_30_ <= 0) OR (cAMP__30_8_ <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((cAMP__30_2_ <= 0) OR (cAMP__30_17_ <= 2)) AND ((cAMP__19_30_ <= 0) OR (cAMP__30_8_ <= 0)))
lola: processed formula length: 95
lola: 16 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__25_8_ <= 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__25_8_ <= 2)))
lola: processed formula length: 26
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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__25_8_ <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-14-0.sara
lola: lola: state equation: calling and running sara
SUBRESULT
lola: sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-14-0.sara.
result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: lola: subprocess 15 will run for 3524 seconds at most (--localtimelimit=0)
========================================
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__26_20_ <= 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:695
lola: processed formula: A (G ((cAMP__26_20_ <= 2)))
lola: processed formula length: 27
lola: 18 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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:695
lola: formula 0: (3 <= cAMP__26_20_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12634 markings, 42805 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Diffusion2D-PT-D30N010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1760 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((cAMP__30_10_ + 1 <= cAMP__5_27_) OR (cAMP__29_25_ <= 2)))) AND (A (((2 <= cAMP__9_24_) U (1 <= cAMP__10_8_))) OR (cAMP__1_13_ <= cAMP__22_3_)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1760 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (cAMP__1_13_ <= cAMP__22_3_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cAMP__1_13_ <= cAMP__22_3_)
lola: processed formula length: 28
lola: 16 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__30_10_ + 1 <= cAMP__5_27_) OR (cAMP__29_25_ <= 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:695
lola: processed formula: A (G (((cAMP__30_10_ + 1 <= cAMP__5_27_) OR (cAMP__29_25_ <= 2))))
lola: processed formula length: 67
lola: 18 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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:695
lola: formula 0: ((cAMP__5_27_ <= cAMP__30_10_) AND (3 <= cAMP__29_25_))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N010-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N010-CTLCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4930 markings, 16986 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Diffusion2D-PT-D30N010-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((2 <= cAMP__5_30_))))) AND A (G (((cAMP__8_1_ <= 0) AND (cAMP__23_23_ <= cAMP__28_23_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__8_1_ <= 0) AND (cAMP__23_23_ <= cAMP__28_23_))))
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_1_ <= 0) AND (cAMP__23_23_ <= cAMP__28_23_))))
lola: processed formula length: 62
lola: 18 rewrites
lola: closed formula file Diffusion2D-PT-D30N010-CTLCardinality.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: ((1 <= cAMP__8_1_) OR (cAMP__28_23_ + 1 <= cAMP__23_23_))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
========================================
lola: ========================================

FORMULA Diffusion2D-PT-D30N010-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes no no no no no yes yes yes no yes no no
lola:
preliminary result: yes yes no yes no no no no no yes yes yes no yes no no
lola: memory consumption: 29548 KB
lola: time consumption: 50 seconds

BK_STOP 1526683930096

--------------------
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-D30N010"
export BK_EXAMINATION="CTLCardinality"
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-D30N010.tgz
mv Diffusion2D-PT-D30N010 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-D30N010, examination is CTLCardinality"
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-152649937000234"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;