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 7.5M
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K 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 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 7.3M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Diffusion2D-PT-D50N100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649937100306
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526713237660

info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D50N100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D50N100 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ Diffusion2D-PT-D50N100 @ 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: 21904/65536 symbol table entries, 8280 collisions
lola: preprocessing...
lola: Size of bit vector: 80000
lola: finding significant places
lola: 2500 places, 19404 transitions, 2499 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2500 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D50N100-ReachabilityCardinality.task
lola: A (G ((cAMP__2_11_ <= cAMP__19_33_))) : E (F ((cAMP__3_2_ + 1 <= cAMP__19_38_))) : A (G (((cAMP__41_16_ + 1 <= cAMP__23_37_) OR (cAMP__29_15_ <= 1) OR ((cAMP__48_4_ <= 0) AND (cAMP__3_35_ + 1 <= cAMP__6_11_))))) : A (G ((cAMP__5_28_ <= cAMP__27_32_))) : A (G (((1 <= cAMP__16_23_) OR (cAMP__39_16_ <= cAMP__21_36_) OR (cAMP__44_29_ <= cAMP__42_24_)))) : E (F (((cAMP__15_17_ <= cAMP__17_21_) AND ((2 <= cAMP__16_6_) OR ((3 <= cAMP__46_25_) AND (cAMP__43_48_ <= cAMP__13_18_)))))) : E (F (((3 <= cAMP__10_14_) AND (cAMP__40_3_ <= 2) AND (3 <= cAMP__21_20_)))) : A (G (((cAMP__1_12_ <= 1) OR (cAMP__2_22_ <= 2) OR (cAMP__22_10_ <= cAMP__45_33_) OR (3 <= cAMP__7_34_) OR (cAMP__19_48_ <= cAMP__17_3_) OR (cAMP__48_3_ <= cAMP__37_19_)))) : A (G ((cAMP__33_49_ <= cAMP__45_34_))) : A (G ((((cAMP__35_42_ <= cAMP__16_46_) OR (cAMP__46_32_ <= 0)) AND ((cAMP__48_25_ <= cAMP__43_14_) OR ((1 <= cAMP__7_41_) AND (cAMP__49_20_ <= cAMP__9_12_)))))) : A (G ((((2 <= cAMP__36_35_) AND (cAMP__2_27_ <= 0)) OR (((3 <= cAMP__36_3_) OR (cAMP__47_45_ <= cAMP__27_19_)) AND (cAMP__6_44_ <= cAMP__39_42_))))) : A (G ((cAMP__22_9_ <= cAMP__39_2_))) : E (F (((2 <= cAMP__4_36_) AND (cAMP__8_38_ <= cAMP__49_17_)))) : E (F (((1 <= cAMP__16_39_) OR ((3 <= cAMP__8_3_) AND (3 <= cAMP__10_13_))))) : A (G (((3 <= cAMP__28_6_) OR ((cAMP__26_31_ <= cAMP__21_39_) AND (cAMP__37_11_ <= cAMP__22_31_) AND ((cAMP__14_18_ <= cAMP__14_37_) OR (1 <= cAMP__33_11_)))))) : A (G ((cAMP__41_26_ <= cAMP__22_37_)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__2_11_ <= cAMP__19_33_)))
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__2_11_ <= cAMP__19_33_)))
lola: processed formula length: 37
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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__19_33_ + 1 <= cAMP__2_11_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-0.sara.
lola: sara is running 0 secs || 5370 markings, 17373 edges, 1074 markings/sec, 0 secs
lola: sara is running 5 secs || 10757 markings, 33951 edges, 1077 markings/sec, 5 secs
lola: sara is running 10 secs || 16120 markings, 51604 edges, 1073 markings/sec, 10 secs
lola: sara is running 15 secs || 21463 markings, 69262 edges, 1069 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 20 secs || 26850 markings, 85567 edges, 1077 markings/sec, 20 secs
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-D50N100-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__3_2_ + 1 <= cAMP__19_38_)))
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_2_ + 1 <= cAMP__19_38_)))
lola: processed formula length: 40
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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_2_ + 1 <= cAMP__19_38_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__5_28_ <= cAMP__27_32_)))
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__5_28_ <= cAMP__27_32_)))
lola: processed formula length: 37
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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__27_32_ + 1 <= cAMP__5_28_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-2-0.sara.
lola: sara is running 0 secs || 5327 markings, 18933 edges, 1065 markings/sec, 0 secs
lola: sara is running 5 secs || 10667 markings, 37688 edges, 1068 markings/sec, 5 secs
lola: sara is running 10 secs || 15982 markings, 56937 edges, 1063 markings/sec, 10 secs
lola: sara is running 15 secs || 21304 markings, 76005 edges, 1064 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 20 secs || 26634 markings, 94871 edges, 1066 markings/sec, 20 secs
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-D50N100-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__33_49_ <= cAMP__45_34_)))
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__33_49_ <= cAMP__45_34_)))
lola: processed formula length: 38
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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__45_34_ + 1 <= cAMP__33_49_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-3-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 727 markings, 2488 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__22_9_ <= cAMP__39_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__22_9_ <= cAMP__39_2_)))
lola: processed formula length: 36
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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__39_2_ + 1 <= cAMP__22_9_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__41_26_ <= cAMP__22_37_)))
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__41_26_ <= cAMP__22_37_)))
lola: processed formula length: 38
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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__22_37_ + 1 <= cAMP__41_26_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 538 markings, 1918 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__4_36_) AND (cAMP__8_38_ <= cAMP__49_17_))))
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__4_36_) AND (cAMP__8_38_ <= cAMP__49_17_))))
lola: processed formula length: 62
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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__4_36_) AND (cAMP__8_38_ <= cAMP__49_17_))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5092 markings, 17971 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 366 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= cAMP__16_39_) OR ((3 <= cAMP__8_3_) AND (3 <= cAMP__10_13_)))))
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__16_39_) OR ((3 <= cAMP__8_3_) AND (3 <= cAMP__10_13_)))))
lola: processed formula length: 77
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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: ((1 <= cAMP__16_39_) OR ((3 <= cAMP__8_3_) AND (3 <= cAMP__10_13_)))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__10_14_) AND (cAMP__40_3_ <= 2) AND (3 <= cAMP__21_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 (((3 <= cAMP__10_14_) AND (cAMP__40_3_ <= 2) AND (3 <= cAMP__21_20_))))
lola: processed formula length: 76
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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__10_14_) AND (cAMP__40_3_ <= 2) AND (3 <= cAMP__21_20_))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-8-0.sara.
lola: sara is running 0 secs || 5269 markings, 18443 edges, 1054 markings/sec, 0 secs
lola: sara is running 5 secs || 10522 markings, 37096 edges, 1051 markings/sec, 5 secs
lola: sara is running 10 secs || 15786 markings, 55706 edges, 1053 markings/sec, 10 secs
lola: sara is running 15 secs || 21060 markings, 74263 edges, 1055 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 26320 markings, 92677 edges, 1052 markings/sec, 20 secs

