About the Execution of LoLA for S_PolyORBLF-COL-S02J06T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15931.260 | 495212.00 | 855959.00 | 1856.20 | FFFFTTFFTTTF?F?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_PolyORBLF-COL-S02J06T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681400309
=====================================================================
--------------------
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-S02J06T10-CTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496383502627
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PolyORBLF-COL-S02J06T10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_PolyORBLF-COL-S02J06T10: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
CTLCardinality @ S_PolyORBLF-COL-S02J06T10 @ 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: 2656/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 844 places, 1812 transitions, 786 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2543 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: A ((A (X ((p375 + p376 <= p398 + p399 + p400 + p401 + p402 + p403 + p404))) U (3 <= p279))) : (((p89 + p90 <= 1) AND (p343 + p344 <= 1)) OR A (F (((2 <= p436) AND (p397 <= p278) AND (1 <= p375 + p376))))) : (E (F (((2 <= p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843) AND (p278 <= p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477) AND ((p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p731 <= p703) OR (1 <= p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477))))) AND E (F (((p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 <= 1) AND ((1 <= p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374) OR (2 <= p18 + p17 + p16 + p15 + p14 + p13 + p12)))))) : (A (((p100 + p101 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99 <= 0) U ((2 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28) AND (2 <= p267)))) OR E (F (A (G ((p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 <= p11)))))) : A (F ((1 <= 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 + 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))) : A (F (A (G (((2 <= p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612) OR (2 <= p278)))))) : (((2 <= p278) OR (A (X ((2 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28))) OR E (F ((2 <= p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186))))) AND (((p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + 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 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 <= p711) AND (p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 <= p322)) OR (p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + 1 <= p100 + p101 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99))) : A (F ((A (X ((p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p753 + p752))) AND (((3 <= p343 + p344) OR (p29 <= p398 + p399 + p400 + p401 + p402 + p403 + p404)) AND (p278 <= 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 + 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))))) : E (F ((A (X ((2 <= p703))) AND ((p279 <= p0) AND (1 <= p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833) AND ((p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p731 <= p322) OR (2 <= p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186)))))) : A (F ((3 <= p29))) : A (F ((3 <= p398 + p399 + p400 + p401 + p402 + p403 + p404))) : A (X (A (F (((1 <= p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152) AND (2 <= p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843)))))) : NOT(NOT(A (G ((p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 <= 2))))) : NOT(NOT(E (F ((p112 <= p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622))))) : A (G (A (F ((3 <= p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632))))) : E (G (A (((1 <= p721 + p720 + p719 + p718 + p717 + p716 + p715 + p714 + p713 + p712) U (3 <= p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342)))))
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 ((A (X ((p375 + p376 <= p398 + p399 + p400 + p401 + p402 + p403 + p404))) U (3 <= p279)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((p375 + p376 <= p398 + p399 + p400 + p401 + p402 + p403 + p404)) U (3 <= p279))
lola: processed formula length: 84
lola: 2 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p89 + p90 <= 1) AND (p343 + p344 <= 1)) OR A (F (((2 <= p436) AND (p397 <= p278) AND (1 <= p375 + p376)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p89 + p90 <= 1) AND (p343 + p344 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p89 + p90 <= 1) AND (p343 + p344 <= 1))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p436) AND (p397 <= p278) AND (1 <= p375 + p376))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((2 <= p436) AND (p397 <= p278) AND (1 <= p375 + p376)))
lola: processed formula length: 65
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: lola: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((2 <= p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843) AND (p278 <= p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477) AND ((p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p731 <= p703) OR (1 <= p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477))))) AND E (F (((p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843) AND (p278 <= p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477) AND ((p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p731 <= p703) OR (1 <= p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J06T10-CTLCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 <= 1) AND ((1 <= p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374) OR (2 <= p18 + p17 + p16 + p15 + p14 + p13 + p12)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((p100 + p101 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99 <= 0) U ((2 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28) AND (2 <= p267)))) OR E (F (A (G ((p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p100 + p101 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99 <= 0) U ((2 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28) AND (2 <= p267))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p100 + p101 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99 <= 0) U ((2 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28) AND (2 <= p267)))
lola: processed formula length: 154
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (p11 + 1 <= p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843))))
lola: processed formula length: 105
lola: 3 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 375602 markings, 1086050 edges, 3225752436249460736 markings/sec, 0 secs
lola: 726247 markings, 2110854 edges, 70129 markings/sec, 5 secs
lola: 1062733 markings, 3105268 edges, 67297 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= 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 + 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 + p53... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= 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 + 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 + ... (shortened)
lola: processed formula length: 504
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((2 <= p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612) OR (2 <= p278))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U ((p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 <= 1) AND (p278 <= 1)))))
lola: processed formula length: 117
lola: 3 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p278) OR (A (X ((2 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28))) OR E (F ((2 <= p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186))))) AND (((p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p278)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p278)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.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 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((2 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28))
lola: processed formula length: 68
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J06T10-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 68118 markings, 81984 edges, 13624 markings/sec, 0 secs
lola: sara is running 5 secs || 134942 markings, 164009 edges, 13365 markings/sec, 5 secs
lola: sara is running 10 secs || 200935 markings, 248179 edges, 13199 markings/sec, 10 secs
lola: sara is running 15 secs || 266688 markings, 331959 edges, 13151 markings/sec, 15 secs
lola: sara is running 20 secs || 332641 markings, 416106 edges, 13191 markings/sec, 20 secs
lola: sara is running 25 secs || 398564 markings, 500336 edges, 13185 markings/sec, 25 secs
lola: sara is running 30 secs || 464162 markings, 583561 edges, 13120 markings/sec, 30 secs
lola: sara is running 35 secs || 529717 markings, 668145 edges, 13111 markings/sec, 35 secs
lola: sara is running 40 secs || 594648 markings, 753394 edges, 12986 markings/sec, 40 secs
lola: sara is running 45 secs || 659657 markings, 838156 edges, 13002 markings/sec, 45 secs
lola: sara is running 50 secs || 724831 markings, 922844 edges, 13035 markings/sec, 50 secs
lola: sara is running 55 secs || 789256 markings, 1009070 edges, 12885 markings/sec, 55 secs
lola: sara is running 60 secs || 853731 markings, 1095917 edges, 12895 markings/sec, 60 secs
lola: sara is running 65 secs || 918735 markings, 1181849 edges, 13001 markings/sec, 65 secs
lola: sara is running 70 secs || 983659 markings, 1266621 edges, 12985 markings/sec, 70 secs
lola: sara is running 75 secs || 1048489 markings, 1352500 edges, 12966 markings/sec, 75 secs
lola: sara is running 80 secs || 1113121 markings, 1438215 edges, 12926 markings/sec, 80 secs
lola: sara is running 85 secs || 1177789 markings, 1523989 edges, 12934 markings/sec, 85 secs
lola: sara is running 90 secs || 1242387 markings, 1609367 edges, 12920 markings/sec, 90 secs
lola: sara is running 95 secs || 1306747 markings, 1697558 edges, 12872 markings/sec, 95 secs
lola: sara is running 100 secs || 1371339 markings, 1783237 edges, 12918 markings/sec, 100 secs
lola: sara is running 105 secs || 1435699 markings, 1868325 edges, 12872 markings/sec, 105 secs
lola: sara is running 110 secs || 1499747 markings, 1952194 edges, 12810 markings/sec, 110 secs
lola: sara is running 115 secs || 1563629 markings, 2036898 edges, 12776 markings/sec, 115 secs
lola: sara is running 120 secs || 1627662 markings, 2122123 edges, 12807 markings/sec, 120 secs
lola: sara is running 125 secs || 1691333 markings, 2206907 edges, 12734 markings/sec, 125 secs
lola: sara is running 130 secs || 1754868 markings, 2291400 edges, 12707 markings/sec, 130 secs
lola: sara is running 135 secs || 1818571 markings, 2377883 edges, 12741 markings/sec, 135 secs
lola: sara is running 140 secs || 1882114 markings, 2462981 edges, 12709 markings/sec, 140 secs
lola: sara is running 145 secs || 1945522 markings, 2548926 edges, 12682 markings/sec, 145 secs
lola: sara is running 150 secs || 2009209 markings, 2634540 edges, 12737 markings/sec, 150 secs
lola: sara is running 155 secs || 2072759 markings, 2720418 edges, 12710 markings/sec, 155 secs
lola: sara is running 160 secs || 2136115 markings, 2806201 edges, 12671 markings/sec, 160 secs
lola: sara is running 165 secs || 2199472 markings, 2892917 edges, 12671 markings/sec, 165 secs
lola: sara is running 170 secs || 2262507 markings, 2981285 edges, 12607 markings/sec, 170 secs
lola: sara is running 175 secs || 2325756 markings, 3066504 edges, 12650 markings/sec, 175 secs
lola: sara is running 180 secs || 2389280 markings, 3152333 edges, 12705 markings/sec, 180 secs
lola: sara is running 185 secs || 2452471 markings, 3237999 edges, 12638 markings/sec, 185 secs
lola: sara is running 190 secs || 2516030 markings, 3323215 edges, 12712 markings/sec, 190 secs
lola: sara is running 195 secs || 2579177 markings, 3408658 edges, 12629 markings/sec, 195 secs
lola: sara is running 200 secs || 2642369 markings, 3494509 edges, 12638 markings/sec, 200 secs
lola: sara is running 205 secs || 2705653 markings, 3579621 edges, 12657 markings/sec, 205 secs
lola: sara is running 210 secs || 2769106 markings, 3665468 edges, 12691 markings/sec, 210 secs
lola: sara is running 215 secs || 2832318 markings, 3751580 edges, 12642 markings/sec, 215 secs
lola: sara is running 220 secs || 2895626 markings, 3837045 edges, 12662 markings/sec, 220 secs
lola: sara is running 225 secs || 2958858 markings, 3921458 edges, 12646 markings/sec, 225 secs
lola: sara is running 230 secs || 3022235 markings, 4006174 edges, 12675 markings/sec, 230 secs
lola: sara is running 235 secs || 3085449 markings, 4092133 edges, 12643 markings/sec, 235 secs
lola: sara is running 240 secs || 3148523 markings, 4178451 edges, 12615 markings/sec, 240 secs
lola: sara is running 245 secs || 3212000 markings, 4263302 edges, 12695 markings/sec, 245 secs
lola: sara is running 250 secs || 3275232 markings, 4348858 edges, 12646 markings/sec, 250 secs
lola: sara is running 255 secs || 3338248 markings, 4436105 edges, 12603 markings/sec, 255 secs
lola: sara is running 260 secs || 3401573 markings, 4520225 edges, 12665 markings/sec, 260 secs
lola: sara is running 265 secs || 3464632 markings, 4605837 edges, 12612 markings/sec, 265 secs
lola: sara is running 270 secs || 3527408 markings, 4691660 edges, 12555 markings/sec, 270 secs
lola: sara is running 275 secs || 3590809 markings, 4775469 edges, 12680 markings/sec, 275 secs
lola: sara is running 280 secs || 3654094 markings, 4860062 edges, 12657 markings/sec, 280 secs
lola: sara is running 285 secs || 3716806 markings, 4947173 edges, 12542 markings/sec, 285 secs
lola: sara is running 290 secs || 3780103 markings, 5033160 edges, 12659 markings/sec, 290 secs
lola: sara is running 295 secs || 3843560 markings, 5119571 edges, 12691 markings/sec, 295 secs
lola: sara is running 300 secs || 3906651 markings, 5206826 edges, 12618 markings/sec, 300 secs
lola: sara is running 305 secs || 3970128 markings, 5293513 edges, 12695 markings/sec, 305 secs
lola: sara is running 310 secs || 4033361 markings, 5379422 edges, 12647 markings/sec, 310 secs
lola: sara is running 315 secs || 4096482 markings, 5464892 edges, 12624 markings/sec, 315 secs
lola: sara is running 320 secs || 4159648 markings, 5550484 edges, 12633 markings/sec, 320 secs
lola: sara is running 325 secs || 4222531 markings, 5637338 edges, 12577 markings/sec, 325 secs
lola: sara is running 330 secs || 4288118 markings, 5727192 edges, 13117 markings/sec, 330 secs
lola: sara is running 335 secs || 4353124 markings, 5818950 edges, 13001 markings/sec, 335 secs
lola: sara is running 340 secs || 4418485 markings, 5909215 edges, 13072 markings/sec, 340 secs
lola: sara is running 345 secs || 4483938 markings, 5999351 edges, 13091 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p753 + p752))) AND (((3 <= p343 + p344) OR (p29 <= p398 + p399 + p400 + p401 + p402 + p403 + p404)) AND (p278 <= 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 + p506 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX((p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p753 + p752)) AND (((3 <= p343 + p344) OR (p29 <= p398 + p399 + p400 + p401 + p402 + p403 + p404)) AND (p278 <= 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 + p506 +... (shortened)
lola: processed formula length: 689
lola: 2 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((2 <= p703))) AND ((p279 <= p0) AND (1 <= p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833) AND ((p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p731 <= p322) OR (2 <= p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (AX((2 <= p703)) AND ((p279 <= p0) AND (1 <= p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833) AND ((p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p731 <= p322) OR (2 <= p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186)))))
lola: processed formula length: 288
lola: 2 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 484962 markings, 576328 edges, 2976872481744224256 markings/sec, 0 secs
lola: 942708 markings, 1131318 edges, 91549 markings/sec, 5 secs
lola: 1391859 markings, 1677205 edges, 89830 markings/sec, 10 secs
lola: 1832443 markings, 2218855 edges, 88117 markings/sec, 15 secs
lola: 2266856 markings, 2758830 edges, 86883 markings/sec, 20 secs
lola: 2686651 markings, 3285103 edges, 83959 markings/sec, 25 secs
lola: 3103329 markings, 3810791 edges, 83336 markings/sec, 30 secs
lola: 3518287 markings, 4333111 edges, 82992 markings/sec, 35 secs
lola: 3928441 markings, 4851397 edges, 82031 markings/sec, 40 secs
lola: 4333778 markings, 5378465 edges, 81067 markings/sec, 45 secs
lola: 4741105 markings, 5897401 edges, 81465 markings/sec, 50 secs
lola: 5142987 markings, 6408529 edges, 80376 markings/sec, 55 secs
lola: 5545171 markings, 6913797 edges, 80437 markings/sec, 60 secs
lola: 5949772 markings, 7419132 edges, 80920 markings/sec, 65 secs
lola: 6350348 markings, 7917273 edges, 80115 markings/sec, 70 secs
lola: 6754635 markings, 8414193 edges, 80857 markings/sec, 75 secs
lola: 7156825 markings, 8915447 edges, 80438 markings/sec, 80 secs
lola: 7551707 markings, 9411814 edges, 78976 markings/sec, 85 secs
lola: 7951415 markings, 9907252 edges, 79942 markings/sec, 90 secs
lola: 8343220 markings, 10401350 edges, 78361 markings/sec, 95 secs
lola: 8736509 markings, 10895738 edges, 78658 markings/sec, 100 secs
lola: 9127288 markings, 11390025 edges, 78156 markings/sec, 105 secs
lola: 9525858 markings, 11884121 edges, 79714 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p29)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= p29))
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 10 will run for 508 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p398 + p399 + p400 + p401 + p402 + p403 + p404)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(TRUE U (3 <= p398 + p399 + p400 + p401 + p402 + p403 + p404))
lola: processed formula length: 63
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 610 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152) AND (2 <= p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U ((1 <= p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152) AND (2 <= p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843))))
lola: processed formula length: 169
lola: 2 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 763 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (G ((p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J06T10-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 67182 markings, 80862 edges, 13436 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1015 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (F ((p112 <= p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J06T10-CTLCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1522 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((3 <= p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (3 <= p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632)))))
lola: processed formula length: 104
lola: 2 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3045 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((1 <= p721 + p720 + p719 + p718 + p717 + p716 + p715 + p714 + p713 + p712) U (3 <= p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((1 <= p721 + p720 + p719 + p718 + p717 + p716 + p715 + p714 + p713 + p712) U (3 <= p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342)))))
lola: processed formula length: 244
lola: 2 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: RESULT
lola:
SUMMARY: no no yes yes yes no unknown no unknown no no no yes yes no no
lola: ========================================
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496383997839
--------------------
content from stderr:
----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_PolyORBLF-COL-S02J06T10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/S_PolyORBLF-COL-S02J06T10.tgz
mv S_PolyORBLF-COL-S02J06T10 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_PolyORBLF-COL-S02J06T10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-149441681400309"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;