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

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

=== Now, execution of the tool begins

BK_START 1494657740691


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ PolyORBLF-COL-S06J04T06 @ 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: 11132/65536 symbol table entries, 3572 collisions
lola: preprocessing...
lola: finding significant places
lola: 632 places, 10500 transitions, 578 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2723 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: A (F (F (X (F ((p534 <= p319 + p320 + p321 + p322 + p323 + p324)))))) : A (X (F (F (G ((2 <= p577 + p578 + p579 + p580 + p581 + p582)))))) : A (((3 <= p507) U X (X ((3 <= p526 + p527 + p528 + p529 + p530 + p531))))) : A ((X ((p325 <= p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505)) U G (F ((3 <= p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287))))) : A (F ((1 <= p508))) : A (F (X ((2 <= p288 + p289 + p290 + p291 + p292 + p293)))) : A (((1 <= p395 + p396 + p397 + p398 + p399 + p400) U G (X ((1 <= p626 + p627 + p628 + p629 + p630 + p631))))) : A (F (X (((2 <= p535 + p536 + p537 + p538 + p539 + p540) U (2 <= p626 + p627 + p628 + p629 + p630 + p631))))) : A (X ((X ((p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 <= p195)) U (p122 + p123 + p124 + p125 + p126 <= p226 + p227 + p228 + p229 + p230 + p231)))) : A (((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= p607 + p608 + p609 + p610 + p611 + p612) U (p532 <= p515 + p516 + p517 + p518 + p519))) : A (X (X ((p139 <= p408 + p409 + p410 + p411 + p412 + p413)))) : A ((2 <= p25 + p26 + p27 + p28 + p29 + p30)) : A (X ((p421 + p422 + p423 + p424 + p425 + p426 <= p307))) : A ((p319 + p320 + p321 + p322 + p323 + p324 <= p421 + p422 + p423 + p424 + p425 + p426)) : A (F ((G ((p313 + p314 + p315 + p316 + p317 + p318 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p72)) U (p36 + p35 + p34 + p33 + p32 + p31 <= p421 + p422 + p423 + p424 + p425 + p426)))) : A ((G (G ((p327 <= p428 + p429 + p430 + p431 + p432 + p433))) U (1 <= p533)))
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 (F (F (X (F ((p534 <= p319 + p320 + p321 + p322 + p323 + p324))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((p534 <= p319 + p320 + p321 + p322 + p323 + p324)))))
lola: processed formula: A (F (X (F ((p534 <= p319 + p320 + p321 + p322 + p323 + p324)))))
lola: processed formula length: 65
lola: 1 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 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: 119015 markings, 255660 edges, 23803 markings/sec, 0 secs
lola: 270706 markings, 616308 edges, 30338 markings/sec, 5 secs
lola: 422320 markings, 981744 edges, 30323 markings/sec, 10 secs
lola: 574203 markings, 1343111 edges, 30377 markings/sec, 15 secs
lola: 762242 markings, 1897452 edges, 37608 markings/sec, 20 secs
lola: 1009031 markings, 2733507 edges, 49358 markings/sec, 25 secs
lola: 1256714 markings, 3620429 edges, 49537 markings/sec, 30 secs
lola: 1502866 markings, 4461512 edges, 49230 markings/sec, 35 secs
lola: 1746111 markings, 5284826 edges, 48649 markings/sec, 40 secs
lola: 1991551 markings, 6165882 edges, 49088 markings/sec, 45 secs
lola: 2237376 markings, 7003403 edges, 49165 markings/sec, 50 secs
lola: 2481747 markings, 7865914 edges, 48874 markings/sec, 55 secs
lola: 2728456 markings, 8718228 edges, 49342 markings/sec, 60 secs
lola: 2972571 markings, 9645518 edges, 48823 markings/sec, 65 secs
lola: 3213075 markings, 10536188 edges, 48101 markings/sec, 70 secs
lola: 3456551 markings, 11365370 edges, 48695 markings/sec, 75 secs
lola: 3696873 markings, 12214831 edges, 48064 markings/sec, 80 secs
lola: 3940367 markings, 13055470 edges, 48699 markings/sec, 85 secs
lola: 4178379 markings, 13896598 edges, 47602 markings/sec, 90 secs
lola: 4420979 markings, 14724454 edges, 48520 markings/sec, 95 secs
lola: 4663458 markings, 15549971 edges, 48496 markings/sec, 100 secs
lola: 4902661 markings, 16405472 edges, 47841 markings/sec, 105 secs
lola: 5145918 markings, 17236988 edges, 48651 markings/sec, 110 secs
lola: 5380006 markings, 18200322 edges, 46818 markings/sec, 115 secs
lola: 5626127 markings, 19040856 edges, 49224 markings/sec, 120 secs
lola: 5869202 markings, 19863688 edges, 48615 markings/sec, 125 secs
lola: 6110869 markings, 20733313 edges, 48333 markings/sec, 130 secs
lola: 6352571 markings, 21553769 edges, 48340 markings/sec, 135 secs
lola: 6592769 markings, 22404326 edges, 48040 markings/sec, 140 secs
lola: 6836440 markings, 23237776 edges, 48734 markings/sec, 145 secs
lola: 7076814 markings, 24095402 edges, 48075 markings/sec, 150 secs
lola: 7319470 markings, 24923939 edges, 48531 markings/sec, 155 secs
lola: 7561610 markings, 25746104 edges, 48428 markings/sec, 160 secs
lola: 7801970 markings, 26734742 edges, 48072 markings/sec, 165 secs
lola: 8048985 markings, 27575709 edges, 49403 markings/sec, 170 secs
lola: 8293985 markings, 28449969 edges, 49000 markings/sec, 175 secs
lola: 8538732 markings, 29286557 edges, 48949 markings/sec, 180 secs
lola: 8782139 markings, 30112879 edges, 48681 markings/sec, 185 secs
lola: 9025293 markings, 30983899 edges, 48631 markings/sec, 190 secs
lola: 9270222 markings, 31820135 edges, 48986 markings/sec, 195 secs
lola: 9512507 markings, 32673939 edges, 48457 markings/sec, 200 secs
lola: 9758534 markings, 33524418 edges, 49205 markings/sec, 205 secs
lola: 10000856 markings, 34446079 edges, 48464 markings/sec, 210 secs
lola: 10242242 markings, 35338692 edges, 48277 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (G ((2 <= p577 + p578 + p579 + p580 + p581 + p582))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G ((2 <= p577 + p578 + p579 + p580 + p581 + p582)))))
lola: processed formula: A (X (F (G ((2 <= p577 + p578 + p579 + p580 + p581 + p582)))))
lola: processed formula length: 62
lola: 1 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 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 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p507) U X (X ((3 <= p526 + p527 + p528 + p529 + p530 + p531)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= p507) U X (X ((3 <= p526 + p527 + p528 + p529 + p530 + p531)))))
lola: processed formula: A (((3 <= p507) U X (X ((3 <= p526 + p527 + p528 + p529 + p530 + p531)))))
lola: processed formula length: 74
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 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 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((p325 <= p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505)) U G (F ((3 <= p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((p325 <= p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505)) U G (F ((3 <= p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287)))))
lola: processed formula: A ((X ((p325 <= p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505)) U G (F ((3 <= p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 +... (shortened)
lola: processed formula length: 494
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 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 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p508)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((1 <= p508)))
lola: processed formula: A (F ((1 <= p508)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 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 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((2 <= p288 + p289 + p290 + p291 + p292 + p293))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((2 <= p288 + p289 + p290 + p291 + p292 + p293))))
lola: processed formula: A (F (X ((2 <= p288 + p289 + p290 + p291 + p292 + p293))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 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 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p395 + p396 + p397 + p398 + p399 + p400) U G (X ((1 <= p626 + p627 + p628 + p629 + p630 + p631)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= p395 + p396 + p397 + p398 + p399 + p400) U G (X ((1 <= p626 + p627 + p628 + p629 + p630 + p631)))))
lola: processed formula: A (((1 <= p395 + p396 + p397 + p398 + p399 + p400) U G (X ((1 <= p626 + p627 + p628 + p629 + p630 + p631)))))
lola: processed formula length: 109
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 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 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((2 <= p535 + p536 + p537 + p538 + p539 + p540) U (2 <= p626 + p627 + p628 + p629 + p630 + p631)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (((2 <= p535 + p536 + p537 + p538 + p539 + p540) U (2 <= p626 + p627 + p628 + p629 + p630 + p631)))))
lola: processed formula: A (F (X (((2 <= p535 + p536 + p537 + p538 + p539 + p540) U (2 <= p626 + p627 + p628 + p629 + p630 + p631)))))
lola: processed formula length: 109
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 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 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 <= p195)) U (p122 + p123 + p124 + p125 + p126 <= p226 + p227 + p228 + p229 + p230 + p231))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 <= p195)) U (p122 + p123 + p124 + p125 + p126 <= p226 + p227 + p228 + p229 + p230 + p231))))
lola: processed formula: A (X ((X ((p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 <= p195)) U (p122 + p123 + p124 + p125 + p126 <= p226 + p227 + p228 + p229 + p230 + p231))))
lola: processed formula length: 353
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 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 9 will run for 474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= p607 + p608 + p609 + p610 + p611 + p612) U (p532 <= p515 + p516 + p517 + p518 + p519)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= p607 + p608 + p609 + p610 + p611 + p612) U (p532 <= p515 + p516 + p517 + p518 + p519)))
lola: processed formula: A (((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= p607 + p608 + p609 + p610 + p611 + p612) U (p532 <= p515 + p516 + p517 + p518 + p519)))
lola: processed formula length: 345
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 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 10 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((p139 <= p408 + p409 + p410 + p411 + p412 + p413))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((p139 <= p408 + p409 + p410 + p411 + p412 + p413))))
lola: processed formula: A (X (X ((p139 <= p408 + p409 + p410 + p411 + p412 + p413))))
lola: processed formula length: 61
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 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 11 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p25 + p26 + p27 + p28 + p29 + p30))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p25 + p26 + p27 + p28 + p29 + p30)
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-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 12 will run for 829 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p421 + p422 + p423 + p424 + p425 + p426 <= p307)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p421 + p422 + p423 + p424 + p425 + p426 <= p307)))
lola: processed formula: A (X ((p421 + p422 + p423 + p424 + p425 + p426 <= p307)))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 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 13 will run for 1106 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p319 + p320 + p321 + p322 + p323 + p324 <= p421 + p422 + p423 + p424 + p425 + p426))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p319 + p320 + p321 + p322 + p323 + p324 <= p421 + p422 + p423 + p424 + p425 + p426)
lola: processed formula length: 84
lola: 1 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-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 14 will run for 1659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((p313 + p314 + p315 + p316 + p317 + p318 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p72)) U (p36 + p35 + p34 + p33 + p32 + p31 <= p421 + p422 + p423 + p424 + p425 + p426))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((p313 + p314 + p315 + p316 + p317 + p318 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p72)) U (p36 + p35 + p34 + p33 + p32 + p31 <= p421 + p422 + p423 + p424 + p425 + p426))))
lola: processed formula: A (F ((G ((p313 + p314 + p315 + p316 + p317 + p318 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p72)) U (p36 + p35 + p34 + p33 + p32 + p31 <= p421 + p422 + p423 + p424 + p425 + p426))))
lola: processed formula length: 353
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 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 15 will run for 3318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p327 <= p428 + p429 + p430 + p431 + p432 + p433))) U (1 <= p533)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (G ((p327 <= p428 + p429 + p430 + p431 + p432 + p433))) U (1 <= p533)))
lola: processed formula: A ((G (G ((p327 <= p428 + p429 + p430 + p431 + p432 + p433))) U (1 <= p533)))
lola: processed formula length: 77
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 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: RESULT
lola:
SUMMARY: unknown no no no yes no no no yes yes yes no yes yes yes no
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494657963521

--------------------
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-S06J04T06"
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-S06J04T06.tgz
mv PolyORBLF-COL-S06J04T06 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-S06J04T06, 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-149440869900383"
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 ;