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 irma4mcc-full
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 r258-csrt-152732583900067
=====================================================================

--------------------
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 1527456648638


BK_STOP 1527457994275

--------------------
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 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 stdout -----
----- Start make result stderr -----
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: 4643 markings, 4642 edges, 929 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: 6438 markings, 6437 edges, 1288 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: 5644 markings, 5643 edges, 1129 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: 5725 markings, 5724 edges, 1145 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 319 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: 5328 markings, 5327 edges, 1066 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 389 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: 5508 markings, 5507 edges, 1102 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 699 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: 5906 markings, 5905 edges, 1181 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 1744 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: 757 markings, 756 edges, 151 markings/sec, 0 secs
lola: 1016 markings, 1015 edges, 52 markings/sec, 5 secs
lola: 1072 markings, 1071 edges, 11 markings/sec, 10 secs
lola: 1086 markings, 1085 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: 1145 markings, 1144 edges, 5 markings/sec, 30 secs
lola: 1164 markings, 1163 edges, 4 markings/sec, 35 secs
lola: 1196 markings, 1195 edges, 6 markings/sec, 40 secs
lola: 1230 markings, 1229 edges, 7 markings/sec, 45 secs
lola: 1242 markings, 1241 edges, 2 markings/sec, 50 secs
lola: 1260 markings, 1259 edges, 4 markings/sec, 55 secs
lola: 1301 markings, 1300 edges, 8 markings/sec, 60 secs
lola: 1317 markings, 1316 edges, 3 markings/sec, 65 secs
lola: 1355 markings, 1354 edges, 8 markings/sec, 70 secs
lola: 1369 markings, 1368 edges, 3 markings/sec, 75 secs
lola: 1389 markings, 1388 edges, 4 markings/sec, 80 secs
lola: 1407 markings, 1406 edges, 4 markings/sec, 85 secs
lola: 1426 markings, 1425 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: 1519 markings, 1518 edges, 4 markings/sec, 115 secs
lola: 1538 markings, 1537 edges, 4 markings/sec, 120 secs
lola: 1562 markings, 1561 edges, 5 markings/sec, 125 secs
lola: 1585 markings, 1584 edges, 5 markings/sec, 130 secs
lola: 1595 markings, 1594 edges, 2 markings/sec, 135 secs
lola: 1623 markings, 1622 edges, 6 markings/sec, 140 secs
lola: 1655 markings, 1654 edges, 6 markings/sec, 145 secs
lola: 1691 markings, 1690 edges, 7 markings/sec, 150 secs
lola: 1719 markings, 1718 edges, 6 markings/sec, 155 secs
lola: 1743 markings, 1742 edges, 5 markings/sec, 160 secs
lola: 1768 markings, 1767 edges, 5 markings/sec, 165 secs
lola: 1788 markings, 1787 edges, 4 markings/sec, 170 secs
lola: 1814 markings, 1813 edges, 5 markings/sec, 175 secs
lola: 1840 markings, 1839 edges, 5 markings/sec, 180 secs
lola: 1860 markings, 1859 edges, 4 markings/sec, 185 secs
lola: 1885 markings, 1884 edges, 5 markings/sec, 190 secs
lola: 1904 markings, 1903 edges, 4 markings/sec, 195 secs
lola: 1923 markings, 1922 edges, 4 markings/sec, 200 secs
lola: 1948 markings, 1947 edges, 5 markings/sec, 205 secs
lola: 1971 markings, 1970 edges, 5 markings/sec, 210 secs
lola: 1994 markings, 1993 edges, 5 markings/sec, 215 secs
lola: 2013 markings, 2012 edges, 4 markings/sec, 220 secs
lola: 2038 markings, 2037 edges, 5 markings/sec, 225 secs
lola: 2057 markings, 2056 edges, 4 markings/sec, 230 secs
lola: 2079 markings, 2078 edges, 4 markings/sec, 235 secs
lola: 2103 markings, 2102 edges, 5 markings/sec, 240 secs
lola: 2125 markings, 2124 edges, 4 markings/sec, 245 secs
lola: 2148 markings, 2147 edges, 5 markings/sec, 250 secs
lola: 2173 markings, 2172 edges, 5 markings/sec, 255 secs
lola: 2193 markings, 2192 edges, 4 markings/sec, 260 secs
lola: 2219 markings, 2218 edges, 5 markings/sec, 265 secs
lola: 2241 markings, 2240 edges, 4 markings/sec, 270 secs
lola: 2270 markings, 2269 edges, 6 markings/sec, 275 secs
lola: 2295 markings, 2294 edges, 5 markings/sec, 280 secs
lola: 2319 markings, 2318 edges, 5 markings/sec, 285 secs
lola: 2358 markings, 2357 edges, 8 markings/sec, 290 secs
lola: 2381 markings, 2380 edges, 5 markings/sec, 295 secs
lola: 2392 markings, 2391 edges, 2 markings/sec, 300 secs
lola: 2408 markings, 2407 edges, 3 markings/sec, 305 secs
lola: 2427 markings, 2426 edges, 4 markings/sec, 310 secs
lola: 2458 markings, 2457 edges, 6 markings/sec, 315 secs
lola: 2486 markings, 2485 edges, 6 markings/sec, 320 secs
lola: 2517 markings, 2516 edges, 6 markings/sec, 325 secs
lola: 2549 markings, 2548 edges, 6 markings/sec, 330 secs
lola: 2577 markings, 2576 edges, 6 markings/sec, 335 secs
lola: 2605 markings, 2604 edges, 6 markings/sec, 340 secs
lola: 2627 markings, 2626 edges, 4 markings/sec, 345 secs
lola: 2656 markings, 2655 edges, 6 markings/sec, 350 secs
lola: 2677 markings, 2676 edges, 4 markings/sec, 355 secs
lola: 2701 markings, 2700 edges, 5 markings/sec, 360 secs
lola: 2716 markings, 2715 edges, 3 markings/sec, 365 secs
lola: 2732 markings, 2731 edges, 3 markings/sec, 370 secs
lola: 2755 markings, 2754 edges, 5 markings/sec, 375 secs
lola: 2773 markings, 2772 edges, 4 markings/sec, 380 secs
lola: 2794 markings, 2793 edges, 4 markings/sec, 385 secs
lola: 2831 markings, 2830 edges, 7 markings/sec, 390 secs
lola: 2859 markings, 2858 edges, 6 markings/sec, 395 secs
lola: 2894 markings, 2893 edges, 7 markings/sec, 400 secs
lola: 2922 markings, 2921 edges, 6 markings/sec, 405 secs
lola: 2958 markings, 2957 edges, 7 markings/sec, 410 secs
lola: 2996 markings, 2995 edges, 8 markings/sec, 415 secs
lola: 3029 markings, 3028 edges, 7 markings/sec, 420 secs
lola: 3044 markings, 3043 edges, 3 markings/sec, 425 secs
lola: 3063 markings, 3062 edges, 4 markings/sec, 430 secs
lola: 3088 markings, 3087 edges, 5 markings/sec, 435 secs
lola: 3115 markings, 3114 edges, 5 markings/sec, 440 secs
lola: 3150 markings, 3149 edges, 7 markings/sec, 445 secs
lola: 3178 markings, 3177 edges, 6 markings/sec, 450 secs
lola: 3213 markings, 3212 edges, 7 markings/sec, 455 secs
lola: 3254 markings, 3253 edges, 8 markings/sec, 460 secs
lola: 3294 markings, 3293 edges, 8 markings/sec, 465 secs
lola: 3325 markings, 3324 edges, 6 markings/sec, 470 secs
lola: 3351 markings, 3350 edges, 5 markings/sec, 475 secs
lola: 3391 markings, 3390 edges, 8 markings/sec, 480 secs
lola: 3416 markings, 3415 edges, 5 markings/sec, 485 secs
lola: 3441 markings, 3440 edges, 5 markings/sec, 490 secs
lola: 3457 markings, 3456 edges, 3 markings/sec, 495 secs
lola: 3477 markings, 3476 edges, 4 markings/sec, 500 secs
lola: 3495 markings, 3494 edges, 4 markings/sec, 505 secs
lola: 3518 markings, 3517 edges, 5 markings/sec, 510 secs
lola: 3553 markings, 3552 edges, 7 markings/sec, 515 secs
lola: 3569 markings, 3568 edges, 3 markings/sec, 520 secs
lola: 3584 markings, 3583 edges, 3 markings/sec, 525 secs
lola: 3599 markings, 3598 edges, 3 markings/sec, 530 secs
lola: 3614 markings, 3613 edges, 3 markings/sec, 535 secs
lola: 3630 markings, 3629 edges, 3 markings/sec, 540 secs
lola: 3647 markings, 3646 edges, 3 markings/sec, 545 secs
lola: 3669 markings, 3668 edges, 4 markings/sec, 550 secs
lola: 3685 markings, 3684 edges, 3 markings/sec, 555 secs
lola: 3706 markings, 3705 edges, 4 markings/sec, 560 secs
lola: 3731 markings, 3730 edges, 5 markings/sec, 565 secs
lola: 3756 markings, 3755 edges, 5 markings/sec, 570 secs
lola: 3782 markings, 3781 edges, 5 markings/sec, 575 secs
lola: 3811 markings, 3810 edges, 6 markings/sec, 580 secs
lola: 3838 markings, 3837 edges, 5 markings/sec, 585 secs
lola: 3875 markings, 3874 edges, 7 markings/sec, 590 secs
lola: 3918 markings, 3917 edges, 9 markings/sec, 595 secs
lola: 3955 markings, 3954 edges, 7 markings/sec, 600 secs
lola: 3974 markings, 3973 edges, 4 markings/sec, 605 secs
lola: 3993 markings, 3992 edges, 4 markings/sec, 610 secs
lola: 4034 markings, 4033 edges, 8 markings/sec, 615 secs
lola: 4082 markings, 4081 edges, 10 markings/sec, 620 secs
lola: 4126 markings, 4125 edges, 9 markings/sec, 625 secs
lola: 4166 markings, 4165 edges, 8 markings/sec, 630 secs
lola: 4194 markings, 4193 edges, 6 markings/sec, 635 secs
lola: 4228 markings, 4227 edges, 7 markings/sec, 640 secs
lola: 4249 markings, 4248 edges, 4 markings/sec, 645 secs
lola: 4269 markings, 4268 edges, 4 markings/sec, 650 secs
lola: 4290 markings, 4289 edges, 4 markings/sec, 655 secs
lola: 4311 markings, 4310 edges, 4 markings/sec, 660 secs
lola: 4329 markings, 4328 edges, 4 markings/sec, 665 secs
lola: 4349 markings, 4348 edges, 4 markings/sec, 670 secs
lola: 4367 markings, 4366 edges, 4 markings/sec, 675 secs
lola: 4385 markings, 4384 edges, 4 markings/sec, 680 secs
lola: 4404 markings, 4403 edges, 4 markings/sec, 685 secs
lola: 4423 markings, 4422 edges, 4 markings/sec, 690 secs
lola: 4446 markings, 4445 edges, 5 markings/sec, 695 secs
lola: 4487 markings, 4486 edges, 8 markings/sec, 700 secs
lola: 4523 markings, 4522 edges, 7 markings/sec, 705 secs
lola: 4560 markings, 4559 edges, 7 markings/sec, 710 secs
lola: 4580 markings, 4579 edges, 4 markings/sec, 715 secs
lola: 4610 markings, 4609 edges, 6 markings/sec, 720 secs
lola: 4640 markings, 4639 edges, 6 markings/sec, 725 secs
lola: 4672 markings, 4671 edges, 6 markings/sec, 730 secs
lola: 4703 markings, 4702 edges, 6 markings/sec, 735 secs
lola: 4733 markings, 4732 edges, 6 markings/sec, 740 secs
lola: 4769 markings, 4768 edges, 7 markings/sec, 745 secs
lola: 4797 markings, 4796 edges, 6 markings/sec, 750 secs
lola: 4840 markings, 4839 edges, 9 markings/sec, 755 secs
lola: 4894 markings, 4893 edges, 11 markings/sec, 760 secs
lola: 4933 markings, 4932 edges, 8 markings/sec, 765 secs
lola: 4969 markings, 4968 edges, 7 markings/sec, 770 secs
lola: 5004 markings, 5003 edges, 7 markings/sec, 775 secs
lola: 5039 markings, 5038 edges, 7 markings/sec, 780 secs
lola: 5075 markings, 5074 edges, 7 markings/sec, 785 secs
lola: 5115 markings, 5114 edges, 8 markings/sec, 790 secs
lola: 5154 markings, 5153 edges, 8 markings/sec, 795 secs
lola: 5194 markings, 5193 edges, 8 markings/sec, 800 secs
lola: 5233 markings, 5232 edges, 8 markings/sec, 805 secs
lola: 5281 markings, 5280 edges, 10 markings/sec, 810 secs
lola: 5305 markings, 5304 edges, 5 markings/sec, 815 secs
lola: 5330 markings, 5329 edges, 5 markings/sec, 820 secs
lola: 5376 markings, 5375 edges, 9 markings/sec, 825 secs
lola: 5425 markings, 5424 edges, 10 markings/sec, 830 secs
lola: 5486 markings, 5485 edges, 12 markings/sec, 835 secs
lola: 5544 markings, 5543 edges, 12 markings/sec, 840 secs
lola: 5598 markings, 5597 edges, 11 markings/sec, 845 secs
lola: 5654 markings, 5653 edges, 11 markings/sec, 850 secs
lola: 5693 markings, 5692 edges, 8 markings/sec, 855 secs
lola: 5747 markings, 5746 edges, 11 markings/sec, 860 secs
lola: 5812 markings, 5811 edges, 13 markings/sec, 865 secs
lola: 5868 markings, 5867 edges, 11 markings/sec, 870 secs
lola: 5929 markings, 5928 edges, 12 markings/sec, 875 secs
lola: 5981 markings, 5980 edges, 10 markings/sec, 880 secs
lola: 6041 markings, 6040 edges, 12 markings/sec, 885 secs
lola: 6093 markings, 6092 edges, 10 markings/sec, 890 secs
lola: 6151 markings, 6150 edges, 12 markings/sec, 895 secs
lola: 6226 markings, 6225 edges, 15 markings/sec, 900 secs
lola: 6328 markings, 6327 edges, 20 markings/sec, 905 secs
lola: 6393 markings, 6392 edges, 13 markings/sec, 910 secs
lola: 6458 markings, 6457 edges, 13 markings/sec, 915 secs
lola: 6523 markings, 6522 edges, 13 markings/sec, 920 secs
lola: 6592 markings, 6591 edges, 14 markings/sec, 925 secs
lola: 6640 markings, 6639 edges, 10 markings/sec, 930 secs
lola: 6693 markings, 6692 edges, 11 markings/sec, 935 secs
lola: 6773 markings, 6772 edges, 16 markings/sec, 940 secs
lola: 6837 markings, 6836 edges, 13 markings/sec, 945 secs
lola: 6868 markings, 6867 edges, 6 markings/sec, 950 secs
lola: 6899 markings, 6898 edges, 6 markings/sec, 955 secs
lola: 6931 markings, 6930 edges, 6 markings/sec, 960 secs
lola: 6963 markings, 6962 edges, 6 markings/sec, 965 secs
lola: 6992 markings, 6991 edges, 6 markings/sec, 970 secs
lola: 7021 markings, 7020 edges, 6 markings/sec, 975 secs
lola: 7050 markings, 7049 edges, 6 markings/sec, 980 secs
lola: 7081 markings, 7080 edges, 6 markings/sec, 985 secs
lola: 7124 markings, 7123 edges, 9 markings/sec, 990 secs
lola: 7170 markings, 7169 edges, 9 markings/sec, 995 secs
lola: 7236 markings, 7235 edges, 13 markings/sec, 1000 secs
lola: 7368 markings, 7367 edges, 26 markings/sec, 1005 secs
lola: 7510 markings, 7509 edges, 28 markings/sec, 1010 secs
lola: 7653 markings, 7652 edges, 29 markings/sec, 1015 secs
lola: 7796 markings, 7795 edges, 29 markings/sec, 1020 secs
lola: 7939 markings, 7938 edges, 29 markings/sec, 1025 secs
lola: 8082 markings, 8081 edges, 29 markings/sec, 1030 secs
lola: 8224 markings, 8223 edges, 28 markings/sec, 1035 secs
lola: 8367 markings, 8366 edges, 29 markings/sec, 1040 secs
lola: 8505 markings, 8504 edges, 28 markings/sec, 1045 secs
lola: 8640 markings, 8639 edges, 27 markings/sec, 1050 secs
lola: 8770 markings, 8769 edges, 26 markings/sec, 1055 secs
lola: 8899 markings, 8898 edges, 26 markings/sec, 1060 secs
lola: 9030 markings, 9029 edges, 26 markings/sec, 1065 secs
lola: 9138 markings, 9137 edges, 22 markings/sec, 1070 secs
lola: 9235 markings, 9234 edges, 19 markings/sec, 1075 secs
lola: 9321 markings, 9320 edges, 17 markings/sec, 1080 secs
lola: 9421 markings, 9425 edges, 20 markings/sec, 1085 secs
lola: 9534 markings, 9548 edges, 23 markings/sec, 1090 secs
lola: 9644 markings, 9667 edges, 22 markings/sec, 1095 secs
lola: 9753 markings, 9785 edges, 22 markings/sec, 1100 secs
lola: 9872 markings, 9914 edges, 24 markings/sec, 1105 secs
lola: 9969 markings, 10016 edges, 19 markings/sec, 1110 secs
lola: 10073 markings, 10122 edges, 21 markings/sec, 1115 secs
lola: 10119 markings, 10168 edges, 9 markings/sec, 1120 secs
lola: 10179 markings, 10228 edges, 12 markings/sec, 1125 secs
lola: 10295 markings, 10344 edges, 23 markings/sec, 1130 secs
lola: 10424 markings, 10473 edges, 26 markings/sec, 1135 secs
lola: 10548 markings, 10597 edges, 25 markings/sec, 1140 secs
lola: 10668 markings, 10717 edges, 24 markings/sec, 1145 secs
lola: 10776 markings, 10825 edges, 22 markings/sec, 1150 secs
lola: 10893 markings, 10942 edges, 23 markings/sec, 1155 secs
lola: 11009 markings, 11058 edges, 23 markings/sec, 1160 secs
lola: 11122 markings, 11171 edges, 23 markings/sec, 1165 secs
lola: 11243 markings, 11292 edges, 24 markings/sec, 1170 secs
lola: 11411 markings, 11460 edges, 34 markings/sec, 1175 secs
lola: 11529 markings, 11578 edges, 24 markings/sec, 1180 secs
lola: 11639 markings, 11688 edges, 22 markings/sec, 1185 secs
lola: 11793 markings, 11842 edges, 31 markings/sec, 1190 secs
lola: 11899 markings, 11948 edges, 21 markings/sec, 1195 secs
lola: 11987 markings, 12036 edges, 18 markings/sec, 1200 secs
lola: 12098 markings, 12147 edges, 22 markings/sec, 1205 secs
lola: 12241 markings, 12290 edges, 29 markings/sec, 1210 secs
lola: 12386 markings, 12435 edges, 29 markings/sec, 1215 secs
lola: 12528 markings, 12577 edges, 28 markings/sec, 1220 secs
lola: 12669 markings, 12718 edges, 28 markings/sec, 1225 secs
lola: 12812 markings, 12861 edges, 29 markings/sec, 1230 secs
lola: 12946 markings, 12995 edges, 27 markings/sec, 1235 secs
lola: 13096 markings, 13145 edges, 30 markings/sec, 1240 secs
lola: 13261 markings, 13310 edges, 33 markings/sec, 1245 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 2237 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: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no yes no yes no yes yes no no yes
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
----- Kill lola and sara stderr -----
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 stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeighborGrid-PT-d5n4m1t35"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-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/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 irma4mcc-full"
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 r258-csrt-152732583900067"
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 ;