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 244K
-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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 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-full
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 r138-qhx2-152673580400026
=====================================================================

--------------------
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 1527139372681


BK_STOP 1527140094212

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-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 ((((p471 + p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461 <= 0) OR (p95 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71)) AND (2 <= p0)))) : E (F ((3 <= p12))) : E (F (())) : A (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p118 + p129 + p140 + p151 + p162 + p173 + p184 + p195 + p206 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130 + p128 + p127 + p126 + p125 + p124 + p123 + p122 + p121 + p120 + p119 + p117 + p116 + p115 + p114 + p113 + p112 + p96 + p97 + p98 + p99 <= p0))) : A (G (((p94 <= p471 + p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461) OR ((2 <= p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527) AND (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p118 + p129 + p140 + p151 + p162 + p173 + p184 + p195 + p206 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130 + p128 + p127 + p126 + p125 + p124 + p123 + p122 + p121 + p120 + p119 + p117 + p116 + p115 + p114 + p113 + p112 + p96 + p97 + p98 + p99) AND (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 <= 0))))) : E (F ((p482 + p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + 1 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60))) : E (F (((p217 <= 1) AND (p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 <= 0) AND (p450 + p439 + p428 + p417 + p406 + p395 + p384 + p373 + p362 + p351 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + 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 + 1 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60) AND (p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + 1 <= p13)))) : A (G (((p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 <= 1) OR (p94 <= 0) OR (p504 + p503 + p502 + p501 + p500 + p499 + p498 + p497 + p496 + p495 + p494 + 1 <= p516 + p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506) OR (p504 + p503 + p502 + p501 + p500 + p499 + p498 + p497 + p496 + p495 + p494 <= 2)))) : A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p118 + p129 + p140 + p151 + p162 + p173 + p184 + p195 + p206 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130 + p128 + p127 + p126 + p125 + p124 + p123 + p122 + p121 + p120 + p119 + p117 + p116 + p115 + p114 + p113 + p112 + p96 + p97 + p98 + p99 <= p95) OR (2 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528)))) : A (G ((2 <= p493 + p492 + p491 + p490 + p489 + p488 + p487 + p486 + p485 + p484 + p483))) : E (F (((p482 + p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72) AND (1 <= p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p93)))) : E (F ((((2 <= p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24) OR (p450 + p439 + p428 + p417 + p406 + p395 + p384 + p373 + p362 + p351 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + 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 + 1 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528)) AND (((p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p0) AND (p450 + p439 + p428 + p417 + p406 + p395 + p384 + p373 + p362 + p351 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + 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 <= p94)) OR (1 <= p450 + p439 + p428 + p417 + p406 + p395 + p384 + p373 + p362 + p351 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + 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))))) : A (G (((p482 + p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 <= p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p328 + p317 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + 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 + p264 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p263 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p262 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229) OR (2 <= p12)))) : E (F (((3 <= p47) OR (((p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p450 + p439 + p428 + p417 + p406 + p395 + p384 + p373 + p362 + p351 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + 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) OR (2 <= p450 + p439 + p428 + p417 + p406 + p395 + p384 + p373 + p362 + p351 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + 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)) AND ((2 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528) OR (1 <= p217)))))) : E (F ((1 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25))) : E (F (((p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p13) AND (1 <= p12) AND (p48 <= p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p328 + p317 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + 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 + p264 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p263 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p262 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229) AND (2 <= p48) AND ((p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p328 + p317 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + 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 + p264 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p263 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p262 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 <= 2) OR ((2 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25) AND (p94 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528))))))
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 ((((p471 + p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461 <= 0) OR (p95 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71)) AND (2 <= p0))))
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 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality.sara
lola: 2 markings, 1 edges
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 ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p118 + p129 + p140 + p151 + p162 + p173 + p184 + p195 + p206 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p183 + p182 + p181 + p180 + p179 + 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 (((p94 <= p471 + p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461) OR ((2 <= p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527) AND (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p118 + p129 + p140 + p151 + p162 + p173 + p184 + p195 + p206 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p2... (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
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-3.sara.
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p482 + p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + 1 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-4.sara.
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: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: E (F (((p217 <= 1) AND (p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 <= 0) AND (p450 + p439 + p428 + p417 + p406 + p395 + p384 + p373 + p362 + p351 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p374 + p375 + ... (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
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-6.sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
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 (((p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 <= 1) OR (p94 <= 0) OR (p504 + p503 + p502 + p501 + p500 + p499 + p498 + p497 + p496 + p495 + p494 + 1 <= p516 + p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506) OR (p504 + p503 + p502 + p501 + p500 + p499 + p498 + p497 + p496 + p495 + p494 <= 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: 65 markings, 64 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p118 + p129 + p140 + p151 + p162 + p173 + p184 + p195 + p206 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p183 + p182 + p181 + p180 + p179 + ... (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
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p493 + p492 + p491 + p490 + p489 + p488 + p487 + p486 + p485 + p484 + p483)))
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
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-8.sara.
lola: state equation: write sara problem file to 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: state equation: calling and running sara
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p482 + p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72) AND (1 <= p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p93))))
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
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-9.sara.
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24) OR (p450 + p439 + p428 + p417 + p406 + p395 + p384 + p373 + p362 + p351 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p374 + p375 + p376 + p377 + p... (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
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 || 494673 markings, 1050346 edges, 98935 markings/sec, 0 secs
lola: sara is running 5 secs || 976666 markings, 2289083 edges, 96399 markings/sec, 5 secs
lola: sara is running 10 secs || 1409496 markings, 3558671 edges, 86566 markings/sec, 10 secs
lola: sara is running 15 secs || 1914788 markings, 4791297 edges, 101058 markings/sec, 15 secs
lola: sara is running 20 secs || 2309146 markings, 6049336 edges, 78872 markings/sec, 20 secs
lola: sara is running 25 secs || 2803502 markings, 7247332 edges, 98871 markings/sec, 25 secs
lola: sara is running 30 secs || 3198335 markings, 8527237 edges, 78967 markings/sec, 30 secs
lola: sara is running 35 secs || 3686719 markings, 9736451 edges, 97677 markings/sec, 35 secs
lola: sara is running 40 secs || 4084564 markings, 11007633 edges, 79569 markings/sec, 40 secs
lola: sara is running 45 secs || 4516579 markings, 12220601 edges, 86403 markings/sec, 45 secs
lola: sara is running 50 secs || 4955732 markings, 13526944 edges, 87831 markings/sec, 50 secs
lola: sara is running 55 secs || 5329390 markings, 14744290 edges, 74732 markings/sec, 55 secs
lola: sara is running 60 secs || 5680362 markings, 15889773 edges, 70194 markings/sec, 60 secs
lola: sara is running 65 secs || 6049282 markings, 17042466 edges, 73784 markings/sec, 65 secs
lola: sara is running 70 secs || 6391852 markings, 18198461 edges, 68514 markings/sec, 70 secs
lola: sara is running 75 secs || 6727506 markings, 19344697 edges, 67131 markings/sec, 75 secs
lola: sara is running 80 secs || 7023488 markings, 20494230 edges, 59196 markings/sec, 80 secs
lola: sara is running 85 secs || 7287313 markings, 21604254 edges, 52765 markings/sec, 85 secs
lola: sara is running 90 secs || 7550677 markings, 22732165 edges, 52673 markings/sec, 90 secs
lola: sara is running 95 secs || 7791795 markings, 24062174 edges, 48224 markings/sec, 95 secs
lola: sara is running 100 secs || 8292150 markings, 25200039 edges, 100071 markings/sec, 100 secs
lola: sara is running 105 secs || 8700219 markings, 26313674 edges, 81614 markings/sec, 105 secs
lola: sara is running 110 secs || 9109469 markings, 27494681 edges, 81850 markings/sec, 110 secs
lola: sara is running 115 secs || 9557472 markings, 28648395 edges, 89601 markings/sec, 115 secs
lola: sara is running 120 secs || 9948825 markings, 29848261 edges, 78271 markings/sec, 120 secs
lola: sara is running 125 secs || 10382569 markings, 31029406 edges, 86749 markings/sec, 125 secs
lola: sara is running 130 secs || 10798802 markings, 32267083 edges, 83247 markings/sec, 130 secs
lola: sara is running 135 secs || 11186406 markings, 33464762 edges, 77521 markings/sec, 135 secs
lola: sara is running 140 secs || 11609968 markings, 34655656 edges, 84712 markings/sec, 140 secs
lola: sara is running 145 secs || 11998554 markings, 35902201 edges, 77717 markings/sec, 145 secs
lola: sara is running 150 secs || 12365129 markings, 37146853 edges, 73315 markings/sec, 150 secs
lola: sara is running 155 secs || 12736939 markings, 38371920 edges, 74362 markings/sec, 155 secs
lola: sara is running 160 secs || 13095884 markings, 39564696 edges, 71789 markings/sec, 160 secs
lola: sara is running 165 secs || 13407630 markings, 40616961 edges, 62349 markings/sec, 165 secs
lola: sara is running 170 secs || 13690943 markings, 41719358 edges, 56663 markings/sec, 170 secs
lola: sara is running 175 secs || 13952965 markings, 42839740 edges, 52404 markings/sec, 175 secs
lola: sara is running 180 secs || 14210745 markings, 44024934 edges, 51556 markings/sec, 180 secs
lola: sara is running 185 secs || 14520157 markings, 45345692 edges, 61882 markings/sec, 185 secs
lola: sara is running 190 secs || 15005582 markings, 46510201 edges, 97085 markings/sec, 190 secs
lola: sara is running 195 secs || 15380182 markings, 47724517 edges, 74920 markings/sec, 195 secs
lola: sara is running 200 secs || 15848078 markings, 48920799 edges, 93579 markings/sec, 200 secs
lola: sara is running 205 secs || 16231383 markings, 50132402 edges, 76661 markings/sec, 205 secs
lola: sara is running 210 secs || 16641935 markings, 51259412 edges, 82110 markings/sec, 210 secs
lola: sara is running 215 secs || 17020656 markings, 52426795 edges, 75744 markings/sec, 215 secs
lola: sara is running 220 secs || 17364316 markings, 53598605 edges, 68732 markings/sec, 220 secs
lola: sara is running 225 secs || 17761609 markings, 54734111 edges, 79459 markings/sec, 225 secs
lola: sara is running 230 secs || 18122280 markings, 55890993 edges, 72134 markings/sec, 230 secs
lola: sara is running 235 secs || 18473769 markings, 57083472 edges, 70298 markings/sec, 235 secs
lola: sara is running 240 secs || 18810352 markings, 58229989 edges, 67317 markings/sec, 240 secs
lola: sara is running 245 secs || 19090507 markings, 59395729 edges, 56031 markings/sec, 245 secs
lola: sara is running 250 secs || 19370475 markings, 60411756 edges, 55994 markings/sec, 250 secs
lola: sara is running 255 secs || 19619849 markings, 61515387 edges, 49875 markings/sec, 255 secs
lola: sara is running 260 secs || 19865930 markings, 62731627 edges, 49216 markings/sec, 260 secs
lola: sara is running 265 secs || 20280669 markings, 64002729 edges, 82948 markings/sec, 265 secs
lola: sara is running 270 secs || 20680787 markings, 65201343 edges, 80024 markings/sec, 270 secs
lola: sara is running 275 secs || 21109078 markings, 66378087 edges, 85658 markings/sec, 275 secs
lola: sara is running 280 secs || 21457762 markings, 67546775 edges, 69737 markings/sec, 280 secs
lola: sara is running 285 secs || 21854836 markings, 68641264 edges, 79415 markings/sec, 285 secs
lola: sara is running 290 secs || 22218546 markings, 69784111 edges, 72742 markings/sec, 290 secs
lola: sara is running 295 secs || 22580079 markings, 71000424 edges, 72307 markings/sec, 295 secs
lola: sara is running 300 secs || 22946282 markings, 72220267 edges, 73241 markings/sec, 300 secs
lola: sara is running 305 secs || 23282918 markings, 73359990 edges, 67327 markings/sec, 305 secs
lola: sara is running 310 secs || 23585227 markings, 74359460 edges, 60462 markings/sec, 310 secs
lola: sara is running 315 secs || 23854794 markings, 75445817 edges, 53913 markings/sec, 315 secs
lola: sara is running 320 secs || 24112704 markings, 76497732 edges, 51582 markings/sec, 320 secs
lola: sara is running 325 secs || 24358296 markings, 77603683 edges, 49118 markings/sec, 325 secs
lola: sara is running 330 secs || 24611525 markings, 78915963 edges, 50646 markings/sec, 330 secs
lola: sara is running 335 secs || 25038916 markings, 80022557 edges, 85478 markings/sec, 335 secs
lola: sara is running 340 secs || 25422827 markings, 81249851 edges, 76782 markings/sec, 340 secs
lola: sara is running 345 secs || 25805014 markings, 82422672 edges, 76437 markings/sec, 345 secs
lola: sara is running 350 secs || 26205457 markings, 83610810 edges, 80089 markings/sec, 350 secs
lola: sara is running 355 secs || 26572891 markings, 84812447 edges, 73487 markings/sec, 355 secs
lola: sara is running 360 secs || 26939423 markings, 86054958 edges, 73306 markings/sec, 360 secs
lola: sara is running 365 secs || 27271615 markings, 87193590 edges, 66438 markings/sec, 365 secs
lola: sara is running 370 secs || 27550650 markings, 88267713 edges, 55807 markings/sec, 370 secs
lola: sara is running 375 secs || 27824173 markings, 89300785 edges, 54705 markings/sec, 375 secs
lola: sara is running 380 secs || 28082811 markings, 90418025 edges, 51728 markings/sec, 380 secs
lola: sara is running 385 secs || 28326520 markings, 91624778 edges, 48742 markings/sec, 385 secs
lola: sara is running 390 secs || 28701035 markings, 92918701 edges, 74903 markings/sec, 390 secs
lola: sara is running 395 secs || 29070992 markings, 94146911 edges, 73991 markings/sec, 395 secs
lola: sara is running 400 secs || 29458636 markings, 95330732 edges, 77529 markings/sec, 400 secs
lola: sara is running 405 secs || 29834180 markings, 96525178 edges, 75109 markings/sec, 405 secs
lola: sara is running 410 secs || 30178328 markings, 97684651 edges, 68830 markings/sec, 410 secs
lola: sara is running 415 secs || 30504775 markings, 98788730 edges, 65289 markings/sec, 415 secs
lola: sara is running 420 secs || 30781835 markings, 99921869 edges, 55412 markings/sec, 420 secs
lola: sara is running 425 secs || 31048883 markings, 100956599 edges, 53410 markings/sec, 425 secs
lola: sara is running 430 secs || 31298208 markings, 102071312 edges, 49865 markings/sec, 430 secs
lola: sara is running 435 secs || 31537098 markings, 103249947 edges, 47778 markings/sec, 435 secs
lola: sara is running 440 secs || 31911536 markings, 104481677 edges, 74888 markings/sec, 440 secs
lola: sara is running 445 secs || 32285085 markings, 105715223 edges, 74710 markings/sec, 445 secs
lola: sara is running 450 secs || 32630927 markings, 106885423 edges, 69168 markings/sec, 450 secs
lola: sara is running 455 secs || 32969413 markings, 108015070 edges, 67697 markings/sec, 455 secs
lola: sara is running 460 secs || 33258172 markings, 109066188 edges, 57752 markings/sec, 460 secs
lola: sara is running 465 secs || 33528321 markings, 110114386 edges, 54030 markings/sec, 465 secs
lola: sara is running 470 secs || 33783613 markings, 111189190 edges, 51058 markings/sec, 470 secs
lola: sara is running 475 secs || 34029598 markings, 112366225 edges, 49197 markings/sec, 475 secs
lola: sara is running 480 secs || 34337668 markings, 113670236 edges, 61614 markings/sec, 480 secs
lola: sara is running 485 secs || 34675173 markings, 114815913 edges, 67501 markings/sec, 485 secs
lola: sara is running 490 secs || 35018781 markings, 115973553 edges, 68722 markings/sec, 490 secs
lola: sara is running 495 secs || 35308489 markings, 116979006 edges, 57942 markings/sec, 495 secs
lola: sara is running 500 secs || 35584974 markings, 118057875 edges, 55297 markings/sec, 500 secs
lola: sara is running 505 secs || 35842338 markings, 119137953 edges, 51473 markings/sec, 505 secs
lola: sara is running 510 secs || 36096411 markings, 120300933 edges, 50815 markings/sec, 510 secs
lola: sara is running 515 secs || 36371924 markings, 121603242 edges, 55103 markings/sec, 515 secs
lola: sara is running 520 secs || 36713015 markings, 122758862 edges, 68218 markings/sec, 520 secs
lola: sara is running 525 secs || 37019100 markings, 123812732 edges, 61217 markings/sec, 525 secs
lola: sara is running 530 secs || 37295722 markings, 124898858 edges, 55324 markings/sec, 530 secs
lola: sara is running 535 secs || 37554618 markings, 125999142 edges, 51779 markings/sec, 535 secs
lola: sara is running 540 secs || 37798967 markings, 127171779 edges, 48870 markings/sec, 540 secs
lola: sara is running 545 secs || 38083041 markings, 128430240 edges, 56815 markings/sec, 545 secs
lola: sara is running 550 secs || 38385077 markings, 129528459 edges, 60407 markings/sec, 550 secs
lola: sara is running 555 secs || 38655349 markings, 130593067 edges, 54054 markings/sec, 555 secs
lola: sara is running 560 secs || 38904097 markings, 131623707 edges, 49750 markings/sec, 560 secs
lola: sara is running 565 secs || 39137278 markings, 132761162 edges, 46636 markings/sec, 565 secs
lola: sara is running 570 secs || 39392851 markings, 133933694 edges, 51115 markings/sec, 570 secs
lola: sara is running 575 secs || 39674380 markings, 134917532 edges, 56306 markings/sec, 575 secs
lola: sara is running 580 secs || 39907727 markings, 135946657 edges, 46669 markings/sec, 580 secs
lola: sara is running 585 secs || 40158219 markings, 136970705 edges, 50098 markings/sec, 585 secs
lola: sara is running 590 secs || 40376004 markings, 138014328 edges, 43557 markings/sec, 590 secs
lola: sara is running 595 secs || 40608779 markings, 139057631 edges, 46555 markings/sec, 595 secs
lola: sara is running 600 secs || 40821058 markings, 140198909 edges, 42456 markings/sec, 600 secs
lola: sara is running 605 secs || 41044316 markings, 141422620 edges, 44652 markings/sec, 605 secs
lola: sara is running 610 secs || 41284796 markings, 142380398 edges, 48096 markings/sec, 610 secs
lola: sara is running 615 secs || 41502620 markings, 143379299 edges, 43565 markings/sec, 615 secs
lola: sara is running 620 secs || 41704087 markings, 144406754 edges, 40293 markings/sec, 620 secs
lola: sara is running 625 secs || 41913139 markings, 145486493 edges, 41810 markings/sec, 625 secs
lola: sara is running 630 secs || 42129356 markings, 146636313 edges, 43243 markings/sec, 630 secs
lola: sara is running 635 secs || 42330242 markings, 147664775 edges, 40177 markings/sec, 635 secs
lola: sara is running 640 secs || 42539823 markings, 148751098 edges, 41916 markings/sec, 640 secs
lola: sara is running 645 secs || 42752716 markings, 149949180 edges, 42579 markings/sec, 645 secs
lola: sara is running 650 secs || 42948080 markings, 151078818 edges, 39073 markings/sec, 650 secs
lola: sara is running 655 secs || 43150046 markings, 152302521 edges, 40393 markings/sec, 655 secs
lola: sara is running 660 secs || 43351898 markings, 153621931 edges, 40370 markings/sec, 660 secs
lola: sara is running 665 secs || 43730965 markings, 154868716 edges, 75813 markings/sec, 665 secs
lola: sara is running 670 secs || 44143311 markings, 156059384 edges, 82469 markings/sec, 670 secs
lola: sara is running 675 secs || 44455960 markings, 157296637 edges, 62530 markings/sec, 675 secs
lola: sara is running 680 secs || 44876676 markings, 158538747 edges, 84143 markings/sec, 680 secs
lola: sara is running 685 secs || 45188164 markings, 159685652 edges, 62298 markings/sec, 685 secs
lola: sara is running 690 secs || 45572915 markings, 160916470 edges, 76950 markings/sec, 690 secs
lola: sara is running 695 secs || 45889663 markings, 162007384 edges, 63350 markings/sec, 695 secs
lola: sara is running 700 secs || 46231807 markings, 163197173 edges, 68429 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: ''
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 stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-full"
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-full"
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 r138-qhx2-152673580400026"
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 ;