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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-149581172200039
=====================================================================

--------------------
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-CTLCardinality-0
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-1
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-15
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-2
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-3
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-4
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-5
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-6
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-7
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-8
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496298118096


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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ 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-CTLCardinality.task
lola: NOT(A (G (E (X ((p_2_0_0_3_1 <= p_0_1_3_0_2)))))) : (E (((1 <= p_1_0_1_2_0) U ((p_0_2_3_2_2 <= p_0_3_3_0_1) AND (2 <= p_3_3_1_2_0)))) AND ((A (X ((1 <= p_3_2_3_0_0))) OR (p_0_1_1_3_1 <= p_1_0_2_1_1)) OR A (F ((p_3_3_1_0_0 <= 1))))) : A (G ((((p_0_1_3_1_0 <= 1) OR (p_2_0_3_3_1 <= 2)) AND (p_2_3_1_3_1 <= p_1_0_0_2_3)))) : E ((((p_3_3_3_0_3 + 1 <= p_1_1_1_1_2) OR (p_0_0_0_1_2 <= 2)) U E (F ((2 <= p_2_0_0_1_0))))) : NOT(A (F ((((p_3_2_1_3_1 <= p_3_2_3_0_0) OR (3 <= p_1_2_1_2_2)) AND ((3 <= p_1_0_1_2_0) OR (2 <= p_3_2_3_0_0)))))) : A (F (A (G ((p_2_0_0_1_1 <= p_2_1_3_3_1))))) : (E (F (((p_2_1_1_1_0 <= p_2_0_2_1_3) AND ((3 <= p_0_0_0_1_3) OR (2 <= p_1_2_0_2_2))))) OR A (X ((p_3_2_1_2_3 <= p_3_2_2_3_1)))) : A (G (A (F ((2 <= p_2_3_3_1_3))))) : A (X ((((p_2_1_3_2_2 <= p_1_1_0_2_0) AND (p_3_1_3_1_0 <= p_1_0_1_2_3) AND ((p_0_3_0_2_0 <= p_2_0_3_2_1) OR (p_2_1_2_0_1 <= p_3_3_1_1_3))) OR E (G ((p_1_0_2_2_1 <= p_2_0_2_3_1)))))) : A (G (A (F (((2 <= p_1_3_0_2_2) AND (p_2_0_0_3_3 <= p_3_2_1_3_0)))))) : E (G (E (((2 <= p_3_0_0_3_2) U (p_0_3_2_2_1 <= p_1_1_0_3_1))))) : NOT(((((p_3_1_1_3_2 <= p_2_0_3_0_3) AND (3 <= p_2_2_3_0_0) AND ((p_0_0_3_0_1 <= p_2_2_2_1_2) OR (p_1_3_3_2_2 <= p_2_1_2_3_3))) OR A (F ((p_0_2_2_0_3 <= p_3_3_0_1_0)))) AND (A (G ((p_0_0_1_2_1 <= p_0_2_1_2_2))) AND ((p_2_0_2_1_2 <= 1) OR ((p_0_2_3_2_3 <= p_0_0_0_2_2) AND (1 <= p_0_3_0_2_2)))))) : NOT(A (G ((p_2_3_0_2_1 <= p_1_1_3_1_3)))) : (A (X ((((p_2_2_1_1_3 <= p_2_3_3_1_2) AND (p_1_2_1_1_1 <= p_1_1_2_1_1)) OR (p_0_3_3_0_3 <= 0)))) OR NOT((((p_3_0_3_1_1 + 1 <= p_2_1_2_1_0) AND (p_1_2_2_2_2 + 1 <= p_3_1_0_3_0)) OR A (F ((2 <= p_0_0_1_1_0)))))) : A (G (NOT(A (X ((1 <= p_2_3_0_2_0)))))) : NOT(((((p_1_0_0_0_3 + 1 <= p_1_2_0_2_1) OR (p_3_0_0_3_3 <= p_2_1_1_0_3)) AND E (F ((1 <= p_0_0_0_0_2)))) AND A (F (((3 <= p_2_2_3_1_2) AND (2 <= p_2_1_2_1_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: NOT(A (G (E (X ((p_2_0_0_3_1 <= p_0_1_3_0_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((p_0_1_3_0_2 + 1 <= p_2_0_0_3_1)))
lola: processed formula length: 46
lola: 7 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2373 markings, 2372 edges, 475 markings/sec, 0 secs
lola: 5235 markings, 5234 edges, 572 markings/sec, 5 secs
lola: 9289 markings, 9341 edges, 811 markings/sec, 10 secs
lola: 14901 markings, 15040 edges, 1122 markings/sec, 15 secs
lola: 20884 markings, 21194 edges, 1197 markings/sec, 20 secs
lola: 26875 markings, 27372 edges, 1198 markings/sec, 25 secs
lola: 33175 markings, 33920 edges, 1260 markings/sec, 30 secs
lola: 40245 markings, 41377 edges, 1414 markings/sec, 35 secs
lola: 48971 markings, 50494 edges, 1745 markings/sec, 40 secs
lola: 58024 markings, 59941 edges, 1811 markings/sec, 45 secs
lola: 67035 markings, 69344 edges, 1802 markings/sec, 50 secs
lola: 76042 markings, 78742 edges, 1801 markings/sec, 55 secs
lola: 85034 markings, 88125 edges, 1798 markings/sec, 60 secs
lola: 94509 markings, 99157 edges, 1895 markings/sec, 65 secs
lola: 104076 markings, 110772 edges, 1913 markings/sec, 70 secs
lola: 113629 markings, 122344 edges, 1911 markings/sec, 75 secs
lola: 123192 markings, 133931 edges, 1913 markings/sec, 80 secs
lola: 132738 markings, 145474 edges, 1909 markings/sec, 85 secs
lola: 142277 markings, 157058 edges, 1908 markings/sec, 90 secs
lola: 151827 markings, 168630 edges, 1910 markings/sec, 95 secs
lola: 161367 markings, 180184 edges, 1908 markings/sec, 100 secs
lola: 170932 markings, 191753 edges, 1913 markings/sec, 105 secs
lola: 180122 markings, 202916 edges, 1838 markings/sec, 110 secs
lola: 189680 markings, 214490 edges, 1912 markings/sec, 115 secs
lola: 199229 markings, 226043 edges, 1910 markings/sec, 120 secs
lola: 208808 markings, 237651 edges, 1916 markings/sec, 125 secs
lola: 218366 markings, 249245 edges, 1912 markings/sec, 130 secs
lola: 227181 markings, 259900 edges, 1763 markings/sec, 135 secs
lola: 236411 markings, 271116 edges, 1846 markings/sec, 140 secs
lola: 245967 markings, 282705 edges, 1911 markings/sec, 145 secs
lola: 255033 markings, 293655 edges, 1813 markings/sec, 150 secs
lola: 264488 markings, 305142 edges, 1891 markings/sec, 155 secs
lola: 273940 markings, 316605 edges, 1890 markings/sec, 160 secs
lola: 283431 markings, 328077 edges, 1898 markings/sec, 165 secs
lola: 292729 markings, 339333 edges, 1860 markings/sec, 170 secs
lola: 301853 markings, 350415 edges, 1825 markings/sec, 175 secs
lola: 310946 markings, 361410 edges, 1819 markings/sec, 180 secs
lola: 320043 markings, 372445 edges, 1819 markings/sec, 185 secs
lola: 328534 markings, 382741 edges, 1698 markings/sec, 190 secs
lola: 338244 markings, 394505 edges, 1942 markings/sec, 195 secs
lola: 347950 markings, 406276 edges, 1941 markings/sec, 200 secs
lola: 357661 markings, 418043 edges, 1942 markings/sec, 205 secs
lola: 367362 markings, 429789 edges, 1940 markings/sec, 210 secs
lola: 377081 markings, 441546 edges, 1944 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((1 <= p_1_0_1_2_0) U ((p_0_2_3_2_2 <= p_0_3_3_0_1) AND (2 <= p_3_3_1_2_0)))) AND ((A (X ((1 <= p_3_2_3_0_0))) OR (p_0_1_1_3_1 <= p_1_0_2_1_1)) OR A (F ((p_3_3_1_0_0 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((1 <= p_1_0_1_2_0) U ((p_0_2_3_2_2 <= p_0_3_3_0_1) AND (2 <= p_3_3_1_2_0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((1 <= p_1_0_1_2_0) U ((p_0_2_3_2_2 <= p_0_3_3_0_1) AND (2 <= p_3_3_1_2_0)))
lola: processed formula length: 77
lola: 2 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 7210 markings, 7209 edges, 1442 markings/sec, 0 secs
lola: 22903 markings, 23024 edges, 3139 markings/sec, 5 secs
lola: 41352 markings, 41831 edges, 3690 markings/sec, 10 secs
lola: 62184 markings, 63278 edges, 4166 markings/sec, 15 secs
lola: 88644 markings, 90446 edges, 5292 markings/sec, 20 secs
lola: 115911 markings, 118450 edges, 5453 markings/sec, 25 secs
lola: 143313 markings, 146883 edges, 5480 markings/sec, 30 secs
lola: 171124 markings, 178448 edges, 5562 markings/sec, 35 secs
lola: 198910 markings, 209988 edges, 5557 markings/sec, 40 secs
lola: 226671 markings, 241472 edges, 5552 markings/sec, 45 secs
lola: 254439 markings, 273002 edges, 5554 markings/sec, 50 secs
lola: 282188 markings, 304505 edges, 5550 markings/sec, 55 secs
lola: 309956 markings, 335998 edges, 5554 markings/sec, 60 secs
lola: 337782 markings, 367581 edges, 5565 markings/sec, 65 secs
lola: 365602 markings, 399154 edges, 5564 markings/sec, 70 secs
lola: 393432 markings, 430736 edges, 5566 markings/sec, 75 secs
lola: 421260 markings, 462319 edges, 5566 markings/sec, 80 secs
lola: 449053 markings, 493862 edges, 5559 markings/sec, 85 secs
lola: 476858 markings, 525404 edges, 5561 markings/sec, 90 secs
lola: 504668 markings, 556963 edges, 5562 markings/sec, 95 secs
lola: 532489 markings, 588539 edges, 5564 markings/sec, 100 secs
lola: 560285 markings, 620089 edges, 5559 markings/sec, 105 secs
lola: 588107 markings, 651645 edges, 5564 markings/sec, 110 secs
lola: 615944 markings, 683224 edges, 5567 markings/sec, 115 secs
lola: 643778 markings, 714819 edges, 5567 markings/sec, 120 secs
lola: 671594 markings, 746361 edges, 5563 markings/sec, 125 secs
lola: 699390 markings, 777899 edges, 5559 markings/sec, 130 secs
lola: 727205 markings, 809471 edges, 5563 markings/sec, 135 secs
lola: 755001 markings, 841021 edges, 5559 markings/sec, 140 secs
lola: 782825 markings, 872605 edges, 5565 markings/sec, 145 secs
lola: 810610 markings, 904119 edges, 5557 markings/sec, 150 secs
lola: 838416 markings, 935680 edges, 5561 markings/sec, 155 secs
lola: 866243 markings, 967273 edges, 5565 markings/sec, 160 secs
lola: 894056 markings, 998842 edges, 5563 markings/sec, 165 secs
lola: 921893 markings, 1030424 edges, 5567 markings/sec, 170 secs
lola: 949708 markings, 1061977 edges, 5563 markings/sec, 175 secs
lola: 977547 markings, 1093586 edges, 5568 markings/sec, 180 secs
lola: 1005327 markings, 1125100 edges, 5556 markings/sec, 185 secs
lola: 1033115 markings, 1156642 edges, 5558 markings/sec, 190 secs
lola: 1060886 markings, 1188155 edges, 5554 markings/sec, 195 secs
lola: 1088699 markings, 1219710 edges, 5563 markings/sec, 200 secs
lola: 1116538 markings, 1251301 edges, 5568 markings/sec, 205 secs
lola: 1144369 markings, 1282891 edges, 5566 markings/sec, 210 secs
lola: 1172187 markings, 1314469 edges, 5564 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p_0_1_3_1_0 <= 1) OR (p_2_0_3_3_1 <= 2)) AND (p_2_3_1_3_1 <= p_1_0_0_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d5n4m1t35-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file NeighborGrid-PT-d5n4m1t35-CTLCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p_3_3_3_0_3 + 1 <= p_1_1_1_1_2) OR (p_0_0_0_1_2 <= 2)) U E (F ((2 <= p_2_0_0_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p_3_3_3_0_3 + 1 <= p_1_1_1_1_2) OR (p_0_0_0_1_2 <= 2)) U E(TRUE U (2 <= p_2_0_0_1_0)))
lola: processed formula length: 91
lola: 2 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 5376 markings, 5376 edges, 2561584191154159616 markings/sec, 0 secs
lola: 14297 markings, 14407 edges, 1784 markings/sec, 5 secs
lola: 26589 markings, 27078 edges, 2458 markings/sec, 10 secs
lola: 40180 markings, 41310 edges, 2718 markings/sec, 15 secs
lola: 58252 markings, 60180 edges, 3614 markings/sec, 20 secs
lola: 76593 markings, 79318 edges, 3668 markings/sec, 25 secs
lola: 95365 markings, 100218 edges, 3754 markings/sec, 30 secs
lola: 114636 markings, 123550 edges, 3854 markings/sec, 35 secs
lola: 133893 markings, 146908 edges, 3851 markings/sec, 40 secs
lola: 153144 markings, 170202 edges, 3850 markings/sec, 45 secs
lola: 172399 markings, 193550 edges, 3851 markings/sec, 50 secs
lola: 191638 markings, 216853 edges, 3848 markings/sec, 55 secs
lola: 210895 markings, 240196 edges, 3851 markings/sec, 60 secs
lola: 230142 markings, 263529 edges, 3849 markings/sec, 65 secs
lola: 249388 markings, 286826 edges, 3849 markings/sec, 70 secs
lola: 268625 markings, 310146 edges, 3847 markings/sec, 75 secs
lola: 287864 markings, 333456 edges, 3848 markings/sec, 80 secs
lola: 307125 markings, 356805 edges, 3852 markings/sec, 85 secs
lola: 326397 markings, 380125 edges, 3854 markings/sec, 90 secs
lola: 345663 markings, 403493 edges, 3853 markings/sec, 95 secs
lola: 364927 markings, 426827 edges, 3853 markings/sec, 100 secs
lola: 384226 markings, 450224 edges, 3860 markings/sec, 105 secs
lola: 403514 markings, 473599 edges, 3858 markings/sec, 110 secs
lola: 422798 markings, 496957 edges, 3857 markings/sec, 115 secs
lola: 442068 markings, 520317 edges, 3854 markings/sec, 120 secs
lola: 459739 markings, 541727 edges, 3534 markings/sec, 125 secs
lola: 478925 markings, 564953 edges, 3837 markings/sec, 130 secs
lola: 498114 markings, 588233 edges, 3838 markings/sec, 135 secs
lola: 517296 markings, 611437 edges, 3836 markings/sec, 140 secs
lola: 536479 markings, 634711 edges, 3837 markings/sec, 145 secs
lola: 555692 markings, 657973 edges, 3843 markings/sec, 150 secs
lola: 574883 markings, 681234 edges, 3838 markings/sec, 155 secs
lola: 594076 markings, 704491 edges, 3839 markings/sec, 160 secs
lola: 613259 markings, 727756 edges, 3837 markings/sec, 165 secs
lola: 632438 markings, 751002 edges, 3836 markings/sec, 170 secs
lola: 651626 markings, 774222 edges, 3838 markings/sec, 175 secs
lola: 670802 markings, 797482 edges, 3835 markings/sec, 180 secs
lola: 689977 markings, 820685 edges, 3835 markings/sec, 185 secs
lola: 709184 markings, 843982 edges, 3841 markings/sec, 190 secs
lola: 728389 markings, 867233 edges, 3841 markings/sec, 195 secs
lola: 747588 markings, 890517 edges, 3840 markings/sec, 200 secs
lola: 766779 markings, 913741 edges, 3838 markings/sec, 205 secs
lola: 785976 markings, 937021 edges, 3839 markings/sec, 210 secs
lola: 805169 markings, 960263 edges, 3839 markings/sec, 215 secs
lola: 824359 markings, 983526 edges, 3838 markings/sec, 220 secs
lola: 843533 markings, 1006758 edges, 3835 markings/sec, 225 secs
lola: 862734 markings, 1030040 edges, 3840 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((((p_3_2_1_3_1 <= p_3_2_3_0_0) OR (3 <= p_1_2_1_2_2)) AND ((3 <= p_1_0_1_2_0) OR (2 <= p_3_2_3_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p_3_2_1_3_1 <= p_3_2_3_0_0) OR (3 <= p_1_2_1_2_2)) AND ((3 <= p_1_0_1_2_0) OR (2 <= p_3_2_3_0_0)))))
lola: processed formula length: 118
lola: 5 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 5528 markings, 5527 edges, 1106 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p_2_0_0_1_1 <= p_2_1_3_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (p_2_1_3_3_1 + 1 <= p_2_0_0_1_1))))
lola: processed formula length: 57
lola: 3 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 4049 markings, 6936 edges, 2317418942508826624 markings/sec, 0 secs
lola: 6328 markings, 17367 edges, 456 markings/sec, 5 secs
lola: 17064 markings, 28294 edges, 2147 markings/sec, 10 secs
lola: 29440 markings, 41059 edges, 2475 markings/sec, 15 secs
lola: 44106 markings, 56469 edges, 2933 markings/sec, 20 secs
lola: 62243 markings, 75383 edges, 3627 markings/sec, 25 secs
lola: 80506 markings, 94440 edges, 3653 markings/sec, 30 secs
lola: 90174 markings, 108776 edges, 1934 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((p_2_1_1_1_0 <= p_2_0_2_1_3) AND ((3 <= p_0_0_0_1_3) OR (2 <= p_1_2_0_2_2))))) OR A (X ((p_3_2_1_2_3 <= p_3_2_2_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p_2_1_1_1_0 <= p_2_0_2_1_3) AND ((3 <= p_0_0_0_1_3) OR (2 <= p_1_2_0_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d5n4m1t35-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file NeighborGrid-PT-d5n4m1t35-CTLCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((2 <= p_2_3_3_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (2 <= p_2_3_3_1_3)))))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 5505 markings, 5505 edges, 2073443909375098880 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((((p_2_1_3_2_2 <= p_1_1_0_2_0) AND (p_3_1_3_1_0 <= p_1_0_1_2_3) AND ((p_0_3_0_2_0 <= p_2_0_3_2_1) OR (p_2_1_2_0_1 <= p_3_3_1_1_3))) OR E (G ((p_1_0_2_2_1 <= p_2_0_2_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((((p_2_1_3_2_2 <= p_1_1_0_2_0) AND (p_3_1_3_1_0 <= p_1_0_1_2_3) AND ((p_0_3_0_2_0 <= p_2_0_3_2_1) OR (p_2_1_2_0_1 <= p_3_3_1_1_3))) OR NOT(A(TRUE U (p_2_0_2_3_1 + 1 <= p_1_0_2_2_1)))))
lola: processed formula length: 188
lola: 3 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 7976 markings, 7981 edges, 3096159597753270272 markings/sec, 0 secs
lola: 16623 markings, 16635 edges, 1729 markings/sec, 5 secs
lola: 25649 markings, 25668 edges, 1805 markings/sec, 10 secs
lola: 33745 markings, 33771 edges, 1619 markings/sec, 15 secs
lola: 42462 markings, 42494 edges, 1743 markings/sec, 20 secs
lola: 51125 markings, 51165 edges, 1733 markings/sec, 25 secs
lola: 59969 markings, 60017 edges, 1769 markings/sec, 30 secs
lola: 68131 markings, 68187 edges, 1632 markings/sec, 35 secs
lola: 76808 markings, 76872 edges, 1735 markings/sec, 40 secs
lola: 84028 markings, 84093 edges, 1444 markings/sec, 45 secs
lola: 91948 markings, 92019 edges, 1584 markings/sec, 50 secs
lola: 100483 markings, 100562 edges, 1707 markings/sec, 55 secs
lola: 111297 markings, 111390 edges, 2163 markings/sec, 60 secs
lola: 118321 markings, 118414 edges, 1405 markings/sec, 65 secs
lola: 126757 markings, 126857 edges, 1687 markings/sec, 70 secs
lola: 136821 markings, 136935 edges, 2013 markings/sec, 75 secs
lola: 145692 markings, 145813 edges, 1774 markings/sec, 80 secs
lola: 152508 markings, 152629 edges, 1363 markings/sec, 85 secs
lola: 160903 markings, 161031 edges, 1679 markings/sec, 90 secs
lola: 169718 markings, 169853 edges, 1763 markings/sec, 95 secs
lola: 179692 markings, 179841 edges, 1995 markings/sec, 100 secs
lola: 188652 markings, 188808 edges, 1792 markings/sec, 105 secs
lola: 197126 markings, 197289 edges, 1695 markings/sec, 110 secs
lola: 204415 markings, 204578 edges, 1458 markings/sec, 115 secs
lola: 212876 markings, 213046 edges, 1692 markings/sec, 120 secs
lola: 221729 markings, 221906 edges, 1771 markings/sec, 125 secs
lola: 231198 markings, 231384 edges, 1894 markings/sec, 130 secs
lola: 239936 markings, 240130 edges, 1748 markings/sec, 135 secs
lola: 247934 markings, 248135 edges, 1600 markings/sec, 140 secs
lola: 257195 markings, 257404 edges, 1852 markings/sec, 145 secs
lola: 265554 markings, 265771 edges, 1672 markings/sec, 150 secs
lola: 273976 markings, 274200 edges, 1684 markings/sec, 155 secs
lola: 282826 markings, 283058 edges, 1770 markings/sec, 160 secs
lola: 291819 markings, 292059 edges, 1799 markings/sec, 165 secs
lola: 300592 markings, 300841 edges, 1755 markings/sec, 170 secs
lola: 308638 markings, 308894 edges, 1609 markings/sec, 175 secs
lola: 317232 markings, 317495 edges, 1719 markings/sec, 180 secs
lola: 326100 markings, 326370 edges, 1774 markings/sec, 185 secs
lola: 335134 markings, 335411 edges, 1807 markings/sec, 190 secs
lola: 341791 markings, 342068 edges, 1331 markings/sec, 195 secs
lola: 350162 markings, 350446 edges, 1674 markings/sec, 200 secs
lola: 361969 markings, 362268 edges, 2361 markings/sec, 205 secs
lola: 370258 markings, 370564 edges, 1658 markings/sec, 210 secs
lola: 380675 markings, 380995 edges, 2083 markings/sec, 215 secs
lola: 389692 markings, 390019 edges, 1803 markings/sec, 220 secs
lola: 397660 markings, 397994 edges, 1594 markings/sec, 225 secs
lola: 406435 markings, 406776 edges, 1755 markings/sec, 230 secs
lola: 413358 markings, 413699 edges, 1385 markings/sec, 235 secs
lola: 421764 markings, 422113 edges, 1681 markings/sec, 240 secs
lola: 432212 markings, 432576 edges, 2090 markings/sec, 245 secs
lola: 440768 markings, 441139 edges, 1711 markings/sec, 250 secs
lola: 449548 markings, 449926 edges, 1756 markings/sec, 255 secs
lola: 458085 markings, 458470 edges, 1707 markings/sec, 260 secs
lola: 465590 markings, 465976 edges, 1501 markings/sec, 265 secs
lola: 475157 markings, 475557 edges, 1913 markings/sec, 270 secs
lola: 485411 markings, 485825 edges, 2051 markings/sec, 275 secs
lola: 493320 markings, 493741 edges, 1582 markings/sec, 280 secs
lola: 503498 markings, 503929 edges, 2036 markings/sec, 285 secs
lola: 510615 markings, 511047 edges, 1423 markings/sec, 290 secs
lola: 520528 markings, 520974 edges, 1983 markings/sec, 295 secs
lola: 529662 markings, 530117 edges, 1827 markings/sec, 300 secs
lola: 536550 markings, 537005 edges, 1378 markings/sec, 305 secs
lola: 545110 markings, 545572 edges, 1712 markings/sec, 310 secs
lola: 553736 markings, 554206 edges, 1725 markings/sec, 315 secs
lola: 562745 markings, 563223 edges, 1802 markings/sec, 320 secs
lola: 571178 markings, 571663 edges, 1687 markings/sec, 325 secs
lola: 579762 markings, 580254 edges, 1717 markings/sec, 330 secs
lola: 588785 markings, 589285 edges, 1805 markings/sec, 335 secs
lola: 596830 markings, 597338 edges, 1609 markings/sec, 340 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((2 <= p_1_3_0_2_2) AND (p_2_0_0_3_3 <= p_3_2_1_3_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((2 <= p_1_3_0_2_2) AND (p_2_0_0_3_3 <= p_3_2_1_3_0))))))
lola: processed formula length: 83
lola: 2 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 12931 markings, 12931 edges, 3110627521507360768 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (((2 <= p_3_0_0_3_2) U (p_0_3_2_2_1 <= p_1_1_0_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((2 <= p_3_0_0_3_2) U (p_0_3_2_2_1 <= p_1_1_0_3_1)))))
lola: processed formula length: 72
lola: 2 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 10223 markings, 20445 edges, 2313940637474357248 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 487 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((p_3_1_1_3_2 <= p_2_0_3_0_3) AND (3 <= p_2_2_3_0_0) AND ((p_0_0_3_0_1 <= p_2_2_2_1_2) OR (p_1_3_3_2_2 <= p_2_1_2_3_3))) OR A (F ((p_0_2_2_0_3 <= p_3_3_0_1_0)))) AND (A (G ((p_0_0_1_2_1 <= p_0_2_1_2_2))) AND ((p_2_0_2_1_2 <= 1) OR ((p_0_2_3_2_3 <= p_0_0_0_2_2) AND (1 <= p_0_3_0_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 487 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p_2_0_3_0_3 + 1 <= p_3_1_1_3_2) OR (p_2_2_3_0_0 <= 2) OR ((p_2_2_2_1_2 + 1 <= p_0_0_3_0_1) AND (p_2_1_2_3_3 + 1 <= p_1_3_3_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_2_0_3_0_3 + 1 <= p_3_1_1_3_2) OR (p_2_2_3_0_0 <= 2) OR ((p_2_2_2_1_2 + 1 <= p_0_0_3_0_1) AND (p_2_1_2_3_3 + 1 <= p_1_3_3_2_2)))
lola: processed formula length: 133
lola: 11 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
lola: processed formula with 4 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 12 will run for 608 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p_3_3_0_1_0 + 1 <= p_0_2_2_0_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p_0_2_2_0_3 <= p_3_3_0_1_0)))
lola: processed formula length: 43
lola: 13 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p_0_2_1_2_2 + 1 <= p_0_0_1_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d5n4m1t35-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file NeighborGrid-PT-d5n4m1t35-CTLCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
========================================lola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 608 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((p_2_3_0_2_1 <= p_1_1_3_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d5n4m1t35-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file NeighborGrid-PT-d5n4m1t35-CTLCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X ((((p_2_2_1_1_3 <= p_2_3_3_1_2) AND (p_1_2_1_1_1 <= p_1_1_2_1_1)) OR (p_0_3_3_0_3 <= 0)))) OR NOT((((p_3_0_3_1_1 + 1 <= p_2_1_2_1_0) AND (p_1_2_2_2_2 + 1 <= p_3_1_0_3_0)) OR A (F ((2 <= p_0_0_1_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((((p_2_2_1_1_3 <= p_2_3_3_1_2) AND (p_1_2_1_1_1 <= p_1_1_2_1_1)) OR (p_0_3_3_0_3 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((((p_2_2_1_1_3 <= p_2_3_3_1_2) AND (p_1_2_1_1_1 <= p_1_1_2_1_1)) OR (p_0_3_3_0_3 <= 0)))
lola: processed formula length: 92
lola: 6 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1216 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p_2_1_2_1_0 <= p_3_0_3_1_1) OR (p_3_1_0_3_0 <= p_1_2_2_2_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_2_1_2_1_0 <= p_3_0_3_1_1) OR (p_3_1_0_3_0 <= p_1_2_2_2_2))
lola: processed formula length: 63
lola: 5 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
lola: processed formula with 2 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 15 will run for 2433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p_0_0_1_1_0 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p_0_0_1_1_0)))
lola: processed formula length: 33
lola: 7 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 5463 markings, 5462 edges, 3689348869717491712 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 14 will run for 1213 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (X ((1 <= p_2_3_0_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: NOT(E(TRUE U NOT(EX((p_2_3_0_2_0 <= 0)))))
lola: processed formula length: 42
lola: 5 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 38 markings, 37 edges, 3224912959121653760 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 2417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((p_1_0_0_0_3 + 1 <= p_1_2_0_2_1) OR (p_3_0_0_3_3 <= p_2_1_1_0_3)) AND E (F ((1 <= p_0_0_0_0_2)))) AND A (F (((3 <= p_2_2_3_1_2) AND (2 <= p_2_1_2_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p_1_2_0_2_1 <= p_1_0_0_0_3) AND (p_2_1_1_0_3 + 1 <= p_3_0_0_3_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_1_2_0_2_1 <= p_1_0_0_0_3) AND (p_2_1_1_0_3 + 1 <= p_3_0_0_3_3))
lola: processed formula length: 67
lola: 10 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
lola: processed formula with 2 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p_2_2_3_1_2 <= 2) OR (p_2_1_2_1_1 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((3 <= p_2_2_3_1_2) AND (2 <= p_2_1_2_1_1))))
lola: processed formula length: 58
lola: 12 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown unknown no unknown yes no yes no unknown no yes yes yes yes no unknown
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496299243198

--------------------
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="CTLCardinality"
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 CTLCardinality"
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-149581172200039"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;