fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r188-blw3-149581034600239
Last Updated
June 27, 2017

About the Execution of LoLA for HexagonalGrid-PT-816

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2350.090 310511.00 310664.00 150.10 TTTFFTFFFTFFFFFT normal

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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
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 r188-blw3-149581034600239
=====================================================================


--------------------
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-0
FORMULA_NAME HexagonalGrid-PT-816-LTLCardinality-1
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
FORMULA_NAME HexagonalGrid-PT-816-LTLCardinality-2
FORMULA_NAME HexagonalGrid-PT-816-LTLCardinality-3
FORMULA_NAME HexagonalGrid-PT-816-LTLCardinality-4
FORMULA_NAME HexagonalGrid-PT-816-LTLCardinality-5
FORMULA_NAME HexagonalGrid-PT-816-LTLCardinality-6
FORMULA_NAME HexagonalGrid-PT-816-LTLCardinality-7
FORMULA_NAME HexagonalGrid-PT-816-LTLCardinality-8
FORMULA_NAME HexagonalGrid-PT-816-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496504990680


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 -----
LTLCardinality @ HexagonalGrid-PT-816 @ 3540 seconds
----- Start make result stdout -----
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 (F ((po3_9_13 <= pb1_13_8))) : A ((pol1_1_3 <= pil1_9_10)) : A (X (F (G (F ((po2_15_4 <= pb3_15_6)))))) : A ((pb5_11_12 <= pb5_3_3)) : A (F (G ((pil1_7_3 <= pi3_5_8)))) : A ((X (F ((pil5_12_1 <= pbl_8_3))) U X (G ((pol1_1_2 <= pb1_2_4))))) : A (X ((F ((pol2_4_8 <= pil3_7_13)) U F ((1 <= pi3_12_10))))) : A (G (G (((1 <= pi1_9_9) U (pb4_10_3 <= po2_2_6))))) : A ((G ((3 <= pi3_15_6)) U (2 <= pb4_14_1))) : A (F ((po2_12_8 <= pol2_8_11))) : A ((pb1_7_13 <= pb3_7_12)) : A (F (X (F ((pil3_2_7 <= pb4_7_10))))) : A (G (G ((1 <= pb1_3_7)))) : A (F (F (((1 <= pb1_12_3) U (1 <= pol2_11_12))))) : A (G (X (G (G ((3 <= pb5_6_12)))))) : A (F (G (X (G ((pb6_15_6 <= pol1_8_1))))))
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 ((po3_9_13 <= pb1_13_8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((po3_9_13 <= pb1_13_8)))
lola: processed formula: A (F ((po3_9_13 <= pb1_13_8)))
lola: processed formula length: 30
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üchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pol1_1_3 <= pil1_9_10))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pol1_1_3 <= pil1_9_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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (F ((po2_15_4 <= pb3_15_6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (F ((po2_15_4 <= pb3_15_6)))))
lola: processed formula: A (X (G (F ((po2_15_4 <= pb3_15_6)))))
lola: processed formula length: 38
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üchi 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: 134741 markings, 343216 edges, 26948 markings/sec, 0 secs
lola: 226026 markings, 648053 edges, 18257 markings/sec, 5 secs
lola: 318065 markings, 963441 edges, 18408 markings/sec, 10 secs
lola: 407660 markings, 1215326 edges, 17919 markings/sec, 15 secs
lola: 495726 markings, 1442438 edges, 17613 markings/sec, 20 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: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pb5_11_12 <= pb5_3_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb5_11_12 <= pb5_3_3)
lola: processed formula length: 22
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: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((pil1_7_3 <= pi3_5_8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((pil1_7_3 <= pi3_5_8))))
lola: processed formula: A (F (G ((pil1_7_3 <= pi3_5_8))))
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üchi 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: 1741 markings, 1740 edges, 348 markings/sec, 0 secs
lola: 1852 markings, 1851 edges, 22 markings/sec, 5 secs
lola: 1960 markings, 1959 edges, 22 markings/sec, 10 secs
lola: 2435 markings, 2434 edges, 95 markings/sec, 15 secs
lola: 3065 markings, 3064 edges, 126 markings/sec, 20 secs
lola: 3334 markings, 3333 edges, 54 markings/sec, 25 secs
lola: 3735 markings, 3734 edges, 80 markings/sec, 30 secs
lola: 4220 markings, 4219 edges, 97 markings/sec, 35 secs
lola: 4830 markings, 4829 edges, 122 markings/sec, 40 secs
lola: 5599 markings, 5598 edges, 154 markings/sec, 45 secs
lola: 6462 markings, 6461 edges, 173 markings/sec, 50 secs
lola: 7022 markings, 7021 edges, 112 markings/sec, 55 secs
lola: 8106 markings, 8105 edges, 217 markings/sec, 60 secs
lola: 9483 markings, 9482 edges, 275 markings/sec, 65 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: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((pil5_12_1 <= pbl_8_3))) U X (G ((pol1_1_2 <= pb1_2_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automatonlola:
========================================
lola: processed formula: A (X ((F ((pil5_12_1 <= pbl_8_3)) U G ((pol1_1_2 <= pb1_2_4)))))
lola: processed formula: A (X ((F ((pil5_12_1 <= pbl_8_3)) U G ((pol1_1_2 <= pb1_2_4)))))
lola: processed formula length: 64
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üchi 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: ========================================
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((pol2_4_8 <= pil3_7_13)) U F ((1 <= pi3_12_10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((pol2_4_8 <= pil3_7_13)) U F ((1 <= pi3_12_10)))))
lola: processed formula: A (X ((F ((pol2_4_8 <= pil3_7_13)) U F ((1 <= pi3_12_10)))))
lola: processed formula length: 60
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üchi 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: ========================================
lola: subprocess 7 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (((1 <= pi1_9_9) U (pb4_10_3 <= po2_2_6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (((1 <= pi1_9_9) U (pb4_10_3 <= po2_2_6)))))
lola: processed formula: A (G (G (((1 <= pi1_9_9) U (pb4_10_3 <= po2_2_6)))))
lola: processed formula length: 52
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üchi 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: 1900 markings, 1899 edges, 380 markings/sec, 0 secs
lola: 1987 markings, 1986 edges, 17 markings/sec, 5 secs
lola: 2143 markings, 2142 edges, 31 markings/sec, 10 secs
lola: 3491 markings, 3490 edges, 270 markings/sec, 15 secs
lola: 6634 markings, 6633 edges, 629 markings/sec, 20 secs
lola: 9651 markings, 9650 edges, 603 markings/sec, 25 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: ========================================
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((3 <= pi3_15_6)) U (2 <= pb4_14_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((3 <= pi3_15_6)) U (2 <= pb4_14_1)))
lola: processed formula: A ((G ((3 <= pi3_15_6)) U (2 <= pb4_14_1)))
lola: processed formula length: 43
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üchi 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 486 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((po2_12_8 <= pol2_8_11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((po2_12_8 <= pol2_8_11)))
lola: processed formula: A (F ((po2_12_8 <= pol2_8_11)))
lola: processed formula length: 31
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üchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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: ========================================
lola: subprocess 10 will run for 567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pb1_7_13 <= pb3_7_12))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb1_7_13 <= pb3_7_12)
lola: processed formula length: 22
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: ========================================
lola: subprocess 11 will run for 681 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F ((pil3_2_7 <= pb4_7_10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((pil3_2_7 <= pb4_7_10)))))
lola: processed formula: A (F (X (F ((pil3_2_7 <= pb4_7_10)))))
lola: processed formula length: 38
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üchi 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: ========================================
lola: subprocess 12 will run for 851 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((1 <= pb1_3_7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G ((1 <= pb1_3_7))))
lola: processed formula: A (G (G ((1 <= pb1_3_7))))
lola: processed formula length: 26
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üchi 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: 1908 markings, 1907 edges, 382 markings/sec, 0 secs
lola: 1954 markings, 1953 edges, 9 markings/sec, 5 secs
lola: 1986 markings, 1985 edges, 6 markings/sec, 10 secs
lola: 2028 markings, 2027 edges, 8 markings/sec, 15 secs
lola: 2113 markings, 2112 edges, 17 markings/sec, 20 secs
lola: 2253 markings, 2252 edges, 28 markings/sec, 25 secs
lola: 2346 markings, 2345 edges, 19 markings/sec, 30 secs
lola: 2407 markings, 2406 edges, 12 markings/sec, 35 secs
lola: 2469 markings, 2468 edges, 12 markings/sec, 40 secs
lola: 2531 markings, 2530 edges, 12 markings/sec, 45 secs
lola: 2669 markings, 2668 edges, 28 markings/sec, 50 secs
lola: 3397 markings, 3396 edges, 146 markings/sec, 55 secs
lola: 3826 markings, 3825 edges, 86 markings/sec, 60 secs
lola: 4080 markings, 4079 edges, 51 markings/sec, 65 secs
lola: 4734 markings, 4733 edges, 131 markings/sec, 70 secs
lola: 5925 markings, 5924 edges, 238 markings/sec, 75 secs
lola: 7392 markings, 7391 edges, 293 markings/sec, 80 secs
lola: 8733 markings, 8732 edges, 268 markings/sec, 85 secs
lola: 9459 markings, 9458 edges, 145 markings/sec, 90 secs
lola: 10790 markings, 10822 edges, 266 markings/sec, 95 secs
lola: 12498 markings, 12538 edges, 342 markings/sec, 100 secs
lola: 22506 markings, 24260 edges, 2002 markings/sec, 105 secs
lola: 31390 markings, 34829 edges, 1777 markings/sec, 110 secs
lola: 40623 markings, 45788 edges, 1847 markings/sec, 115 secs
lola: 49879 markings, 56748 edges, 1851 markings/sec, 120 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: ========================================
lola: subprocess 13 will run for 1092 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((1 <= pb1_12_3) U (1 <= pol2_11_12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((1 <= pb1_12_3) U (1 <= pol2_11_12))))
lola: processed formula: A (F (((1 <= pb1_12_3) U (1 <= pol2_11_12))))
lola: processed formula length: 45
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üchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8472 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: ========================================
lola: subprocess 14 will run for 1639 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (G ((3 <= pb5_6_12))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G (G ((3 <= pb5_6_12))))))
lola: processed formula: A (G (X (G (G ((3 <= pb5_6_12))))))
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üchi 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: ========================================
lola: subprocess 15 will run for 3277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (G ((pb6_15_6 <= pol1_8_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X (G ((pb6_15_6 <= pol1_8_1))))))
lola: processed formula: A (F (G (X (G ((pb6_15_6 <= pol1_8_1))))))
lola: processed formula length: 42
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üchi 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: 133337 markings, 339059 edges, 26667 markings/sec, 0 secs
lola: 223000 markings, 640627 edges, 17933 markings/sec, 5 secs
lola: 311918 markings, 947984 edges, 17784 markings/sec, 10 secs
lola: 406455 markings, 1214347 edges, 18907 markings/sec, 15 secs
lola: 495945 markings, 1446035 edges, 17898 markings/sec, 20 secs
lola: 578752 markings, 1652237 edges, 16561 markings/sec, 25 secs
lola: 643386 markings, 1832080 edges, 12927 markings/sec, 30 secs
lola: 702364 markings, 2005570 edges, 11796 markings/sec, 35 secs
lola: 757635 markings, 2179119 edges, 11054 markings/sec, 40 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: RESULT
lola:
SUMMARY: yes yes no yes no no no no no yes yes no no yes no no
lola: ========================================
FORMULA HexagonalGrid-PT-816-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-1 TRUE 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 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-5 FALSE 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 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-LTLCardinality-10 TRUE 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 TRUE 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 stdout -----
----- Finished stdout -----

BK_STOP 1496505301191

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="HexagonalGrid-PT-816"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
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 r188-blw3-149581034600239"
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 ;