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

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

=== Now, execution of the tool begins

BK_START 1494663454844


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ PolyORBLF-COL-S06J04T08 @ 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: 14824/65536 symbol table entries, 5181 collisions
lola: preprocessing...
lola: finding significant places
lola: 810 places, 14014 transitions, 752 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3639 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: A ((F (X ((p671 + p672 + p673 + p674 + p675 <= p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774))) U G (F ((2 <= p801))))) : A (G (F (G ((p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 <= p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800))))) : A ((p292 <= p727 + p728 + p729 + p726 + p725 + p724 + p723 + p722)) : A (X ((2 <= p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316))) : A ((X (F ((1 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170))) U X (G ((1 <= p761 + p762 + p763 + p764 + p765 + p766))))) : A (G ((p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 <= p108))) : A (F ((p152 <= p468))) : A (F ((X ((p775 <= p801)) U F ((1 <= p670))))) : A ((2 <= p755 + p756 + p757 + p758 + p759)) : A (G (F (X (G ((p670 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)))))) : A (F ((p0 + p1 + p2 + p3 + p4 <= p143))) : A ((p252 + p253 + p254 + p255 + p256 + p257 + 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 + p288 + p289 + p290 + p291 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151)) : A ((((2 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332) U (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 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 <= p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791)) U (2 <= p706 + p707 + p708 + p709 + p710 + p711 + p712 + p713))) : A ((F (G ((p775 <= p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324))) U (1 <= p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316))) : A ((2 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332)) : A (G (F (G (X ((p237 <= p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + 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))))))
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 (X ((p671 + p672 + p673 + p674 + p675 <= p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774))) U G (F ((2 <= p801)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (X ((p671 + p672 + p673 + p674 + p675 <= p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774))) U G (F ((2 <= p801)))))
lola: processed formula: A ((F (X ((p671 + p672 + p673 + p674 + p675 <= p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774))) U G (F ((2 <= p801)))))
lola: processed formula length: 127
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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 (G (F (G ((p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 <= p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 <= p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800))))
lola: processed formula: A (F (G ((p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 <= p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800))))
lola: processed formula length: 124
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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 ((p292 <= p727 + p728 + p729 + p726 + p725 + p724 + p723 + p722))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p292 <= p727 + p728 + p729 + p726 + p725 + p724 + p723 + p722)
lola: processed formula length: 63
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((2 <= p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316)))
lola: processed formula: A (X ((2 <= p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316)))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((1 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170))) U X (G ((1 <= p761 + p762 + p763 + p764 + p765 + p766)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((1 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170)) U G ((1 <= p761 + p762 + p763 + p764 + p765 + p766)))))
lola: processed formula: A (X ((F ((1 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170)) U G ((1 <= p761 + p762 + p763 + p764 + p765 + p766)))))
lola: processed formula length: 127
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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: 230305 markings, 499031 edges, 46061 markings/sec, 0 secs
lola: 457048 markings, 1001096 edges, 45349 markings/sec, 5 secs
lola: 670722 markings, 1564151 edges, 42735 markings/sec, 10 secs
lola: 890785 markings, 2100505 edges, 44013 markings/sec, 15 secs
lola: 1111486 markings, 2605716 edges, 44140 markings/sec, 20 secs
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: subprocess 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 <= p108)))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p152 <= p468)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((p152 <= p468)))
lola: processed formula: A (F ((p152 <= p468)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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 7 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((p775 <= p801)) U F ((1 <= p670)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((p775 <= p801)) U F ((1 <= p670)))))
lola: processed formula: A (F ((X ((p775 <= p801)) U F ((1 <= p670)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 bytes per marking, with 31 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 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p755 + p756 + p757 + p758 + p759))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p755 + p756 + p757 + p758 + p759)
lola: processed formula length: 39
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-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 501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X (G ((p670 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (X (G ((p670 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179))))))
lola: processed formula: A (G (F (X (G ((p670 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179))))))
lola: processed formula length: 83
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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 10 will run for 585 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p0 + p1 + p2 + p3 + p4 <= p143)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((p0 + p1 + p2 + p3 + p4 <= p143)))
lola: processed formula: A (F ((p0 + p1 + p2 + p3 + p4 <= p143)))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 11 will run for 702 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p252 + p253 + p254 + p255 + p256 + p257 + 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 + p288 + p289 + p290 + p291 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p252 + p253 + p254 + p255 + p256 + p257 + 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 + p288 + p289 + p290 + p291 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151)
lola: processed formula length: 336
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-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 12 will run for 877 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332) U (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 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332) U (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 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 <= p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791)) U (2 <= p706 + p707 + p708 + p709 + p710 + p711 + p712 + p713)))
lola: processed formula: A ((((2 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332) U (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 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p5... (shortened)
lola: processed formula length: 526
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 1170 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((p775 <= p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324))) U (1 <= p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((p775 <= p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324))) U (1 <= p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316)))
lola: processed formula: A ((F (G ((p775 <= p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324))) U (1 <= p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316)))
lola: processed formula length: 140
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1755 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332)
lola: processed formula length: 60
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-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 15 will run for 3511 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (X ((p237 <= p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + 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))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((p237 <= p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + 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)))))
lola: processed formula: A (F (G (X ((p237 <= p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + 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)))))
lola: processed formula length: 359
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: RESULT
lola:
SUMMARY: no no no no no no yes no no no yes yes no no no no
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494663483890

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