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 S_PolyORBLF-COL-S06J04T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681500374
=====================================================================

--------------------
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 PolyORBLF-COL-S06J04T04-LTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496417468830


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PolyORBLF-COL-S06J04T04: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_PolyORBLF-COL-S06J04T04: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
LTLCardinality @ S_PolyORBLF-COL-S06J04T04 @ 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: 7448/65536 symbol table entries, 2235 collisions
lola: preprocessing...
lola: finding significant places
lola: 454 places, 6994 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1823 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: A ((p168 <= p169)) : A ((1 <= p259 + p260 + p261 + p262)) : A (X (G (F (X ((p240 <= p377)))))) : A (F (F (G (F ((p119 + p120 + p121 + p122 <= p420 + p421 + p422 + p423)))))) : A ((F (X ((p147 + p148 + p149 + p150 + p151 + p152 <= p175 + p176 + p177 + p178))) U G (G ((3 <= p27))))) : A (G (X ((2 <= p356 + p355 + p354 + p353 + p352 + p351)))) : A (X (G (G (F ((1 <= p90 + p91 + p92 + p93)))))) : A ((((p170 <= p50 + p51 + p49 + p48) U (2 <= p27)) U (p268 <= p240))) : A (F ((G ((p424 + p425 + p426 + p427 <= p54 + p53 + p52 + p55)) U G ((2 <= p23 + p24 + p25 + p26))))) : A (G (F (((p268 <= p267) U (1 <= p118))))) : A (F ((p362 + p363 + p364 + p365 + p366 + p367 <= p269 + p270 + p271 + p272))) : A ((X ((1 <= p387 + p388 + p389 + p390)) U (p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 <= p356 + p355 + p354 + p353 + p352 + p351))) : A (G (G (((p344 <= p378) U (3 <= p208 + p209 + p210 + p211))))) : A (G (F (((1 <= p335 + p336 + p337 + p338) U (3 <= p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235))))) : A (((3 <= p387 + p388 + p389 + p390) U ((2 <= p54 + p53 + p52 + p55) U (p163 + p164 + p165 + p166 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47)))) : A (G (X (F (G ((p259 + p260 + p261 + p262 <= p251 + p252 + p253 + p254))))))
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 ((p168 <= p169))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p168 <= p169)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p259 + p260 + p261 + p262))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p259 + p260 + p261 + p262)
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (X ((p240 <= p377))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (F (X ((p240 <= p377))))))
lola: processed formula: A (X (G (F (X ((p240 <= p377))))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (F ((p119 + p120 + p121 + p122 <= p420 + p421 + p422 + p423))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p119 + p120 + p121 + p122 <= p420 + p421 + p422 + p423))))
lola: processed formula: A (G (F ((p119 + p120 + p121 + p122 <= p420 + p421 + p422 + p423))))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 10570 markings, 23101 edges, 2114 markings/sec, 0 secs
lola: 21067 markings, 43530 edges, 2099 markings/sec, 5 secs
lola: 32278 markings, 66206 edges, 2242 markings/sec, 10 secs
lola: 42596 markings, 83100 edges, 2064 markings/sec, 15 secs
lola: 53126 markings, 100800 edges, 2106 markings/sec, 20 secs
lola: 63949 markings, 116519 edges, 2165 markings/sec, 25 secs
lola: 74518 markings, 131735 edges, 2114 markings/sec, 30 secs
lola: 85643 markings, 149044 edges, 2225 markings/sec, 35 secs
lola: 96727 markings, 165861 edges, 2217 markings/sec, 40 secs
lola: 107238 markings, 178692 edges, 2102 markings/sec, 45 secs
lola: 118089 markings, 193952 edges, 2170 markings/sec, 50 secs
lola: 129315 markings, 210989 edges, 2245 markings/sec, 55 secs
lola: 140409 markings, 226627 edges, 2219 markings/sec, 60 secs
lola: 151419 markings, 244191 edges, 2202 markings/sec, 65 secs
lola: 161917 markings, 258068 edges, 2100 markings/sec, 70 secs
lola: 171940 markings, 271817 edges, 2005 markings/sec, 75 secs
lola: 182042 markings, 284629 edges, 2020 markings/sec, 80 secs
lola: 192694 markings, 298329 edges, 2130 markings/sec, 85 secs
lola: 203142 markings, 312980 edges, 2090 markings/sec, 90 secs
lola: 213321 markings, 324974 edges, 2036 markings/sec, 95 secs
lola: 223740 markings, 338380 edges, 2084 markings/sec, 100 secs
lola: 234105 markings, 353553 edges, 2073 markings/sec, 105 secs
lola: 244112 markings, 365333 edges, 2001 markings/sec, 110 secs
lola: 253878 markings, 377206 edges, 1953 markings/sec, 115 secs
lola: 263577 markings, 387931 edges, 1940 markings/sec, 120 secs
lola: 273545 markings, 400480 edges, 1994 markings/sec, 125 secs
lola: 282935 markings, 411189 edges, 1878 markings/sec, 130 secs
lola: 292463 markings, 422200 edges, 1906 markings/sec, 135 secs
lola: 302054 markings, 433815 edges, 1918 markings/sec, 140 secs
lola: 312196 markings, 445990 edges, 2028 markings/sec, 145 secs
lola: 322096 markings, 458611 edges, 1980 markings/sec, 150 secs
lola: 331858 markings, 470100 edges, 1952 markings/sec, 155 secs
lola: 341907 markings, 482692 edges, 2010 markings/sec, 160 secs
lola: 351586 markings, 494377 edges, 1936 markings/sec, 165 secs
lola: 361211 markings, 505014 edges, 1925 markings/sec, 170 secs
lola: 370568 markings, 515694 edges, 1871 markings/sec, 175 secs
lola: 380671 markings, 528377 edges, 2021 markings/sec, 180 secs
lola: 390326 markings, 540929 edges, 1931 markings/sec, 185 secs
lola: 400256 markings, 553409 edges, 1986 markings/sec, 190 secs
lola: 409593 markings, 563943 edges, 1867 markings/sec, 195 secs
lola: 419163 markings, 575574 edges, 1914 markings/sec, 200 secs
lola: 428721 markings, 586614 edges, 1912 markings/sec, 205 secs
lola: 438581 markings, 598686 edges, 1972 markings/sec, 210 secs
lola: 448161 markings, 609465 edges, 1916 markings/sec, 215 secs
lola: 457986 markings, 621595 edges, 1965 markings/sec, 220 secs
lola: 467586 markings, 632416 edges, 1920 markings/sec, 225 secs
lola: 477110 markings, 643480 edges, 1905 markings/sec, 230 secs
lola: 486420 markings, 653803 edges, 1862 markings/sec, 235 secs
lola: 496122 markings, 665549 edges, 1940 markings/sec, 240 secs
lola: 505633 markings, 676521 edges, 1902 markings/sec, 245 secs
lola: 515235 markings, 687818 edges, 1920 markings/sec, 250 secs
lola: 524978 markings, 699178 edges, 1949 markings/sec, 255 secs
lola: 534611 markings, 710032 edges, 1927 markings/sec, 260 secs
lola: 544063 markings, 720806 edges, 1890 markings/sec, 265 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 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((p147 + p148 + p149 + p150 + p151 + p152 <= p175 + p176 + p177 + p178))) U G (G ((3 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (X ((p147 + p148 + p149 + p150 + p151 + p152 <= p175 + p176 + p177 + p178))) U G (G ((3 <= p27)))))
lola: processed formula: A ((F (X ((p147 + p148 + p149 + p150 + p151 + p152 <= p175 + p176 + p177 + p178))) U G (G ((3 <= p27)))))
lola: processed formula length: 105
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((2 <= p356 + p355 + p354 + p353 + p352 + p351))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((2 <= p356 + p355 + p354 + p353 + p352 + p351))))
lola: processed formula: A (G (X ((2 <= p356 + p355 + p354 + p353 + p352 + p351))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (F ((1 <= p90 + p91 + p92 + p93))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (G (F ((1 <= p90 + p91 + p92 + p93))))))
lola: processed formula: A (X (G (G (F ((1 <= p90 + p91 + p92 + p93))))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p170 <= p50 + p51 + p49 + p48) U (2 <= p27)) U (p268 <= p240)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p170 <= p50 + p51 + p49 + p48) U (2 <= p27)) U (p268 <= p240)))
lola: processed formula: A ((((p170 <= p50 + p51 + p49 + p48) U (2 <= p27)) U (p268 <= p240)))
lola: processed formula length: 69
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((p424 + p425 + p426 + p427 <= p54 + p53 + p52 + p55)) U G ((2 <= p23 + p24 + p25 + p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((p424 + p425 + p426 + p427 <= p54 + p53 + p52 + p55)) U G ((2 <= p23 + p24 + p25 + p26)))))
lola: processed formula: A (F ((G ((p424 + p425 + p426 + p427 <= p54 + p53 + p52 + p55)) U G ((2 <= p23 + p24 + p25 + p26)))))
lola: processed formula length: 101
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p268 <= p267) U (1 <= p118)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((p268 <= p267) U (1 <= p118)))))
lola: processed formula: A (G (F (((p268 <= p267) U (1 <= p118)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 9260 markings, 15261 edges, 1852 markings/sec, 0 secs
lola: 18474 markings, 31737 edges, 1843 markings/sec, 5 secs
lola: 27372 markings, 45796 edges, 1780 markings/sec, 10 secs
lola: 36474 markings, 60231 edges, 1820 markings/sec, 15 secs
lola: 45500 markings, 76870 edges, 1805 markings/sec, 20 secs
lola: 53643 markings, 92411 edges, 1629 markings/sec, 25 secs
lola: 63148 markings, 108244 edges, 1901 markings/sec, 30 secs
lola: 72177 markings, 124198 edges, 1806 markings/sec, 35 secs
lola: 81274 markings, 138573 edges, 1819 markings/sec, 40 secs
lola: 90519 markings, 153280 edges, 1849 markings/sec, 45 secs
lola: 99270 markings, 169917 edges, 1750 markings/sec, 50 secs
lola: 107825 markings, 185448 edges, 1711 markings/sec, 55 secs
lola: 117280 markings, 201530 edges, 1891 markings/sec, 60 secs
lola: 126230 markings, 217141 edges, 1790 markings/sec, 65 secs
lola: 135394 markings, 231701 edges, 1833 markings/sec, 70 secs
lola: 144464 markings, 246216 edges, 1814 markings/sec, 75 secs
lola: 152960 markings, 262814 edges, 1699 markings/sec, 80 secs
lola: 162169 markings, 280143 edges, 1842 markings/sec, 85 secs
lola: 172138 markings, 297112 edges, 1994 markings/sec, 90 secs
lola: 181718 markings, 315183 edges, 1916 markings/sec, 95 secs
lola: 191886 markings, 332292 edges, 2034 markings/sec, 100 secs
lola: 201270 markings, 351419 edges, 1877 markings/sec, 105 secs
lola: 211355 markings, 368891 edges, 2017 markings/sec, 110 secs
lola: 219656 markings, 390393 edges, 1660 markings/sec, 115 secs
lola: 227801 markings, 409946 edges, 1629 markings/sec, 120 secs
lola: 237479 markings, 427201 edges, 1936 markings/sec, 125 secs
lola: 246791 markings, 442294 edges, 1862 markings/sec, 130 secs
lola: 256403 markings, 457530 edges, 1922 markings/sec, 135 secs
lola: 264783 markings, 475027 edges, 1676 markings/sec, 140 secs
lola: 274335 markings, 491069 edges, 1910 markings/sec, 145 secs
lola: 283625 markings, 507230 edges, 1858 markings/sec, 150 secs
lola: 293162 markings, 522230 edges, 1907 markings/sec, 155 secs
lola: 301854 markings, 539235 edges, 1738 markings/sec, 160 secs
lola: 310861 markings, 554892 edges, 1801 markings/sec, 165 secs
lola: 320324 markings, 571406 edges, 1893 markings/sec, 170 secs
lola: 329420 markings, 586193 edges, 1819 markings/sec, 175 secs
lola: 338341 markings, 602709 edges, 1784 markings/sec, 180 secs
lola: 348016 markings, 621123 edges, 1935 markings/sec, 185 secs
lola: 358460 markings, 640858 edges, 2089 markings/sec, 190 secs
lola: 369368 markings, 659953 edges, 2182 markings/sec, 195 secs
lola: 379940 markings, 679991 edges, 2114 markings/sec, 200 secs
lola: 389150 markings, 701911 edges, 1842 markings/sec, 205 secs
lola: 398035 markings, 720393 edges, 1777 markings/sec, 210 secs
lola: 407278 markings, 736601 edges, 1849 markings/sec, 215 secs
lola: 416462 markings, 752259 edges, 1837 markings/sec, 220 secs
lola: 425577 markings, 769303 edges, 1823 markings/sec, 225 secs
lola: 434206 markings, 785472 edges, 1726 markings/sec, 230 secs
lola: 443270 markings, 802107 edges, 1813 markings/sec, 235 secs
lola: 452325 markings, 817155 edges, 1811 markings/sec, 240 secs
lola: 461887 markings, 833202 edges, 1912 markings/sec, 245 secs
lola: 470271 markings, 851223 edges, 1677 markings/sec, 250 secs
lola: 479550 markings, 867194 edges, 1856 markings/sec, 255 secs
lola: 488318 markings, 882587 edges, 1754 markings/sec, 260 secs
lola: 497763 markings, 898309 edges, 1889 markings/sec, 265 secs
lola: 506674 markings, 915853 edges, 1782 markings/sec, 270 secs
lola: 516235 markings, 934255 edges, 1912 markings/sec, 275 secs
lola: 526047 markings, 953682 edges, 1962 markings/sec, 280 secs
lola: 536441 markings, 971652 edges, 2079 markings/sec, 285 secs
lola: 546195 markings, 991798 edges, 1951 markings/sec, 290 secs
lola: 555784 markings, 1012541 edges, 1918 markings/sec, 295 secs
lola: 564595 markings, 1033769 edges, 1762 markings/sec, 300 secs
lola: 574614 markings, 1051234 edges, 2004 markings/sec, 305 secs
lola: 584634 markings, 1066521 edges, 2004 markings/sec, 310 secs
lola: 594255 markings, 1083102 edges, 1924 markings/sec, 315 secs
lola: 603669 markings, 1099450 edges, 1883 markings/sec, 320 secs
lola: 613637 markings, 1116555 edges, 1994 markings/sec, 325 secs
lola: 623806 markings, 1132732 edges, 2034 markings/sec, 330 secs
lola: 633316 markings, 1148994 edges, 1902 markings/sec, 335 secs
lola: 642897 markings, 1164853 edges, 1916 markings/sec, 340 secs
lola: 652631 markings, 1181778 edges, 1947 markings/sec, 345 secs
lola: 662574 markings, 1197569 edges, 1989 markings/sec, 350 secs
lola: 671976 markings, 1214163 edges, 1880 markings/sec, 355 secs
lola: 683099 markings, 1233482 edges, 2225 markings/sec, 360 secs
lola: 694607 markings, 1254660 edges, 2302 markings/sec, 365 secs
lola: 705886 markings, 1276558 edges, 2256 markings/sec, 370 secs
lola: 717259 markings, 1297374 edges, 2275 markings/sec, 375 secs
lola: 726251 markings, 1318930 edges, 1798 markings/sec, 380 secs
lola: 735427 markings, 1335649 edges, 1835 markings/sec, 385 secs
lola: 744623 markings, 1350797 edges, 1839 markings/sec, 390 secs
lola: 754181 markings, 1366530 edges, 1912 markings/sec, 395 secs
lola: 762727 markings, 1384569 edges, 1709 markings/sec, 400 secs
lola: 771741 markings, 1400105 edges, 1803 markings/sec, 405 secs
lola: 780978 markings, 1416918 edges, 1847 markings/sec, 410 secs
lola: 790393 markings, 1432411 edges, 1883 markings/sec, 415 secs
lola: 799239 markings, 1449842 edges, 1769 markings/sec, 420 secs
lola: 808079 markings, 1465592 edges, 1768 markings/sec, 425 secs
lola: 817269 markings, 1482473 edges, 1838 markings/sec, 430 secs
lola: 826450 markings, 1497949 edges, 1836 markings/sec, 435 secs
lola: 835622 markings, 1515011 edges, 1834 markings/sec, 440 secs
lola: 844349 markings, 1532190 edges, 1745 markings/sec, 445 secs
lola: 854328 markings, 1551272 edges, 1996 markings/sec, 450 secs
lola: 864204 markings, 1569550 edges, 1975 markings/sec, 455 secs
lola: 873989 markings, 1589310 edges, 1957 markings/sec, 460 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p362 + p363 + p364 + p365 + p366 + p367 <= p269 + p270 + p271 + p272)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((p362 + p363 + p364 + p365 + p366 + p367 <= p269 + p270 + p271 + p272)))
lola: processed formula: A (F ((p362 + p363 + p364 + p365 + p366 + p367 <= p269 + p270 + p271 + p272)))
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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 11 will run for 560 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((1 <= p387 + p388 + p389 + p390)) U (p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 <= p356 + p355 + p354 + p353 + p352 + p351)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((1 <= p387 + p388 + p389 + p390)) U (p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 <= p356 + p355 + p354 + p353 + p352 + p351)))
lola: processed formula: A ((X ((1 <= p387 + p388 + p389 + p390)) U (p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 <= p356 + p355 + p354 + p353 + p352 + p351)))
lola: processed formula length: 227
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 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 700 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (((p344 <= p378) U (3 <= p208 + p209 + p210 + p211)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (((p344 <= p378) U (3 <= p208 + p209 + p210 + p211)))))
lola: processed formula: A (G (G (((p344 <= p378) U (3 <= p208 + p209 + p210 + p211)))))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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 13 will run for 933 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((1 <= p335 + p336 + p337 + p338) U (3 <= p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((1 <= p335 + p336 + p337 + p338) U (3 <= p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235)))))
lola: processed formula: A (G (F (((1 <= p335 + p336 + p337 + p338) U (3 <= p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235)))))
lola: processed formula length: 221
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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 14 will run for 1400 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p387 + p388 + p389 + p390) U ((2 <= p54 + p53 + p52 + p55) U (p163 + p164 + p165 + p166 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= p387 + p388 + p389 + p390) U ((2 <= p54 + p53 + p52 + p55) U (p163 + p164 + p165 + p166 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47))))
lola: processed formula: A (((3 <= p387 + p388 + p389 + p390) U ((2 <= p54 + p53 + p52 + p55) U (p163 + p164 + p165 + p166 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47))))
lola: processed formula length: 222
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 15 will run for 2800 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (F (G ((p259 + p260 + p261 + p262 <= p251 + p252 + p253 + p254))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (F (G ((p259 + p260 + p261 + p262 <= p251 + p252 + p253 + p254))))))
lola: processed formula: A (G (X (F (G ((p259 + p260 + p261 + p262 <= p251 + p252 + p253 + p254))))))
lola: processed formula length: 76
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: RESULT
lola:
SUMMARY: yes no no unknown no no no yes no unknown yes yes no no yes no
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496418208952

--------------------
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="S_PolyORBLF-COL-S06J04T04"
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/S_PolyORBLF-COL-S06J04T04.tgz
mv S_PolyORBLF-COL-S06J04T04 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 S_PolyORBLF-COL-S06J04T04, 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 r128-smll-149441681500374"
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 ;