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 240K
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 55K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Diffusion2D-PT-D05N010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-blw3-152649949400115
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527406218026


BK_STOP 1527407031996

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Diffusion2D-PT-D05N010 as instance name.
Using Diffusion2D as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 3127, 'Memory': 135.23, 'Tool': 'gspn'}, {'Time': 5226, 'Memory': 254.27, 'Tool': 'itstools'}, {'Time': 6087, 'Memory': 258.47, 'Tool': 'itstools'}, {'Time': 7410, 'Memory': 161.69, 'Tool': 'gspn'}, {'Time': 16626, 'Memory': 7483.97, 'Tool': 'marcie'}, {'Time': 18488, 'Memory': 7483.64, 'Tool': 'marcie'}, {'Time': 2289092, 'Memory': 10547.59, 'Tool': 'lola'}, {'Time': 2289449, 'Memory': 10785.29, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 732.0409338023665x far from the best tool gspn.
CTLCardinality lola Diffusion2D-PT-D05N010...

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


checking for too many tokens
===========================================================================================
Diffusion2D-PT-D05N010: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ Diffusion2D-PT-D05N010 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 169/65536 symbol table entries, 4 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 144 transitions, 24 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D05N010-CTLCardinality.task
lola: ((1 <= cAMP__5_3_) OR A (G (((cAMP__2_5_ <= 2) OR (cAMP__2_5_ + 1 <= cAMP__4_1_))))) : E ((E (F ((cAMP__3_1_ <= cAMP__5_5_))) U A (G ((cAMP__5_4_ <= cAMP__3_3_))))) : A (F (NOT(E (F ((3 <= cAMP__2_5_)))))) : E (G ((E (F ((3 <= cAMP__5_1_))) AND (cAMP__5_1_ <= 0)))) : (A ((((cAMP__2_2_ <= cAMP__3_5_) OR (cAMP__4_2_ <= cAMP__3_1_)) U ((1 <= cAMP__1_2_) AND (1 <= cAMP__2_4_)))) OR (E (F (((cAMP__3_3_ <= cAMP__5_5_) AND (3 <= cAMP__1_2_)))) AND (((3 <= cAMP__3_3_) OR (cAMP__4_3_ <= cAMP__1_2_)) AND (cAMP__5_4_ <= cAMP__2_3_)))) : E ((((cAMP__4_5_ <= 1) OR (2 <= cAMP__3_5_)) U ((3 <= cAMP__5_1_) AND (cAMP__1_1_ + 1 <= cAMP__4_5_)))) : (E (F ((3 <= cAMP__3_1_))) AND E (F (E (G ((1 <= cAMP__4_1_)))))) : A ((A (G ((cAMP__2_5_ <= cAMP__3_5_))) U (cAMP__4_3_ + 1 <= cAMP__3_4_))) : (cAMP__5_2_ <= cAMP__3_4_) : (((E (G ((3 <= cAMP__3_5_))) OR (cAMP__3_4_ <= cAMP__1_1_)) OR ((cAMP__1_4_ + 1 <= cAMP__4_5_) AND ((cAMP__4_5_ <= cAMP__3_1_) OR (cAMP__5_3_ <= cAMP__5_4_) OR (2 <= cAMP__5_2_) OR (2 <= cAMP__1_1_)))) AND (E (G ((3 <= cAMP__3_3_))) AND (E (F ((cAMP__5_4_ <= cAMP__3_2_))) OR E (G ((cAMP__2_1_ <= cAMP__5_3_)))))) : ((E (F ((2 <= cAMP__1_5_))) OR A (X ((cAMP__3_3_ <= cAMP__3_4_)))) OR (cAMP__2_5_ <= cAMP__1_3_)) : NOT((A (F (((1 <= cAMP__5_1_) OR (cAMP__3_5_ <= cAMP__1_1_)))) AND ((cAMP__1_2_ + 1 <= cAMP__1_3_) AND (cAMP__5_4_ <= cAMP__5_1_) AND (((1 <= cAMP__2_3_) AND (cAMP__5_2_ <= cAMP__2_5_)) OR (cAMP__5_5_ + 1 <= cAMP__4_3_))))) : NOT(E (G (((3 <= cAMP__4_3_) AND (cAMP__2_4_ <= 0))))) : E ((E (G ((cAMP__5_5_ <= cAMP__5_2_))) U ((2 <= cAMP__3_1_) AND (cAMP__4_5_ <= cAMP__1_2_) AND (3 <= cAMP__3_3_) AND (3 <= cAMP__4_5_)))) : ((A (F ((3 <= cAMP__4_1_))) AND (((cAMP__1_5_ <= 0) OR ((3 <= cAMP__5_5_) AND (cAMP__1_3_ <= cAMP__5_3_))) OR A (F ((cAMP__3_3_ <= cAMP__1_3_))))) OR A (((1 <= cAMP__5_1_) U (3 <= cAMP__3_1_)))) : (NOT((E (F ((2 <= cAMP__2_2_))) AND E (F ((3 <= cAMP__1_1_))))) OR (cAMP__5_4_ <= cAMP__1_5_))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= cAMP__5_3_) OR A (G (((cAMP__2_5_ <= 2) OR (cAMP__2_5_ + 1 <= cAMP__4_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= cAMP__5_3_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= cAMP__5_3_)
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__2_5_ <= 2) OR (cAMP__2_5_ + 1 <= cAMP__4_1_))))
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 96 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-D05N010-CTLCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 134 markings, 290 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((cAMP__3_1_ <= cAMP__5_5_))) U A (G ((cAMP__5_4_ <= cAMP__3_3_)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (cAMP__3_1_ <= cAMP__5_5_)) U NOT(E(TRUE U (cAMP__3_3_ + 1 <= cAMP__5_4_))))
lola: processed formula length: 87
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 888971 markings, 7553707 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1674179 markings, 14477900 edges, 157042 markings/sec, 5 secs
lola: 2413217 markings, 21063196 edges, 147808 markings/sec, 10 secs
lola: 3116110 markings, 27423016 edges, 140579 markings/sec, 15 secs
lola: 3807390 markings, 33626991 edges, 138256 markings/sec, 20 secs
lola: 4489480 markings, 39735379 edges, 136418 markings/sec, 25 secs
lola: 5147292 markings, 45671227 edges, 131562 markings/sec, 30 secs
lola: 5792543 markings, 51560357 edges, 129050 markings/sec, 35 secs
lola: 6370495 markings, 57089976 edges, 115590 markings/sec, 40 secs
lola: 6910064 markings, 62391707 edges, 107914 markings/sec, 45 secs
lola: 7525517 markings, 68072918 edges, 123091 markings/sec, 50 secs
lola: 8215506 markings, 74158832 edges, 137998 markings/sec, 55 secs
lola: 8853935 markings, 79948897 edges, 127686 markings/sec, 60 secs
lola: 9484435 markings, 85659324 edges, 126100 markings/sec, 65 secs
lola: 10059976 markings, 91049220 edges, 115108 markings/sec, 70 secs
lola: 10661772 markings, 96612236 edges, 120359 markings/sec, 75 secs
lola: 11288226 markings, 102329496 edges, 125291 markings/sec, 80 secs
lola: 11829496 markings, 107526390 edges, 108254 markings/sec, 85 secs
lola: 12430205 markings, 112994043 edges, 120142 markings/sec, 90 secs
lola: 13028417 markings, 118478371 edges, 119642 markings/sec, 95 secs
lola: 13547900 markings, 123510836 edges, 103897 markings/sec, 100 secs
lola: 14096954 markings, 128785972 edges, 109811 markings/sec, 105 secs
lola: 14666856 markings, 134131501 edges, 113980 markings/sec, 110 secs
lola: 15201849 markings, 139270577 edges, 106999 markings/sec, 115 secs
lola: 15734584 markings, 144414297 edges, 106547 markings/sec, 120 secs
lola: 16310637 markings, 149719188 edges, 115211 markings/sec, 125 secs
lola: 16865849 markings, 154902289 edges, 111042 markings/sec, 130 secs
lola: 17370824 markings, 159769971 edges, 100995 markings/sec, 135 secs
lola: 17925841 markings, 164862437 edges, 111003 markings/sec, 140 secs
lola: 18395402 markings, 169412890 edges, 93912 markings/sec, 145 secs
lola: 18897314 markings, 174132709 edges, 100382 markings/sec, 150 secs
lola: 19354337 markings, 178688629 edges, 91405 markings/sec, 155 secs
lola: 19908498 markings, 183797740 edges, 110832 markings/sec, 160 secs
lola: 20384699 markings, 188501532 edges, 95240 markings/sec, 165 secs
lola: 20890130 markings, 193373833 edges, 101086 markings/sec, 170 secs
lola: 21372222 markings, 198115745 edges, 96418 markings/sec, 175 secs
lola: 21864402 markings, 202804184 edges, 98436 markings/sec, 180 secs
lola: 22386937 markings, 207720313 edges, 104507 markings/sec, 185 secs
lola: 22917727 markings, 212653497 edges, 106158 markings/sec, 190 secs
lola: 23371276 markings, 217120011 edges, 90710 markings/sec, 195 secs
lola: 23865712 markings, 221825358 edges, 98887 markings/sec, 200 secs
lola: 24380612 markings, 226623378 edges, 102980 markings/sec, 205 secs
lola: 24884009 markings, 231348148 edges, 100679 markings/sec, 210 secs
lola: 25349738 markings, 235919341 edges, 93146 markings/sec, 215 secs
lola: 25821572 markings, 240509147 edges, 94367 markings/sec, 220 secs
lola: 26284258 markings, 244996143 edges, 92537 markings/sec, 225 secs
lola: 26748150 markings, 249555881 edges, 92778 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (F ((3 <= cAMP__2_5_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((cAMP__2_5_ <= 2)))))
lola: processed formula: A (F (A (G ((cAMP__2_5_ <= 2)))))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 418 markings, 1474 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((3 <= cAMP__5_1_))) AND (cAMP__5_1_ <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U (3 <= cAMP__5_1_))) OR (1 <= cAMP__5_1_))))
lola: processed formula length: 70
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 999 markings, 3783 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((cAMP__2_2_ <= cAMP__3_5_) OR (cAMP__4_2_ <= cAMP__3_1_)) U ((1 <= cAMP__1_2_) AND (1 <= cAMP__2_4_)))) OR (E (F (((cAMP__3_3_ <= cAMP__5_5_) AND (3 <= cAMP__1_2_)))) AND (((3 <= cAMP__3_3_) OR (cAMP__4_3_ <= cAMP__1_2_)) AND (cAMP__5_4_ <= cAMP__2_3_))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((cAMP__2_2_ <= cAMP__3_5_) OR (cAMP__4_2_ <= cAMP__3_1_)) U ((1 <= cAMP__1_2_) AND (1 <= cAMP__2_4_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((cAMP__2_2_ <= cAMP__3_5_) OR (cAMP__4_2_ <= cAMP__3_1_)) U ((1 <= cAMP__1_2_) AND (1 <= cAMP__2_4_))))
lola: processed formula: A ((((cAMP__2_2_ <= cAMP__3_5_) OR (cAMP__4_2_ <= cAMP__3_1_)) U ((1 <= cAMP__1_2_) AND (1 <= cAMP__2_4_))))
lola: processed formula length: 109
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 31 markings, 31 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__3_3_ <= cAMP__5_5_) AND (3 <= cAMP__1_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 96 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-D05N010-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= cAMP__3_3_) OR (cAMP__4_3_ <= cAMP__1_2_)) AND (cAMP__5_4_ <= cAMP__2_3_))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((3 <= cAMP__3_3_) OR (cAMP__4_3_ <= cAMP__1_2_)) AND (cAMP__5_4_ <= cAMP__2_3_))
lola: processed formula length: 83
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((cAMP__4_5_ <= 1) OR (2 <= cAMP__3_5_)) U ((3 <= cAMP__5_1_) AND (cAMP__1_1_ + 1 <= cAMP__4_5_))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((cAMP__4_5_ <= 1) OR (2 <= cAMP__3_5_)) U ((3 <= cAMP__5_1_) AND (cAMP__1_1_ + 1 <= cAMP__4_5_)))
lola: processed formula length: 101
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 17635 markings, 81924 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= cAMP__3_1_))) AND E (F (E (G ((1 <= cAMP__4_1_))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cAMP__3_1_)))
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 96 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((1 <= cAMP__4_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (cAMP__4_1_ <= 0))))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 73 markings, 186 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((cAMP__2_5_ <= cAMP__3_5_))) U (cAMP__4_3_ + 1 <= cAMP__3_4_)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((A (G ((cAMP__2_5_ <= cAMP__3_5_))) U (cAMP__4_3_ + 1 <= cAMP__3_4_)))
lola: processed formula: A ((A (G ((cAMP__2_5_ <= cAMP__3_5_))) U (cAMP__4_3_ + 1 <= cAMP__3_4_)))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 82 markings, 114 edges
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (cAMP__5_2_ <= cAMP__3_4_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cAMP__5_2_ <= cAMP__3_4_)
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-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 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G ((3 <= cAMP__3_5_))) OR (cAMP__3_4_ <= cAMP__1_1_)) OR ((cAMP__1_4_ + 1 <= cAMP__4_5_) AND ((cAMP__4_5_ <= cAMP__3_1_) OR (cAMP__5_3_ <= cAMP__5_4_) OR (2 <= cAMP__5_2_) OR (2 <= cAMP__1_1_)))) AND (E (G ((3 <= cAMP__3_3_))) AND (E (F ((cAMP__5_4_ <= cAMP__3_2_))) OR E (G ((cAMP__2_1_ <= cAMP__5_3_))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= cAMP__3_5_)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (cAMP__3_5_ <= 2)))
lola: processed formula length: 32
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((cAMP__3_4_ <= cAMP__1_1_) OR ((cAMP__1_4_ + 1 <= cAMP__4_5_) AND ((cAMP__4_5_ <= cAMP__3_1_) OR (cAMP__5_3_ <= cAMP__5_4_) OR (2 <= cAMP__5_2_) OR (2 <= cAMP__1_1_))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cAMP__3_4_ <= cAMP__1_1_) OR ((cAMP__1_4_ + 1 <= cAMP__4_5_) AND ((cAMP__4_5_ <= cAMP__3_1_) OR (cAMP__5_3_ <= cAMP__5_4_) OR (2 <= cAMP__5_2_) OR (2 <= cAMP__1_1_))))
lola: processed formula length: 172
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: processed formula with 6 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 11 will run for 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= cAMP__3_3_)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (cAMP__3_3_ <= 2)))
lola: processed formula length: 32
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 24 markings, 24 edges
lola: ========================================
lola: subprocess 12 will run for 825 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__5_4_ <= cAMP__3_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 96 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to Diffusion2D-PT-D05N010-CTLCardinality-12.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((2 <= cAMP__1_5_))) OR A (X ((cAMP__3_3_ <= cAMP__3_4_)))) OR (cAMP__2_5_ <= cAMP__1_3_))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= cAMP__1_5_)))
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 96 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Diffusion2D-PT-D05N010-CTLCardinality-10.sara
lola: The predicate is reachable.
lola: 8 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F (((1 <= cAMP__5_1_) OR (cAMP__3_5_ <= cAMP__1_1_)))) AND ((cAMP__1_2_ + 1 <= cAMP__1_3_) AND (cAMP__5_4_ <= cAMP__5_1_) AND (((1 <= cAMP__2_3_) AND (cAMP__5_2_ <= cAMP__2_5_)) OR (cAMP__5_5_ + 1 <= cAMP__4_3_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: sara: try reading problem file Diffusion2D-PT-D05N010-CTLCardinality-10.sara.subprocess 11 will run for 660 seconds at most (--localtimelimit=-1)

lola: ========================================
lola: ...considering subproblem: E (G (((cAMP__5_1_ <= 0) AND (cAMP__1_1_ + 1 <= cAMP__3_5_))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= cAMP__5_1_) OR (cAMP__3_5_ <= cAMP__1_1_))))
lola: processed formula length: 65
lola: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 825 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((cAMP__1_3_ <= cAMP__1_2_) OR (cAMP__5_1_ + 1 <= cAMP__5_4_) OR (((cAMP__2_3_ <= 0) OR (cAMP__2_5_ + 1 <= cAMP__5_2_)) AND (cAMP__4_3_ <= cAMP__5_5_)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cAMP__1_3_ <= cAMP__1_2_) OR (cAMP__5_1_ + 1 <= cAMP__5_4_) OR (((cAMP__2_3_ <= 0) OR (cAMP__2_5_ + 1 <= cAMP__5_2_)) AND (cAMP__4_3_ <= cAMP__5_5_)))
lola: processed formula length: 155
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: processed formula with 5 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: ========================================
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

lola: subprocess 12 will run for 825 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (((3 <= cAMP__4_3_) AND (cAMP__2_4_ <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((cAMP__4_3_ <= 2) OR (1 <= cAMP__2_4_))))
lola: processed formula: A (F (((cAMP__4_3_ <= 2) OR (1 <= cAMP__2_4_))))
lola: processed formula length: 49
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1101 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (G ((cAMP__5_5_ <= cAMP__5_2_))) U ((2 <= cAMP__3_1_) AND (cAMP__4_5_ <= cAMP__1_2_) AND (3 <= cAMP__3_3_) AND (3 <= cAMP__4_5_))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(A(TRUE U (cAMP__5_2_ + 1 <= cAMP__5_5_))) U ((2 <= cAMP__3_1_) AND (cAMP__4_5_ <= cAMP__1_2_) AND (3 <= cAMP__3_3_) AND (3 <= cAMP__4_5_)))
lola: processed formula length: 145
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 913248 markings, 6941280 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1672502 markings, 12973550 edges, 151851 markings/sec, 5 secs
lola: 2369939 markings, 18648982 edges, 139487 markings/sec, 10 secs
lola: 3101234 markings, 24397833 edges, 146259 markings/sec, 15 secs
lola: 3822887 markings, 30014977 edges, 144331 markings/sec, 20 secs
lola: 4502732 markings, 35450796 edges, 135969 markings/sec, 25 secs
lola: 5142160 markings, 40653752 edges, 127886 markings/sec, 30 secs
lola: 5724258 markings, 45601539 edges, 116420 markings/sec, 35 secs
lola: 6340193 markings, 50676764 edges, 123187 markings/sec, 40 secs
lola: 6991804 markings, 55845667 edges, 130322 markings/sec, 45 secs
lola: 7560565 markings, 60712270 edges, 113752 markings/sec, 50 secs
lola: 8264656 markings, 66058652 edges, 140818 markings/sec, 55 secs
lola: 8812110 markings, 70776327 edges, 109491 markings/sec, 60 secs
lola: 9474292 markings, 75894361 edges, 132436 markings/sec, 65 secs
lola: 9982584 markings, 80409825 edges, 101658 markings/sec, 70 secs
lola: 10582456 markings, 85250970 edges, 119974 markings/sec, 75 secs
lola: 11218130 markings, 90269858 edges, 127135 markings/sec, 80 secs
lola: 11818592 markings, 95154437 edges, 120092 markings/sec, 85 secs
lola: 12477062 markings, 100231186 edges, 131694 markings/sec, 90 secs
lola: 13059508 markings, 105013993 edges, 116489 markings/sec, 95 secs
lola: 13644468 markings, 109732088 edges, 116992 markings/sec, 100 secs
lola: 14229887 markings, 114445993 edges, 117084 markings/sec, 105 secs
lola: 14920895 markings, 119430654 edges, 138202 markings/sec, 110 secs
lola: 15550557 markings, 124365040 edges, 125932 markings/sec, 115 secs
lola: 16081457 markings, 128868679 edges, 106180 markings/sec, 120 secs
lola: 16619220 markings, 133373048 edges, 107553 markings/sec, 125 secs
lola: 17271078 markings, 138275322 edges, 130372 markings/sec, 130 secs
lola: 17776732 markings, 142646684 edges, 101131 markings/sec, 135 secs
lola: 18376395 markings, 147301183 edges, 119933 markings/sec, 140 secs
lola: 18989212 markings, 152008204 edges, 122563 markings/sec, 145 secs
lola: 19501537 markings, 156381488 edges, 102465 markings/sec, 150 secs
lola: 20132642 markings, 161098058 edges, 126221 markings/sec, 155 secs
lola: 20643354 markings, 165462604 edges, 102142 markings/sec, 160 secs
lola: 21139235 markings, 169822307 edges, 99176 markings/sec, 165 secs
lola: 21648143 markings, 174043417 edges, 101782 markings/sec, 170 secs
lola: 22129869 markings, 178258595 edges, 96345 markings/sec, 175 secs
lola: 22661551 markings, 182687233 edges, 106336 markings/sec, 180 secs
lola: 23215029 markings, 187127755 edges, 110696 markings/sec, 185 secs
lola: 23685578 markings, 191296096 edges, 94110 markings/sec, 190 secs
lola: 24285636 markings, 195920628 edges, 120012 markings/sec, 195 secs
lola: 24756474 markings, 200026155 edges, 94168 markings/sec, 200 secs
lola: 25242874 markings, 204178911 edges, 97280 markings/sec, 205 secs
lola: 25804661 markings, 208589797 edges, 112357 markings/sec, 210 secs
lola: 26334401 markings, 212906666 edges, 105948 markings/sec, 215 secs
lola: 26872881 markings, 217209462 edges, 107696 markings/sec, 220 secs
lola: 27424166 markings, 221558029 edges, 110257 markings/sec, 225 secs
lola: 27890228 markings, 225574889 edges, 93212 markings/sec, 230 secs
lola: 28334020 markings, 229476735 edges, 88758 markings/sec, 235 secs
lola: 28865168 markings, 233739260 edges, 106230 markings/sec, 240 secs
lola: 29342812 markings, 237775376 edges, 95529 markings/sec, 245 secs
lola: 29897510 markings, 242118496 edges, 110940 markings/sec, 250 secs
lola: 30406499 markings, 246228490 edges, 101798 markings/sec, 255 secs
lola: 30931911 markings, 250430565 edges, 105082 markings/sec, 260 secs
lola: 31485674 markings, 254759675 edges, 110753 markings/sec, 265 secs
lola: 31976746 markings, 258875883 edges, 98214 markings/sec, 270 secs
lola: 32520378 markings, 263156853 edges, 108726 markings/sec, 275 secs
lola: 32983762 markings, 267150622 edges, 92677 markings/sec, 280 secs
lola: 33526508 markings, 271412898 edges, 108549 markings/sec, 285 secs
lola: 34050419 markings, 275590076 edges, 104782 markings/sec, 290 secs
lola: 34567662 markings, 279739811 edges, 103449 markings/sec, 295 secs
lola: 35091031 markings, 283917080 edges, 104674 markings/sec, 300 secs
lola: 35581654 markings, 287939563 edges, 98125 markings/sec, 305 secs
lola: 36102089 markings, 292073831 edges, 104087 markings/sec, 310 secs
lola: 36696720 markings, 296504970 edges, 118926 markings/sec, 315 secs
lola: 37228795 markings, 300666110 edges, 106415 markings/sec, 320 secs
lola: 37709824 markings, 304631007 edges, 96206 markings/sec, 325 secs
lola: 38181862 markings, 308614222 edges, 94408 markings/sec, 330 secs
lola: 38638484 markings, 312487429 edges, 91324 markings/sec, 335 secs
lola: 39181888 markings, 316704978 edges, 108681 markings/sec, 340 secs
lola: 39683787 markings, 320702016 edges, 100380 markings/sec, 345 secs
lola: 40157588 markings, 324634347 edges, 94760 markings/sec, 350 secs
lola: 40628097 markings, 328535286 edges, 94102 markings/sec, 355 secs
lola: 41107985 markings, 332455191 edges, 95978 markings/sec, 360 secs
lola: 41664826 markings, 336732288 edges, 111368 markings/sec, 365 secs
lola: 42195454 markings, 340867641 edges, 106126 markings/sec, 370 secs
lola: 42637045 markings, 344653343 edges, 88318 markings/sec, 375 secs
lola: 43150357 markings, 348628950 edges, 102662 markings/sec, 380 secs
lola: 43637212 markings, 352587043 edges, 97371 markings/sec, 385 secs
lola: 44083841 markings, 356340702 edges, 89326 markings/sec, 390 secs
lola: 44545983 markings, 360144226 edges, 92428 markings/sec, 395 secs
lola: 44951936 markings, 363775199 edges, 81191 markings/sec, 400 secs
lola: 45393144 markings, 367502162 edges, 88242 markings/sec, 405 secs
lola: 45867828 markings, 371352769 edges, 94937 markings/sec, 410 secs
lola: 46363920 markings, 375224756 edges, 99218 markings/sec, 415 secs
lola: 46830345 markings, 379009806 edges, 93285 markings/sec, 420 secs
lola: 47371597 markings, 383125777 edges, 108250 markings/sec, 425 secs
lola: 47862579 markings, 387027858 edges, 98196 markings/sec, 430 secs
lola: 48410301 markings, 391112903 edges, 109544 markings/sec, 435 secs
lola: 48891287 markings, 394939953 edges, 96197 markings/sec, 440 secs
lola: 49318813 markings, 398613032 edges, 85505 markings/sec, 445 secs
lola: 49760593 markings, 402315521 edges, 88356 markings/sec, 450 secs
lola: 50263863 markings, 406257265 edges, 100654 markings/sec, 455 secs
lola: 50712512 markings, 410007438 edges, 89730 markings/sec, 460 secs
lola: 51181826 markings, 413851221 edges, 93863 markings/sec, 465 secs
lola: 51653680 markings, 417649843 edges, 94371 markings/sec, 470 secs
lola: 52100705 markings, 421320800 edges, 89405 markings/sec, 475 secs
lola: 52566897 markings, 425108646 edges, 93238 markings/sec, 480 secs
lola: 53003296 markings, 428787657 edges, 87280 markings/sec, 485 secs
lola: 53088179 markings, 429385585 edges, 16977 markings/sec, 490 secs
lola: 53093228 markings, 429424755 edges, 1010 markings/sec, 495 secs
lola: 53094832 markings, 429438476 edges, 321 markings/sec, 500 secs
lola: 53097161 markings, 429459148 edges, 466 markings/sec, 505 secs
lola: 53097947 markings, 429466648 edges, 157 markings/sec, 510 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1385 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((3 <= cAMP__4_1_))) AND (((cAMP__1_5_ <= 0) OR ((3 <= cAMP__5_5_) AND (cAMP__1_3_ <= cAMP__5_3_))) OR A (F ((cAMP__3_3_ <= cAMP__1_3_))))) OR A (((1 <= cAMP__5_1_) U (3 <= cAMP__3_1_))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1385 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= cAMP__4_1_)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= cAMP__4_1_)))
lola: processed formula: A (F ((3 <= cAMP__4_1_)))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 14 edges
lola: subprocess 15 will run for 2770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((1 <= cAMP__5_1_) U (3 <= cAMP__3_1_)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= cAMP__5_1_) U (3 <= cAMP__3_1_)))
lola: processed formula: A (((1 <= cAMP__5_1_) U (3 <= cAMP__3_1_)))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (F ((2 <= cAMP__2_2_))) AND E (F ((3 <= cAMP__1_1_))))) OR (cAMP__5_4_ <= cAMP__1_5_))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__2_2_ <= 1)))
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 96 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (cAMP__5_4_ <= cAMP__1_5_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cAMP__5_4_ <= cAMP__1_5_)
lola: processed formula length: 26
lola: 8 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N010-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no yes yes yes yes no yes yes yes yes yes unknown no yes
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished 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-D05N010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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-D05N010.tgz
mv Diffusion2D-PT-D05N010 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-full"
echo " Input is Diffusion2D-PT-D05N010, 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 r082-blw3-152649949400115"
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 ;