fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r143-qhx2-152673584400026
Last Updated
June 26, 2018

About the Execution of M4M.struct for QuasiCertifProtocol-COL-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12173.840 721424.00 1498334.00 2539.40 ???????????????? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
............................................
/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 mcc4mcc-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 r143-qhx2-152673584400026
=====================================================================


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


BK_STOP 1527980172134

--------------------
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 stderr -----
----- Start make result stdout -----
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 ((((p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p538 <= 0) OR (p235 <= p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234)) AND (2 <= p271)))) : E (F ((3 <= p91))) : E (F (())) : A (G ((p503 + p492 + p481 + p470 + p459 + p448 + p437 + p426 + p415 + p404 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 <= p271))) : A (G (((p525 <= p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p538) OR ((2 <= p247 + p257 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248) AND (3 <= p503 + p492 + p481 + p470 + p459 + p448 + p437 + p426 + p415 + p404 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513) AND (p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 <= 0))))) : E (F ((p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + 1 <= p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223))) : E (F (((p22 <= 1) AND (p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 <= 0) AND (p382 + p371 + p360 + p349 + p338 + p327 + p316 + p305 + p294 + p283 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + 1 <= p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223) AND (p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + 1 <= p270)))) : A (G (((p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 <= 1) OR (p525 <= 0) OR (p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p79 + 1 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524) OR (p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p79 <= 2)))) : A (G (((p503 + p492 + p481 + p470 + p459 + p448 + p437 + p426 + p415 + p404 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 <= p235) OR (2 <= p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56)))) : A (G ((2 <= p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35))) : E (F (((p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 <= p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57) AND (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))) : E (F ((((2 <= p268 + p267 + p266 + p265 + p258 + p259 + p260 + p261 + p262 + p263 + p264) OR (p382 + p371 + p360 + p349 + p338 + p327 + p316 + p305 + p294 + p283 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + 1 <= p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56)) AND (((p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 <= p271) AND (p382 + p371 + p360 + p349 + p338 + p327 + p316 + p305 + p294 + p283 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 <= p525)) OR (1 <= p382 + p371 + p360 + p349 + p338 + p327 + p316 + p305 + p294 + p283 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392))))) : A (G (((p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p114 + p125 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 + p135 + p134 + p133 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p124 + p123 + p122 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p113 + p112 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (2 <= p91)))) : E (F (((3 <= p526) OR (((p268 + p267 + p266 + p265 + p258 + p259 + p260 + p261 + p262 + p263 + p264 <= p382 + p371 + p360 + p349 + p338 + p327 + p316 + p305 + p294 + p283 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392) OR (2 <= p382 + p371 + p360 + p349 + p338 + p327 + p316 + p305 + p294 + p283 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392)) AND ((2 <= p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56) OR (1 <= p22)))))) : E (F ((1 <= p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11))) : E (F (((p268 + p267 + p266 + p265 + p258 + p259 + p260 + p261 + p262 + p263 + p264 <= p270) AND (1 <= p91) AND (p269 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p114 + p125 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 + p135 + p134 + p133 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p124 + p123 + p122 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p113 + p112 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (2 <= p269) AND ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p114 + p125 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 + p135 + p134 + p133 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p124 + p123 + p122 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p113 + p112 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 2) OR ((2 <= p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11) AND (p525 <= p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56))))))
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 ((((p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p538 <= 0) OR (p235 <= p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234)) AND (2 <= p271))))
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 <= p91)))
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 ((p503 + p492 + p481 + p470 + p459 + p448 + p437 + p426 + p415 + p404 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p438 + p439 + p440 + p441 + p442 + 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-3.sara
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p525 <= p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p538) OR ((2 <= p247 + p257 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248) AND (3 <= p503 + p492 + p481 + p470 + p459 + p448 + p437 + p426 + p415 + p404 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + 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: ========================================
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
sara: try reading problem file 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: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + 1 <= p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223)))
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: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-5.sara
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p22 <= 1) AND (p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 <= 0) AND (p382 + p371 + p360 + p349 + p338 + p327 + p316 + p305 + p294 + p283 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p306... (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

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 (((p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 <= 1) OR (p525 <= 0) OR (p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p79 + 1 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524) OR (p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p79 <= 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: 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 (((p503 + p492 + p481 + p470 + p459 + p448 + p437 + p426 + p415 + p404 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p438 + p439 + p440 + p441 + p442 + ... (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: SUBRESULT
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-8.sara
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
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-8.sara.
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35)))
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: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 <= p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57) AND (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file 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: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p268 + p267 + p266 + p265 + p258 + p259 + p260 + p261 + p262 + p263 + p264) OR (p382 + p371 + p360 + p349 + p338 + p327 + p316 + p305 + p294 + p283 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p306 + p307 + p308... (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: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara

sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 324362 markings, 556436 edges, 64872 markings/sec, 0 secs
lola: sara is running 5 secs || 637413 markings, 1193705 edges, 62610 markings/sec, 5 secs
lola: sara is running 10 secs || 896907 markings, 2002767 edges, 51899 markings/sec, 10 secs
lola: sara is running 15 secs || 1206227 markings, 2604684 edges, 61864 markings/sec, 15 secs
lola: sara is running 20 secs || 1518467 markings, 3342053 edges, 62448 markings/sec, 20 secs
lola: sara is running 25 secs || 1799753 markings, 4088537 edges, 56257 markings/sec, 25 secs
lola: sara is running 30 secs || 2113403 markings, 4860690 edges, 62730 markings/sec, 30 secs
lola: sara is running 35 secs || 2403668 markings, 5661046 edges, 58053 markings/sec, 35 secs
lola: sara is running 40 secs || 2686421 markings, 6493989 edges, 56551 markings/sec, 40 secs
lola: sara is running 45 secs || 2970253 markings, 7326225 edges, 56766 markings/sec, 45 secs
lola: sara is running 50 secs || 3233652 markings, 8188452 edges, 52680 markings/sec, 50 secs
lola: sara is running 55 secs || 3509397 markings, 9108892 edges, 55149 markings/sec, 55 secs
lola: sara is running 60 secs || 3730253 markings, 10117131 edges, 44171 markings/sec, 60 secs
lola: sara is running 65 secs || 4028572 markings, 10763335 edges, 59664 markings/sec, 65 secs
lola: sara is running 70 secs || 4324815 markings, 11418556 edges, 59249 markings/sec, 70 secs
lola: sara is running 75 secs || 4590625 markings, 12164775 edges, 53162 markings/sec, 75 secs
lola: sara is running 80 secs || 4879004 markings, 12834054 edges, 57676 markings/sec, 80 secs
lola: sara is running 85 secs || 5140420 markings, 13584514 edges, 52283 markings/sec, 85 secs
lola: sara is running 90 secs || 5416597 markings, 14303221 edges, 55235 markings/sec, 90 secs
lola: sara is running 95 secs || 5688550 markings, 15072262 edges, 54391 markings/sec, 95 secs
lola: sara is running 100 secs || 5945759 markings, 15875668 edges, 51442 markings/sec, 100 secs
lola: sara is running 105 secs || 6193748 markings, 16711411 edges, 49598 markings/sec, 105 secs
lola: sara is running 110 secs || 6426515 markings, 17592028 edges, 46553 markings/sec, 110 secs
lola: sara is running 115 secs || 6648561 markings, 18506007 edges, 44409 markings/sec, 115 secs
lola: sara is running 120 secs || 6947032 markings, 19153710 edges, 59694 markings/sec, 120 secs
lola: sara is running 125 secs || 7195134 markings, 19923918 edges, 49620 markings/sec, 125 secs
lola: sara is running 130 secs || 7484964 markings, 20609730 edges, 57966 markings/sec, 130 secs
lola: sara is running 135 secs || 7746809 markings, 21369183 edges, 52369 markings/sec, 135 secs
lola: sara is running 140 secs || 7996891 markings, 22150688 edges, 50016 markings/sec, 140 secs
lola: sara is running 145 secs || 8228100 markings, 22899860 edges, 46242 markings/sec, 145 secs
lola: sara is running 150 secs || 8465103 markings, 23723772 edges, 47401 markings/sec, 150 secs
lola: sara is running 155 secs || 8673660 markings, 24645345 edges, 41711 markings/sec, 155 secs
lola: sara is running 160 secs || 8913912 markings, 25322042 edges, 48050 markings/sec, 160 secs
lola: sara is running 165 secs || 9157983 markings, 26085624 edges, 48814 markings/sec, 165 secs
lola: sara is running 170 secs || 9435889 markings, 26800750 edges, 55581 markings/sec, 170 secs
lola: sara is running 175 secs || 9693523 markings, 27606150 edges, 51527 markings/sec, 175 secs
lola: sara is running 180 secs || 9926788 markings, 28463035 edges, 46653 markings/sec, 180 secs
lola: sara is running 185 secs || 10154328 markings, 29335237 edges, 45508 markings/sec, 185 secs
lola: sara is running 190 secs || 10390131 markings, 30171281 edges, 47161 markings/sec, 190 secs
lola: sara is running 195 secs || 10617998 markings, 30911663 edges, 45573 markings/sec, 195 secs
lola: sara is running 200 secs || 10861562 markings, 31684210 edges, 48713 markings/sec, 200 secs
lola: sara is running 205 secs || 11100405 markings, 32483340 edges, 47769 markings/sec, 205 secs
lola: sara is running 210 secs || 11291735 markings, 33302202 edges, 38266 markings/sec, 210 secs
lola: sara is running 215 secs || 11514694 markings, 34081999 edges, 44592 markings/sec, 215 secs
lola: sara is running 220 secs || 11763717 markings, 34938452 edges, 49805 markings/sec, 220 secs
lola: sara is running 225 secs || 11988194 markings, 35814632 edges, 44895 markings/sec, 225 secs
lola: sara is running 230 secs || 12210079 markings, 36741110 edges, 44377 markings/sec, 230 secs
lola: sara is running 235 secs || 12443384 markings, 37631902 edges, 46661 markings/sec, 235 secs
lola: sara is running 240 secs || 12648921 markings, 38594820 edges, 41107 markings/sec, 240 secs
lola: sara is running 245 secs || 12872528 markings, 39459248 edges, 44721 markings/sec, 245 secs
lola: sara is running 250 secs || 13070818 markings, 40389599 edges, 39658 markings/sec, 250 secs
lola: sara is running 255 secs || 13267165 markings, 41351155 edges, 39269 markings/sec, 255 secs
lola: sara is running 260 secs || 13445377 markings, 42361359 edges, 35642 markings/sec, 260 secs
lola: sara is running 265 secs || 13740917 markings, 43011198 edges, 59108 markings/sec, 265 secs
lola: sara is running 270 secs || 14031571 markings, 43682293 edges, 58131 markings/sec, 270 secs
lola: sara is running 275 secs || 14294500 markings, 44414968 edges, 52586 markings/sec, 275 secs
lola: sara is running 280 secs || 14582933 markings, 45071633 edges, 57687 markings/sec, 280 secs
lola: sara is running 285 secs || 14834753 markings, 45818253 edges, 50364 markings/sec, 285 secs
lola: sara is running 290 secs || 15110161 markings, 46500699 edges, 55082 markings/sec, 290 secs
lola: sara is running 295 secs || 15340617 markings, 47185080 edges, 46091 markings/sec, 295 secs
lola: sara is running 300 secs || 15583048 markings, 47951764 edges, 48486 markings/sec, 300 secs
lola: sara is running 305 secs || 15827474 markings, 48727588 edges, 48885 markings/sec, 305 secs
lola: sara is running 310 secs || 16060412 markings, 49531313 edges, 46588 markings/sec, 310 secs
lola: sara is running 315 secs || 16266028 markings, 50433361 edges, 41123 markings/sec, 315 secs
lola: sara is running 320 secs || 16539263 markings, 51142664 edges, 54647 markings/sec, 320 secs
lola: sara is running 325 secs || 16797810 markings, 51796038 edges, 51709 markings/sec, 325 secs
lola: sara is running 330 secs || 17056368 markings, 52503796 edges, 51712 markings/sec, 330 secs
lola: sara is running 335 secs || 17317905 markings, 53285635 edges, 52307 markings/sec, 335 secs
lola: sara is running 340 secs || 17584002 markings, 53994237 edges, 53219 markings/sec, 340 secs
lola: sara is running 345 secs || 17824339 markings, 54738484 edges, 48067 markings/sec, 345 secs
lola: sara is running 350 secs || 18047741 markings, 55500330 edges, 44680 markings/sec, 350 secs
lola: sara is running 355 secs || 18242375 markings, 56257156 edges, 38927 markings/sec, 355 secs
lola: sara is running 360 secs || 18418123 markings, 57068043 edges, 35150 markings/sec, 360 secs
lola: sara is running 365 secs || 18680534 markings, 57699342 edges, 52482 markings/sec, 365 secs
lola: sara is running 370 secs || 18919304 markings, 58449930 edges, 47754 markings/sec, 370 secs
lola: sara is running 375 secs || 19184713 markings, 59191901 edges, 53082 markings/sec, 375 secs
lola: sara is running 380 secs || 19429651 markings, 59957211 edges, 48988 markings/sec, 380 secs
lola: sara is running 385 secs || 19656851 markings, 60775402 edges, 45440 markings/sec, 385 secs
lola: sara is running 390 secs || 19870562 markings, 61606392 edges, 42742 markings/sec, 390 secs
lola: sara is running 395 secs || 20080065 markings, 62408147 edges, 41901 markings/sec, 395 secs
lola: sara is running 400 secs || 20317765 markings, 63150785 edges, 47540 markings/sec, 400 secs
lola: sara is running 405 secs || 20567510 markings, 63930018 edges, 49949 markings/sec, 405 secs
lola: sara is running 410 secs || 20806790 markings, 64725097 edges, 47856 markings/sec, 410 secs
lola: sara is running 415 secs || 21015287 markings, 65606664 edges, 41699 markings/sec, 415 secs
lola: sara is running 420 secs || 21230978 markings, 66362265 edges, 43138 markings/sec, 420 secs
lola: sara is running 425 secs || 21462391 markings, 67144487 edges, 46283 markings/sec, 425 secs
lola: sara is running 430 secs || 21681868 markings, 67986610 edges, 43895 markings/sec, 430 secs
lola: sara is running 435 secs || 21875096 markings, 68876721 edges, 38646 markings/sec, 435 secs
lola: sara is running 440 secs || 22116410 markings, 69709440 edges, 48263 markings/sec, 440 secs
lola: sara is running 445 secs || 22323516 markings, 70623301 edges, 41421 markings/sec, 445 secs
lola: sara is running 450 secs || 22537526 markings, 71497877 edges, 42802 markings/sec, 450 secs
lola: sara is running 455 secs || 22735651 markings, 72427960 edges, 39625 markings/sec, 455 secs
lola: sara is running 460 secs || 22932443 markings, 73369435 edges, 39358 markings/sec, 460 secs
lola: sara is running 465 secs || 23117743 markings, 74357716 edges, 37060 markings/sec, 465 secs
lola: sara is running 470 secs || 23357361 markings, 75128293 edges, 47924 markings/sec, 470 secs
lola: sara is running 475 secs || 23628561 markings, 75758731 edges, 54240 markings/sec, 475 secs
lola: sara is running 480 secs || 23867502 markings, 76471767 edges, 47788 markings/sec, 480 secs
lola: sara is running 485 secs || 24126770 markings, 77140668 edges, 51854 markings/sec, 485 secs
lola: sara is running 490 secs || 24371547 markings, 77855239 edges, 48955 markings/sec, 490 secs
lola: sara is running 495 secs || 24608656 markings, 78582137 edges, 47422 markings/sec, 495 secs
lola: sara is running 500 secs || 24849127 markings, 79364901 edges, 48094 markings/sec, 500 secs
lola: sara is running 505 secs || 25081362 markings, 80193563 edges, 46447 markings/sec, 505 secs
lola: sara is running 510 secs || 25283524 markings, 81104154 edges, 40432 markings/sec, 510 secs
lola: sara is running 515 secs || 25557433 markings, 81800467 edges, 54782 markings/sec, 515 secs
lola: sara is running 520 secs || 25802009 markings, 82560608 edges, 48915 markings/sec, 520 secs
lola: sara is running 525 secs || 26062301 markings, 83296402 edges, 52058 markings/sec, 525 secs
lola: sara is running 530 secs || 26306130 markings, 84059256 edges, 48766 markings/sec, 530 secs
lola: sara is running 535 secs || 26521329 markings, 84834768 edges, 43040 markings/sec, 535 secs
lola: sara is running 540 secs || 26726574 markings, 85616016 edges, 41049 markings/sec, 540 secs
lola: sara is running 545 secs || 26944338 markings, 86473591 edges, 43553 markings/sec, 545 secs
lola: sara is running 550 secs || 27190571 markings, 87229785 edges, 49247 markings/sec, 550 secs
lola: sara is running 555 secs || 27423089 markings, 87919713 edges, 46504 markings/sec, 555 secs
lola: sara is running 560 secs || 27654281 markings, 88724353 edges, 46238 markings/sec, 560 secs
lola: sara is running 565 secs || 27865848 markings, 89589165 edges, 42313 markings/sec, 565 secs
lola: sara is running 570 secs || 28086466 markings, 90414869 edges, 44124 markings/sec, 570 secs
lola: sara is running 575 secs || 28326730 markings, 91211109 edges, 48053 markings/sec, 575 secs
lola: sara is running 580 secs || 28531834 markings, 91994627 edges, 41021 markings/sec, 580 secs
lola: sara is running 585 secs || 28726310 markings, 92923859 edges, 38895 markings/sec, 585 secs
lola: sara is running 590 secs || 28951666 markings, 93671195 edges, 45071 markings/sec, 590 secs
lola: sara is running 595 secs || 29162751 markings, 94538423 edges, 42217 markings/sec, 595 secs
lola: sara is running 600 secs || 29368538 markings, 95445164 edges, 41157 markings/sec, 600 secs
lola: sara is running 605 secs || 29570750 markings, 96372871 edges, 40442 markings/sec, 605 secs
lola: sara is running 610 secs || 29772695 markings, 97296387 edges, 40389 markings/sec, 610 secs
lola: sara is running 615 secs || 29956962 markings, 98251968 edges, 36853 markings/sec, 615 secs
lola: sara is running 620 secs || 30171509 markings, 99124130 edges, 42909 markings/sec, 620 secs
lola: sara is running 625 secs || 30429000 markings, 99784401 edges, 51498 markings/sec, 625 secs
lola: sara is running 630 secs || 30663667 markings, 100454958 edges, 46933 markings/sec, 630 secs
lola: sara is running 635 secs || 30880630 markings, 101155382 edges, 43393 markings/sec, 635 secs
lola: sara is running 640 secs || 31099180 markings, 101875756 edges, 43710 markings/sec, 640 secs
lola: sara is running 645 secs || 31315189 markings, 102580287 edges, 43202 markings/sec, 645 secs
lola: sara is running 650 secs || 31507375 markings, 103363099 edges, 38437 markings/sec, 650 secs
lola: sara is running 655 secs || 31713473 markings, 104146830 edges, 41220 markings/sec, 655 secs
lola: sara is running 660 secs || 31940874 markings, 104835298 edges, 45480 markings/sec, 660 secs
lola: sara is running 665 secs || 32181772 markings, 105573420 edges, 48180 markings/sec, 665 secs
lola: sara is running 670 secs || 32414742 markings, 106376132 edges, 46594 markings/sec, 670 secs
lola: sara is running 675 secs || 32623027 markings, 107236017 edges, 41657 markings/sec, 675 secs
lola: sara is running 680 secs || 32855700 markings, 108082872 edges, 46535 markings/sec, 680 secs
lola: sara is running 685 secs || 33072686 markings, 108809540 edges, 43397 markings/sec, 685 secs
lola: sara is running 690 secs || 33293399 markings, 109656803 edges, 44143 markings/sec, 690 secs
lola: sara is running 695 secs || 33486236 markings, 110574849 edges, 38567 markings/sec, 695 secs
lola: sara is running 700 secs || 33732981 markings, 111386821 edges, 49349 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 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="mcc4mcc-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 mcc4mcc-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 r143-qhx2-152673584400026"
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 ;