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 PolyORBLF-COL-S04J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-smll-149440869900347
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494640111737


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ PolyORBLF-COL-S04J06T06 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3808/65536 symbol table entries, 459 collisions
lola: preprocessing...
lola: finding significant places
lola: 618 places, 3190 transitions, 564 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2157 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: A (X (G (((p572 + p573 + p574 + p575 + p578 + p577 + p576 <= p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617) U (2 <= p465))))) : A (F (X ((2 <= p438)))) : A (F (((p170 <= p46 + p45 + p44 + p43 + p42 + p41) U (p328 + p329 + p330 + p331 + p332 + p333 <= p211 + p212 + p213 + p214)))) : A ((G (F ((1 <= 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))) U F ((3 <= p479 + p480 + p481 + p482)))) : A (F (G ((3 <= p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540)))) : A ((2 <= p205 + p206 + p207 + p208 + p209 + p210)) : A (G (F (F (G ((3 <= p55)))))) : A ((p67 + p66 + p65 + p64 + p63 + p68 <= p115 + p116 + p117 + p118 + p119 + p120)) : A ((2 <= p215)) : A ((((p437 <= p581 + p582 + p583 + p584 + p585 + p586) U (p388 + p389 + p390 + p391 + p392 + p393 <= p170)) U ((3 <= p121 + p122 + p123 + p124 + p125 + p126) U (3 <= p579)))) : A ((p272 <= p211 + p212 + p213 + p214)) : A ((F (G ((p466 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))) U G (X ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 <= p328 + p329 + p330 + p331 + p332 + p333))))) : A (X (X ((p587 + p588 + p589 + p590 + p591 + p592 <= p121 + p122 + p123 + p124 + p125 + p126)))) : A (X (G (G (G ((1 <= p315 + p316 + p317 + p318 + p319 + p320)))))) : A (F (G (((p493 + p494 + p495 + p496 + p497 + p498 <= p79 + p78 + p77 + p76 + p75 + p80) U (p572 + p573 + p574 + p575 + p578 + p577 + p576 <= p483 + p484 + p485 + p486 + p487 + p488))))) : A (F ((1 <= p546 + p545 + p544 + p543 + p542 + p541)))
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 (X (G (((p572 + p573 + p574 + p575 + p578 + p577 + p576 <= p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617) U (2 <= p465)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p572 + p573 + p574 + p575 + p578 + p577 + p576 <= p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617) U (2 <= p465)))))
lola: processed formula: A (X (G (((p572 + p573 + p574 + p575 + p578 + p577 + p576 <= p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617) U (2 <= p465)))))
lola: processed formula length: 245
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((2 <= p438))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((2 <= p438))))
lola: processed formula: A (F (X ((2 <= p438))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p170 <= p46 + p45 + p44 + p43 + p42 + p41) U (p328 + p329 + p330 + p331 + p332 + p333 <= p211 + p212 + p213 + p214))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((p170 <= p46 + p45 + p44 + p43 + p42 + p41) U (p328 + p329 + p330 + p331 + p332 + p333 <= p211 + p212 + p213 + p214))))
lola: processed formula: A (F (((p170 <= p46 + p45 + p44 + p43 + p42 + p41) U (p328 + p329 + p330 + p331 + p332 + p333 <= p211 + p212 + p213 + p214))))
lola: processed formula length: 126
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((1 <= 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))) U F ((3 <= p479 + p480 + p481 + p482))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((1 <= 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))) U F ((3 <= p479 + p480 + p481 + p482))))
lola: processed formula: A ((G (F ((1 <= 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))) U F ((3 <= p479 + p480 + p481 + p482))))
lola: processed formula length: 351
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540))))
lola: processed formula: A (F (G ((3 <= p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540))))
lola: processed formula length: 310
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p205 + p206 + p207 + p208 + p209 + p210))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p205 + p206 + p207 + p208 + p209 + p210)
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F (G ((3 <= p55))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= p55))))
lola: processed formula: A (F (G ((3 <= p55))))
lola: processed formula length: 22
lola: 2 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p67 + p66 + p65 + p64 + p63 + p68 <= p115 + p116 + p117 + p118 + p119 + p120))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p67 + p66 + p65 + p64 + p63 + p68 <= p115 + p116 + p117 + p118 + p119 + p120)
lola: processed formula length: 78
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p215))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p215)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p437 <= p581 + p582 + p583 + p584 + p585 + p586) U (p388 + p389 + p390 + p391 + p392 + p393 <= p170)) U ((3 <= p121 + p122 + p123 + p124 + p125 + p126) U (3 <= p579))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p437 <= p581 + p582 + p583 + p584 + p585 + p586) U (p388 + p389 + p390 + p391 + p392 + p393 <= p170)) U ((3 <= p121 + p122 + p123 + p124 + p125 + p126) U (3 <= p579))))
lola: processed formula: A ((((p437 <= p581 + p582 + p583 + p584 + p585 + p586) U (p388 + p389 + p390 + p391 + p392 + p393 <= p170)) U ((3 <= p121 + p122 + p123 + p124 + p125 + p126) U (3 <= p579))))
lola: processed formula length: 174
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p272 <= p211 + p212 + p213 + p214))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p272 <= p211 + p212 + p213 + p214)
lola: processed formula length: 35
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((p466 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))) U G (X ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((p466 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))) U G (X ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 <= p328 + p329 + p330 + p331 + p332 + p333)))))
lola: processed formula: A ((F (G ((p466 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))) U G (X ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + ... (shortened)
lola: processed formula length: 536
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((p587 + p588 + p589 + p590 + p591 + p592 <= p121 + p122 + p123 + p124 + p125 + p126))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((p587 + p588 + p589 + p590 + p591 + p592 <= p121 + p122 + p123 + p124 + p125 + p126))))
lola: processed formula: A (X (X ((p587 + p588 + p589 + p590 + p591 + p592 <= p121 + p122 + p123 + p124 + p125 + p126))))
lola: processed formula length: 96
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (G ((1 <= p315 + p316 + p317 + p318 + p319 + p320))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (G (G ((1 <= p315 + p316 + p317 + p318 + p319 + p320))))))
lola: processed formula: A (X (G (G (G ((1 <= p315 + p316 + p317 + p318 + p319 + p320))))))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((p493 + p494 + p495 + p496 + p497 + p498 <= p79 + p78 + p77 + p76 + p75 + p80) U (p572 + p573 + p574 + p575 + p578 + p577 + p576 <= p483 + p484 + p485 + p486 + p487 + p488)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((p493 + p494 + p495 + p496 + p497 + p498 <= p79 + p78 + p77 + p76 + p75 + p80) U (p572 + p573 + p574 + p575 + p578 + p577 + p576 <= p483 + p484 + p485 + p486 + p487 + p488)))))
lola: processed formula: A (F (G (((p493 + p494 + p495 + p496 + p497 + p498 <= p79 + p78 + p77 + p76 + p75 + p80) U (p572 + p573 + p574 + p575 + p578 + p577 + p576 <= p483 + p484 + p485 + p486 + p487 + p488)))))
lola: processed formula length: 186
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p546 + p545 + p544 + p543 + p542 + p541)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((1 <= p546 + p545 + p544 + p543 + p542 + p541)))
lola: processed formula: A (F ((1 <= p546 + p545 + p544 + p543 + p542 + p541)))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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: 14745 markings, 23213 edges, 2949 markings/sec, 0 secs
lola: 30722 markings, 52732 edges, 3195 markings/sec, 5 secs
lola: 46920 markings, 81247 edges, 3240 markings/sec, 10 secs
lola: 63063 markings, 112708 edges, 3229 markings/sec, 15 secs
lola: 79186 markings, 141194 edges, 3225 markings/sec, 20 secs
lola: 95262 markings, 170520 edges, 3215 markings/sec, 25 secs
lola: 111331 markings, 201249 edges, 3214 markings/sec, 30 secs
lola: 127534 markings, 229780 edges, 3241 markings/sec, 35 secs
lola: 143596 markings, 262083 edges, 3212 markings/sec, 40 secs
lola: 159774 markings, 289692 edges, 3236 markings/sec, 45 secs
lola: 176024 markings, 318199 edges, 3250 markings/sec, 50 secs
lola: 192124 markings, 350679 edges, 3220 markings/sec, 55 secs
lola: 208437 markings, 378585 edges, 3263 markings/sec, 60 secs
lola: 224789 markings, 407652 edges, 3270 markings/sec, 65 secs
lola: 240787 markings, 439551 edges, 3200 markings/sec, 70 secs
lola: 257025 markings, 467322 edges, 3248 markings/sec, 75 secs
lola: 272996 markings, 499309 edges, 3194 markings/sec, 80 secs
lola: 289112 markings, 527788 edges, 3223 markings/sec, 85 secs
lola: 305213 markings, 556888 edges, 3220 markings/sec, 90 secs
lola: 320664 markings, 608901 edges, 3090 markings/sec, 95 secs
lola: 335752 markings, 650582 edges, 3018 markings/sec, 100 secs
lola: 350995 markings, 677254 edges, 3049 markings/sec, 105 secs
lola: 366181 markings, 703332 edges, 3037 markings/sec, 110 secs
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: RESULT
lola:
SUMMARY: no no yes no no no no yes no no yes no yes no no yes
lola: ========================================
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494640232629

--------------------
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="PolyORBLF-COL-S04J06T06"
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/PolyORBLF-COL-S04J06T06.tgz
mv PolyORBLF-COL-S04J06T06 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 PolyORBLF-COL-S04J06T06, 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 r048-smll-149440869900347"
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 ;