lola: sara is running 25 secs || 31480 markings, 110911 edges, 1032 markings/sec, 25 secs
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-D50N100-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= cAMP__16_23_) OR (cAMP__39_16_ <= cAMP__21_36_) OR (cAMP__44_29_ <= cAMP__42_24_))))
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__16_23_) OR (cAMP__39_16_ <= cAMP__21_36_) OR (cAMP__44_29_ <= cAMP__42_24_))))
lola: processed formula length: 99
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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__16_23_ <= 0) AND (cAMP__21_36_ + 1 <= cAMP__39_16_) AND (cAMP__42_24_ + 1 <= cAMP__44_29_))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-9-0.sara.
lola: sara is running 0 secs || 5321 markings, 18381 edges, 1064 markings/sec, 0 secs
lola: sara is running 5 secs || 10543 markings, 36851 edges, 1044 markings/sec, 5 secs
lola: sara is running 10 secs || 15814 markings, 52998 edges, 1054 markings/sec, 10 secs
lola: sara is running 15 secs || 21041 markings, 71014 edges, 1045 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 26254 markings, 89527 edges, 1043 markings/sec, 20 secs

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-D50N100-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__41_16_ + 1 <= cAMP__23_37_) OR (cAMP__29_15_ <= 1) OR ((cAMP__48_4_ <= 0) AND (cAMP__3_35_ + 1 <= cAMP__6_11_)))))
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__41_16_ + 1 <= cAMP__23_37_) OR (cAMP__29_15_ <= 1) OR ((cAMP__48_4_ <= 0) AND (cAMP__3_35_ + 1 <= cAMP__6_11_)))))
lola: processed formula length: 130
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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__23_37_ <= cAMP__41_16_) AND (2 <= cAMP__29_15_) AND ((1 <= cAMP__48_4_) OR (cAMP__6_11_ <= cAMP__3_35_)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1018 markings, 3441 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 647 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__15_17_ <= cAMP__17_21_) AND ((2 <= cAMP__16_6_) OR ((3 <= cAMP__46_25_) AND (cAMP__43_48_ <= cAMP__13_18_))))))
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__15_17_ <= cAMP__17_21_) AND ((2 <= cAMP__16_6_) OR ((3 <= cAMP__46_25_) AND (cAMP__43_48_ <= cAMP__13_18_))))))
lola: processed formula length: 126
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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__15_17_ <= cAMP__17_21_) AND ((2 <= cAMP__16_6_) OR ((3 <= cAMP__46_25_) AND (cAMP__43_48_ <= cAMP__13_18_))))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-11-0.sara.
lola: sara is running 0 secs || 5105 markings, 17892 edges, 1021 markings/sec, 0 secs
lola: sara is running 5 secs || 10249 markings, 35679 edges, 1029 markings/sec, 5 secs
lola: sara is running 10 secs || 15372 markings, 53543 edges, 1025 markings/sec, 10 secs
lola: sara is running 15 secs || 20495 markings, 71761 edges, 1025 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 25617 markings, 89443 edges, 1024 markings/sec, 20 secs

