About the Execution of LoLA for S_PolyORBLF-COL-S04J06T10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
718.040 | 275299.00 | 277109.00 | 877.80 | FFFFFTTFF?TTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_PolyORBLF-COL-S04J06T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681500365
=====================================================================
--------------------
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-S04J06T10-LTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496414132898
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PolyORBLF-COL-S04J06T10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_PolyORBLF-COL-S04J06T10: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
LTLCardinality @ S_PolyORBLF-COL-S04J06T10 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 6320/65536 symbol table entries, 1380 collisions
lola: preprocessing...
lola: finding significant places
lola: 966 places, 5354 transitions, 904 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3657 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J06T10-LTLCardinality.task
lola: A ((p788 <= p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542)) : A (G (G (((2 <= p791) U (3 <= p258 + p259 + p260 + p261 + p262 + p263 + p264))))) : A (G (G ((2 <= p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p64)))) : A ((F ((1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22)) U G (G ((2 <= p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235))))) : A (X (F (((3 <= p12) U (p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 <= p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215))))) : A (F (X (F (X ((p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p64 <= p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492)))))) : A ((p493 <= p135)) : A (F (F (F (F ((3 <= p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786)))))) : A ((X (X ((p755 + p754 + p753 + p752 <= p256))) U ((p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 <= p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521) U (3 <= p257)))) : A (G (G (G (G ((p501 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394)))))) : A (G ((F ((3 <= p100 + p101 + p102 + p103 + p94 + p93 + p92 + p90 + p89 + p88 + p86 + p85 + p84 + p82 + p81 + p80 + p78 + p77 + p76 + p79 + p83 + p87 + p91 + p95 + p96 + p97 + p98 + p99)) U F ((3 <= p257))))) : A (F (G ((1 <= p469 + p470 + p471 + p472)))) : A ((3 <= p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776)) : A (X (X (X (X ((p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))))) : A (((p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 <= p135) U ((1 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225) U (p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 <= p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955)))) : A ((G (X ((3 <= p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955))) U ((1 <= p38 + p39 + p40 + p41 + p42 + p43 + p37 + p36 + p35 + p34) U (1 <= p787))))
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 ((p788 <= p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p788 <= p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542)
lola: processed formula length: 77
lola: 1 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-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 (G (G (((2 <= p791) U (3 <= p258 + p259 + p260 + p261 + p262 + p263 + p264)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (((2 <= p791) U (3 <= p258 + p259 + p260 + p261 + p262 + p263 + p264)))))
lola: processed formula: A (G (G (((2 <= p791) U (3 <= p258 + p259 + p260 + p261 + p262 + p263 + p264)))))
lola: processed formula length: 81
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3620 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((2 <= p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p64))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G ((2 <= p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p64))))
lola: processed formula: A (G (G ((2 <= p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p64))))
lola: processed formula length: 76
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3620 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22)) U G (G ((2 <= 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 ((F ((1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22)) U G (G ((2 <= p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235)))))
lola: processed formula: A ((F ((1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22)) U G (G ((2 <= p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235)))))
lola: processed formula length: 159
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3620 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: 10695 markings, 16442 edges, 2139 markings/sec, 0 secs
lola: 21362 markings, 33111 edges, 2133 markings/sec, 5 secs
lola: 32305 markings, 50146 edges, 2189 markings/sec, 10 secs
lola: 42813 markings, 67196 edges, 2102 markings/sec, 15 secs
lola: 52808 markings, 86936 edges, 1999 markings/sec, 20 secs
lola: 62295 markings, 106166 edges, 1897 markings/sec, 25 secs
lola: 71949 markings, 125276 edges, 1931 markings/sec, 30 secs
lola: 81457 markings, 145650 edges, 1902 markings/sec, 35 secs
lola: 91264 markings, 165343 edges, 1961 markings/sec, 40 secs
lola: 101060 markings, 184635 edges, 1959 markings/sec, 45 secs
lola: 110848 markings, 204300 edges, 1958 markings/sec, 50 secs
lola: 120836 markings, 223741 edges, 1998 markings/sec, 55 secs
lola: 130752 markings, 244654 edges, 1983 markings/sec, 60 secs
lola: 139231 markings, 263491 edges, 1696 markings/sec, 65 secs
lola: 148947 markings, 282904 edges, 1943 markings/sec, 70 secs
lola: 158651 markings, 302409 edges, 1941 markings/sec, 75 secs
lola: 167985 markings, 322619 edges, 1867 markings/sec, 80 secs
lola: 177698 markings, 342142 edges, 1943 markings/sec, 85 secs
lola: 187661 markings, 361853 edges, 1993 markings/sec, 90 secs
lola: 197438 markings, 381127 edges, 1955 markings/sec, 95 secs
lola: 207235 markings, 400656 edges, 1959 markings/sec, 100 secs
lola: 217224 markings, 420464 edges, 1998 markings/sec, 105 secs
lola: 225831 markings, 440355 edges, 1721 markings/sec, 110 secs
lola: 235497 markings, 460103 edges, 1933 markings/sec, 115 secs
lola: 244977 markings, 479299 edges, 1896 markings/sec, 120 secs
lola: 254643 markings, 498499 edges, 1933 markings/sec, 125 secs
lola: 264175 markings, 518914 edges, 1906 markings/sec, 130 secs
lola: 273983 markings, 538601 edges, 1962 markings/sec, 135 secs
lola: 283776 markings, 557859 edges, 1959 markings/sec, 140 secs
lola: 293603 markings, 577631 edges, 1965 markings/sec, 145 secs
lola: 303647 markings, 597199 edges, 2009 markings/sec, 150 secs
lola: 313570 markings, 618400 edges, 1985 markings/sec, 155 secs
lola: 322238 markings, 637245 edges, 1734 markings/sec, 160 secs
lola: 332067 markings, 656922 edges, 1966 markings/sec, 165 secs
lola: 341705 markings, 676512 edges, 1928 markings/sec, 170 secs
lola: 351119 markings, 696911 edges, 1883 markings/sec, 175 secs
lola: 360896 markings, 716198 edges, 1955 markings/sec, 180 secs
lola: 370752 markings, 735971 edges, 1971 markings/sec, 185 secs
lola: 380631 markings, 755215 edges, 1976 markings/sec, 190 secs
lola: 390404 markings, 775007 edges, 1955 markings/sec, 195 secs
lola: 400790 markings, 795320 edges, 2077 markings/sec, 200 secs
lola: 409257 markings, 815287 edges, 1693 markings/sec, 205 secs
lola: 419173 markings, 835234 edges, 1983 markings/sec, 210 secs
lola: 429175 markings, 855152 edges, 2000 markings/sec, 215 secs
lola: 439144 markings, 875374 edges, 1994 markings/sec, 220 secs
lola: 448966 markings, 895254 edges, 1964 markings/sec, 225 secs
lola: 459273 markings, 915476 edges, 2061 markings/sec, 230 secs
lola: 469204 markings, 935790 edges, 1986 markings/sec, 235 secs
lola: 479343 markings, 955715 edges, 2028 markings/sec, 240 secs
lola: 489187 markings, 975803 edges, 1969 markings/sec, 245 secs
lola: 499541 markings, 996810 edges, 2071 markings/sec, 250 secs
lola: 509030 markings, 1018650 edges, 1898 markings/sec, 255 secs
lola: 518682 markings, 1038359 edges, 1930 markings/sec, 260 secs
lola: 528287 markings, 1057665 edges, 1921 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 (X (F (((3 <= p12) U (p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 <= p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((3 <= p12) U (p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 <= p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215)))))
lola: processed formula: A (X (F (((3 <= p12) U (p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 <= p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215)))))
lola: processed formula length: 167
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3620 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 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (X ((p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p64 <= p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F (X ((p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p64 <= p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492))))))
lola: processed formula: A (F (X (F (X ((p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p64 <= p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492))))))
lola: processed formula length: 150
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3620 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 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p493 <= p135))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p493 <= p135)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-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 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (F ((3 <= p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((3 <= p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786)))
lola: processed formula: A (F ((3 <= p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786)))
lola: processed formula length: 82
lola: 3 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3620 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: 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 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((p755 + p754 + p753 + p752 <= p256))) U ((p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 <= p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521) U (3 <= p257))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((p755 + p754 + p753 + p752 <= p256))) U ((p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 <= p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521) U (3 <= p257))))
lola: processed formula: A ((X (X ((p755 + p754 + p753 + p752 <= p256))) U ((p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 <= p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521) U (3 <= p257))))
lola: processed formula length: 208
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3620 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 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G (G ((p501 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (G (G ((p501 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394))))))
lola: processed formula: A (G (G (G (G ((p501 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 ... (shortened)
lola: processed formula length: 517
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3620 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 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((3 <= p100 + p101 + p102 + p103 + p94 + p93 + p92 + p90 + p89 + p88 + p86 + p85 + p84 + p82 + p81 + p80 + p78 + p77 + p76 + p79 + p83 + p87 + p91 + p95 + p96 + p97 + p98 + p99)) U F ((3 <= p257)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((3 <= p100 + p101 + p102 + p103 + p94 + p93 + p92 + p90 + p89 + p88 + p86 + p85 + p84 + p82 + p81 + p80 + p78 + p77 + p76 + p79 + p83 + p87 + p91 + p95 + p96 + p97 + p98 + p99)) U F ((3 <= p257)))))
lola: processed formula: A (G ((F ((3 <= p100 + p101 + p102 + p103 + p94 + p93 + p92 + p90 + p89 + p88 + p86 + p85 + p84 + p82 + p81 + p80 + p78 + p77 + p76 + p79 + p83 + p87 + p91 + p95 + p96 + p97 + p98 + p99)) U F ((3 <= p257)))))
lola: processed formula length: 208
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3620 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 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p469 + p470 + p471 + p472))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p469 + p470 + p471 + p472))))
lola: processed formula: A (F (G ((1 <= p469 + p470 + p471 + p472))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3620 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 12 will run for 816 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776)
lola: processed formula length: 74
lola: 1 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-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 13 will run for 1088 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X ((p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X ((p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))))
lola: processed formula: A (X (X (X (X ((p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))))
lola: processed formula length: 141
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3620 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 14 will run for 1632 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 <= p135) U ((1 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225) U (p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 <= p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 <= p135) U ((1 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225) U (p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 <= p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955))))
lola: processed formula: A (((p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 <= p135) U ((1 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225) U (p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 <= p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955))))
lola: processed formula length: 305
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3620 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 3264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((3 <= p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955))) U ((1 <= p38 + p39 + p40 + p41 + p42 + p43 + p37 + p36 + p35 + p34) U (1 <= p787))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((3 <= p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955))) U ((1 <= p38 + p39 + p40 + p41 + p42 + p43 + p37 + p36 + p35 + p34) U (1 <= p787))))
lola: processed formula: A ((G (X ((3 <= p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955))) U ((1 <= p38 + p39 + p40 + p41 + p42 + p43 + p37 + p36 + p35 + p34) U (1 <= p787))))
lola: processed formula length: 171
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3620 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: RESULT
lola:
SUMMARY: no no no unknown yes yes yes no no no no no no yes yes no
lola: ========================================
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496414408197
--------------------
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-S04J06T10"
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-S04J06T10.tgz
mv S_PolyORBLF-COL-S04J06T10 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-S04J06T10, 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-149441681500365"
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 '
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 ;