Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.....................
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K 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.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 3.9M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is HexagonalGrid-PT-816, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265400275
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527450614516


BK_STOP 1527450915711

--------------------
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 HexagonalGrid-PT-816 as instance name.
Using HexagonalGrid 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': False, 'Extended Free Choice': False, 'State Machine': False, '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': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 310511, 'Memory': 2350.09, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola HexagonalGrid-PT-816...

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


checking for too many tokens
===========================================================================================
HexagonalGrid-PT-816: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ HexagonalGrid-PT-816 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 9565/65536 symbol table entries, 1336 collisions
lola: preprocessing...
lola: finding significant places
lola: 3391 places, 6174 transitions, 2117 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 7447 transition conflict sets
lola: TASK
lola: reading formula from HexagonalGrid-PT-816-LTLCardinality.task
lola: A ((pil3_9_3 <= pil1_5_10)) : A (X ((po3_14_9 <= pi1_9_3))) : A (F (X (((pil1_14_2 <= pi2_6_2) U (3 <= po5_9_1))))) : A (G ((pb3_5_7 <= pol2_13_3))) : A ((F ((pol2_5_1 <= pol2_11_7)) U ((3 <= po3_8_5) U (1 <= pol5_5_1)))) : A ((F ((2 <= pol1_10_6)) U ((pi3_12_10 <= po1_7_5) U (1 <= pb6_8_15)))) : A (F (F (X (G ((3 <= pil3_2_1)))))) : A (X (G (F (G ((1 <= pb2_9_2)))))) : A (G (F (G (F ((pb3_3_5 <= pb3_12_7)))))) : A (X (F ((pol1_11_7 <= pb4_11_7)))) : A (G (F (F (F ((3 <= pi3_2_6)))))) : A (G (X (G (X ((po3_5_6 <= po2_1_3)))))) : A (X (X ((pil1_5_4 <= po3_2_3)))) : A ((3 <= po3_6_4)) : A (G ((pol3_10_4 <= po1_9_14))) : A (G (X (X (X ((pb1_8_3 <= po1_3_8))))))
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 ((pil3_9_3 <= pil1_5_10))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pil3_9_3 <= pil1_5_10)
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((po3_14_9 <= pi1_9_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((po3_14_9 <= pi1_9_3)))
lola: processed formula: A (X ((po3_14_9 <= pi1_9_3)))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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: 8398 markings, 8398 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((pil1_14_2 <= pi2_6_2) U (3 <= po5_9_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((pil1_14_2 <= pi2_6_2) U (3 <= po5_9_1)))))
lola: processed formula: A (F (X (((pil1_14_2 <= pi2_6_2) U (3 <= po5_9_1)))))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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: 8144 markings, 8144 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pb3_5_7 <= pol2_13_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 8468 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((pol2_5_1 <= pol2_11_7)) U ((3 <= po3_8_5) U (1 <= pol5_5_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((pol2_5_1 <= pol2_11_7)) U ((3 <= po3_8_5) U (1 <= pol5_5_1))))
lola: processed formula: A ((F ((pol2_5_1 <= pol2_11_7)) U ((3 <= po3_8_5) U (1 <= pol5_5_1))))
lola: processed formula length: 70
lola: 0 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((2 <= pol1_10_6)) U ((pi3_12_10 <= po1_7_5) U (1 <= pb6_8_15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((2 <= pol1_10_6)) U ((pi3_12_10 <= po1_7_5) U (1 <= pb6_8_15))))
lola: processed formula: A ((F ((2 <= pol1_10_6)) U ((pi3_12_10 <= po1_7_5) U (1 <= pb6_8_15))))
lola: processed formula length: 71
lola: 0 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (G ((3 <= pil3_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G ((3 <= pil3_2_1)))))
lola: processed formula: A (F (X (G ((3 <= pil3_2_1)))))
lola: processed formula length: 31
lola: 1 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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: 8144 markings, 8144 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (G ((1 <= pb2_9_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((1 <= pb2_9_2)))))
lola: processed formula: A (X (F (G ((1 <= pb2_9_2)))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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: 8145 markings, 8146 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (F ((pb3_3_5 <= pb3_12_7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (F ((pb3_3_5 <= pb3_12_7)))))
lola: processed formula: A (G (G (F ((pb3_3_5 <= pb3_12_7)))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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: 2018 markings, 2017 edges, 404 markings/sec, 0 secs
lola: 2092 markings, 2091 edges, 15 markings/sec, 5 secs
lola: 2162 markings, 2161 edges, 14 markings/sec, 10 secs
lola: 2226 markings, 2225 edges, 13 markings/sec, 15 secs
lola: 2283 markings, 2282 edges, 11 markings/sec, 20 secs
lola: 2337 markings, 2336 edges, 11 markings/sec, 25 secs
lola: 2406 markings, 2405 edges, 14 markings/sec, 30 secs
lola: 2455 markings, 2454 edges, 10 markings/sec, 35 secs
lola: 2499 markings, 2498 edges, 9 markings/sec, 40 secs
lola: 2537 markings, 2536 edges, 8 markings/sec, 45 secs
lola: 2569 markings, 2568 edges, 6 markings/sec, 50 secs
lola: 2609 markings, 2608 edges, 8 markings/sec, 55 secs
lola: 2644 markings, 2643 edges, 7 markings/sec, 60 secs
lola: 2682 markings, 2681 edges, 8 markings/sec, 65 secs
lola: 2800 markings, 2799 edges, 24 markings/sec, 70 secs
lola: 2942 markings, 2941 edges, 28 markings/sec, 75 secs
lola: 3456 markings, 3455 edges, 103 markings/sec, 80 secs
lola: 3589 markings, 3588 edges, 27 markings/sec, 85 secs
lola: 3817 markings, 3816 edges, 46 markings/sec, 90 secs
lola: 3904 markings, 3903 edges, 17 markings/sec, 95 secs
lola: 4320 markings, 4319 edges, 83 markings/sec, 100 secs
lola: 4492 markings, 4491 edges, 34 markings/sec, 105 secs
lola: 4613 markings, 4612 edges, 24 markings/sec, 110 secs
lola: 4784 markings, 4783 edges, 34 markings/sec, 115 secs
lola: 5154 markings, 5153 edges, 74 markings/sec, 120 secs
lola: 5445 markings, 5444 edges, 58 markings/sec, 125 secs
lola: 5777 markings, 5776 edges, 66 markings/sec, 130 secs
lola: 6247 markings, 6246 edges, 94 markings/sec, 135 secs
lola: 6506 markings, 6505 edges, 52 markings/sec, 140 secs
lola: 7020 markings, 7019 edges, 103 markings/sec, 145 secs
lola: 7428 markings, 7427 edges, 82 markings/sec, 150 secs
lola: 7878 markings, 7877 edges, 90 markings/sec, 155 secs
lola: 8311 markings, 8310 edges, 87 markings/sec, 160 secs
lola: 8737 markings, 8736 edges, 85 markings/sec, 165 secs
lola: 9077 markings, 9076 edges, 68 markings/sec, 170 secs
lola: 9408 markings, 9407 edges, 66 markings/sec, 175 secs
lola: 9796 markings, 9795 edges, 78 markings/sec, 180 secs
lola: 10310 markings, 10309 edges, 103 markings/sec, 185 secs
lola: 10740 markings, 10739 edges, 86 markings/sec, 190 secs
lola: 11163 markings, 11162 edges, 85 markings/sec, 195 secs
lola: 11519 markings, 11518 edges, 71 markings/sec, 200 secs
lola: 11987 markings, 11986 edges, 94 markings/sec, 205 secs
lola: 12642 markings, 12641 edges, 131 markings/sec, 210 secs
lola: 13594 markings, 13593 edges, 190 markings/sec, 215 secs
lola: 14403 markings, 14402 edges, 162 markings/sec, 220 secs
lola: 15160 markings, 15159 edges, 151 markings/sec, 225 secs
lola: 15973 markings, 15972 edges, 163 markings/sec, 230 secs
lola: 16945 markings, 16944 edges, 194 markings/sec, 235 secs
lola: 18038 markings, 18037 edges, 219 markings/sec, 240 secs
lola: 19183 markings, 19182 edges, 229 markings/sec, 245 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: 21215 markings, 21215 edges
lola: ========================================
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((pol1_11_7 <= pb4_11_7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((pol1_11_7 <= pb4_11_7))))
lola: processed formula: A (X (F ((pol1_11_7 <= pb4_11_7))))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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: 13399 markings, 13399 edges
lola: ========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F (F ((3 <= pi3_2_6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((3 <= pi3_2_6))))
lola: processed formula: A (G (F ((3 <= pi3_2_6))))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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: 3400 markings, 3400 edges
lola: ========================================
lola: subprocess 11 will run for 657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (X ((po3_5_6 <= po2_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G (X ((po3_5_6 <= po2_1_3))))))
lola: processed formula: A (G (X (G (X ((po3_5_6 <= po2_1_3))))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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: 8242 markings, 8242 edges
lola: ========================================
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((pil1_5_4 <= po3_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((pil1_5_4 <= po3_2_3))))
lola: processed formula: A (X (X ((pil1_5_4 <= po3_2_3))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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: 8144 markings, 8144 edges
lola: ========================================
lola: subprocess 13 will run for 1094 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= po3_6_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= po3_6_4)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-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 14 will run for 1642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pol3_10_4 <= po1_9_14)))
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 8468 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (X (X ((pb1_8_3 <= po1_3_8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (X (X ((pb1_8_3 <= po1_3_8))))))
lola: processed formula: A (G (X (X (X ((pb1_8_3 <= po1_3_8))))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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: 8144 markings, 8144 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes yes no no no no no no no no no no
FORMULA HexagonalGrid-PT-816-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HexagonalGrid-PT-816"
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/HexagonalGrid-PT-816.tgz
mv HexagonalGrid-PT-816 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 HexagonalGrid-PT-816, 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 r214-smll-152732265400275"
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 ;