lola: sara is running 25 secs || 30736 markings, 107564 edges, 1024 markings/sec, 25 secs
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-D50N100-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= cAMP__36_35_) AND (cAMP__2_27_ <= 0)) OR (((3 <= cAMP__36_3_) OR (cAMP__47_45_ <= cAMP__27_19_)) AND (cAMP__6_44_ <= cAMP__39_42_)))))
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__36_35_) AND (cAMP__2_27_ <= 0)) OR (((3 <= cAMP__36_3_) OR (cAMP__47_45_ <= cAMP__27_19_)) AND (cAMP__6_44_ <= cAMP__39_42_)))))
lola: processed formula length: 150
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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__36_35_ <= 1) OR (1 <= cAMP__2_27_)) AND (((cAMP__36_3_ <= 2) AND (cAMP__27_19_ + 1 <= cAMP__47_45_)) OR (cAMP__39_42_ + 1 <= cAMP__6_44_)))
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-12-0.sara.
lola: sara is running 0 secs || 5124 markings, 18055 edges, 1025 markings/sec, 0 secs
lola: sara is running 5 secs || 10311 markings, 34323 edges, 1037 markings/sec, 5 secs
lola: sara is running 10 secs || 15468 markings, 51981 edges, 1031 markings/sec, 10 secs
lola: sara is running 15 secs || 20646 markings, 68467 edges, 1036 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 25799 markings, 86292 edges, 1031 markings/sec, 20 secs

lola: sara is running 25 secs || 30939 markings, 104715 edges, 1028 markings/sec, 25 secs
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-D50N100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1058 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= cAMP__28_6_) OR ((cAMP__26_31_ <= cAMP__21_39_) AND (cAMP__37_11_ <= cAMP__22_31_) AND ((cAMP__14_18_ <= cAMP__14_37_) OR (1 <= cAMP__33_11_))))))
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__28_6_) OR ((cAMP__26_31_ <= cAMP__21_39_) AND (cAMP__37_11_ <= cAMP__22_31_) AND ((cAMP__14_18_ <= cAMP__14_37_) OR (1 <= cAMP__33_11_))))))
lola: processed formula length: 161
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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__28_6_ <= 2) AND ((cAMP__21_39_ + 1 <= cAMP__26_31_) OR (cAMP__22_31_ + 1 <= cAMP__37_11_) OR ((cAMP__14_37_ + 1 <= cAMP__14_18_) AND (cAMP__33_11_ <= 0))))
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges

FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((cAMP__35_42_ <= cAMP__16_46_) OR (cAMP__46_32_ <= 0)) AND ((cAMP__48_25_ <= cAMP__43_14_) OR ((1 <= cAMP__7_41_) AND (cAMP__49_20_ <= cAMP__9_12_))))))
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__35_42_ <= cAMP__16_46_) OR (cAMP__46_32_ <= 0)) AND ((cAMP__48_25_ <= cAMP__43_14_) OR ((1 <= cAMP__7_41_) AND (cAMP__49_20_ <= cAMP__9_12_))))))
lola: processed formula length: 162
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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__16_46_ + 1 <= cAMP__35_42_) AND (1 <= cAMP__46_32_)) OR ((cAMP__43_14_ + 1 <= cAMP__48_25_) AND ((cAMP__7_41_ <= 0) OR (cAMP__9_12_ + 1 <= cAMP__49_20_))))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 582 markings, 2024 edges
lola: ========================================

FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__1_12_ <= 1) OR (cAMP__2_22_ <= 2) OR (cAMP__22_10_ <= cAMP__45_33_) OR (3 <= cAMP__7_34_) OR (cAMP__19_48_ <= cAMP__17_3_) OR (cAMP__48_3_ <= cAMP__37_19_))))
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_12_ <= 1) OR (cAMP__2_22_ <= 2) OR (cAMP__22_10_ <= cAMP__45_33_) OR (3 <= cAMP__7_34_) OR (cAMP__19_48_ <= cAMP__17_3_) OR (cAMP__48_3_ <= cAMP__37_19_))))
lola: processed formula length: 177
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N100-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_12_) AND (3 <= cAMP__2_22_) AND (cAMP__45_33_ + 1 <= cAMP__22_10_) AND (cAMP__7_34_ <= 2) AND (cAMP__17_3_ + 1 <= cAMP__19_48_) AND (cAMP__37_19_ + 1 <= cAMP__48_3_))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-15-0.sara.
lola: sara is running 0 secs || 5386 markings, 17507 edges, 1077 markings/sec, 0 secs
lola: sara is running 5 secs || 10837 markings, 35395 edges, 1090 markings/sec, 5 secs
lola: sara is running 10 secs || 16296 markings, 53356 edges, 1092 markings/sec, 10 secs
lola: sara is running 15 secs || 21741 markings, 71152 edges, 1089 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 27192 markings, 88560 edges, 1090 markings/sec, 20 secs

lola: sara is running 25 secs || 32654 markings, 105983 edges, 1092 markings/sec, 25 secs
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-D50N100-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no yes yes no no no no no yes yes no no
lola:
preliminary result: no yes no no no yes yes no no no no no yes yes no no
lola: memory consumption: 40268 KB
lola: time consumption: 427 seconds

BK_STOP 1526713664607

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