fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r058-smll-149440926000012
Last Updated
June 27, 2017

About the Execution of LoLA for PolyORBNT-COL-S05J30

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15922.640 918722.00 915671.00 2923.50 T?TTF?TFF?TFTTFF 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 PolyORBNT-COL-S05J30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-149440926000012
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494660538828


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ PolyORBNT-COL-S05J30 @ 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: 1949/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 519 places, 1430 transitions, 437 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 948 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J30-CTLCardinality.task
lola: (A (X (((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 <= p320) OR (3 <= p50) OR (p118 <= 0)))) AND E (F (((p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + 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 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 <= p224) AND (1 <= p49) AND (p257 <= p223))))) : A (X (NOT(A (G ((p8 <= p9)))))) : A (((1 <= p152) U (p7 <= p481))) : A (G (E (((1 <= p482) U (p320 <= p483))))) : E (G (A (((p83 <= p222) U (p256 <= p48))))) : A (X (A (F ((3 <= p9))))) : E (G (NOT(E (G ((1 <= p256)))))) : (E (F (E (G ((p50 <= 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))))) OR E (G (((p480 + p479 + p478 + p477 + p476 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (1 <= p15) OR (p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= 0))))) : ((((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR A (F ((2 <= p517)))) AND ((p16 + 1 <= p14 + p13 + p12 + p11 + p10) AND E (G ((p480 + p479 + p478 + p477 + p476 <= p14 + p13 + p12 + p11 + p10))))) AND E (((p8 + 1 <= p481) U (p83 <= p0 + p1 + p2 + p3 + p4)))) : A (G (A (F ((2 <= p9))))) : NOT(E ((((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 <= 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) OR (p482 <= p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + 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 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475)) U ((1 <= p48) AND (p216 <= p517))))) : NOT(A (F (((1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151) AND (p6 <= p482) AND (3 <= p82))))) : A (G ((E (X ((1 <= p483))) OR A (G ((p5 <= p48)))))) : NOT(A (F (A (G ((p257 <= p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + 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 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475)))))) : (NOT(A (F (((2 <= p9) AND (1 <= p15))))) OR (1 <= p83)) : A (G (((p224 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (3 <= p50) OR (2 <= p119))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (((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 <= p320) OR (3 <= p50) OR (p118 <= 0)))) AND E (F (((p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((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 <= p320) OR (3 <= p50) OR (p118 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((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 <= p320) OR (3 <= p50) OR (p118 <= 0)))
lola: processed formula length: 261
lola: 1 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + ... (shortened)
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 1748 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J30-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J30-CTLCardinality.sara.
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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(A (G ((p8 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (p9 + 1 <= p8)))
lola: processed formula length: 28
lola: 5 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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: 598812 markings, 1542379 edges, 2073447895104749568 markings/sec, 0 secs
lola: 1114080 markings, 3008533 edges, 103054 markings/sec, 5 secs
lola: 1592915 markings, 4384343 edges, 95767 markings/sec, 10 secs
lola: 2109191 markings, 5713253 edges, 103255 markings/sec, 15 secs
lola: 2583065 markings, 7076899 edges, 94775 markings/sec, 20 secs
lola: 3033570 markings, 8379554 edges, 90101 markings/sec, 25 secs
lola: 3538970 markings, 9681727 edges, 101080 markings/sec, 30 secs
lola: 3991035 markings, 10987836 edges, 90413 markings/sec, 35 secs
lola: 4432216 markings, 12266245 edges, 88236 markings/sec, 40 secs
lola: 4916796 markings, 13515714 edges, 96916 markings/sec, 45 secs
lola: 5349605 markings, 14773037 edges, 86562 markings/sec, 50 secs
lola: 5801620 markings, 16079003 edges, 90403 markings/sec, 55 secs
lola: 6251178 markings, 17236828 edges, 89912 markings/sec, 60 secs
lola: 6673494 markings, 18467291 edges, 84463 markings/sec, 65 secs
lola: 7140226 markings, 19668532 edges, 93346 markings/sec, 70 secs
lola: 7546453 markings, 20858254 edges, 81245 markings/sec, 75 secs
lola: 7982200 markings, 22120311 edges, 87149 markings/sec, 80 secs
lola: 8410560 markings, 23222496 edges, 85672 markings/sec, 85 secs
lola: 8825327 markings, 24435581 edges, 82953 markings/sec, 90 secs
lola: 9265889 markings, 25570129 edges, 88112 markings/sec, 95 secs
lola: 9667501 markings, 26746085 edges, 80322 markings/sec, 100 secs
lola: 10121423 markings, 27916695 edges, 90784 markings/sec, 105 secs
lola: 10467109 markings, 28947930 edges, 69137 markings/sec, 110 secs
lola: 10869631 markings, 30063561 edges, 80504 markings/sec, 115 secs
lola: 11218797 markings, 31027166 edges, 69833 markings/sec, 120 secs
lola: 11596806 markings, 32142954 edges, 75602 markings/sec, 125 secs
lola: 11964282 markings, 33087434 edges, 73495 markings/sec, 130 secs
lola: 12340959 markings, 34199089 edges, 75335 markings/sec, 135 secs
lola: 12711330 markings, 35152837 edges, 74074 markings/sec, 140 secs
lola: 13087692 markings, 36263639 edges, 75272 markings/sec, 145 secs
lola: 13461042 markings, 37225995 edges, 74670 markings/sec, 150 secs
lola: 13837854 markings, 38338005 edges, 75362 markings/sec, 155 secs
lola: 14215508 markings, 39313250 edges, 75531 markings/sec, 160 secs
lola: 14593288 markings, 40428185 edges, 75556 markings/sec, 165 secs
lola: 14977999 markings, 41418579 edges, 76942 markings/sec, 170 secs
lola: 15362350 markings, 42548909 edges, 76870 markings/sec, 175 secs
lola: 15739817 markings, 43523901 edges, 75493 markings/sec, 180 secs
lola: 16112648 markings, 44623736 edges, 74566 markings/sec, 185 secs
lola: 16496383 markings, 45614911 edges, 76747 markings/sec, 190 secs
lola: 16871436 markings, 46723098 edges, 75011 markings/sec, 195 secs
lola: 17265307 markings, 47738074 edges, 78774 markings/sec, 200 secs
lola: 17650047 markings, 48869430 edges, 76948 markings/sec, 205 secs
lola: 18074784 markings, 49963498 edges, 84947 markings/sec, 210 secs
lola: 18468479 markings, 51121114 edges, 78739 markings/sec, 215 secs
lola: 18872654 markings, 52303375 edges, 80835 markings/sec, 220 secs
lola: 19301140 markings, 53406055 edges, 85697 markings/sec, 225 secs
lola: 19714064 markings, 54611266 edges, 82585 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p152) U (p7 <= p481)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((1 <= p152) U (p7 <= p481))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((1 <= p482) U (p320 <= p483)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((1 <= p482) U (p320 <= p483)))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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: 551059 markings, 1688138 edges, 2073447895104749568 markings/sec, 0 secs
lola: 1052288 markings, 3324792 edges, 100246 markings/sec, 5 secs
lola: 1534106 markings, 4894380 edges, 96364 markings/sec, 10 secs
lola: 2008471 markings, 6435798 edges, 94873 markings/sec, 15 secs
lola: 2495727 markings, 7933633 edges, 97451 markings/sec, 20 secs
lola: 2961474 markings, 9456884 edges, 93149 markings/sec, 25 secs
lola: 3407736 markings, 10915133 edges, 89252 markings/sec, 30 secs
lola: 3891775 markings, 12399163 edges, 96808 markings/sec, 35 secs
lola: 4337929 markings, 13861070 edges, 89231 markings/sec, 40 secs
lola: 4774365 markings, 15285364 edges, 87287 markings/sec, 45 secs
lola: 5252785 markings, 16745698 edges, 95684 markings/sec, 50 secs
lola: 5678255 markings, 18146207 edges, 85094 markings/sec, 55 secs
lola: 6105373 markings, 19544546 edges, 85424 markings/sec, 60 secs
lola: 6570413 markings, 20960268 edges, 93008 markings/sec, 65 secs
lola: 6982626 markings, 22320652 edges, 82443 markings/sec, 70 secs
lola: 7407166 markings, 23709774 edges, 84908 markings/sec, 75 secs
lola: 7851880 markings, 25067896 edges, 88943 markings/sec, 80 secs
lola: 8257637 markings, 26404850 edges, 81151 markings/sec, 85 secs
lola: 8683887 markings, 27798578 edges, 85250 markings/sec, 90 secs
lola: 9107846 markings, 29097163 edges, 84792 markings/sec, 95 secs
lola: 9489844 markings, 30358203 edges, 76400 markings/sec, 100 secs
lola: 9904430 markings, 31621801 edges, 82917 markings/sec, 105 secs
lola: 10242909 markings, 32756203 edges, 67696 markings/sec, 110 secs
lola: 10628513 markings, 34022611 edges, 77121 markings/sec, 115 secs
lola: 10991307 markings, 35136373 edges, 72559 markings/sec, 120 secs
lola: 11370901 markings, 36382896 edges, 75919 markings/sec, 125 secs
lola: 11754968 markings, 37541072 edges, 76813 markings/sec, 130 secs
lola: 12129450 markings, 38761276 edges, 74896 markings/sec, 135 secs
lola: 12535811 markings, 39981563 edges, 81272 markings/sec, 140 secs
lola: 12894732 markings, 41161585 edges, 71784 markings/sec, 145 secs
lola: 13284197 markings, 42422022 edges, 77893 markings/sec, 150 secs
lola: 13665199 markings, 43575567 edges, 76200 markings/sec, 155 secs
lola: 14056498 markings, 44843704 edges, 78260 markings/sec, 160 secs
lola: 14458968 markings, 46056064 edges, 80494 markings/sec, 165 secs
lola: 14843301 markings, 47308457 edges, 76867 markings/sec, 170 secs
lola: 15239457 markings, 48589233 edges, 79231 markings/sec, 175 secs
lola: 15638638 markings, 49797125 edges, 79836 markings/sec, 180 secs
lola: 16038873 markings, 51091941 edges, 80047 markings/sec, 185 secs
lola: 16448796 markings, 52324748 edges, 81985 markings/sec, 190 secs
lola: 16833105 markings, 53579554 edges, 76862 markings/sec, 195 secs
lola: 17226483 markings, 54850906 edges, 78676 markings/sec, 200 secs
lola: 17628179 markings, 56067210 edges, 80339 markings/sec, 205 secs
lola: 18028025 markings, 57360773 edges, 79969 markings/sec, 210 secs
lola: 18446834 markings, 58621277 edges, 83762 markings/sec, 215 secs
lola: 18850877 markings, 59935830 edges, 80809 markings/sec, 220 secs
lola: 19264269 markings, 61269784 edges, 82678 markings/sec, 225 secs
lola: 19711913 markings, 62617869 edges, 89529 markings/sec, 230 secs
lola: 19875771 markings, 64038570 edges, 32772 markings/sec, 235 secs
lola: 19929046 markings, 65271693 edges, 10655 markings/sec, 240 secs
lola: 20048530 markings, 66599968 edges, 23897 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((p83 <= p222) U (p256 <= p48)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((p83 <= p222) U (p256 <= p48)))))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((3 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (3 <= p9)))
lola: processed formula length: 23
lola: 2 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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 6 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (G ((1 <= p256))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p256 <= 0)))))
lola: processed formula length: 41
lola: 5 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((p50 <= 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))))) OR E (G (((p480 + p479 + p478 + p477 + p476 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p84 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p50 <= 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)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (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 + 1 <= p50))))
lola: processed formula length: 252
lola: 3 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 8 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR A (F ((2 <= p517)))) AND ((p16 + 1 <= p14 + p13 + p12 + p11 + p10) AND E (G ((p480 + p479 + p478 + p477 + p476 <= p14 + p13 + p12 + p11 + p10))))) AND E (((p8 + 1 <= p481) U (p83 <= p0 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: ========================================
lola: RUNNING
lola: subprocess 8 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: processed formula length: 205
lola: 2 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-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 9 will run for 435 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p517)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= p517))
lola: processed formula length: 21
lola: 3 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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 9 will run for 435 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((2 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (2 <= p9)))))
lola: processed formula length: 39
lola: 2 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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 10 will run for 508 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((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 <= 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(((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 <= 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 +... (shortened)
lola: processed formula length: 1575
lola: 7 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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: 1056752 markings, 1442557 edges, 3225752436249460736 markings/sec, 0 secs
lola: 2011017 markings, 2785032 edges, 190853 markings/sec, 5 secs
lola: 2943893 markings, 4078030 edges, 186575 markings/sec, 10 secs
lola: 3870633 markings, 5364080 edges, 185348 markings/sec, 15 secs
lola: 4376867 markings, 6918298 edges, 101247 markings/sec, 20 secs
lola: 5415576 markings, 8353671 edges, 207742 markings/sec, 25 secs
lola: 6392293 markings, 9709358 edges, 195343 markings/sec, 30 secs
lola: 7347496 markings, 11028744 edges, 191041 markings/sec, 35 secs
lola: 8283822 markings, 12326003 edges, 187265 markings/sec, 40 secs
lola: 8826741 markings, 13934944 edges, 108584 markings/sec, 45 secs
lola: 9838700 markings, 15345731 edges, 202392 markings/sec, 50 secs
lola: 10808692 markings, 16683153 edges, 193998 markings/sec, 55 secs
lola: 11742780 markings, 17985708 edges, 186818 markings/sec, 60 secs
lola: 12664936 markings, 19258352 edges, 184431 markings/sec, 65 secs
lola: 13192239 markings, 20881782 edges, 105461 markings/sec, 70 secs
lola: 14204963 markings, 22269245 edges, 202545 markings/sec, 75 secs
lola: 15145897 markings, 23598895 edges, 188187 markings/sec, 80 secs
lola: 16075006 markings, 24887314 edges, 185822 markings/sec, 85 secs
lola: 16987082 markings, 26129294 edges, 182415 markings/sec, 90 secs
lola: 17475915 markings, 27677325 edges, 97767 markings/sec, 95 secs
lola: 18506400 markings, 29125491 edges, 206097 markings/sec, 100 secs
lola: 19455856 markings, 30438318 edges, 189891 markings/sec, 105 secs
lola: 20374145 markings, 31714293 edges, 183658 markings/sec, 110 secs
lola: 21271564 markings, 32965337 edges, 179484 markings/sec, 115 secs
lola: 21795955 markings, 34270621 edges, 104878 markings/sec, 120 secs
lola: 22285440 markings, 35259593 edges, 97897 markings/sec, 125 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 11 will run for 583 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151) AND (p6 <= p482) AND (3 <= p82)))))
lola: lola: ================================================================================

lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151) AND (p6 <= p482) AND (3 <= p82))))
lola: processed formula length: 270
lola: 5 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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 12 will run for 729 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((1 <= p483))) OR A (G ((p5 <= p48))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(EX((1 <= p483))) AND E(TRUE U (p48 + 1 <= p5)))))
lola: processed formula length: 67
lola: 6 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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 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 13 will run for 972 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G ((p257 <= p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p3... (shortened)
lola: processed formula length: 1126
lola: 7 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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: 662560 markings, 1423282 edges, 3225752436249460736 markings/sec, 0 secs
lola: 1258099 markings, 2691055 edges, 119108 markings/sec, 5 secs
lola: 1824743 markings, 3956766 edges, 113329 markings/sec, 10 secs
lola: 2380788 markings, 5204403 edges, 111209 markings/sec, 15 secs
lola: 2927448 markings, 6425206 edges, 109332 markings/sec, 20 secs
lola: 3451895 markings, 7599013 edges, 104889 markings/sec, 25 secs
lola: 4004490 markings, 8832419 edges, 110519 markings/sec, 30 secs
lola: 4552136 markings, 9961184 edges, 109529 markings/sec, 35 secs
lola: 5067279 markings, 11115172 edges, 103029 markings/sec, 40 secs
lola: 5576250 markings, 12258269 edges, 101794 markings/sec, 45 secs
lola: 6085903 markings, 13397532 edges, 101931 markings/sec, 50 secs
lola: 6624578 markings, 14530952 edges, 107735 markings/sec, 55 secs
lola: 7117134 markings, 15611004 edges, 98511 markings/sec, 60 secs
lola: 7603066 markings, 16709241 edges, 97186 markings/sec, 65 secs
lola: 8097556 markings, 17815254 edges, 98898 markings/sec, 70 secs
lola: 8607068 markings, 18920080 edges, 101902 markings/sec, 75 secs
lola: 9086284 markings, 19945211 edges, 95843 markings/sec, 80 secs
lola: 9528772 markings, 20948837 edges, 88498 markings/sec, 85 secs
lola: 9980502 markings, 21968993 edges, 90346 markings/sec, 90 secs
lola: 10410719 markings, 22855791 edges, 86043 markings/sec, 95 secs
lola: 10832339 markings, 23817192 edges, 84324 markings/sec, 100 secs
lola: 11272282 markings, 24812951 edges, 87989 markings/sec, 105 secs
lola: 11706233 markings, 25690592 edges, 86790 markings/sec, 110 secs
lola: 12145084 markings, 26664219 edges, 87770 markings/sec, 115 secs
lola: 12593470 markings, 27656877 edges, 89677 markings/sec, 120 secs
lola: 13036795 markings, 28550092 edges, 88665 markings/sec, 125 secs
lola: 13480550 markings, 29538970 edges, 88751 markings/sec, 130 secs
lola: 13934605 markings, 30539658 edges, 90811 markings/sec, 135 secs
lola: 14373244 markings, 31425478 edges, 87728 markings/sec, 140 secs
lola: 14813139 markings, 32402410 edges, 87979 markings/sec, 145 secs
lola: 15255617 markings, 33382978 edges, 88496 markings/sec, 150 secs
lola: 15706877 markings, 34294083 edges, 90252 markings/sec, 155 secs
lola: 16157402 markings, 35292350 edges, 90105 markings/sec, 160 secs
lola: 16612422 markings, 36297141 edges, 91004 markings/sec, 165 secs
lola: 17085854 markings, 37251177 edges, 94686 markings/sec, 170 secs
lola: 17547336 markings, 38275580 edges, 92296 markings/sec, 175 secs
lola: 18014772 markings, 39308029 edges, 93487 markings/sec, 180 secs
lola: 18511282 markings, 40339785 edges, 99302 markings/sec, 185 secs
lola: 18992838 markings, 41369364 edges, 96311 markings/sec, 190 secs
lola: 19486274 markings, 42454820 edges, 98687 markings/sec, 195 secs
lola: 19851963 markings, 43630334 edges, 73138 markings/sec, 200 secs
lola: 19910134 markings, 44930695 edges, 11634 markings/sec, 205 secs
lola: 19966108 markings, 46141794 edges, 11195 markings/sec, 210 secs
lola: 20272163 markings, 47016971 edges, 61211 markings/sec, 215 secs
lola: 20634834 markings, 47758000 edges, 72534 markings/sec, 220 secs
lola: 21082887 markings, 48782406 edges, 89611 markings/sec, 225 secs
lola: 21549083 markings, 49839341 edges, 93239 markings/sec, 230 secs
lola: 21985508 markings, 50830495 edges, 87285 markings/sec, 235 secs
lola: 22334172 markings, 51559141 edges, 69733 markings/sec, 240 secs
lola: 22662228 markings, 52323780 edges, 65611 markings/sec, 245 secs
lola: 23012345 markings, 53050235 edges, 70023 markings/sec, 250 secs
lola: 23339581 markings, 53816342 edges, 65447 markings/sec, 255 secs
lola: 23684841 markings, 54535433 edges, 69052 markings/sec, 260 secs
lola: 24005230 markings, 55285413 edges, 64078 markings/sec, 265 secs
lola: 24342814 markings, 55983958 edges, 67517 markings/sec, 270 secs
lola: 24668660 markings, 56744877 edges, 65169 markings/sec, 275 secs
lola: 25015378 markings, 57461294 edges, 69344 markings/sec, 280 secs
lola: 25342584 markings, 58222035 edges, 65441 markings/sec, 285 secs
lola: 25686380 markings, 58934501 edges, 68759 markings/sec, 290 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F (((2 <= p9) AND (1 <= p15))))) OR (1 <= p83))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p9 <= 1) OR (p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= p9) AND (1 <= p15))))
lola: processed formula length: 41
lola: 5 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1748 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2621 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((p224 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (3 <= p50) OR (2 <= p119))))
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 1748 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J30-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J30-CTLCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: RESULT
lola:
SUMMARY: yes unknown no unknown yes no yes yes no no yes yes no unknown yes no
lola: ========================================
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494661457550

--------------------
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="PolyORBNT-COL-S05J30"
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/PolyORBNT-COL-S05J30.tgz
mv PolyORBNT-COL-S05J30 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 PolyORBNT-COL-S05J30, 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 r058-smll-149440926000012"
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 '' CTLCardinality.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 ;