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 59M
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K 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 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 59M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is NeighborGrid-PT-d5n4m1t35, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-csrt-152732587400067
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527830774973


BK_STOP 1527832167202

--------------------
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 NeighborGrid-PT-d5n4m1t35 as instance name.
Using NeighborGrid 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': 884612, 'Memory': 4190.2, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola NeighborGrid-PT-d5n4m1t35...

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


checking for too many tokens
===========================================================================================
NeighborGrid-PT-d5n4m1t35: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ NeighborGrid-PT-d5n4m1t35 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 197632/65536 symbol table entries, 177787 collisions
lola: preprocessing...
lola: finding significant places
lola: 1024 places, 196608 transitions, 1023 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1024 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: A (F (F (X ((2 <= p_0_1_1_3_3))))) : A (X ((2 <= p_1_3_1_1_1))) : A ((X ((1 <= p_3_1_3_0_2)) U G (G ((1 <= p_0_1_0_3_1))))) : A ((3 <= p_0_2_0_2_0)) : A (X (G (F ((2 <= p_0_2_1_0_2))))) : A ((p_3_3_0_3_1 <= p_3_1_3_3_1)) : A (X (X (F (X ((2 <= p_1_0_0_0_0)))))) : A (F ((p_1_1_1_1_2 <= p_0_3_3_1_3))) : A (G ((p_0_0_3_2_1 <= p_3_0_0_3_3))) : A ((((1 <= p_1_3_2_0_3) U (3 <= p_3_1_3_0_1)) U ((1 <= p_2_0_0_2_3) U (p_3_0_1_0_3 <= p_3_2_0_1_0)))) : A (X (G (F (G ((2 <= p_0_2_0_0_3)))))) : A (F ((G ((p_3_0_0_0_1 <= p_0_1_1_0_0)) U F ((p_1_2_3_0_3 <= p_0_3_2_1_2))))) : A ((1 <= p_3_2_1_3_0)) : A (X ((p_0_3_1_3_3 <= p_2_0_3_2_3))) : A (G (G (((2 <= p_1_1_3_1_3) U (p_0_0_1_1_0 <= p_3_0_0_0_2))))) : A (F (F (F (F ((p_3_0_3_0_1 <= p_3_0_1_3_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 (F (F (X ((2 <= p_0_1_1_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((2 <= p_0_1_1_3_3))))
lola: processed formula: A (F (X ((2 <= p_0_1_1_3_3))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 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: 4532 markings, 4531 edges, 906 markings/sec, 0 secs
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: 9798 markings, 9798 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p_1_3_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((2 <= p_1_3_1_1_1)))
lola: processed formula: A (X ((2 <= p_1_3_1_1_1)))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 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: 5421 markings, 5420 edges, 1084 markings/sec, 0 secs
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: 8161 markings, 8161 edges
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((1 <= p_3_1_3_0_2)) U G (G ((1 <= p_0_1_0_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((1 <= p_3_1_3_0_2)) U G (G ((1 <= p_0_1_0_3_1)))))
lola: processed formula: A ((X ((1 <= p_3_1_3_0_2)) U G (G ((1 <= p_0_1_0_3_1)))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 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: 5337 markings, 5336 edges, 1067 markings/sec, 0 secs
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: 8424 markings, 8424 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p_0_2_0_2_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p_0_2_0_2_0)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F ((2 <= p_0_2_1_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((2 <= p_0_2_1_0_2)))))
lola: processed formula: A (X (G (F ((2 <= p_0_2_1_0_2)))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 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: 5459 markings, 5458 edges, 1092 markings/sec, 0 secs
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: 8161 markings, 8161 edges
lola: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p_3_3_0_3_1 <= p_3_1_3_3_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_3_3_0_3_1 <= p_3_1_3_3_1)
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (X ((2 <= p_1_0_0_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (F (X ((2 <= p_1_0_0_0_0))))))
lola: processed formula: A (X (X (F (X ((2 <= p_1_0_0_0_0))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 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: 5956 markings, 5955 edges, 1191 markings/sec, 0 secs
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: 8161 markings, 8161 edges
lola: ========================================
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p_1_1_1_1_2 <= p_0_3_3_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p_1_1_1_1_2 <= p_0_3_3_1_3)))
lola: processed formula: A (F ((p_1_1_1_1_2 <= p_0_3_3_1_3)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 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 8 will run for 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p_0_0_3_2_1 <= p_3_0_0_3_3)))
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 4092 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p_1_3_2_0_3) U (3 <= p_3_1_3_0_1)) U ((1 <= p_2_0_0_2_3) U (p_3_0_1_0_3 <= p_3_2_0_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= p_1_3_2_0_3) U (3 <= p_3_1_3_0_1)) U ((1 <= p_2_0_0_2_3) U (p_3_0_1_0_3 <= p_3_2_0_1_0))))
lola: processed formula: A ((((1 <= p_1_3_2_0_3) U (3 <= p_3_1_3_0_1)) U ((1 <= p_2_0_0_2_3) U (p_3_0_1_0_3 <= p_3_2_0_1_0))))
lola: processed formula length: 101
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 29 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 10 will run for 583 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (G ((2 <= p_0_2_0_0_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((2 <= p_0_2_0_0_3)))))
lola: processed formula: A (X (F (G ((2 <= p_0_2_0_0_3)))))
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 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: 5186 markings, 5185 edges, 1037 markings/sec, 0 secs
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: 8162 markings, 8163 edges
lola: ========================================
lola: subprocess 11 will run for 698 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((p_3_0_0_0_1 <= p_0_1_1_0_0)) U F ((p_1_2_3_0_3 <= p_0_3_2_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((p_3_0_0_0_1 <= p_0_1_1_0_0)) U F ((p_1_2_3_0_3 <= p_0_3_2_1_2)))))
lola: processed formula: A (F ((G ((p_3_0_0_0_1 <= p_0_1_1_0_0)) U F ((p_1_2_3_0_3 <= p_0_3_2_1_2)))))
lola: processed formula length: 77
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 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 12 will run for 873 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p_3_2_1_3_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p_3_2_1_3_0)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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 1164 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p_0_3_1_3_3 <= p_2_0_3_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p_0_3_1_3_3 <= p_2_0_3_2_3)))
lola: processed formula: A (X ((p_0_3_1_3_3 <= p_2_0_3_2_3)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 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: 5005 markings, 5004 edges, 1001 markings/sec, 0 secs
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: 8976 markings, 8976 edges
lola: ========================================
lola: subprocess 14 will run for 1742 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (((2 <= p_1_1_3_1_3) U (p_0_0_1_1_0 <= p_3_0_0_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (((2 <= p_1_1_3_1_3) U (p_0_0_1_1_0 <= p_3_0_0_0_2)))))
lola: processed formula: A (G (G (((2 <= p_1_1_3_1_3) U (p_0_0_1_1_0 <= p_3_0_0_0_2)))))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 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: 748 markings, 747 edges, 150 markings/sec, 0 secs
lola: 1018 markings, 1017 edges, 54 markings/sec, 5 secs
lola: 1072 markings, 1071 edges, 11 markings/sec, 10 secs
lola: 1088 markings, 1087 edges, 3 markings/sec, 15 secs
lola: 1097 markings, 1096 edges, 2 markings/sec, 20 secs
lola: 1121 markings, 1120 edges, 5 markings/sec, 25 secs
lola: 1148 markings, 1147 edges, 5 markings/sec, 30 secs
lola: 1170 markings, 1169 edges, 4 markings/sec, 35 secs
lola: 1198 markings, 1197 edges, 6 markings/sec, 40 secs
lola: 1232 markings, 1231 edges, 7 markings/sec, 45 secs
lola: 1243 markings, 1242 edges, 2 markings/sec, 50 secs
lola: 1261 markings, 1260 edges, 4 markings/sec, 55 secs
lola: 1301 markings, 1300 edges, 8 markings/sec, 60 secs
lola: 1319 markings, 1318 edges, 4 markings/sec, 65 secs
lola: 1355 markings, 1354 edges, 7 markings/sec, 70 secs
lola: 1370 markings, 1369 edges, 3 markings/sec, 75 secs
lola: 1389 markings, 1388 edges, 4 markings/sec, 80 secs
lola: 1405 markings, 1404 edges, 3 markings/sec, 85 secs
lola: 1427 markings, 1426 edges, 4 markings/sec, 90 secs
lola: 1448 markings, 1447 edges, 4 markings/sec, 95 secs
lola: 1475 markings, 1474 edges, 5 markings/sec, 100 secs
lola: 1488 markings, 1487 edges, 3 markings/sec, 105 secs
lola: 1498 markings, 1497 edges, 2 markings/sec, 110 secs
lola: 1515 markings, 1514 edges, 3 markings/sec, 115 secs
lola: 1534 markings, 1533 edges, 4 markings/sec, 120 secs
lola: 1554 markings, 1553 edges, 4 markings/sec, 125 secs
lola: 1583 markings, 1582 edges, 6 markings/sec, 130 secs
lola: 1593 markings, 1592 edges, 2 markings/sec, 135 secs
lola: 1613 markings, 1612 edges, 4 markings/sec, 140 secs
lola: 1645 markings, 1644 edges, 6 markings/sec, 145 secs
lola: 1675 markings, 1674 edges, 6 markings/sec, 150 secs
lola: 1710 markings, 1709 edges, 7 markings/sec, 155 secs
lola: 1734 markings, 1733 edges, 5 markings/sec, 160 secs
lola: 1755 markings, 1754 edges, 4 markings/sec, 165 secs
lola: 1778 markings, 1777 edges, 5 markings/sec, 170 secs
lola: 1797 markings, 1796 edges, 4 markings/sec, 175 secs
lola: 1822 markings, 1821 edges, 5 markings/sec, 180 secs
lola: 1845 markings, 1844 edges, 5 markings/sec, 185 secs
lola: 1868 markings, 1867 edges, 5 markings/sec, 190 secs
lola: 1890 markings, 1889 edges, 4 markings/sec, 195 secs
lola: 1913 markings, 1912 edges, 5 markings/sec, 200 secs
lola: 1932 markings, 1931 edges, 4 markings/sec, 205 secs
lola: 1957 markings, 1956 edges, 5 markings/sec, 210 secs
lola: 1977 markings, 1976 edges, 4 markings/sec, 215 secs
lola: 1998 markings, 1997 edges, 4 markings/sec, 220 secs
lola: 2021 markings, 2020 edges, 5 markings/sec, 225 secs
lola: 2040 markings, 2039 edges, 4 markings/sec, 230 secs
lola: 2065 markings, 2064 edges, 5 markings/sec, 235 secs
lola: 2084 markings, 2083 edges, 4 markings/sec, 240 secs
lola: 2106 markings, 2105 edges, 4 markings/sec, 245 secs
lola: 2129 markings, 2128 edges, 5 markings/sec, 250 secs
lola: 2148 markings, 2147 edges, 4 markings/sec, 255 secs
lola: 2173 markings, 2172 edges, 5 markings/sec, 260 secs
lola: 2192 markings, 2191 edges, 4 markings/sec, 265 secs
lola: 2214 markings, 2213 edges, 4 markings/sec, 270 secs
lola: 2236 markings, 2235 edges, 4 markings/sec, 275 secs
lola: 2257 markings, 2256 edges, 4 markings/sec, 280 secs
lola: 2283 markings, 2282 edges, 5 markings/sec, 285 secs
lola: 2308 markings, 2307 edges, 5 markings/sec, 290 secs
lola: 2340 markings, 2339 edges, 6 markings/sec, 295 secs
lola: 2374 markings, 2373 edges, 7 markings/sec, 300 secs
lola: 2388 markings, 2387 edges, 3 markings/sec, 305 secs
lola: 2397 markings, 2396 edges, 2 markings/sec, 310 secs
lola: 2414 markings, 2413 edges, 3 markings/sec, 315 secs
lola: 2441 markings, 2440 edges, 5 markings/sec, 320 secs
lola: 2463 markings, 2462 edges, 4 markings/sec, 325 secs
lola: 2488 markings, 2487 edges, 5 markings/sec, 330 secs
lola: 2520 markings, 2519 edges, 6 markings/sec, 335 secs
lola: 2551 markings, 2550 edges, 6 markings/sec, 340 secs
lola: 2584 markings, 2583 edges, 7 markings/sec, 345 secs
lola: 2615 markings, 2614 edges, 6 markings/sec, 350 secs
lola: 2631 markings, 2630 edges, 3 markings/sec, 355 secs
lola: 2668 markings, 2667 edges, 7 markings/sec, 360 secs
lola: 2683 markings, 2682 edges, 3 markings/sec, 365 secs
lola: 2703 markings, 2702 edges, 4 markings/sec, 370 secs
lola: 2719 markings, 2718 edges, 3 markings/sec, 375 secs
lola: 2740 markings, 2739 edges, 4 markings/sec, 380 secs
lola: 2761 markings, 2760 edges, 4 markings/sec, 385 secs
lola: 2779 markings, 2778 edges, 4 markings/sec, 390 secs
lola: 2804 markings, 2803 edges, 5 markings/sec, 395 secs
lola: 2840 markings, 2839 edges, 7 markings/sec, 400 secs
lola: 2876 markings, 2875 edges, 7 markings/sec, 405 secs
lola: 2912 markings, 2911 edges, 7 markings/sec, 410 secs
lola: 2936 markings, 2935 edges, 5 markings/sec, 415 secs
lola: 2975 markings, 2974 edges, 8 markings/sec, 420 secs
lola: 3003 markings, 3002 edges, 6 markings/sec, 425 secs
lola: 3032 markings, 3031 edges, 6 markings/sec, 430 secs
lola: 3047 markings, 3046 edges, 3 markings/sec, 435 secs
lola: 3063 markings, 3062 edges, 3 markings/sec, 440 secs
lola: 3085 markings, 3084 edges, 4 markings/sec, 445 secs
lola: 3110 markings, 3109 edges, 5 markings/sec, 450 secs
lola: 3137 markings, 3136 edges, 5 markings/sec, 455 secs
lola: 3170 markings, 3169 edges, 7 markings/sec, 460 secs
lola: 3193 markings, 3192 edges, 5 markings/sec, 465 secs
lola: 3230 markings, 3229 edges, 7 markings/sec, 470 secs
lola: 3269 markings, 3268 edges, 8 markings/sec, 475 secs
lola: 3301 markings, 3300 edges, 6 markings/sec, 480 secs
lola: 3330 markings, 3329 edges, 6 markings/sec, 485 secs
lola: 3358 markings, 3357 edges, 6 markings/sec, 490 secs
lola: 3395 markings, 3394 edges, 7 markings/sec, 495 secs
lola: 3416 markings, 3415 edges, 4 markings/sec, 500 secs
lola: 3439 markings, 3438 edges, 5 markings/sec, 505 secs
lola: 3453 markings, 3452 edges, 3 markings/sec, 510 secs
lola: 3472 markings, 3471 edges, 4 markings/sec, 515 secs
lola: 3486 markings, 3485 edges, 3 markings/sec, 520 secs
lola: 3510 markings, 3509 edges, 5 markings/sec, 525 secs
lola: 3526 markings, 3525 edges, 3 markings/sec, 530 secs
lola: 3559 markings, 3558 edges, 7 markings/sec, 535 secs
lola: 3576 markings, 3575 edges, 3 markings/sec, 540 secs
lola: 3592 markings, 3591 edges, 3 markings/sec, 545 secs
lola: 3609 markings, 3608 edges, 3 markings/sec, 550 secs
lola: 3624 markings, 3623 edges, 3 markings/sec, 555 secs
lola: 3640 markings, 3639 edges, 3 markings/sec, 560 secs
lola: 3662 markings, 3661 edges, 4 markings/sec, 565 secs
lola: 3677 markings, 3676 edges, 3 markings/sec, 570 secs
lola: 3693 markings, 3692 edges, 3 markings/sec, 575 secs
lola: 3716 markings, 3715 edges, 5 markings/sec, 580 secs
lola: 3741 markings, 3740 edges, 5 markings/sec, 585 secs
lola: 3766 markings, 3765 edges, 5 markings/sec, 590 secs
lola: 3791 markings, 3790 edges, 5 markings/sec, 595 secs
lola: 3816 markings, 3815 edges, 5 markings/sec, 600 secs
lola: 3842 markings, 3841 edges, 5 markings/sec, 605 secs
lola: 3875 markings, 3874 edges, 7 markings/sec, 610 secs
lola: 3915 markings, 3914 edges, 8 markings/sec, 615 secs
lola: 3953 markings, 3952 edges, 8 markings/sec, 620 secs
lola: 3970 markings, 3969 edges, 3 markings/sec, 625 secs
lola: 3988 markings, 3987 edges, 4 markings/sec, 630 secs
lola: 4021 markings, 4020 edges, 7 markings/sec, 635 secs
lola: 4068 markings, 4067 edges, 9 markings/sec, 640 secs
lola: 4114 markings, 4113 edges, 9 markings/sec, 645 secs
lola: 4163 markings, 4162 edges, 10 markings/sec, 650 secs
lola: 4190 markings, 4189 edges, 5 markings/sec, 655 secs
lola: 4223 markings, 4222 edges, 7 markings/sec, 660 secs
lola: 4241 markings, 4240 edges, 4 markings/sec, 665 secs
lola: 4260 markings, 4259 edges, 4 markings/sec, 670 secs
lola: 4279 markings, 4278 edges, 4 markings/sec, 675 secs
lola: 4298 markings, 4297 edges, 4 markings/sec, 680 secs
lola: 4317 markings, 4316 edges, 4 markings/sec, 685 secs
lola: 4335 markings, 4334 edges, 4 markings/sec, 690 secs
lola: 4353 markings, 4352 edges, 4 markings/sec, 695 secs
lola: 4371 markings, 4370 edges, 4 markings/sec, 700 secs
lola: 4390 markings, 4389 edges, 4 markings/sec, 705 secs
lola: 4408 markings, 4407 edges, 4 markings/sec, 710 secs
lola: 4426 markings, 4425 edges, 4 markings/sec, 715 secs
lola: 4451 markings, 4450 edges, 5 markings/sec, 720 secs
lola: 4491 markings, 4490 edges, 8 markings/sec, 725 secs
lola: 4525 markings, 4524 edges, 7 markings/sec, 730 secs
lola: 4560 markings, 4559 edges, 7 markings/sec, 735 secs
lola: 4580 markings, 4579 edges, 4 markings/sec, 740 secs
lola: 4609 markings, 4608 edges, 6 markings/sec, 745 secs
lola: 4639 markings, 4638 edges, 6 markings/sec, 750 secs
lola: 4669 markings, 4668 edges, 6 markings/sec, 755 secs
lola: 4700 markings, 4699 edges, 6 markings/sec, 760 secs
lola: 4730 markings, 4729 edges, 6 markings/sec, 765 secs
lola: 4768 markings, 4767 edges, 8 markings/sec, 770 secs
lola: 4793 markings, 4792 edges, 5 markings/sec, 775 secs
lola: 4832 markings, 4831 edges, 8 markings/sec, 780 secs
lola: 4880 markings, 4879 edges, 10 markings/sec, 785 secs
lola: 4915 markings, 4914 edges, 7 markings/sec, 790 secs
lola: 4950 markings, 4949 edges, 7 markings/sec, 795 secs
lola: 4985 markings, 4984 edges, 7 markings/sec, 800 secs
lola: 5020 markings, 5019 edges, 7 markings/sec, 805 secs
lola: 5058 markings, 5057 edges, 8 markings/sec, 810 secs
lola: 5094 markings, 5093 edges, 7 markings/sec, 815 secs
lola: 5129 markings, 5128 edges, 7 markings/sec, 820 secs
lola: 5164 markings, 5163 edges, 7 markings/sec, 825 secs
lola: 5198 markings, 5197 edges, 7 markings/sec, 830 secs
lola: 5234 markings, 5233 edges, 7 markings/sec, 835 secs
lola: 5282 markings, 5281 edges, 10 markings/sec, 840 secs
lola: 5305 markings, 5304 edges, 5 markings/sec, 845 secs
lola: 5328 markings, 5327 edges, 5 markings/sec, 850 secs
lola: 5369 markings, 5368 edges, 8 markings/sec, 855 secs
lola: 5408 markings, 5407 edges, 8 markings/sec, 860 secs
lola: 5470 markings, 5469 edges, 12 markings/sec, 865 secs
lola: 5527 markings, 5526 edges, 11 markings/sec, 870 secs
lola: 5576 markings, 5575 edges, 10 markings/sec, 875 secs
lola: 5638 markings, 5637 edges, 12 markings/sec, 880 secs
lola: 5676 markings, 5675 edges, 8 markings/sec, 885 secs
lola: 5724 markings, 5723 edges, 10 markings/sec, 890 secs
lola: 5776 markings, 5775 edges, 10 markings/sec, 895 secs
lola: 5826 markings, 5825 edges, 10 markings/sec, 900 secs
lola: 5886 markings, 5885 edges, 12 markings/sec, 905 secs
lola: 5939 markings, 5938 edges, 11 markings/sec, 910 secs
lola: 6002 markings, 6001 edges, 13 markings/sec, 915 secs
lola: 6063 markings, 6062 edges, 12 markings/sec, 920 secs
lola: 6111 markings, 6110 edges, 10 markings/sec, 925 secs
lola: 6169 markings, 6168 edges, 12 markings/sec, 930 secs
lola: 6251 markings, 6250 edges, 16 markings/sec, 935 secs
lola: 6347 markings, 6346 edges, 19 markings/sec, 940 secs
lola: 6418 markings, 6417 edges, 14 markings/sec, 945 secs
lola: 6492 markings, 6491 edges, 15 markings/sec, 950 secs
lola: 6563 markings, 6562 edges, 14 markings/sec, 955 secs
lola: 6621 markings, 6620 edges, 12 markings/sec, 960 secs
lola: 6681 markings, 6680 edges, 12 markings/sec, 965 secs
lola: 6736 markings, 6735 edges, 11 markings/sec, 970 secs
lola: 6816 markings, 6815 edges, 16 markings/sec, 975 secs
lola: 6855 markings, 6854 edges, 8 markings/sec, 980 secs
lola: 6884 markings, 6883 edges, 6 markings/sec, 985 secs
lola: 6912 markings, 6911 edges, 6 markings/sec, 990 secs
lola: 6942 markings, 6941 edges, 6 markings/sec, 995 secs
lola: 6974 markings, 6973 edges, 6 markings/sec, 1000 secs
lola: 7005 markings, 7004 edges, 6 markings/sec, 1005 secs
lola: 7037 markings, 7036 edges, 6 markings/sec, 1010 secs
lola: 7069 markings, 7068 edges, 6 markings/sec, 1015 secs
lola: 7106 markings, 7105 edges, 7 markings/sec, 1020 secs
lola: 7158 markings, 7157 edges, 10 markings/sec, 1025 secs
lola: 7202 markings, 7201 edges, 9 markings/sec, 1030 secs
lola: 7322 markings, 7321 edges, 24 markings/sec, 1035 secs
lola: 7445 markings, 7444 edges, 25 markings/sec, 1040 secs
lola: 7575 markings, 7574 edges, 26 markings/sec, 1045 secs
lola: 7712 markings, 7711 edges, 27 markings/sec, 1050 secs
lola: 7835 markings, 7834 edges, 25 markings/sec, 1055 secs
lola: 7965 markings, 7964 edges, 26 markings/sec, 1060 secs
lola: 8102 markings, 8101 edges, 27 markings/sec, 1065 secs
lola: 8232 markings, 8231 edges, 26 markings/sec, 1070 secs
lola: 8355 markings, 8354 edges, 25 markings/sec, 1075 secs
lola: 8485 markings, 8484 edges, 26 markings/sec, 1080 secs
lola: 8615 markings, 8614 edges, 26 markings/sec, 1085 secs
lola: 8745 markings, 8744 edges, 26 markings/sec, 1090 secs
lola: 8882 markings, 8881 edges, 27 markings/sec, 1095 secs
lola: 9012 markings, 9011 edges, 26 markings/sec, 1100 secs
lola: 9117 markings, 9116 edges, 21 markings/sec, 1105 secs
lola: 9208 markings, 9207 edges, 18 markings/sec, 1110 secs
lola: 9291 markings, 9290 edges, 17 markings/sec, 1115 secs
lola: 9385 markings, 9386 edges, 19 markings/sec, 1120 secs
lola: 9493 markings, 9503 edges, 22 markings/sec, 1125 secs
lola: 9606 markings, 9626 edges, 23 markings/sec, 1130 secs
lola: 9714 markings, 9743 edges, 22 markings/sec, 1135 secs
lola: 9812 markings, 9849 edges, 20 markings/sec, 1140 secs
lola: 9909 markings, 9954 edges, 19 markings/sec, 1145 secs
lola: 9989 markings, 10037 edges, 16 markings/sec, 1150 secs
lola: 10075 markings, 10124 edges, 17 markings/sec, 1155 secs
lola: 10113 markings, 10162 edges, 8 markings/sec, 1160 secs
lola: 10152 markings, 10201 edges, 8 markings/sec, 1165 secs
lola: 10239 markings, 10288 edges, 17 markings/sec, 1170 secs
lola: 10352 markings, 10401 edges, 23 markings/sec, 1175 secs
lola: 10465 markings, 10514 edges, 23 markings/sec, 1180 secs
lola: 10591 markings, 10640 edges, 25 markings/sec, 1185 secs
lola: 10719 markings, 10768 edges, 26 markings/sec, 1190 secs
lola: 10833 markings, 10882 edges, 23 markings/sec, 1195 secs
lola: 10951 markings, 11000 edges, 24 markings/sec, 1200 secs
lola: 11058 markings, 11107 edges, 21 markings/sec, 1205 secs
lola: 11185 markings, 11234 edges, 25 markings/sec, 1210 secs
lola: 11303 markings, 11352 edges, 24 markings/sec, 1215 secs
lola: 11464 markings, 11513 edges, 32 markings/sec, 1220 secs
lola: 11566 markings, 11615 edges, 20 markings/sec, 1225 secs
lola: 11678 markings, 11727 edges, 22 markings/sec, 1230 secs
lola: 11824 markings, 11873 edges, 29 markings/sec, 1235 secs
lola: 11917 markings, 11966 edges, 19 markings/sec, 1240 secs
lola: 12012 markings, 12061 edges, 19 markings/sec, 1245 secs
lola: 12141 markings, 12190 edges, 26 markings/sec, 1250 secs
lola: 12294 markings, 12343 edges, 31 markings/sec, 1255 secs
lola: 12441 markings, 12490 edges, 29 markings/sec, 1260 secs
lola: 12597 markings, 12646 edges, 31 markings/sec, 1265 secs
lola: 12747 markings, 12796 edges, 30 markings/sec, 1270 secs
lola: 12891 markings, 12940 edges, 29 markings/sec, 1275 secs
lola: 13035 markings, 13084 edges, 29 markings/sec, 1280 secs
lola: 13184 markings, 13233 edges, 30 markings/sec, 1285 secs
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: 13274 markings, 13324 edges
lola: ========================================
lola: subprocess 15 will run for 2191 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (F ((p_3_0_3_0_1 <= p_3_0_1_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p_3_0_3_0_1 <= p_3_0_1_3_3)))
lola: processed formula: A (F ((p_3_0_3_0_1 <= p_3_0_1_3_3)))
lola: processed formula length: 36
lola: 3 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 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: RESULT
lola:
SUMMARY: no no no no no yes no yes no yes no yes yes no no yes
lola: ========================================
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-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="NeighborGrid-PT-d5n4m1t35"
export BK_EXAMINATION="LTLCardinality"
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/NeighborGrid-PT-d5n4m1t35.tgz
mv NeighborGrid-PT-d5n4m1t35 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 NeighborGrid-PT-d5n4m1t35, 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 r263-csrt-152732587400067"
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 ;