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 240K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 18K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 72K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is QuasiCertifProtocol-COL-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-qhx2-152673581100026
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527780928074


BK_STOP 1527781646121

--------------------
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 QuasiCertifProtocol-COL-10 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 881, 'Memory': 105.74, 'Tool': 'lola'}, {'Time': 1145, 'Memory': 125.95, 'Tool': 'lola'}, {'Time': 751068, 'Memory': 15938.97, 'Tool': 'itstools'}, {'Time': 752471, 'Memory': 15933.27, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola QuasiCertifProtocol-COL-10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
QuasiCertifProtocol-COL-10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
QuasiCertifProtocol-COL-10: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ QuasiCertifProtocol-COL-10 @ 3539 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-10-ReachabilityCardinality.task
lola: E (F ((((p269 + p268 + p267 + p266 + p265 + p259 + p260 + p261 + p262 + p263 + p264 <= 0) OR (p0 <= p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57)) AND (2 <= p405)))) : E (F ((3 <= p35))) : E (F (())) : A (G ((p516 + p505 + p494 + p483 + p472 + p461 + p450 + p439 + p428 + p417 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 <= p405))) : A (G (((p404 <= p269 + p268 + p267 + p266 + p265 + p259 + p260 + p261 + p262 + p263 + p264) OR ((2 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (3 <= p516 + p505 + p494 + p483 + p472 + p461 + p450 + p439 + p428 + p417 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526) AND (p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= 0))))) : E (F ((p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p11 + p10))) : E (F (((p403 <= 1) AND (p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 <= 0) AND (p392 + p381 + p370 + p359 + p348 + p337 + p326 + p315 + p304 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p11 + p10) AND (p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + 1 <= p69)))) : A (G (((p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 <= 1) OR (p404 <= 0) OR (p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + 1 <= p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93) OR (p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 <= 2)))) : A (G (((p516 + p505 + p494 + p483 + p472 + p461 + p450 + p439 + p428 + p417 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 <= p0) OR (2 <= p237 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238)))) : A (G ((2 <= p100 + p101 + p102 + p103 + p104 + p98 + p97 + p96 + p95 + p94 + p99))) : E (F (((p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72) AND (1 <= p280 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270)))) : E (F ((((2 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115) OR (p392 + p381 + p370 + p359 + p348 + p337 + p326 + p315 + p304 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + 1 <= p237 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238)) AND (((p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 <= p405) AND (p392 + p381 + p370 + p359 + p348 + p337 + p326 + p315 + p304 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 <= p404)) OR (1 <= p392 + p381 + p370 + p359 + p348 + p337 + p326 + p315 + p304 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402))))) : A (G (((p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p138 + p149 + p160 + p171 + p182 + p193 + p204 + p215 + p226 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130 + p129 + p128) OR (2 <= p35)))) : E (F (((3 <= p34) OR (((p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 <= p392 + p381 + p370 + p359 + p348 + p337 + p326 + p315 + p304 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402) OR (2 <= p392 + p381 + p370 + p359 + p348 + p337 + p326 + p315 + p304 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402)) AND ((2 <= p237 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238) OR (1 <= p403)))))) : E (F ((1 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528))) : E (F (((p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 <= p69) AND (1 <= p35) AND (p527 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p138 + p149 + p160 + p171 + p182 + p193 + p204 + p215 + p226 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130 + p129 + p128) AND (2 <= p527) AND ((p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p138 + p149 + p160 + p171 + p182 + p193 + p204 + p215 + p226 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130 + p129 + p128 <= 2) OR ((2 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528) AND (p404 <= p237 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p269 + p268 + p267 + p266 + p265 + p259 + p260 + p261 + p262 + p263 + p264 <= 0) OR (p0 <= p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57)) AND (2 <= p405))))
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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p35)))
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 700 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityCardinality.task
lola: processed formula with 0 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: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p516 + p505 + p494 + p483 + p472 + p461 + p450 + p439 + p428 + p417 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p451 + p452 + p453 + p454 + p455 + p... (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 700 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p404 <= p269 + p268 + p267 + p266 + p265 + p259 + p260 + p261 + p262 + p263 + p264) OR ((2 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (3 <= p516 + p505 + p494 + p483 + p472 + p461 + p450 + p439 + p428 + p417 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p429 ... (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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-3.sara.
lola: ...considering subproblem: E (F ((p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p11 + p10)))
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 700 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p403 <= 1) AND (p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 <= 0) AND (p392 + p381 + p370 + p359 + p348 + p337 + p326 + p315 + p304 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p316 + p317 + ... (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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 <= 1) OR (p404 <= 0) OR (p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + 1 <= p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93) OR (p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: state equation: calling and running sara65 markings, 64 edges

lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p516 + p505 + p494 + p483 + p472 + p461 + p450 + p439 + p428 + p417 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p451 + p452 + p453 + p454 + p455 + ... (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 700 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-7.sara.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p100 + p101 + p102 + p103 + p104 + p98 + p97 + p96 + p95 + p94 + p99)))
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 700 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72) AND (1 <= p280 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270))))
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 700 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115) OR (p392 + p381 + p370 + p359 + p348 + p337 + p326 + p315 + p304 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p316 + p317 + p318... (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 700 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 10 literals and 4 conjunctive subformulas
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-10.sara.
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-11.sara.

sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 285106 markings, 715040 edges, 57021 markings/sec, 0 secs
lola: sara is running 5 secs || 571218 markings, 1561948 edges, 57222 markings/sec, 5 secs
lola: sara is running 10 secs || 856525 markings, 2359688 edges, 57061 markings/sec, 10 secs
lola: sara is running 15 secs || 1139761 markings, 3195234 edges, 56647 markings/sec, 15 secs
lola: sara is running 20 secs || 1422550 markings, 4056825 edges, 56558 markings/sec, 20 secs
lola: sara is running 25 secs || 1691888 markings, 4910087 edges, 53868 markings/sec, 25 secs
lola: sara is running 30 secs || 1968032 markings, 5815775 edges, 55229 markings/sec, 30 secs
lola: sara is running 35 secs || 2242002 markings, 6782824 edges, 54794 markings/sec, 35 secs
lola: sara is running 40 secs || 2635374 markings, 7873474 edges, 78674 markings/sec, 40 secs
lola: sara is running 45 secs || 3214330 markings, 9253852 edges, 115791 markings/sec, 45 secs
lola: sara is running 50 secs || 3683671 markings, 10686255 edges, 93868 markings/sec, 50 secs
lola: sara is running 55 secs || 4260041 markings, 12056593 edges, 115274 markings/sec, 55 secs
lola: sara is running 60 secs || 4712532 markings, 13466768 edges, 90498 markings/sec, 60 secs
lola: sara is running 65 secs || 5254626 markings, 14788903 edges, 108419 markings/sec, 65 secs
lola: sara is running 70 secs || 5690133 markings, 16157372 edges, 87101 markings/sec, 70 secs
lola: sara is running 75 secs || 6193032 markings, 17494552 edges, 100580 markings/sec, 75 secs
lola: sara is running 80 secs || 6649967 markings, 18839542 edges, 91387 markings/sec, 80 secs
lola: sara is running 85 secs || 7075653 markings, 20204338 edges, 85137 markings/sec, 85 secs
lola: sara is running 90 secs || 7531857 markings, 21534956 edges, 91241 markings/sec, 90 secs
lola: sara is running 95 secs || 7970119 markings, 22872252 edges, 87652 markings/sec, 95 secs
lola: sara is running 100 secs || 8376885 markings, 24191391 edges, 81353 markings/sec, 100 secs
lola: sara is running 105 secs || 8755631 markings, 25485211 edges, 75749 markings/sec, 105 secs
lola: sara is running 110 secs || 9138301 markings, 26794351 edges, 76534 markings/sec, 110 secs
lola: sara is running 115 secs || 9470628 markings, 28096288 edges, 66465 markings/sec, 115 secs
lola: sara is running 120 secs || 9782117 markings, 29380509 edges, 62298 markings/sec, 120 secs
lola: sara is running 125 secs || 10041087 markings, 30623637 edges, 51794 markings/sec, 125 secs
lola: sara is running 130 secs || 10377444 markings, 31876453 edges, 67271 markings/sec, 130 secs
lola: sara is running 135 secs || 10931685 markings, 33215027 edges, 110848 markings/sec, 135 secs
lola: sara is running 140 secs || 11378870 markings, 34608040 edges, 89437 markings/sec, 140 secs
lola: sara is running 145 secs || 11907636 markings, 35941847 edges, 105753 markings/sec, 145 secs
lola: sara is running 150 secs || 12343776 markings, 37252848 edges, 87228 markings/sec, 150 secs
lola: sara is running 155 secs || 12820648 markings, 38559563 edges, 95374 markings/sec, 155 secs
lola: sara is running 160 secs || 13267683 markings, 39880438 edges, 89407 markings/sec, 160 secs
lola: sara is running 165 secs || 13710441 markings, 41281783 edges, 88552 markings/sec, 165 secs
lola: sara is running 170 secs || 14163804 markings, 42641512 edges, 90673 markings/sec, 170 secs
lola: sara is running 175 secs || 14599317 markings, 43953035 edges, 87103 markings/sec, 175 secs
lola: sara is running 180 secs || 15016134 markings, 45312613 edges, 83363 markings/sec, 180 secs
lola: sara is running 185 secs || 15402286 markings, 46641662 edges, 77230 markings/sec, 185 secs
lola: sara is running 190 secs || 15796149 markings, 47996753 edges, 78773 markings/sec, 190 secs
lola: sara is running 195 secs || 16138977 markings, 49334649 edges, 68566 markings/sec, 195 secs
lola: sara is running 200 secs || 16437638 markings, 50619796 edges, 59732 markings/sec, 200 secs
lola: sara is running 205 secs || 16692774 markings, 51897865 edges, 51027 markings/sec, 205 secs
lola: sara is running 210 secs || 17112622 markings, 53194482 edges, 83970 markings/sec, 210 secs
lola: sara is running 215 secs || 17587496 markings, 54506395 edges, 94975 markings/sec, 215 secs
lola: sara is running 220 secs || 18066839 markings, 55850148 edges, 95869 markings/sec, 220 secs
lola: sara is running 225 secs || 18496454 markings, 57238524 edges, 85923 markings/sec, 225 secs
lola: sara is running 230 secs || 19014709 markings, 58599129 edges, 103651 markings/sec, 230 secs
lola: sara is running 235 secs || 19465866 markings, 59951365 edges, 90231 markings/sec, 235 secs
lola: sara is running 240 secs || 19879206 markings, 61297577 edges, 82668 markings/sec, 240 secs
lola: sara is running 245 secs || 20297766 markings, 62661179 edges, 83712 markings/sec, 245 secs
lola: sara is running 250 secs || 20712723 markings, 63999878 edges, 82991 markings/sec, 250 secs
lola: sara is running 255 secs || 21111229 markings, 65318549 edges, 79701 markings/sec, 255 secs
lola: sara is running 260 secs || 21459499 markings, 66657217 edges, 69654 markings/sec, 260 secs
lola: sara is running 265 secs || 21795511 markings, 67988691 edges, 67202 markings/sec, 265 secs
lola: sara is running 270 secs || 22097103 markings, 69286072 edges, 60318 markings/sec, 270 secs
lola: sara is running 275 secs || 22326616 markings, 70562124 edges, 45903 markings/sec, 275 secs
lola: sara is running 280 secs || 22855617 markings, 71872679 edges, 105800 markings/sec, 280 secs
lola: sara is running 285 secs || 23293728 markings, 73241994 edges, 87622 markings/sec, 285 secs
lola: sara is running 290 secs || 23757481 markings, 74620901 edges, 92751 markings/sec, 290 secs
lola: sara is running 295 secs || 24230724 markings, 75990042 edges, 94649 markings/sec, 295 secs
lola: sara is running 300 secs || 24663344 markings, 77340841 edges, 86524 markings/sec, 300 secs
lola: sara is running 305 secs || 25044760 markings, 78615799 edges, 76283 markings/sec, 305 secs
lola: sara is running 310 secs || 25412081 markings, 79833605 edges, 73464 markings/sec, 310 secs
lola: sara is running 315 secs || 25771019 markings, 81043056 edges, 71788 markings/sec, 315 secs
lola: sara is running 320 secs || 26094910 markings, 82282274 edges, 64778 markings/sec, 320 secs
lola: sara is running 325 secs || 26417292 markings, 83534634 edges, 64476 markings/sec, 325 secs
lola: sara is running 330 secs || 26703366 markings, 84781120 edges, 57215 markings/sec, 330 secs
lola: sara is running 335 secs || 26933751 markings, 86001859 edges, 46077 markings/sec, 335 secs
lola: sara is running 340 secs || 27395861 markings, 87302347 edges, 92422 markings/sec, 340 secs
lola: sara is running 345 secs || 27806047 markings, 88612098 edges, 82037 markings/sec, 345 secs
lola: sara is running 350 secs || 28217922 markings, 89929205 edges, 82375 markings/sec, 350 secs
lola: sara is running 355 secs || 28654482 markings, 91229616 edges, 87312 markings/sec, 355 secs
lola: sara is running 360 secs || 29049203 markings, 92491129 edges, 78944 markings/sec, 360 secs
lola: sara is running 365 secs || 29414859 markings, 93743091 edges, 73131 markings/sec, 365 secs
lola: sara is running 370 secs || 29786088 markings, 95002988 edges, 74246 markings/sec, 370 secs
lola: sara is running 375 secs || 30101599 markings, 96248390 edges, 63102 markings/sec, 375 secs
lola: sara is running 380 secs || 30396930 markings, 97470528 edges, 59066 markings/sec, 380 secs
lola: sara is running 385 secs || 30649591 markings, 98679361 edges, 50532 markings/sec, 385 secs
lola: sara is running 390 secs || 30933223 markings, 99909484 edges, 56726 markings/sec, 390 secs
lola: sara is running 395 secs || 31364913 markings, 101213662 edges, 86338 markings/sec, 395 secs
lola: sara is running 400 secs || 31795314 markings, 102515004 edges, 86080 markings/sec, 400 secs
lola: sara is running 405 secs || 32190262 markings, 103791338 edges, 78990 markings/sec, 405 secs
lola: sara is running 410 secs || 32559840 markings, 105048228 edges, 73916 markings/sec, 410 secs
lola: sara is running 415 secs || 32920165 markings, 106287528 edges, 72065 markings/sec, 415 secs
lola: sara is running 420 secs || 33235519 markings, 107515924 edges, 63071 markings/sec, 420 secs
lola: sara is running 425 secs || 33531071 markings, 108724547 edges, 59110 markings/sec, 425 secs
lola: sara is running 430 secs || 33791023 markings, 109911601 edges, 51990 markings/sec, 430 secs
lola: sara is running 435 secs || 34032677 markings, 111135539 edges, 48331 markings/sec, 435 secs
lola: sara is running 440 secs || 34447661 markings, 112404042 edges, 82997 markings/sec, 440 secs
lola: sara is running 445 secs || 34850984 markings, 113699782 edges, 80665 markings/sec, 445 secs
lola: sara is running 450 secs || 35217136 markings, 114959317 edges, 73230 markings/sec, 450 secs
lola: sara is running 455 secs || 35583382 markings, 116179437 edges, 73249 markings/sec, 455 secs
lola: sara is running 460 secs || 35890495 markings, 117391511 edges, 61423 markings/sec, 460 secs
lola: sara is running 465 secs || 36178216 markings, 118594115 edges, 57544 markings/sec, 465 secs
lola: sara is running 470 secs || 36423428 markings, 119776938 edges, 49042 markings/sec, 470 secs
lola: sara is running 475 secs || 36726646 markings, 121053203 edges, 60644 markings/sec, 475 secs
lola: sara is running 480 secs || 37123353 markings, 122391880 edges, 79341 markings/sec, 480 secs
lola: sara is running 485 secs || 37499233 markings, 123682947 edges, 75176 markings/sec, 485 secs
lola: sara is running 490 secs || 37818631 markings, 124914093 edges, 63880 markings/sec, 490 secs
lola: sara is running 495 secs || 38136324 markings, 126140132 edges, 63539 markings/sec, 495 secs
lola: sara is running 500 secs || 38420038 markings, 127367037 edges, 56743 markings/sec, 500 secs
lola: sara is running 505 secs || 38642393 markings, 128544735 edges, 44471 markings/sec, 505 secs
lola: sara is running 510 secs || 39010249 markings, 129866851 edges, 73571 markings/sec, 510 secs
lola: sara is running 515 secs || 39379427 markings, 131111473 edges, 73836 markings/sec, 515 secs
lola: sara is running 520 secs || 39693863 markings, 132320420 edges, 62887 markings/sec, 520 secs
lola: sara is running 525 secs || 39973880 markings, 133517617 edges, 56003 markings/sec, 525 secs
lola: sara is running 530 secs || 40216651 markings, 134674328 edges, 48554 markings/sec, 530 secs
lola: sara is running 535 secs || 40486287 markings, 135865981 edges, 53927 markings/sec, 535 secs
lola: sara is running 540 secs || 40800473 markings, 137032551 edges, 62837 markings/sec, 540 secs
lola: sara is running 545 secs || 41107560 markings, 138220423 edges, 61417 markings/sec, 545 secs
lola: sara is running 550 secs || 41373193 markings, 139395064 edges, 53127 markings/sec, 550 secs
lola: sara is running 555 secs || 41608698 markings, 140566001 edges, 47101 markings/sec, 555 secs
lola: sara is running 560 secs || 41922185 markings, 141829595 edges, 62697 markings/sec, 560 secs
lola: sara is running 565 secs || 42243928 markings, 143061769 edges, 64349 markings/sec, 565 secs
lola: sara is running 570 secs || 42550550 markings, 144368627 edges, 61324 markings/sec, 570 secs
lola: sara is running 575 secs || 42817960 markings, 145619729 edges, 53482 markings/sec, 575 secs
lola: sara is running 580 secs || 43063894 markings, 146818179 edges, 49187 markings/sec, 580 secs
lola: sara is running 585 secs || 43280442 markings, 147962920 edges, 43310 markings/sec, 585 secs
lola: sara is running 590 secs || 43555664 markings, 149277031 edges, 55044 markings/sec, 590 secs
lola: sara is running 595 secs || 43820094 markings, 150504250 edges, 52886 markings/sec, 595 secs
lola: sara is running 600 secs || 44082898 markings, 151722595 edges, 52561 markings/sec, 600 secs
lola: sara is running 605 secs || 44309639 markings, 152905676 edges, 45348 markings/sec, 605 secs
lola: sara is running 610 secs || 44552920 markings, 154202950 edges, 48656 markings/sec, 610 secs
lola: sara is running 615 secs || 44801479 markings, 155418675 edges, 49712 markings/sec, 615 secs
lola: sara is running 620 secs || 45002502 markings, 156591010 edges, 40205 markings/sec, 620 secs
lola: sara is running 625 secs || 45222339 markings, 157812372 edges, 43967 markings/sec, 625 secs
lola: sara is running 630 secs || 45420095 markings, 158976301 edges, 39551 markings/sec, 630 secs
lola: sara is running 635 secs || 45605215 markings, 160110902 edges, 37024 markings/sec, 635 secs
lola: sara is running 640 secs || 45786043 markings, 161317491 edges, 36166 markings/sec, 640 secs
lola: sara is running 645 secs || 46240067 markings, 162574408 edges, 90805 markings/sec, 645 secs
lola: sara is running 650 secs || 46656002 markings, 163930929 edges, 83187 markings/sec, 650 secs
lola: sara is running 655 secs || 47068836 markings, 165340469 edges, 82567 markings/sec, 655 secs
lola: sara is running 660 secs || 47515158 markings, 166776833 edges, 89264 markings/sec, 660 secs
lola: sara is running 665 secs || 47929416 markings, 168190852 edges, 82852 markings/sec, 665 secs
lola: sara is running 670 secs || 48323454 markings, 169613155 edges, 78808 markings/sec, 670 secs
lola: sara is running 675 secs || 48772472 markings, 171028526 edges, 89804 markings/sec, 675 secs
lola: sara is running 680 secs || 49128063 markings, 172423691 edges, 71118 markings/sec, 680 secs
lola: sara is running 685 secs || 49520199 markings, 173832069 edges, 78427 markings/sec, 685 secs
lola: sara is running 690 secs || 49921398 markings, 175239700 edges, 80240 markings/sec, 690 secs
lola: sara is running 695 secs || 50286756 markings, 176620042 edges, 73072 markings/sec, 695 secs
lola: sara is running 700 secs || 50634062 markings, 177985222 edges, 69461 markings/sec, 700 secs
lola: local time limit reached - aborting
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: '\ufffd'
Aborted (core dumped)
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- 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="QuasiCertifProtocol-COL-10"
export BK_EXAMINATION="ReachabilityCardinality"
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/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 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 QuasiCertifProtocol-COL-10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r139-qhx2-152673581100026"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;