Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_QuasiCertifProtocol-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-149479231700203
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496366710809


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_QuasiCertifProtocol-COL-10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_QuasiCertifProtocol-COL-10: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
LTLCardinality @ S_QuasiCertifProtocol-COL-10 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-LTLCardinality.task
lola: A (G (((2 <= p267 + p266 + p265 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264) U (2 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p246 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + 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)))) : A (G (X (G (X ((3 <= p527)))))) : A (G (G (((3 <= p132) U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p109 + p110 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p108 + p107 + p106 + p105 + p104 + p103 + p102 + p101 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337))))) : A (X (G (((p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 <= p132) U (2 <= p135))))) : A (X (X (G (G ((1 <= p527)))))) : A (X ((p291 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528))) : A ((((p372 <= p290) U (p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p369 + p370 <= p548 + p547 + p546 + p545 + p544 + p543 + p542 + p541 + p540 + p539 + p549)) U F (X ((3 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p246 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + 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))))) : A (X (X (F ((p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 <= p315 + p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305))))) : A (G ((F ((p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p369 + p370 <= p291)) U F ((p494 + p483 + p472 + p461 + p450 + p439 + p428 + p417 + p406 + p395 + p384 + 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 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528))))) : A ((2 <= p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515)) : A (F (X (F (F ((2 <= p548 + p547 + p546 + p545 + p544 + p543 + p542 + p541 + p540 + p539 + p549)))))) : A ((((1 <= p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304) U (p134 <= p494 + p483 + p472 + p461 + p450 + p439 + p428 + p417 + p406 + p395 + p384 + 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 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504)) U X (X ((p291 <= p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349))))) : A (X ((F ((p527 <= p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279)) U (3 <= p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348)))) : A (X (((p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 <= p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349) U G ((p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 <= p133))))) : A (X ((X ((3 <= p315 + p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305)) U F ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p109 + p110 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p108 + p107 + p106 + p105 + p104 + p103 + p102 + p101 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))) : A (X (X (X (X ((p290 <= p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p267 + p266 + p265 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264) U (2 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p246 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((2 <= p267 + p266 + p265 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264) U (2 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p246 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + 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))))
lola: processed formula: A (G (((2 <= p267 + p266 + p265 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264) U (2 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p246 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p2... (shortened)
lola: processed formula length: 945
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (X ((3 <= p527))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G (X ((3 <= p527))))))
lola: processed formula: A (G (X (G (X ((3 <= p527))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (((3 <= p132) U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p109 + p110 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p108 + p107 + p106 + p105 + p104 + p103 + p102 + p101 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (((3 <= p132) U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p109 + p110 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p108 + p107 + p106 + p105 + p104 + p103 + p102 + p101 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337)))))
lola: processed formula: A (G (G (((3 <= p132) U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p109 + p110 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p108 + p107 + p106 + p105 + p104 + p103 + p102 + p101 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 ... (shortened)
lola: processed formula length: 842
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 533563 markings, 2125858 edges, 106713 markings/sec, 0 secs
lola: 942461 markings, 4249627 edges, 81780 markings/sec, 5 secs
lola: 1431682 markings, 6362993 edges, 97844 markings/sec, 10 secs
lola: 1895088 markings, 8709772 edges, 92681 markings/sec, 15 secs
lola: 2355018 markings, 11192401 edges, 91986 markings/sec, 20 secs
lola: 2739854 markings, 13708538 edges, 76967 markings/sec, 25 secs
lola: 3067893 markings, 15628266 edges, 65608 markings/sec, 30 secs
lola: 3526126 markings, 17789213 edges, 91647 markings/sec, 35 secs
lola: 3991753 markings, 20340574 edges, 93125 markings/sec, 40 secs
lola: 4412868 markings, 22955320 edges, 84223 markings/sec, 45 secs
lola: 4780960 markings, 25302208 edges, 73618 markings/sec, 50 secs
lola: 5223849 markings, 27892269 edges, 88578 markings/sec, 55 secs
lola: 5595332 markings, 30532969 edges, 74297 markings/sec, 60 secs
lola: 5995276 markings, 33061288 edges, 79989 markings/sec, 65 secs
lola: 6354341 markings, 35688023 edges, 71813 markings/sec, 70 secs
lola: 6736400 markings, 38268428 edges, 76412 markings/sec, 75 secs
lola: 7082494 markings, 40884317 edges, 69219 markings/sec, 80 secs
lola: 7420325 markings, 43483400 edges, 67566 markings/sec, 85 secs
lola: 7749640 markings, 46074260 edges, 65863 markings/sec, 90 secs
lola: 8066884 markings, 48662512 edges, 63449 markings/sec, 95 secs
lola: 8370126 markings, 51230995 edges, 60648 markings/sec, 100 secs
lola: 8742253 markings, 53710994 edges, 74425 markings/sec, 105 secs
lola: 9219308 markings, 55572251 edges, 95411 markings/sec, 110 secs
lola: 9713496 markings, 57457317 edges, 98838 markings/sec, 115 secs
lola: 10167998 markings, 59305560 edges, 90900 markings/sec, 120 secs
lola: 10633026 markings, 61128951 edges, 93006 markings/sec, 125 secs
lola: 11010928 markings, 62856214 edges, 75580 markings/sec, 130 secs
lola: 11345944 markings, 64551562 edges, 67003 markings/sec, 135 secs
lola: 11663572 markings, 66286147 edges, 63526 markings/sec, 140 secs
lola: 12164982 markings, 68059683 edges, 100282 markings/sec, 145 secs
lola: 12575258 markings, 69818574 edges, 82055 markings/sec, 150 secs
lola: 12972511 markings, 71560106 edges, 79451 markings/sec, 155 secs
lola: 13306220 markings, 73239216 edges, 66742 markings/sec, 160 secs
lola: 13630529 markings, 74925384 edges, 64862 markings/sec, 165 secs
lola: 13921487 markings, 76628012 edges, 58192 markings/sec, 170 secs
lola: 14282536 markings, 78377017 edges, 72210 markings/sec, 175 secs
lola: 14633312 markings, 80150767 edges, 70155 markings/sec, 180 secs
lola: 14988461 markings, 81892771 edges, 71030 markings/sec, 185 secs
lola: 15288482 markings, 83668142 edges, 60004 markings/sec, 190 secs
lola: 15684788 markings, 85533278 edges, 79261 markings/sec, 195 secs
lola: 16129838 markings, 87281750 edges, 89010 markings/sec, 200 secs
lola: 16611646 markings, 89070663 edges, 96362 markings/sec, 205 secs
lola: 17048163 markings, 90798039 edges, 87303 markings/sec, 210 secs
lola: 17478050 markings, 92535975 edges, 85977 markings/sec, 215 secs
lola: 17828949 markings, 94225436 edges, 70180 markings/sec, 220 secs
lola: 18208860 markings, 95886252 edges, 75982 markings/sec, 225 secs
lola: 18517497 markings, 97548555 edges, 61727 markings/sec, 230 secs
lola: 18920307 markings, 99198421 edges, 80562 markings/sec, 235 secs
lola: 19345429 markings, 100902549 edges, 85024 markings/sec, 240 secs
lola: 19745245 markings, 102593562 edges, 79963 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 <= p132) U (2 <= p135)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 <= p132) U (2 <= p135)))))
lola: processed formula: A (X (G (((p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 <= p132) U (2 <= p135)))))
lola: processed formula length: 112
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (G ((1 <= p527))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G (G ((1 <= p527))))))
lola: processed formula: A (X (X (G (G ((1 <= p527))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p291 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p291 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528)))
lola: processed formula: A (X ((p291 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528)))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p372 <= p290) U (p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p369 + p370 <= p548 + p547 + p546 + p545 + p544 + p543 + p542 + p541 + p540 + p539 + p549)) U F (X ((3 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p246 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p372 <= p290) U (p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p369 + p370 <= p548 + p547 + p546 + p545 + p544 + p543 + p542 + p541 + p540 + p539 + p549)) U F (X ((3 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p246 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + 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)))))
lola: processed formula: A ((((p372 <= p290) U (p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p369 + p370 <= p548 + p547 + p546 + p545 + p544 + p543 + p542 + p541 + p540 + p539 + p549)) U F (X ((3 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p246 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 ... (shortened)
lola: processed formula length: 1041
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 <= p315 + p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 <= p315 + p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305)))))
lola: processed formula: A (X (X (F ((p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 <= p315 + p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305)))))
lola: processed formula length: 170
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p369 + p370 <= p291)) U F ((p494 + p483 + p472 + p461 + p450 + p439 + p428 + p417 + p406 + p395 + p384 + 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p369 + p370 <= p291)) U F ((p494 + p483 + p472 + p461 + p450 + p439 + p428 + p417 + p406 + p395 + p384 + 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 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528)))))
lola: processed formula: A (G ((F ((p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p369 + p370 <= p291)) U F ((p494 + p483 + p472 + p461 + p450 + p439 + p428 + p417 + p406 + p395 + p384 + 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... (shortened)
lola: processed formula length: 1029
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 508166 markings, 2008689 edges, 101633 markings/sec, 0 secs
lola: 910221 markings, 4069539 edges, 80411 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 467 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515)
lola: processed formula length: 81
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: subprocess 10 will run for 545 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (F ((2 <= p548 + p547 + p546 + p545 + p544 + p543 + p542 + p541 + p540 + p539 + p549))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: ========================================
lola: processed formula: A (F (X (F ((2 <= p548 + p547 + p546 + p545 + p544 + p543 + p542 + p541 + p540 + p539 + p549)))))
lola: processed formula: A (F (X (F ((2 <= p548 + p547 + p546 + p545 + p544 + p543 + p542 + p541 + p540 + p539 + p549)))))
lola: processed formula length: 97
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1103504 markings, 2910364 edges, 220701 markings/sec, 0 secs
lola: 1986844 markings, 5504098 edges, 176668 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 11 will run for 652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304) U (p134 <= p494 + p483 + p472 + p461 + p450 + p439 + p428 + p417 + p406 + p395 + p384 + 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 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304) U (p134 <= p494 + p483 + p472 + p461 + p450 + p439 + p428 + p417 + p406 + p395 + p384 + 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 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504)) U X (X ((p291 <= p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349)))))
lola: processed formula: A ((((1 <= p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304) U (p134 <= p494 + p483 + p472 + p461 + p450 + p439 + p428 + p417 + p406 + p395 + p384 + 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 + p... (shortened)
lola: processed formula length: 1041
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 12 will run for 816 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((p527 <= p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279)) U (3 <= p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((p527 <= p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279)) U (3 <= p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348))))
lola: processed formula: A (X ((F ((p527 <= p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279)) U (3 <= p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348))))
lola: processed formula length: 182
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 13 will run for 1088 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 <= p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349) U G ((p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 <= p133)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 <= p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349) U G ((p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 <= p133)))))
lola: processed formula: A (X (((p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 <= p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349) U G ((p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 <= p133)))))
lola: processed formula length: 255
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 584286 markings, 4154817 edges, 116857 markings/sec, 0 secs
lola: 1117669 markings, 8236527 edges, 106677 markings/sec, 5 secs
lola: 1606185 markings, 12129942 edges, 97703 markings/sec, 10 secs
lola: 2101942 markings, 15996878 edges, 99151 markings/sec, 15 secs
lola: 2567407 markings, 19796562 edges, 93093 markings/sec, 20 secs
lola: 2997245 markings, 23506024 edges, 85968 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1616 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((3 <= p315 + p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305)) U F ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p109 + p110 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p108 + p107 + p106 + p105 + p104 + p103 + p102 + p101 + p10 + p11 + p12 + p13 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((3 <= p315 + p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305)) U F ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p109 + p110 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p108 + p107 + p106 + p105 + p104 + p103 + p102 + p101 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))))
lola: processed formula: A (X ((X ((3 <= p315 + p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305)) U F ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p109 + p110 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p108 + p107 + p106 + p105 + p104 + p103 + p102 + p101 + p10 + p11 + p12 + p13 + p1... (shortened)
lola: processed formula length: 916
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 15 will run for 3233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X ((p290 <= p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X ((p290 <= p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316))))))
lola: processed formula: A (X (X (X (X ((p290 <= p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316))))))
lola: processed formula length: 104
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: RESULT
lola:
SUMMARY: no no unknown no no yes no yes no no yes yes yes no yes yes
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496367017378

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_QuasiCertifProtocol-COL-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_QuasiCertifProtocol-COL-10.tgz
mv S_QuasiCertifProtocol-COL-10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_QuasiCertifProtocol-COL-10, examination is LTLCardinality"
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-smll-149479231700203"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;