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)
...................
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 93K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PolyORBNT-COL-S05J40, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-152673529300276
=====================================================================

--------------------
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-S05J40-CTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526861769749


BK_STOP 1526862628064

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBNT-COL-S05J40 as instance name.
Using PolyORBNT as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1014809, 'Memory': 15944.45, 'Tool': 'lola'}, {'Time': 1092941, 'Memory': 15937.21, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBNT-COL-S05J40...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBNT-COL-S05J40: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBNT-COL-S05J40: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBNT-COL-S05J40 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
Makefile:222: recipe for target 'verify' failed
----- 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: 2299/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 669 places, 1630 transitions, 567 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1208 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J40-CTLCardinality.task
lola: A (F ((((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 <= 1) AND (p323 <= p234)) AND A (X ((3 <= p1)))))) : E (G (A (G ((p657 <= 0))))) : (E (X (((p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 <= p10) OR ((2 <= p2 + p3 + p4 + p5 + p6) AND (2 <= p234))))) AND A (F ((3 <= p278)))) : (A (G ((((p615 <= p661) OR (p658 <= p186)) AND (p9 <= p53 + p54 + p55 + p56 + p57)))) OR ((E (X ((2 <= p323))) AND ((p141 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185) AND (2 <= p657) AND (p321 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (p278 <= 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 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276))) AND ((p663 + p664 + p665 + p666 + p667 <= p8) OR (p659 + 1 <= p668)))) : NOT(E (G ((2 <= p53 + p54 + p55 + p56 + p57)))) : A (F ((A (F ((2 <= p529))) AND A (F ((1 <= p192)))))) : (E (F (((p53 + p54 + p55 + p56 + p57 + 1 <= p321) AND (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 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + 1 <= p235)))) OR A (G (E (G ((p141 <= p2 + p3 + p4 + p5 + p6)))))) : A (X ((A (G ((p322 <= p663 + p664 + p665 + p666 + p667))) AND E (F ((p662 <= p614)))))) : A (G (((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 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 <= p320) OR (p658 <= p320) OR ((p660 <= p7) AND (p615 <= p193 + p194 + p195 + p196 + 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)) OR (1 <= p9)))) : (((2 <= p277) AND NOT(A (G ((p186 <= p1))))) AND A (((p613 <= p0) U ((2 <= p193 + p194 + p195 + p196 + 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) OR (p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p660))))) : E (F (A (((1 <= p278) U (2 <= p278))))) : E (F (NOT(E (G ((p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 <= p668)))))) : A (G ((A (X ((2 <= p615))) OR (2 <= p58)))) : E (((p235 <= p193 + p194 + p195 + p196 + 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) U A (F ((3 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185))))) : NOT(E ((((p529 <= p668) AND (p11 <= p657)) U ((3 <= p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319) AND (p323 <= p53 + p54 + p55 + p56 + p57))))) : A (F (((((3 <= p9) AND (1 <= p660)) OR (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)) AND (2 <= p143))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 <= 1) AND (p323 <= p234)) AND A (X ((3 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 <= 1) AND (p323 <= p234)) AND AX((3 <= p1))))
lola: processed formula length: 342
lola: 2 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 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: 38 markings, 37 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G ((p657 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (1 <= p657))))
lola: processed formula length: 36
lola: 4 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (((p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 +... (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 (X (((p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p58... (shortened)
lola: processed formula length: 638
lola: 1 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p278)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p278)))
lola: processed formula: A (F ((3 <= p278)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2272 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p615 <= p661) OR (p658 <= p186)) AND (p9 <= p53 + p54 + p55 + p56 + p57)))) OR ((E (X ((2 <= p323))) AND ((p141 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p... (shortened)
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 (G ((((p615 <= p661) OR (p658 <= p186)) AND (p9 <= p53 + p54 + p55 + p56 + p57))))
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 2268 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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 34 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= p323)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= p323))
lola: processed formula length: 15
lola: 2 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p141 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185) AND (2 <= p657) AND (p321 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p7... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p141 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185) AND (2 <= p657) AND (p321 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p7... (shortened)
lola: processed formula length: 941
lola: 2 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: processed formula with 6 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((2 <= p53 + p54 + p55 + p56 + p57))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p53 + p54 + p55 + p56 + p57 <= 1)))
lola: processed formula: A (F ((p53 + p54 + p55 + p56 + p57 <= 1)))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2272 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 35 markings, 35 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((2 <= p529))) AND A (F ((1 <= p192))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U (2 <= p529)) AND A(TRUE U (1 <= p192))))
lola: processed formula length: 59
lola: 3 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 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 3 significant temporal operators and needs 13 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: 38 markings, 112 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((p53 + p54 + p55 + p56 + p57 + 1 <= p321) AND (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 + p3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p53 + p54 + p55 + p56 + p57 + 1 <= p321) AND (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 + p37... (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 2268 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J40-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A (G ((p322 <= p663 + p664 + p665 + p666 + p667))) AND E (F ((p662 <= p614))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p322 <= p663 + p664 + p665 + p666 + p667)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (A (G ((p322 <= p663 + p664 + p665 + p666 + p667)))))
lola: processed formula: A (X (A (G ((p322 <= p663 + p664 + p665 + p666 + p667)))))
lola: processed formula length: 58
lola: 1 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2272 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 38 markings, 38 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((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 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 <= p320) OR (p658 <= p320) OR ((p660 <= p7) AND (p615 <= p193 + p194 + p195 + p196 + p197 + p198 + p199 +... (shortened)
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 2268 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J40-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 32721 markings, 71975 edges, 6544 markings/sec, 0 secs
lola: sara is running 5 secs || 66702 markings, 156520 edges, 6796 markings/sec, 5 secs
lola: sara is running 10 secs || 101901 markings, 245847 edges, 7040 markings/sec, 10 secs
lola: sara is running 15 secs || 137235 markings, 325337 edges, 7067 markings/sec, 15 secs
lola: sara is running 20 secs || 171873 markings, 409249 edges, 6928 markings/sec, 20 secs
lola: sara is running 25 secs || 205500 markings, 511202 edges, 6725 markings/sec, 25 secs
lola: sara is running 30 secs || 238458 markings, 607914 edges, 6592 markings/sec, 30 secs
lola: sara is running 35 secs || 272167 markings, 701691 edges, 6742 markings/sec, 35 secs
lola: sara is running 40 secs || 306645 markings, 781656 edges, 6896 markings/sec, 40 secs
lola: sara is running 45 secs || 341036 markings, 875329 edges, 6878 markings/sec, 45 secs
lola: sara is running 50 secs || 376234 markings, 953505 edges, 7040 markings/sec, 50 secs
lola: sara is running 55 secs || 410713 markings, 1033856 edges, 6896 markings/sec, 55 secs
lola: sara is running 60 secs || 444436 markings, 1131773 edges, 6745 markings/sec, 60 secs
lola: sara is running 65 secs || 477534 markings, 1226607 edges, 6620 markings/sec, 65 secs
lola: sara is running 70 secs || 509910 markings, 1328317 edges, 6475 markings/sec, 70 secs
lola: sara is running 75 secs || 544805 markings, 1406307 edges, 6979 markings/sec, 75 secs
lola: sara is running 80 secs || 578502 markings, 1501545 edges, 6739 markings/sec, 80 secs
lola: sara is running 85 secs || 613968 markings, 1579551 edges, 7093 markings/sec, 85 secs
lola: sara is running 90 secs || 648939 markings, 1658747 edges, 6994 markings/sec, 90 secs
lola: sara is running 95 secs || 683185 markings, 1745020 edges, 6849 markings/sec, 95 secs
lola: sara is running 100 secs || 716313 markings, 1845797 edges, 6626 markings/sec, 100 secs
lola: sara is running 105 secs || 748639 markings, 1942123 edges, 6465 markings/sec, 105 secs
lola: sara is running 110 secs || 782395 markings, 2031818 edges, 6751 markings/sec, 110 secs
lola: sara is running 115 secs || 816277 markings, 2113319 edges, 6776 markings/sec, 115 secs
lola: sara is running 120 secs || 850607 markings, 2203794 edges, 6866 markings/sec, 120 secs
lola: sara is running 125 secs || 885427 markings, 2282104 edges, 6964 markings/sec, 125 secs
lola: sara is running 130 secs || 919602 markings, 2364818 edges, 6835 markings/sec, 130 secs
lola: sara is running 135 secs || 952885 markings, 2465878 edges, 6657 markings/sec, 135 secs
lola: sara is running 140 secs || 985642 markings, 2562593 edges, 6551 markings/sec, 140 secs
lola: sara is running 145 secs || 1019121 markings, 2654227 edges, 6696 markings/sec, 145 secs
lola: sara is running 150 secs || 1052940 markings, 2734283 edges, 6764 markings/sec, 150 secs
lola: sara is running 155 secs || 1086928 markings, 2825362 edges, 6798 markings/sec, 155 secs
lola: sara is running 160 secs || 1120935 markings, 2901499 edges, 6801 markings/sec, 160 secs
lola: sara is running 165 secs || 1152606 markings, 2976632 edges, 6334 markings/sec, 165 secs
lola: sara is running 170 secs || 1183833 markings, 3070061 edges, 6245 markings/sec, 170 secs
lola: sara is running 175 secs || 1215613 markings, 3161958 edges, 6356 markings/sec, 175 secs
lola: sara is running 180 secs || 1247746 markings, 3258716 edges, 6427 markings/sec, 180 secs
lola: sara is running 185 secs || 1281512 markings, 3335484 edges, 6753 markings/sec, 185 secs
lola: sara is running 190 secs || 1314375 markings, 3427556 edges, 6573 markings/sec, 190 secs
lola: sara is running 195 secs || 1348700 markings, 3503551 edges, 6865 markings/sec, 195 secs
lola: sara is running 200 secs || 1382478 markings, 3581694 edges, 6756 markings/sec, 200 secs
lola: sara is running 205 secs || 1415288 markings, 3675747 edges, 6562 markings/sec, 205 secs
lola: sara is running 210 secs || 1447569 markings, 3768287 edges, 6456 markings/sec, 210 secs
lola: sara is running 215 secs || 1479071 markings, 3869391 edges, 6300 markings/sec, 215 secs
lola: sara is running 220 secs || 1513069 markings, 3945920 edges, 6800 markings/sec, 220 secs
lola: sara is running 225 secs || 1545872 markings, 4038650 edges, 6561 markings/sec, 225 secs
lola: sara is running 230 secs || 1580332 markings, 4115127 edges, 6892 markings/sec, 230 secs
lola: sara is running 235 secs || 1614182 markings, 4193495 edges, 6770 markings/sec, 235 secs
lola: sara is running 240 secs || 1647031 markings, 4288494 edges, 6570 markings/sec, 240 secs
lola: sara is running 245 secs || 1679648 markings, 4382219 edges, 6523 markings/sec, 245 secs
lola: sara is running 250 secs || 1711811 markings, 4481145 edges, 6433 markings/sec, 250 secs
lola: sara is running 255 secs || 1745392 markings, 4557931 edges, 6716 markings/sec, 255 secs
lola: sara is running 260 secs || 1778163 markings, 4649539 edges, 6554 markings/sec, 260 secs
lola: sara is running 265 secs || 1812313 markings, 4725777 edges, 6830 markings/sec, 265 secs
lola: sara is running 270 secs || 1845900 markings, 4804370 edges, 6717 markings/sec, 270 secs
lola: sara is running 275 secs || 1878555 markings, 4900213 edges, 6531 markings/sec, 275 secs
lola: sara is running 280 secs || 1910823 markings, 4993784 edges, 6454 markings/sec, 280 secs
lola: sara is running 285 secs || 1943030 markings, 5089999 edges, 6441 markings/sec, 285 secs
lola: sara is running 290 secs || 1976483 markings, 5167100 edges, 6691 markings/sec, 290 secs
lola: sara is running 295 secs || 2009233 markings, 5257853 edges, 6550 markings/sec, 295 secs
lola: sara is running 300 secs || 2043332 markings, 5334112 edges, 6820 markings/sec, 300 secs
lola: sara is running 305 secs || 2077192 markings, 5414115 edges, 6772 markings/sec, 305 secs
lola: sara is running 310 secs || 2109985 markings, 5511928 edges, 6559 markings/sec, 310 secs
lola: sara is running 315 secs || 2142252 markings, 5606293 edges, 6453 markings/sec, 315 secs
lola: sara is running 320 secs || 2175104 markings, 5700500 edges, 6570 markings/sec, 320 secs
lola: sara is running 325 secs || 2208680 markings, 5780950 edges, 6715 markings/sec, 325 secs
lola: sara is running 330 secs || 2242192 markings, 5870605 edges, 6702 markings/sec, 330 secs
lola: sara is running 335 secs || 2276385 markings, 5948395 edges, 6839 markings/sec, 335 secs
lola: sara is running 340 secs || 2309883 markings, 6033197 edges, 6700 markings/sec, 340 secs
lola: sara is running 345 secs || 2342757 markings, 6134063 edges, 6575 markings/sec, 345 secs
lola: sara is running 350 secs || 2374855 markings, 6237739 edges, 6420 markings/sec, 350 secs
lola: sara is running 355 secs || 2408895 markings, 6314902 edges, 6808 markings/sec, 355 secs
lola: sara is running 360 secs || 2441235 markings, 6406138 edges, 6468 markings/sec, 360 secs
lola: sara is running 365 secs || 2475015 markings, 6481538 edges, 6756 markings/sec, 365 secs
lola: sara is running 370 secs || 2508173 markings, 6559515 edges, 6632 markings/sec, 370 secs
lola: sara is running 375 secs || 2540328 markings, 6654840 edges, 6431 markings/sec, 375 secs
lola: sara is running 380 secs || 2572081 markings, 6747514 edges, 6351 markings/sec, 380 secs
lola: sara is running 385 secs || 2604112 markings, 6840282 edges, 6406 markings/sec, 385 secs
lola: sara is running 390 secs || 2637114 markings, 6918732 edges, 6600 markings/sec, 390 secs
lola: sara is running 395 secs || 2670128 markings, 7008010 edges, 6603 markings/sec, 395 secs
lola: sara is running 400 secs || 2703975 markings, 7084653 edges, 6769 markings/sec, 400 secs
lola: sara is running 405 secs || 2737102 markings, 7166997 edges, 6625 markings/sec, 405 secs
lola: sara is running 410 secs || 2769292 markings, 7266066 edges, 6438 markings/sec, 410 secs
lola: sara is running 415 secs || 2800815 markings, 7363181 edges, 6305 markings/sec, 415 secs
lola: sara is running 420 secs || 2834237 markings, 7446398 edges, 6684 markings/sec, 420 secs
lola: sara is running 425 secs || 2866569 markings, 7537993 edges, 6466 markings/sec, 425 secs
lola: sara is running 430 secs || 2900499 markings, 7614012 edges, 6786 markings/sec, 430 secs
lola: sara is running 435 secs || 2933803 markings, 7693241 edges, 6661 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p277) AND NOT(A (G ((p186 <= p1))))) AND A (((p613 <= p0) U ((2 <= p193 + p194 + p195 + p196 + 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) OR (p59 + p60 + p61 + p62 + p63 + p64 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p277)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p277)
lola: processed formula length: 11
lola: 4 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1 + 1 <= 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 2268 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 PolyORBNT-COL-S05J40-CTLCardinality-10.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 11 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p613 <= p0) U ((2 <= p193 + p194 + p195 + p196 + 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) OR (p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p613 <= p0) U ((2 <= p193 + p194 + p195 + p196 + 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) OR (p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p660))))
lola: processed formula: A (((p613 <= p0) U ((2 <= p193 + p194 + p195 + p196 + 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) OR (p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 +... (shortened)
lola: processed formula length: 572
lola: 4 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2272 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((1 <= p278) U (2 <= p278)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((1 <= p278) U (2 <= p278)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 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: 422051 markings, 1289840 edges, 3689326604607029248 markings/sec, 0 secs
lola: 799117 markings, 2390923 edges, 75413 markings/sec, 5 secs
lola: 1182014 markings, 3508397 edges, 76579 markings/sec, 10 secs
lola: 1569595 markings, 4620277 edges, 77516 markings/sec, 15 secs
lola: 1942536 markings, 5665469 edges, 74588 markings/sec, 20 secs
lola: 2313062 markings, 6744683 edges, 74105 markings/sec, 25 secs
lola: 2685379 markings, 7807427 edges, 74463 markings/sec, 30 secs
lola: 3041778 markings, 8813904 edges, 71280 markings/sec, 35 secs
lola: 3381142 markings, 9783601 edges, 67873 markings/sec, 40 secs
lola: 3742992 markings, 10806860 edges, 72370 markings/sec, 45 secs
lola: 4088454 markings, 11816956 edges, 69092 markings/sec, 50 secs
lola: 4455566 markings, 12866526 edges, 73422 markings/sec, 55 secs
lola: 4809510 markings, 13864928 edges, 70789 markings/sec, 60 secs
lola: 5156445 markings, 14879038 edges, 69387 markings/sec, 65 secs
lola: 5514365 markings, 15907327 edges, 71584 markings/sec, 70 secs
lola: 5861185 markings, 16881846 edges, 69364 markings/sec, 75 secs
lola: 6223177 markings, 17937169 edges, 72398 markings/sec, 80 secs
lola: 6569164 markings, 18909727 edges, 69197 markings/sec, 85 secs
lola: 6902910 markings, 19871326 edges, 66749 markings/sec, 90 secs
lola: 7260502 markings, 20894248 edges, 71518 markings/sec, 95 secs
lola: 7601260 markings, 21856510 edges, 68152 markings/sec, 100 secs
lola: 7947671 markings, 22868850 edges, 69282 markings/sec, 105 secs
lola: 8291012 markings, 23857521 edges, 68668 markings/sec, 110 secs
lola: 8624788 markings, 24795421 edges, 66755 markings/sec, 115 secs
lola: 8983644 markings, 25819224 edges, 71771 markings/sec, 120 secs
lola: 9317409 markings, 26764998 edges, 66753 markings/sec, 125 secs
lola: 9654575 markings, 27751803 edges, 67433 markings/sec, 130 secs
lola: 9995301 markings, 28732952 edges, 68145 markings/sec, 135 secs
lola: 10328291 markings, 29668996 edges, 66598 markings/sec, 140 secs
lola: 10684914 markings, 30697594 edges, 71325 markings/sec, 145 secs
lola: 11016611 markings, 31626599 edges, 66339 markings/sec, 150 secs
lola: 11337275 markings, 32568120 edges, 64133 markings/sec, 155 secs
lola: 11648614 markings, 33461072 edges, 62268 markings/sec, 160 secs
lola: 11959561 markings, 34343001 edges, 62189 markings/sec, 165 secs
lola: 12278866 markings, 35261922 edges, 63861 markings/sec, 170 secs
lola: 12588172 markings, 36135540 edges, 61861 markings/sec, 175 secs
lola: 12919518 markings, 37091328 edges, 66269 markings/sec, 180 secs
lola: 13224253 markings, 37948575 edges, 60947 markings/sec, 185 secs
lola: 13547007 markings, 38895691 edges, 64551 markings/sec, 190 secs
lola: 13856759 markings, 39769304 edges, 61950 markings/sec, 195 secs
lola: 14169436 markings, 40671225 edges, 62535 markings/sec, 200 secs
lola: 14483115 markings, 41577112 edges, 62736 markings/sec, 205 secs
lola: 14796506 markings, 42459364 edges, 62678 markings/sec, 210 secs
lola: 15121527 markings, 43391373 edges, 65004 markings/sec, 215 secs
lola: 15429825 markings, 44264970 edges, 61660 markings/sec, 220 secs
lola: 15760820 markings, 45234914 edges, 66199 markings/sec, 225 secs
lola: 16073563 markings, 46099068 edges, 62549 markings/sec, 230 secs
lola: 16391275 markings, 47032409 edges, 63542 markings/sec, 235 secs
lola: 16696322 markings, 47913703 edges, 61009 markings/sec, 240 secs
lola: 16802321 markings, 48202177 edges, 21200 markings/sec, 245 secs
lola: 16802943 markings, 48203844 edges, 124 markings/sec, 250 secs
lola: 16803291 markings, 48204775 edges, 70 markings/sec, 255 secs
lola: 16804223 markings, 48207301 edges, 186 markings/sec, 260 secs
lola: 16804747 markings, 48208715 edges, 105 markings/sec, 265 secs
lola: 16804760 markings, 48208747 edges, 3 markings/sec, 270 secs
lola: 16804793 markings, 48208840 edges, 7 markings/sec, 275 secs
lola: 16804813 markings, 48208890 edges, 4 markings/sec, 280 secs
lola: 16805348 markings, 48210332 edges, 107 markings/sec, 285 secs
lola: 16805361 markings, 48210375 edges, 3 markings/sec, 290 secs
lola: 16805374 markings, 48210402 edges, 3 markings/sec, 295 secs
lola: 16805562 markings, 48210905 edges, 38 markings/sec, 300 secs
lola: 16805567 markings, 48210922 edges, 1 markings/sec, 305 secs
lola: 16805573 markings, 48210938 edges, 1 markings/sec, 310 secs
lola: 16805577 markings, 48210958 edges, 1 markings/sec, 315 secs
lola: 16805583 markings, 48210973 edges, 1 markings/sec, 320 secs
lola: 16805587 markings, 48210984 edges, 1 markings/sec, 325 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

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-S05J40"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
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-S05J40.tgz
mv PolyORBNT-COL-S05J40 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is PolyORBNT-COL-S05J40, 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 r127-smll-152673529300276"
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 ;