fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r083-blw3-152649950600264
Last Updated
June 26, 2018

About the Execution of M4M.struct for Diffusion2D-PT-D40N010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
684.690 124898.00 168112.00 231.20 TTFTTFTFTTFTTFTT normal

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 4.8M
-rw-r--r-- 1 mcc users 4.3K 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 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 3.1K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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.4K 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 4.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is Diffusion2D-PT-D40N010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-blw3-152649950600264
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527449647029


BK_STOP 1527449771927

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Diffusion2D-PT-D40N010 as instance name.
Using Diffusion2D as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': True, 'Extended Free Choice': True, 'State Machine': True, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 75191, 'Memory': 1858.02, 'Tool': 'itstools'}, {'Time': 77404, 'Memory': 1846.1, 'Tool': 'itstools'}, {'Time': 131809, 'Memory': 231.52, 'Tool': 'lola'}, {'Time': 132532, 'Memory': 231.96, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.752989054541102x far from the best tool itstools.
ReachabilityCardinality lola Diffusion2D-PT-D40N010...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
Diffusion2D-PT-D40N010: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
Diffusion2D-PT-D40N010: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ Diffusion2D-PT-D40N010 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 13924/65536 symbol table entries, 3777 collisions
lola: preprocessing...
lola: finding significant places
lola: 1600 places, 12324 transitions, 1599 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1600 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D40N010-ReachabilityCardinality.task
lola: E (F ((((cAMP__17_11_ <= 0) OR (cAMP__12_2_ + 1 <= cAMP__10_34_)) AND (3 <= cAMP__10_18_)))) : E (F (((1 <= cAMP__12_30_) OR ((2 <= cAMP__8_32_) AND (3 <= cAMP__11_4_)) OR (2 <= cAMP__7_19_)))) : A (G (((cAMP__40_18_ <= cAMP__14_27_) OR (cAMP__34_6_ <= cAMP__23_27_) OR ((cAMP__19_25_ <= cAMP__36_6_) AND (1 <= cAMP__18_1_)) OR ((cAMP__14_27_ + 1 <= cAMP__30_17_) AND (cAMP__1_17_ <= 2))))) : E (F (((1 <= cAMP__22_30_) AND (cAMP__40_13_ <= cAMP__11_24_)))) : E (F (((cAMP__15_24_ <= 2) AND (cAMP__35_6_ <= 2) AND (3 <= cAMP__10_13_)))) : A (G ((((cAMP__18_11_ <= 1) OR (cAMP__40_23_ <= 0)) AND ((cAMP__9_5_ <= cAMP__32_22_) OR ((1 <= cAMP__26_34_) AND (1 <= cAMP__32_16_)))))) : E (F ((((cAMP__26_38_ + 1 <= cAMP__5_3_) OR (cAMP__21_17_ + 1 <= cAMP__20_24_)) AND (((1 <= cAMP__35_39_) AND (1 <= cAMP__18_30_)) OR (2 <= cAMP__12_9_))))) : A (G (((cAMP__13_8_ <= cAMP__16_3_) AND (cAMP__13_16_ <= 0)))) : E (F (((3 <= cAMP__3_25_) OR (cAMP__17_19_ + 1 <= cAMP__38_28_)))) : E (F (((cAMP__10_16_ + 1 <= cAMP__3_36_) AND (cAMP__33_23_ + 1 <= cAMP__23_34_) AND (cAMP__30_12_ <= 0)))) : A (G ((cAMP__30_27_ <= cAMP__15_27_))) : E (F ((((cAMP__39_17_ + 1 <= cAMP__32_33_) OR (cAMP__12_36_ + 1 <= cAMP__14_22_)) AND (cAMP__18_15_ <= 2)))) : E (F ((cAMP__15_36_ + 1 <= cAMP__4_11_))) : A (G (((cAMP__29_22_ <= 1) OR (cAMP__26_26_ <= 0) OR ((cAMP__7_17_ + 1 <= cAMP__38_37_) AND (cAMP__22_6_ <= 0))))) : E (F (((cAMP__33_23_ <= 0) AND (cAMP__2_32_ + 1 <= cAMP__17_20_) AND (1 <= cAMP__25_33_)))) : E (F ((1 <= cAMP__40_30_)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__17_11_ <= 0) OR (cAMP__12_2_ + 1 <= cAMP__10_34_)) AND (3 <= cAMP__10_18_))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 9594 markings, 34805 edges, 1919 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17208 markings, 61708 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= cAMP__12_30_) OR ((2 <= cAMP__8_32_) AND (3 <= cAMP__11_4_)) OR (2 <= cAMP__7_19_))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__40_18_ <= cAMP__14_27_) OR (cAMP__34_6_ <= cAMP__23_27_) OR ((cAMP__19_25_ <= cAMP__36_6_) AND (1 <= cAMP__18_1_)) OR ((cAMP__14_27_ + 1 <= cAMP__30_17_) AND (cAMP__1_17_ <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 9959 markings, 35648 edges, 1992 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 19899 markings, 68030 edges, 1988 markings/sec, 5 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= cAMP__22_30_) AND (cAMP__40_13_ <= cAMP__11_24_))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__15_24_ <= 2) AND (cAMP__35_6_ <= 2) AND (3 <= cAMP__10_13_))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 9828 markings, 36001 edges, 1966 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 19650 markings, 71937 edges, 1964 markings/sec, 5 secs

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20954 markings, 76121 edges
lola: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((cAMP__18_11_ <= 1) OR (cAMP__40_23_ <= 0)) AND ((cAMP__9_5_ <= cAMP__32_22_) OR ((1 <= cAMP__26_34_) AND (1 <= cAMP__32_16_))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 109 markings, 350 edges
lola: ========================================
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__26_38_ + 1 <= cAMP__5_3_) OR (cAMP__21_17_ + 1 <= cAMP__20_24_)) AND (((1 <= cAMP__35_39_) AND (1 <= cAMP__18_30_)) OR (2 <= cAMP__12_9_)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1227 markings, 4178 edges
lola: ========================================
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__13_8_ <= cAMP__16_3_) AND (cAMP__13_16_ <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__3_25_) OR (cAMP__17_19_ + 1 <= cAMP__38_28_))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 9642 markings, 31901 edges, 1928 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 19350 markings, 60461 edges, 1942 markings/sec, 5 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 499 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__10_16_ + 1 <= cAMP__3_36_) AND (cAMP__33_23_ + 1 <= cAMP__23_34_) AND (cAMP__30_12_ <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 10031 markings, 34114 edges, 2006 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 20053 markings, 68885 edges, 2004 markings/sec, 5 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 580 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__30_27_ <= cAMP__15_27_)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 9503 markings, 33071 edges, 1901 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 18969 markings, 67488 edges, 1893 markings/sec, 5 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 694 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__39_17_ + 1 <= cAMP__32_33_) OR (cAMP__12_36_ + 1 <= cAMP__14_22_)) AND (cAMP__18_15_ <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 12 will run for 867 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__15_36_ + 1 <= cAMP__4_11_)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 10026 markings, 35093 edges, 2005 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 20143 markings, 70520 edges, 2023 markings/sec, 5 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1152 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__29_22_ <= 1) OR (cAMP__26_26_ <= 0) OR ((cAMP__7_17_ + 1 <= cAMP__38_37_) AND (cAMP__22_6_ <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 233 markings, 659 edges
lola: ========================================
lola: subprocess 14 will run for 1729 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__33_23_ <= 0) AND (cAMP__2_32_ + 1 <= cAMP__17_20_) AND (1 <= cAMP__25_33_))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 15 will run for 3458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= cAMP__40_30_)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes no yes no yes yes no yes yes no yes yes
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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-D40N010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-structural"
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-D40N010.tgz
mv Diffusion2D-PT-D40N010 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 mcc4mcc-structural"
echo " Input is Diffusion2D-PT-D40N010, 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 r083-blw3-152649950600264"
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 ;