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 NeighborGrid-PT-d5n4m1t35, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-149581172200041
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496299268093


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 -----
LTLCardinality @ NeighborGrid-PT-d5n4m1t35 @ 3538 seconds
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 197632/65536 symbol table entries, 177787 collisions
lola: preprocessing...
lola: finding significant places
lola: 1024 places, 196608 transitions, 1023 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1024 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: A ((3 <= p_0_1_3_1_0)) : A ((p_1_2_1_0_1 <= p_1_2_0_0_3)) : A (G ((G ((3 <= p_2_3_2_3_2)) U G ((2 <= p_1_1_3_0_2))))) : A ((((1 <= p_1_2_2_3_2) U (1 <= p_0_0_2_0_1)) U G (X ((1 <= p_2_3_0_1_3))))) : A (F ((G ((3 <= p_2_1_0_1_0)) U G ((p_3_2_2_3_2 <= p_3_0_1_2_1))))) : A ((G (X ((2 <= p_1_0_1_3_2))) U F ((3 <= p_1_3_0_1_3)))) : A (F ((G ((2 <= p_2_3_2_0_2)) U G ((2 <= p_2_3_2_1_3))))) : A (X (X (((3 <= p_2_0_2_0_3) U (1 <= p_2_1_2_1_1))))) : A ((((p_0_1_3_3_1 <= p_2_0_0_0_2) U (2 <= p_3_1_3_1_2)) U ((p_3_1_1_1_3 <= p_3_0_3_1_0) U (p_3_2_0_1_3 <= p_1_1_0_1_3)))) : A (((p_3_0_2_2_3 <= p_2_3_2_2_2) U X (G ((2 <= p_2_2_0_0_3))))) : A (G ((p_3_1_1_3_2 <= p_0_3_0_1_0))) : A (F ((p_0_3_2_1_0 <= p_2_2_2_2_0))) : A (F ((1 <= p_3_3_0_0_3))) : A (X ((X ((p_2_3_1_0_3 <= p_2_1_0_1_3)) U G ((3 <= p_0_1_3_1_3))))) : A (G (X (((p_3_1_1_1_2 <= p_2_2_2_0_2) U (p_0_0_3_2_2 <= p_1_3_0_2_3))))) : A (X ((p_3_0_3_3_3 <= p_1_0_1_2_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 ((3 <= p_0_1_3_1_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p_0_1_3_1_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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p_1_2_1_0_1 <= p_1_2_0_0_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_1_2_1_0_1 <= p_1_2_0_0_3)
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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((3 <= p_2_3_2_3_2)) U G ((2 <= p_1_1_3_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G ((3 <= p_2_3_2_3_2)) U G ((2 <= p_1_1_3_0_2)))))
lola: processed formula: A (G ((G ((3 <= p_2_3_2_3_2)) U G ((2 <= p_1_1_3_0_2)))))
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üchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 574 markings, 573 edges, 115 markings/sec, 0 secs
lola: 830 markings, 829 edges, 51 markings/sec, 5 secs
lola: 1042 markings, 1041 edges, 42 markings/sec, 10 secs
lola: 1207 markings, 1206 edges, 33 markings/sec, 15 secs
lola: 1389 markings, 1388 edges, 36 markings/sec, 20 secs
lola: 1516 markings, 1515 edges, 25 markings/sec, 25 secs
lola: 1620 markings, 1619 edges, 21 markings/sec, 30 secs
lola: 1708 markings, 1707 edges, 18 markings/sec, 35 secs
lola: 1736 markings, 1735 edges, 6 markings/sec, 40 secs
lola: 1752 markings, 1751 edges, 3 markings/sec, 45 secs
lola: 1762 markings, 1761 edges, 2 markings/sec, 50 secs
lola: 1772 markings, 1771 edges, 2 markings/sec, 55 secs
lola: 1788 markings, 1787 edges, 3 markings/sec, 60 secs
lola: 1798 markings, 1797 edges, 2 markings/sec, 65 secs
lola: 1809 markings, 1808 edges, 2 markings/sec, 70 secs
lola: 1826 markings, 1825 edges, 3 markings/sec, 75 secs
lola: 1846 markings, 1845 edges, 4 markings/sec, 80 secs
lola: 1865 markings, 1864 edges, 4 markings/sec, 85 secs
lola: 1882 markings, 1881 edges, 3 markings/sec, 90 secs
lola: 1899 markings, 1898 edges, 3 markings/sec, 95 secs
lola: 1920 markings, 1919 edges, 4 markings/sec, 100 secs
lola: 1950 markings, 1949 edges, 6 markings/sec, 105 secs
lola: 1971 markings, 1970 edges, 4 markings/sec, 110 secs
lola: 1995 markings, 1994 edges, 5 markings/sec, 115 secs
lola: 2015 markings, 2014 edges, 4 markings/sec, 120 secs
lola: 2031 markings, 2030 edges, 3 markings/sec, 125 secs
lola: 2058 markings, 2057 edges, 5 markings/sec, 130 secs
lola: 2082 markings, 2081 edges, 5 markings/sec, 135 secs
lola: 2106 markings, 2105 edges, 5 markings/sec, 140 secs
lola: 2130 markings, 2129 edges, 5 markings/sec, 145 secs
lola: 2154 markings, 2153 edges, 5 markings/sec, 150 secs
lola: 2177 markings, 2176 edges, 5 markings/sec, 155 secs
lola: 2201 markings, 2200 edges, 5 markings/sec, 160 secs
lola: 2231 markings, 2230 edges, 6 markings/sec, 165 secs
lola: 2273 markings, 2272 edges, 8 markings/sec, 170 secs
lola: 2337 markings, 2336 edges, 13 markings/sec, 175 secs
lola: 2388 markings, 2387 edges, 10 markings/sec, 180 secs
lola: 2401 markings, 2400 edges, 3 markings/sec, 185 secs
lola: 2415 markings, 2414 edges, 3 markings/sec, 190 secs
lola: 2430 markings, 2429 edges, 3 markings/sec, 195 secs
lola: 2448 markings, 2447 edges, 4 markings/sec, 200 secs
lola: 2474 markings, 2473 edges, 5 markings/sec, 205 secs
lola: 2484 markings, 2483 edges, 2 markings/sec, 210 secs
lola: 2494 markings, 2493 edges, 2 markings/sec, 215 secs
lola: 2503 markings, 2502 edges, 2 markings/sec, 220 secs
lola: 2513 markings, 2512 edges, 2 markings/sec, 225 secs
lola: 2522 markings, 2521 edges, 2 markings/sec, 230 secs
lola: 2532 markings, 2531 edges, 2 markings/sec, 235 secs
lola: 2541 markings, 2540 edges, 2 markings/sec, 240 secs
lola: 2551 markings, 2550 edges, 2 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p_1_2_2_3_2) U (1 <= p_0_0_2_0_1)) U G (X ((1 <= p_2_3_0_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= p_1_2_2_3_2) U (1 <= p_0_0_2_0_1)) U G (X ((1 <= p_2_3_0_1_3)))))
lola: processed formula: A ((((1 <= p_1_2_2_3_2) U (1 <= p_0_0_2_0_1)) U G (X ((1 <= p_2_3_0_1_3)))))
lola: processed formula length: 76
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üchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5123 markings, 5122 edges, 1025 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: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((3 <= p_2_1_0_1_0)) U G ((p_3_2_2_3_2 <= p_3_0_1_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((3 <= p_2_1_0_1_0)) U G ((p_3_2_2_3_2 <= p_3_0_1_2_1)))))
lola: processed formula: A (F ((G ((3 <= p_2_1_0_1_0)) U G ((p_3_2_2_3_2 <= p_3_0_1_2_1)))))
lola: processed formula length: 67
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üchi 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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 408 markings, 407 edges, 82 markings/sec, 0 secs
lola: 613 markings, 612 edges, 41 markings/sec, 5 secs
lola: 756 markings, 755 edges, 29 markings/sec, 10 secs
lola: 882 markings, 881 edges, 25 markings/sec, 15 secs
lola: 981 markings, 980 edges, 20 markings/sec, 20 secs
lola: 1052 markings, 1051 edges, 14 markings/sec, 25 secs
lola: 1067 markings, 1066 edges, 3 markings/sec, 30 secs
lola: 1073 markings, 1072 edges, 1 markings/sec, 35 secs
lola: 1083 markings, 1082 edges, 2 markings/sec, 40 secs
lola: 1099 markings, 1098 edges, 3 markings/sec, 45 secs
lola: 1110 markings, 1109 edges, 2 markings/sec, 50 secs
lola: 1119 markings, 1118 edges, 2 markings/sec, 55 secs
lola: 1132 markings, 1131 edges, 3 markings/sec, 60 secs
lola: 1148 markings, 1147 edges, 3 markings/sec, 65 secs
lola: 1153 markings, 1152 edges, 1 markings/sec, 70 secs
lola: 1166 markings, 1165 edges, 3 markings/sec, 75 secs
lola: 1173 markings, 1172 edges, 1 markings/sec, 80 secs
lola: 1183 markings, 1182 edges, 2 markings/sec, 85 secs
lola: 1199 markings, 1198 edges, 3 markings/sec, 90 secs
lola: 1205 markings, 1204 edges, 1 markings/sec, 95 secs
lola: 1214 markings, 1213 edges, 2 markings/sec, 100 secs
lola: 1222 markings, 1221 edges, 2 markings/sec, 105 secs
lola: 1230 markings, 1229 edges, 2 markings/sec, 110 secs
lola: 1246 markings, 1245 edges, 3 markings/sec, 115 secs
lola: 1256 markings, 1255 edges, 2 markings/sec, 120 secs
lola: 1262 markings, 1261 edges, 1 markings/sec, 125 secs
lola: 1271 markings, 1270 edges, 2 markings/sec, 130 secs
lola: 1289 markings, 1288 edges, 4 markings/sec, 135 secs
lola: 1297 markings, 1296 edges, 2 markings/sec, 140 secs
lola: 1306 markings, 1305 edges, 2 markings/sec, 145 secs
lola: 1323 markings, 1322 edges, 3 markings/sec, 150 secs
lola: 1335 markings, 1334 edges, 2 markings/sec, 155 secs
lola: 1344 markings, 1343 edges, 2 markings/sec, 160 secs
lola: 1356 markings, 1355 edges, 2 markings/sec, 165 secs
lola: 1373 markings, 1372 edges, 3 markings/sec, 170 secs
lola: 1384 markings, 1383 edges, 2 markings/sec, 175 secs
lola: 1403 markings, 1402 edges, 4 markings/sec, 180 secs
lola: 1427 markings, 1426 edges, 5 markings/sec, 185 secs
lola: 1451 markings, 1450 edges, 5 markings/sec, 190 secs
lola: 1475 markings, 1474 edges, 5 markings/sec, 195 secs
lola: 1499 markings, 1498 edges, 5 markings/sec, 200 secs
lola: 1522 markings, 1521 edges, 5 markings/sec, 205 secs
lola: 1542 markings, 1541 edges, 4 markings/sec, 210 secs
lola: 1552 markings, 1551 edges, 2 markings/sec, 215 secs
lola: 1558 markings, 1557 edges, 1 markings/sec, 220 secs
lola: 1565 markings, 1564 edges, 1 markings/sec, 225 secs
lola: 1571 markings, 1570 edges, 1 markings/sec, 230 secs
lola: 1577 markings, 1576 edges, 1 markings/sec, 235 secs
lola: 1587 markings, 1586 edges, 2 markings/sec, 240 secs
lola: 1606 markings, 1605 edges, 4 markings/sec, 245 secs
lola: 1622 markings, 1621 edges, 3 markings/sec, 250 secs
lola: 1632 markings, 1631 edges, 2 markings/sec, 255 secs
lola: 1641 markings, 1640 edges, 2 markings/sec, 260 secs
lola: 1650 markings, 1649 edges, 2 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((2 <= p_1_0_1_3_2))) U F ((3 <= p_1_3_0_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((2 <= p_1_0_1_3_2))) U F ((3 <= p_1_3_0_1_3))))
lola: processed formula: A ((G (X ((2 <= p_1_0_1_3_2))) U F ((3 <= p_1_3_0_1_3))))
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üchi 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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5464 markings, 5463 edges, 1093 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: ========================================
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((2 <= p_2_3_2_0_2)) U G ((2 <= p_2_3_2_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((2 <= p_2_3_2_0_2)) U G ((2 <= p_2_3_2_1_3)))))
lola: processed formula: A (F ((G ((2 <= p_2_3_2_0_2)) U G ((2 <= p_2_3_2_1_3)))))
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üchi 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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 680 markings, 679 edges, 136 markings/sec, 0 secs
lola: 999 markings, 998 edges, 64 markings/sec, 5 secs
lola: 1279 markings, 1278 edges, 56 markings/sec, 10 secs
lola: 1492 markings, 1491 edges, 43 markings/sec, 15 secs
lola: 1663 markings, 1662 edges, 34 markings/sec, 20 secs
lola: 1846 markings, 1845 edges, 37 markings/sec, 25 secs
lola: 1992 markings, 1991 edges, 29 markings/sec, 30 secs
lola: 2067 markings, 2066 edges, 15 markings/sec, 35 secs
lola: 2084 markings, 2083 edges, 3 markings/sec, 40 secs
lola: 2108 markings, 2107 edges, 5 markings/sec, 45 secs
lola: 2130 markings, 2129 edges, 4 markings/sec, 50 secs
lola: 2173 markings, 2172 edges, 9 markings/sec, 55 secs
lola: 2192 markings, 2191 edges, 4 markings/sec, 60 secs
lola: 2214 markings, 2213 edges, 4 markings/sec, 65 secs
lola: 2236 markings, 2235 edges, 4 markings/sec, 70 secs
lola: 2273 markings, 2272 edges, 7 markings/sec, 75 secs
lola: 2291 markings, 2290 edges, 4 markings/sec, 80 secs
lola: 2321 markings, 2320 edges, 6 markings/sec, 85 secs
lola: 2357 markings, 2356 edges, 7 markings/sec, 90 secs
lola: 2388 markings, 2387 edges, 6 markings/sec, 95 secs
lola: 2412 markings, 2411 edges, 5 markings/sec, 100 secs
lola: 2432 markings, 2431 edges, 4 markings/sec, 105 secs
lola: 2463 markings, 2462 edges, 6 markings/sec, 110 secs
lola: 2482 markings, 2481 edges, 4 markings/sec, 115 secs
lola: 2506 markings, 2505 edges, 5 markings/sec, 120 secs
lola: 2552 markings, 2551 edges, 9 markings/sec, 125 secs
lola: 2578 markings, 2577 edges, 5 markings/sec, 130 secs
lola: 2604 markings, 2603 edges, 5 markings/sec, 135 secs
lola: 2641 markings, 2640 edges, 7 markings/sec, 140 secs
lola: 2691 markings, 2690 edges, 10 markings/sec, 145 secs
lola: 2745 markings, 2744 edges, 11 markings/sec, 150 secs
lola: 2802 markings, 2801 edges, 11 markings/sec, 155 secs
lola: 2840 markings, 2839 edges, 8 markings/sec, 160 secs
lola: 2892 markings, 2891 edges, 10 markings/sec, 165 secs
lola: 2917 markings, 2916 edges, 5 markings/sec, 170 secs
lola: 2937 markings, 2936 edges, 4 markings/sec, 175 secs
lola: 2954 markings, 2953 edges, 3 markings/sec, 180 secs
lola: 2965 markings, 2964 edges, 2 markings/sec, 185 secs
lola: 2975 markings, 2974 edges, 2 markings/sec, 190 secs
lola: 2997 markings, 2996 edges, 4 markings/sec, 195 secs
lola: 3011 markings, 3010 edges, 3 markings/sec, 200 secs
lola: 3032 markings, 3031 edges, 4 markings/sec, 205 secs
lola: 3055 markings, 3054 edges, 5 markings/sec, 210 secs
lola: 3099 markings, 3098 edges, 9 markings/sec, 215 secs
lola: 3142 markings, 3141 edges, 9 markings/sec, 220 secs
lola: 3169 markings, 3168 edges, 5 markings/sec, 225 secs
lola: 3197 markings, 3196 edges, 6 markings/sec, 230 secs
lola: 3225 markings, 3224 edges, 6 markings/sec, 235 secs
lola: 3242 markings, 3241 edges, 3 markings/sec, 240 secs
lola: 3282 markings, 3281 edges, 8 markings/sec, 245 secs
lola: 3337 markings, 3336 edges, 11 markings/sec, 250 secs
lola: 3377 markings, 3376 edges, 8 markings/sec, 255 secs
lola: 3405 markings, 3404 edges, 6 markings/sec, 260 secs
lola: 3429 markings, 3428 edges, 5 markings/sec, 265 secs
lola: 3459 markings, 3458 edges, 6 markings/sec, 270 secs
lola: 3481 markings, 3480 edges, 4 markings/sec, 275 secs
lola: 3505 markings, 3504 edges, 5 markings/sec, 280 secs
lola: 3527 markings, 3526 edges, 4 markings/sec, 285 secs
lola: 3553 markings, 3552 edges, 5 markings/sec, 290 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (((3 <= p_2_0_2_0_3) U (1 <= p_2_1_2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((3 <= p_2_0_2_0_3) U (1 <= p_2_1_2_1_1)))))
lola: processed formula: A (X (X (((3 <= p_2_0_2_0_3) U (1 <= p_2_1_2_1_1)))))
lola: processed formula length: 53
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üchi 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: 5559 markings, 5558 edges, 1112 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: ========================================
lola: subprocess 8 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p_0_1_3_3_1 <= p_2_0_0_0_2) U (2 <= p_3_1_3_1_2)) U ((p_3_1_1_1_3 <= p_3_0_3_1_0) U (p_3_2_0_1_3 <= p_1_1_0_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p_0_1_3_3_1 <= p_2_0_0_0_2) U (2 <= p_3_1_3_1_2)) U ((p_3_1_1_1_3 <= p_3_0_3_1_0) U (p_3_2_0_1_3 <= p_1_1_0_1_3))))
lola: processed formula: A ((((p_0_1_3_3_1 <= p_2_0_0_0_2) U (2 <= p_3_1_3_1_2)) U ((p_3_1_1_1_3 <= p_3_0_3_1_0) U (p_3_2_0_1_3 <= p_1_1_0_1_3))))
lola: processed formula length: 121
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üchi 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: ========================================
lola: subprocess 9 will run for 384 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p_3_0_2_2_3 <= p_2_3_2_2_2) U X (G ((2 <= p_2_2_0_0_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p_3_0_2_2_3 <= p_2_3_2_2_2) U X (G ((2 <= p_2_2_0_0_3)))))
lola: processed formula: A (((p_3_0_2_2_3 <= p_2_3_2_2_2) U X (G ((2 <= p_2_2_0_0_3)))))
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üchi 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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5413 markings, 5412 edges, 1083 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: ========================================
lola: subprocess 10 will run for 447 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p_3_1_1_3_2 <= p_0_3_0_1_0)))
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: ========================================
lola: subprocess 11 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p_0_3_2_1_0 <= p_2_2_2_2_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((p_0_3_2_1_0 <= p_2_2_2_2_0)))
lola: processed formula: A (F ((p_0_3_2_1_0 <= p_2_2_2_2_0)))
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üchi 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: ========================================
lola: subprocess 12 will run for 670 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p_3_3_0_0_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((1 <= p_3_3_0_0_3)))
lola: processed formula: A (F ((1 <= p_3_3_0_0_3)))
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üchi 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: ========================================
lola: subprocess 13 will run for 894 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((p_2_3_1_0_3 <= p_2_1_0_1_3)) U G ((3 <= p_0_1_3_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((p_2_3_1_0_3 <= p_2_1_0_1_3)) U G ((3 <= p_0_1_3_1_3)))))
lola: processed formula: A (X ((X ((p_2_3_1_0_3 <= p_2_1_0_1_3)) U G ((3 <= p_0_1_3_1_3)))))
lola: processed formula length: 67
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üchi automaton has 7 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: 5071 markings, 5070 edges, 1014 markings/sec, 0 secs
lola: 11068 markings, 11067 edges, 1199 markings/sec, 5 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 14 will run for 1334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((p_3_1_1_1_2 <= p_2_2_2_0_2) U (p_0_0_3_2_2 <= p_1_3_0_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (((p_3_1_1_1_2 <= p_2_2_2_0_2) U (p_0_0_3_2_2 <= p_1_3_0_2_3)))))
lola: processed formula: A (G (X (((p_3_1_1_1_2 <= p_2_2_2_0_2) U (p_0_0_3_2_2 <= p_1_3_0_2_3)))))
lola: processed formula length: 73
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üchi 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: 5734 markings, 5733 edges, 1147 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: ========================================
lola: subprocess 15 will run for 2663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p_3_0_3_3_3 <= p_1_0_1_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p_3_0_3_3_3 <= p_1_0_1_2_3)))
lola: processed formula: A (X ((p_3_0_3_3_3 <= p_1_0_1_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üchi 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: 5554 markings, 5553 edges, 1111 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: RESULT
lola:
SUMMARY: no yes unknown no unknown no unknown no yes no no yes yes no no no
lola: ========================================
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-2 CANNOT_COMPUTE 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 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-9 FALSE 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 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496300152705

--------------------
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="NeighborGrid-PT-d5n4m1t35"
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/NeighborGrid-PT-d5n4m1t35.tgz
mv NeighborGrid-PT-d5n4m1t35 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 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 r208-smll-149581172200041"
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 ;