Execution Chart

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

Trace from the execution

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

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526859628615


BK_STOP 1526859899157

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

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

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBNT-COL-S05J40: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBNT-COL-S05J40: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBNT-COL-S05J40 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2299/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 669 places, 1630 transitions, 567 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1208 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J40-CTLCardinality.task
lola: A (F ((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p40 <= 1) AND (p397 <= p42)) AND A (X ((3 <= p538)))))) : E (G (A (G ((p43 <= 0))))) : (E (X (((p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 <= p531) OR ((2 <= p402 + p401 + p400 + p399 + p398) AND (2 <= p42))))) AND A (F ((3 <= p487)))) : (A (G ((((p584 <= p136) OR (p86 <= p132)) AND (p130 <= p537 + p536 + p535 + p534 + p533)))) OR ((E (X ((2 <= p397))) AND ((p135 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p40) AND (2 <= p43) AND (p626 <= p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625) AND (p487 <= p667 + p666 + p665 + p664 + p663 + p662 + p661 + p660 + p659 + p658 + p657 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p668))) AND ((p392 + p393 + p394 + p395 + p396 <= p390) OR (p529 + 1 <= p41)))) : NOT(E (G ((2 <= p537 + p536 + p535 + p534 + p533)))) : A (F ((A (F ((2 <= p403))) AND A (F ((1 <= p87)))))) : (E (F (((p537 + p536 + p535 + p534 + p533 + 1 <= p626) AND (p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + 1 <= p134)))) OR A (G (E (G ((p135 <= p402 + p401 + p400 + p399 + p398)))))) : A (X ((A (G ((p129 <= p392 + p393 + p394 + p395 + p396))) AND E (F ((p539 <= p583)))))) : A (G (((p667 + p666 + p665 + p664 + p663 + p662 + p661 + p660 + p659 + p658 + p657 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p668 <= p44) OR (p86 <= p44) OR ((p530 <= p627) AND (p584 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) OR (1 <= p130)))) : (((2 <= p348) AND NOT(A (G ((p132 <= p538))))) AND A (((p582 <= p391) U ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 <= p530))))) : E (F (A (((1 <= p487) U (2 <= p487))))) : E (F (NOT(E (G ((p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 <= p41)))))) : A (G ((A (X ((2 <= p584))) OR (2 <= p133)))) : E (((p134 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U A (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p40))))) : NOT(E ((((p403 <= p41) AND (p532 <= p43)) U ((3 <= p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389) AND (p397 <= p537 + p536 + p535 + p534 + p533))))) : A (F (((((3 <= p130) AND (1 <= p530)) OR (3 <= p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + 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)) AND (2 <= p347))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p40 <= 1) AND (p397 <= p42)) AND A (X ((3 <= p538))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p40 <= 1) AND (p397 <= p42)) AND AX((3 <= p538))))
lola: processed formula length: 292
lola: 2 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 38 markings, 37 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G ((p43 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (1 <= p43))))
lola: processed formula length: 35
lola: 4 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (((p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p46... (shortened)
lola: processed formula length: 648
lola: 1 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p487)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p487)))
lola: processed formula: A (F ((3 <= p487)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2272 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p584 <= p136) OR (p86 <= p132)) AND (p130 <= p537 + p536 + p535 + p534 + p533)))) OR ((E (X ((2 <= p397))) AND ((p135 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p40) AND (2 <= p43) AND (p626 <= p585 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p584 <= p136) OR (p86 <= p132)) AND (p130 <= p537 + p536 + p535 + p534 + p533))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 35 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= p397)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= p397))
lola: processed formula length: 15
lola: 2 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p135 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p40) AND (2 <= p43) AND (p626 <= p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p135 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p40) AND (2 <= p43) AND (p626 <= p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + ... (shortened)
lola: processed formula length: 931
lola: 2 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((2 <= p537 + p536 + p535 + p534 + p533))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p537 + p536 + p535 + p534 + p533 <= 1)))
lola: processed formula: A (F ((p537 + p536 + p535 + p534 + p533 <= 1)))
lola: processed formula length: 47
lola: 3 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2272 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 38 markings, 38 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((2 <= p403))) AND A (F ((1 <= p87))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U (2 <= p403)) AND A(TRUE U (1 <= p87))))
lola: processed formula length: 58
lola: 3 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 38 markings, 112 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((p537 + p536 + p535 + p534 + p533 + 1 <= p626) AND (p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p537 + p536 + p535 + p534 + p533 + 1 <= p626) AND (p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J40-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: lola: ========================================
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A (G ((p129 <= p392 + p393 + p394 + p395 + p396))) AND E (F ((p539 <= p583))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p129 <= p392 + p393 + p394 + p395 + p396)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (A (G ((p129 <= p392 + p393 + p394 + p395 + p396)))))
lola: processed formula: A (X (A (G ((p129 <= p392 + p393 + p394 + p395 + p396)))))
lola: processed formula length: 58
lola: 1 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2272 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 38 markings, 38 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p667 + p666 + p665 + p664 + p663 + p662 + p661 + p660 + p659 + p658 + p657 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p668 <= p44) OR (p86 <= p44) OR ((p530 <= p627) AND (p584 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J40-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-CTLCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3411 markings, 7068 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p348) AND NOT(A (G ((p132 <= p538))))) AND A (((p582 <= p391) U ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (p585 + p586 + p587 + p588 + p589 + p590 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p348)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p348)
lola: processed formula length: 11
lola: 4 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p538 + 1 <= p132)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J40-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-CTLCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 49292 markings, 98879 edges, 9858 markings/sec, 0 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p582 <= p391) U ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p582 <= p391) U ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 <= p530))))
lola: processed formula: A (((p582 <= p391) U ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p5... (shortened)
lola: processed formula length: 603
lola: 4 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2272 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((1 <= p487) U (2 <= p487)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((1 <= p487) U (2 <= p487)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 669 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2268 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 369227 markings, 1130728 edges, 71738 markings/sec, 0 secs
lola: 756155 markings, 2259200 edges, 77386 markings/sec, 5 secs
lola: 1161526 markings, 3411827 edges, 81074 markings/sec, 10 secs
lola: 1542012 markings, 4489419 edges, 76097 markings/sec, 15 secs
lola: 1927595 markings, 5572844 edges, 77117 markings/sec, 20 secs
lola: 2315591 markings, 6686468 edges, 77599 markings/sec, 25 secs
lola: 2700230 markings, 7780171 edges, 76928 markings/sec, 30 secs
lola: 3083484 markings, 8839264 edges, 76651 markings/sec, 35 secs
lola: 3468177 markings, 9943943 edges, 76939 markings/sec, 40 secs
lola: 3853539 markings, 11039090 edges, 77072 markings/sec, 45 secs
lola: 4238164 markings, 12102208 edges, 76925 markings/sec, 50 secs
lola: 4597803 markings, 13138695 edges, 71928 markings/sec, 55 secs
lola: 4985869 markings, 14240995 edges, 77613 markings/sec, 60 secs
lola: 5375356 markings, 15317426 edges, 77897 markings/sec, 65 secs
lola: 5759611 markings, 16421125 edges, 76851 markings/sec, 70 secs
lola: 6151809 markings, 17534232 edges, 78440 markings/sec, 75 secs
lola: 6542575 markings, 18615060 edges, 78153 markings/sec, 80 secs
lola: 6921113 markings, 19702892 edges, 75708 markings/sec, 85 secs
lola: 7309198 markings, 20804238 edges, 77617 markings/sec, 90 secs
lola: 7688140 markings, 21867480 edges, 75788 markings/sec, 95 secs
lola: 8069751 markings, 22949591 edges, 76322 markings/sec, 100 secs
lola: 8456884 markings, 24059593 edges, 77427 markings/sec, 105 secs
lola: 8838206 markings, 25133246 edges, 76264 markings/sec, 110 secs
lola: 9220511 markings, 26202048 edges, 76461 markings/sec, 115 secs
lola: 9605612 markings, 27307892 edges, 77020 markings/sec, 120 secs
lola: 9987865 markings, 28394773 edges, 76451 markings/sec, 125 secs
lola: 10372132 markings, 29456792 edges, 76853 markings/sec, 130 secs
lola: 10756760 markings, 30561279 edges, 76926 markings/sec, 135 secs
lola: 11142970 markings, 31658748 edges, 77242 markings/sec, 140 secs
lola: 11529932 markings, 32728325 edges, 77392 markings/sec, 145 secs
lola: 11912814 markings, 33828344 edges, 76576 markings/sec, 150 secs
lola: 12301948 markings, 34932969 edges, 77827 markings/sec, 155 secs
lola: 12690801 markings, 36008387 edges, 77771 markings/sec, 160 secs
lola: 13074125 markings, 37109678 edges, 76665 markings/sec, 165 secs
lola: 13467463 markings, 38225072 edges, 78668 markings/sec, 170 secs
lola: 13851985 markings, 39301275 edges, 76904 markings/sec, 175 secs
lola: 14238641 markings, 40399693 edges, 77331 markings/sec, 180 secs
lola: 14631069 markings, 41525425 edges, 78486 markings/sec, 185 secs
lola: 15018863 markings, 42627725 edges, 77559 markings/sec, 190 secs
lola: 15411962 markings, 43713769 edges, 78620 markings/sec, 195 secs
lola: 15803692 markings, 44837607 edges, 78346 markings/sec, 200 secs
lola: 16196806 markings, 45953829 edges, 78623 markings/sec, 205 secs
lola: 16591285 markings, 47044059 edges, 78896 markings/sec, 210 secs
lola: 16981055 markings, 48162834 edges, 77954 markings/sec, 215 secs
lola: 17379268 markings, 49292094 edges, 79643 markings/sec, 220 secs
lola: 17769194 markings, 50370731 edges, 77985 markings/sec, 225 secs
lola: 18154862 markings, 51478207 edges, 77134 markings/sec, 230 secs
lola: 18548081 markings, 52606011 edges, 78644 markings/sec, 235 secs
lola: 18941579 markings, 53724375 edges, 78700 markings/sec, 240 secs
lola: 19336460 markings, 54814967 edges, 78976 markings/sec, 245 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J40"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J40.tgz
mv PolyORBNT-COL-S05J40 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is PolyORBNT-COL-S05J40, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r126-smll-152673528600276"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;