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 236K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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.0K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K 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-D05N050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r238-blw3-152732478200035
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528023228879


BK_STOP 1528023271733

--------------------
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-D05N050 as instance name.
Using Diffusion2D as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 257, 'Memory': 107.02, 'Tool': 'lola'}, {'Time': 426, 'Memory': 106.25, 'Tool': 'lola'}, {'Time': 2271277, 'Memory': 3538.34, 'Tool': 'itstools'}, {'Time': 2294037, 'Memory': 3540.8, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola Diffusion2D-PT-D05N050...

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


checking for too many tokens
===========================================================================================
Diffusion2D-PT-D05N050: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ Diffusion2D-PT-D05N050 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 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-D05N050-LTLCardinality.task
lola: A ((((cAMP__4_1_ <= cAMP__5_4_) U (cAMP__3_4_ <= cAMP__1_5_)) U (3 <= cAMP__3_3_))) : A ((G (X ((cAMP__5_4_ <= cAMP__1_3_))) U (cAMP__3_2_ <= cAMP__2_1_))) : A (G (F (G ((2 <= cAMP__4_2_))))) : A (G (G (F (X ((3 <= cAMP__3_5_)))))) : A (G (X (F (F ((cAMP__5_5_ <= cAMP__5_4_)))))) : A ((((1 <= cAMP__1_1_) U (cAMP__3_2_ <= cAMP__5_2_)) U G (X ((3 <= cAMP__5_5_))))) : A (G ((cAMP__3_5_ <= cAMP__4_2_))) : A (((2 <= cAMP__5_3_) U ((cAMP__1_5_ <= cAMP__2_3_) U (1 <= cAMP__5_1_)))) : A ((1 <= cAMP__5_2_)) : A ((X (G ((2 <= cAMP__5_3_))) U F ((1 <= cAMP__4_4_)))) : A (G ((G ((cAMP__4_1_ <= cAMP__2_4_)) U G ((cAMP__5_2_ <= cAMP__4_5_))))) : A ((X (X ((cAMP__4_1_ <= cAMP__1_1_))) U X (F ((cAMP__1_1_ <= cAMP__3_5_))))) : A ((cAMP__4_1_ <= cAMP__3_1_)) : A (G ((X ((cAMP__5_4_ <= cAMP__2_1_)) U (cAMP__1_2_ <= cAMP__1_4_)))) : A (F (((cAMP__4_4_ <= cAMP__4_1_) U X ((1 <= cAMP__5_3_))))) : A (X (F (X ((cAMP__1_1_ <= cAMP__1_3_)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((cAMP__4_1_ <= cAMP__5_4_) U (cAMP__3_4_ <= cAMP__1_5_)) U (3 <= cAMP__3_3_)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((cAMP__4_1_ <= cAMP__5_4_) U (cAMP__3_4_ <= cAMP__1_5_)) U (3 <= cAMP__3_3_)))
lola: processed formula: A ((((cAMP__4_1_ <= cAMP__5_4_) U (cAMP__3_4_ <= cAMP__1_5_)) U (3 <= cAMP__3_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-D05N050-LTLCardinality.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: 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((cAMP__5_4_ <= cAMP__1_3_))) U (cAMP__3_2_ <= cAMP__2_1_)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X ((cAMP__5_4_ <= cAMP__1_3_))) U (cAMP__3_2_ <= cAMP__2_1_)))
lola: processed formula: A ((G (X ((cAMP__5_4_ <= cAMP__1_3_))) U (cAMP__3_2_ <= cAMP__2_1_)))
lola: processed formula length: 69
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G ((2 <= cAMP__4_2_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((2 <= cAMP__4_2_))))
lola: processed formula: A (F (G ((2 <= cAMP__4_2_))))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N050-LTLCardinality.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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (X ((3 <= cAMP__3_5_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (F (X ((3 <= cAMP__3_5_))))))
lola: processed formula: A (G (G (F (X ((3 <= cAMP__3_5_))))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N050-LTLCardinality.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: Formula contains X operator; stubborn sets not applicable
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: 102 markings, 102 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (F (F ((cAMP__5_5_ <= cAMP__5_4_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (F ((cAMP__5_5_ <= cAMP__5_4_)))))
lola: processed formula: A (G (X (F ((cAMP__5_5_ <= cAMP__5_4_)))))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N050-LTLCardinality.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: Formula contains X operator; stubborn sets not applicable
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: 103 markings, 103 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= cAMP__1_1_) U (cAMP__3_2_ <= cAMP__5_2_)) U G (X ((3 <= cAMP__5_5_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= cAMP__1_1_) U (cAMP__3_2_ <= cAMP__5_2_)) U G (X ((3 <= cAMP__5_5_)))))
lola: processed formula: A ((((1 <= cAMP__1_1_) U (cAMP__3_2_ <= cAMP__5_2_)) U G (X ((3 <= cAMP__5_5_)))))
lola: processed formula length: 82
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 340 markings, 436 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__3_5_ <= cAMP__4_2_)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: 592 markings, 1035 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= cAMP__5_3_) U ((cAMP__1_5_ <= cAMP__2_3_) U (1 <= cAMP__5_1_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= cAMP__5_3_) U ((cAMP__1_5_ <= cAMP__2_3_) U (1 <= cAMP__5_1_))))
lola: processed formula: A (((2 <= cAMP__5_3_) U ((cAMP__1_5_ <= cAMP__2_3_) U (1 <= cAMP__5_1_))))
lola: processed formula length: 74
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N050-LTLCardinality.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: 251 markings, 251 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= cAMP__5_2_))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= cAMP__5_2_)
lola: processed formula length: 17
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N050-LTLCardinality.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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((2 <= cAMP__5_3_))) U F ((1 <= cAMP__4_4_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((2 <= cAMP__5_3_))) U F ((1 <= cAMP__4_4_))))
lola: processed formula: A ((X (G ((2 <= cAMP__5_3_))) U F ((1 <= cAMP__4_4_))))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N050-LTLCardinality.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: Formula contains X operator; stubborn sets not applicable
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: 201 markings, 201 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((cAMP__4_1_ <= cAMP__2_4_)) U G ((cAMP__5_2_ <= cAMP__4_5_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((G ((cAMP__4_1_ <= cAMP__2_4_)) U G ((cAMP__5_2_ <= cAMP__4_5_)))))
lola: processed formula: A (G ((G ((cAMP__4_1_ <= cAMP__2_4_)) U G ((cAMP__5_2_ <= cAMP__4_5_)))))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 bytes per marking, with 28 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: 268 markings, 398 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((cAMP__4_1_ <= cAMP__1_1_))) U X (F ((cAMP__1_1_ <= cAMP__3_5_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((cAMP__4_1_ <= cAMP__1_1_)) U F ((cAMP__1_1_ <= cAMP__3_5_)))))
lola: processed formula: A (X ((X ((cAMP__4_1_ <= cAMP__1_1_)) U F ((cAMP__1_1_ <= cAMP__3_5_)))))
lola: processed formula length: 73
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N050-LTLCardinality.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: Formula contains X operator; stubborn sets not applicable
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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((cAMP__4_1_ <= cAMP__3_1_))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cAMP__4_1_ <= cAMP__3_1_)
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N050-LTLCardinality.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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((cAMP__5_4_ <= cAMP__2_1_)) U (cAMP__1_2_ <= cAMP__1_4_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((X ((cAMP__5_4_ <= cAMP__2_1_)) U (cAMP__1_2_ <= cAMP__1_4_))))
lola: processed formula: A (G ((X ((cAMP__5_4_ <= cAMP__2_1_)) U (cAMP__1_2_ <= cAMP__1_4_))))
lola: processed formula length: 69
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 336 markings, 613 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((cAMP__4_4_ <= cAMP__4_1_) U X ((1 <= cAMP__5_3_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((cAMP__4_4_ <= cAMP__4_1_) U X ((1 <= cAMP__5_3_)))))
lola: processed formula: A (F (((cAMP__4_4_ <= cAMP__4_1_) U X ((1 <= cAMP__5_3_)))))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N050-LTLCardinality.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: Formula contains X operator; stubborn sets not applicable
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: 102 markings, 102 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X ((cAMP__1_1_ <= cAMP__1_3_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X ((cAMP__1_1_ <= cAMP__1_3_)))))
lola: processed formula: A (X (F (X ((cAMP__1_1_ <= cAMP__1_3_)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D05N050-LTLCardinality.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: Formula contains X operator; stubborn sets not applicable
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: 316 markings, 386 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no no no no no no no no yes yes no no no
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D05N050-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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-D05N050"
export BK_EXAMINATION="LTLCardinality"
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-D05N050.tgz
mv Diffusion2D-PT-D05N050 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-D05N050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r238-blw3-152732478200035"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;