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 276K
-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.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K 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.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 94K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PolyORBNT-COL-S05J60, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-152673534300283
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527019279732


BK_STOP 1527020109230

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBNT-COL-S05J60 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': 882504, 'Memory': 15948.29, 'Tool': 'lola'}, {'Time': 1994092, 'Memory': 15949.34, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBNT-COL-S05J60...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PolyORBNT-COL-S05J60: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBNT-COL-S05J60: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBNT-COL-S05J60 @ 3539 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2999/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 969 places, 2030 transitions, 827 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1728 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J60-CTLCardinality.task
lola: ((p578 <= p589) AND NOT(E (F ((p590 + 1 <= p846))))) : A (G (A (((p10 <= p386) U (p589 <= p579))))) : E ((((p0 + p1 + p2 + p3 + p4 <= 1) AND (p582 <= 2)) U E (F ((1 <= p514))))) : (E (X (E (X ((1 <= p841 + p842 + p843 + p844 + p845))))) AND NOT(E (G (((p586 <= p652) OR (3 <= p580)))))) : NOT(E (F (((p588 + 1 <= p778) AND ((p716 <= p586) OR (p9 + p8 + p7 + p6 + p5 <= p386)))))) : ((E (G ((p387 + 1 <= p0 + p1 + p2 + p3 + p4))) AND ((p587 <= 0) AND ((3 <= p11) OR (p778 <= p513) OR (p0 + p1 + p2 + p3 + p4 + 1 <= p450)))) AND ((((p387 <= 1) AND ((p12 <= p840) OR (p589 <= 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 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651))) OR E (F ((3 <= p451)))) OR NOT(A (X ((p588 <= p581)))))) : (A (G (E (X ((3 <= p587))))) OR NOT(A (G ((p12 <= 2))))) : (E (((2 <= p590) U ((p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 <= p590) OR (p93 + p91 + p90 + p89 + p88 + 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 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + 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 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p76 + p75 + p74 + p73 + p71 + p70 + p69 + p68 + p66 + p65 + p64 + p63 + p61 + p60 + p59 + p58 + p56 + p55 + p54 + p53 + p51 + p50 + p49 + p48 + p46 + p45 + p44 + p43 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p31 + p30 + p29 + p28 + p26 + p25 + p24 + p23 + p21 + p20 + p19 + p18 + p16 + p15 + p14 + p13 + p17 + p22 + p27 + p32 + p37 + p42 + p47 + p52 + p57 + p62 + p67 + p72 + p77 + p82 + p87 + p92 + p94 + p95 + p96 + p97 + p98 + p99 <= p513)))) AND A (F ((1 <= p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577)))) : ((E (G (())) AND A (((2 <= p586) U (1 <= p384)))) OR (((3 <= p589) AND (2 <= p580)) OR E (G (((p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 <= p585) OR (p514 <= p387)))))) : E (F ((p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 <= 2))) : E (G ((((p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 <= 2) AND (p514 <= p449)) OR (p588 <= p93 + p91 + p90 + p89 + p88 + 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 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + 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 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p76 + p75 + p74 + p73 + p71 + p70 + p69 + p68 + p66 + p65 + p64 + p63 + p61 + p60 + p59 + p58 + p56 + p55 + p54 + p53 + p51 + p50 + p49 + p48 + p46 + p45 + p44 + p43 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p31 + p30 + p29 + p28 + p26 + p25 + p24 + p23 + p21 + p20 + p19 + p18 + p16 + p15 + p14 + p13 + p17 + p22 + p27 + p32 + p37 + p42 + p47 + p52 + p57 + p62 + p67 + p72 + p77 + p82 + p87 + p92 + p94 + p95 + p96 + p97 + p98 + p99)))) : E (G (A (F ((p840 <= p589))))) : NOT(E (X (E (F ((3 <= p578)))))) : NOT(E (G (E (F ((p582 <= p515)))))) : E (G (A (((p384 <= p515) U (p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 <= 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 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651))))) : E (G ((p387 <= 0)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p578 <= p589) AND NOT(E (F ((p590 + 1 <= p846)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p578 <= p589)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p578 <= p589)
lola: processed formula length: 14
lola: 3 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p846 <= p590)))
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 3308 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-S05J60-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J60-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: SUBRESULT
lola: lola: result: yes========================================

lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((p10 <= p386) U (p589 <= p579)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((p10 <= p386) U (p589 <= p579)))))
lola: processed formula length: 53
lola: 2 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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: 395611 markings, 1310307 edges, 2073447895104749568 markings/sec, 0 secs
lola: 760125 markings, 2689176 edges, 72903 markings/sec, 5 secs
lola: 1142731 markings, 4037785 edges, 76521 markings/sec, 10 secs
lola: 1534309 markings, 5407672 edges, 78316 markings/sec, 15 secs
lola: 1898406 markings, 6763112 edges, 72819 markings/sec, 20 secs
lola: 2305478 markings, 8117116 edges, 81414 markings/sec, 25 secs
lola: 2666839 markings, 9485777 edges, 72272 markings/sec, 30 secs
lola: 3047348 markings, 10846066 edges, 76102 markings/sec, 35 secs
lola: 3444379 markings, 12216117 edges, 79406 markings/sec, 40 secs
lola: 3810363 markings, 13568153 edges, 73197 markings/sec, 45 secs
lola: 4193851 markings, 14921386 edges, 76698 markings/sec, 50 secs
lola: 4574489 markings, 16284864 edges, 76128 markings/sec, 55 secs
lola: 4948996 markings, 17643656 edges, 74901 markings/sec, 60 secs
lola: 5353839 markings, 19021218 edges, 80969 markings/sec, 65 secs
lola: 5720709 markings, 20368532 edges, 73374 markings/sec, 70 secs
lola: 6096059 markings, 21724711 edges, 75070 markings/sec, 75 secs
lola: 6485183 markings, 23095295 edges, 77825 markings/sec, 80 secs
lola: 6848852 markings, 24451902 edges, 72734 markings/sec, 85 secs
lola: 7259757 markings, 25815417 edges, 82181 markings/sec, 90 secs
lola: 7620295 markings, 27180844 edges, 72108 markings/sec, 95 secs
lola: 8000795 markings, 28533649 edges, 76100 markings/sec, 100 secs
lola: 8395856 markings, 29904130 edges, 79012 markings/sec, 105 secs
lola: 8760702 markings, 31257064 edges, 72969 markings/sec, 110 secs
lola: 9152803 markings, 32567497 edges, 78420 markings/sec, 115 secs
lola: 9485237 markings, 33841206 edges, 66487 markings/sec, 120 secs
lola: 9841498 markings, 35103686 edges, 71252 markings/sec, 125 secs
lola: 10207662 markings, 36390720 edges, 73233 markings/sec, 130 secs
lola: 10550514 markings, 37649934 edges, 68570 markings/sec, 135 secs
lola: 10917529 markings, 38899271 edges, 73403 markings/sec, 140 secs
lola: 11278751 markings, 40234255 edges, 72244 markings/sec, 145 secs
lola: 11494648 markings, 40973509 edges, 43179 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p0 + p1 + p2 + p3 + p4 <= 1) AND (p582 <= 2)) U E (F ((1 <= p514)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p0 + p1 + p2 + p3 + p4 <= 1) AND (p582 <= 2)) U E(TRUE U (1 <= p514)))
lola: processed formula length: 74
lola: 2 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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: 458724 markings, 1058222 edges, 3689348869717491712 markings/sec, 0 secs
lola: 845534 markings, 2122904 edges, 77362 markings/sec, 5 secs
lola: 1239004 markings, 3157908 edges, 78694 markings/sec, 10 secs
lola: 1674262 markings, 4192025 edges, 87052 markings/sec, 15 secs
lola: 2051067 markings, 5233867 edges, 75361 markings/sec, 20 secs
lola: 2450804 markings, 6268960 edges, 79947 markings/sec, 25 secs
lola: 2882672 markings, 7309200 edges, 86374 markings/sec, 30 secs
lola: 3258305 markings, 8348694 edges, 75127 markings/sec, 35 secs
lola: 3663999 markings, 9383715 edges, 81139 markings/sec, 40 secs
lola: 4091716 markings, 10427716 edges, 85543 markings/sec, 45 secs
lola: 4478868 markings, 11454140 edges, 77430 markings/sec, 50 secs
lola: 4875964 markings, 12495072 edges, 79419 markings/sec, 55 secs
lola: 5295684 markings, 13535202 edges, 83944 markings/sec, 60 secs
lola: 5684444 markings, 14572013 edges, 77752 markings/sec, 65 secs
lola: 6088855 markings, 15609109 edges, 80882 markings/sec, 70 secs
lola: 6505196 markings, 16655320 edges, 83268 markings/sec, 75 secs
lola: 6891863 markings, 17693321 edges, 77333 markings/sec, 80 secs
lola: 7307798 markings, 18739593 edges, 83187 markings/sec, 85 secs
lola: 7717675 markings, 19781690 edges, 81975 markings/sec, 90 secs
lola: 8103661 markings, 20823441 edges, 77197 markings/sec, 95 secs
lola: 8541735 markings, 21851486 edges, 87615 markings/sec, 100 secs
lola: 8930022 markings, 22908472 edges, 77657 markings/sec, 105 secs
lola: 9318944 markings, 23948081 edges, 77784 markings/sec, 110 secs
lola: 9766172 markings, 24993524 edges, 89446 markings/sec, 115 secs
lola: 10150022 markings, 26052138 edges, 76770 markings/sec, 120 secs
lola: 10555474 markings, 27112855 edges, 81090 markings/sec, 125 secs
lola: 10998942 markings, 28166863 edges, 88694 markings/sec, 130 secs
lola: 11390520 markings, 29242317 edges, 78316 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (E (X ((1 <= p841 + p842 + p843 + p844 + p845))))) AND NOT(E (G (((p586 <= p652) OR (3 <= p580))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (X ((1 <= p841 + p842 + p843 + p844 + p845)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(EX((1 <= p841 + p842 + p843 + p844 + p845)))
lola: processed formula length: 47
lola: 5 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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 4 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p652 + 1 <= p586) AND (p580 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p652 + 1 <= p586) AND (p580 <= 2))))
lola: processed formula: A (F (((p652 + 1 <= p586) AND (p580 <= 2))))
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3312 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 4 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((p588 + 1 <= p778) AND ((p716 <= p586) OR (p9 + p8 + p7 + p6 + p5 <= p386))))))
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 3308 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: state equation: write sara problem file to PolyORBNT-COL-S05J60-CTLCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G ((p387 + 1 <= p0 + p1 + p2 + p3 + p4))) AND ((p587 <= 0) AND ((3 <= p11) OR (p778 <= p513) OR (p0 + p1 + p2 + p3 + p4 + 1 <= p450)))) AND ((((p387 <= 1) AND ((p12 <= p840) OR (p589 <= 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 + p62... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p387 + 1 <= p0 + p1 + p2 + p3 + p4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p0 + p1 + p2 + p3 + p4 <= p387)))
lola: processed formula length: 47
lola: 7 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 723406 markings, 863708 edges, 144661 markings/sec, 0 secs
lola: 1259388 markings, 1714868 edges, 107196 markings/sec, 5 secs
lola: 1933378 markings, 2522316 edges, 134798 markings/sec, 10 secs
lola: 2450346 markings, 3351040 edges, 103394 markings/sec, 15 secs
lola: 3113660 markings, 4144389 edges, 132663 markings/sec, 20 secs
lola: 3651420 markings, 5000750 edges, 107552 markings/sec, 25 secs
lola: 4268735 markings, 5807011 edges, 123463 markings/sec, 30 secs
lola: 4859729 markings, 6657694 edges, 118199 markings/sec, 35 secs
lola: 5395763 markings, 7508907 edges, 107207 markings/sec, 40 secs
lola: 6074616 markings, 8321218 edges, 135771 markings/sec, 45 secs
lola: 6591091 markings, 9149449 edges, 103295 markings/sec, 50 secs
lola: 7260669 markings, 9949062 edges, 133916 markings/sec, 55 secs
lola: 7757956 markings, 10758106 edges, 99457 markings/sec, 60 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 1: unexpected character, last read: '\ufffd'
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((3 <= p587))))) OR NOT(A (G ((p12 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((3 <= p587)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((3 <= p587)))))
lola: processed formula length: 35
lola: 5 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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-S05J60-CTLCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((2 <= p590) U ((p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= p590) U ((p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= p590) U ((p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347... (shortened)
lola: processed formula length: 2513
lola: 1 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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 1 significant temporal operators and needs 5 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p57... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577)))
lola: processed formula: A (F ((1 <= p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p57... (shortened)
lola: processed formula length: 439
lola: 0 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3312 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 8 will run for 396 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G (())) AND A (((2 <= p586) U (1 <= p384)))) OR (((3 <= p589) AND (2 <= p580)) OR E (G (((p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p586) U (1 <= p384)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p586) U (1 <= p384)))
lola: processed formula: A (((2 <= p586) U (1 <= p384)))
lola: processed formula length: 31
lola: 4 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3312 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 9 will run for 452 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p589) AND (2 <= p580))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p589) AND (2 <= p580))
lola: processed formula length: 29
lola: 4 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 528 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p585 + 1 <= p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p5... (shortened)
lola: processed formula length: 478
lola: 6 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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 1 significant temporal operators and needs 5 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: 13 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 452 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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-S05J60-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J60-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 24767 markings, 45027 edges, 4953 markings/sec, 0 secs
lola: sara is running 5 secs || 49005 markings, 96404 edges, 4848 markings/sec, 5 secs
lola: sara is running 10 secs || 72969 markings, 147231 edges, 4793 markings/sec, 10 secs
lola: sara is running 15 secs || 97022 markings, 191235 edges, 4811 markings/sec, 15 secs
lola: sara is running 20 secs || 121034 markings, 242188 edges, 4802 markings/sec, 20 secs
lola: sara is running 25 secs || 144935 markings, 293046 edges, 4780 markings/sec, 25 secs
lola: sara is running 30 secs || 168886 markings, 343903 edges, 4790 markings/sec, 30 secs
lola: sara is running 35 secs || 192866 markings, 387772 edges, 4796 markings/sec, 35 secs
lola: sara is running 40 secs || 216069 markings, 437336 edges, 4641 markings/sec, 40 secs
lola: sara is running 45 secs || 241371 markings, 490599 edges, 5060 markings/sec, 45 secs
lola: sara is running 50 secs || 266752 markings, 537014 edges, 5076 markings/sec, 50 secs
lola: sara is running 55 secs || 292048 markings, 590348 edges, 5059 markings/sec, 55 secs
lola: sara is running 60 secs || 317287 markings, 643645 edges, 5048 markings/sec, 60 secs
lola: sara is running 65 secs || 342487 markings, 696742 edges, 5040 markings/sec, 65 secs
lola: sara is running 70 secs || 367816 markings, 743041 edges, 5066 markings/sec, 70 secs
lola: sara is running 75 secs || 393044 markings, 796311 edges, 5046 markings/sec, 75 secs
lola: sara is running 80 secs || 418246 markings, 849453 edges, 5040 markings/sec, 80 secs
lola: sara is running 85 secs || 443471 markings, 902696 edges, 5045 markings/sec, 85 secs
lola: sara is running 90 secs || 468932 markings, 949217 edges, 5092 markings/sec, 90 secs
lola: sara is running 95 secs || 494159 markings, 1002495 edges, 5045 markings/sec, 95 secs
lola: sara is running 100 secs || 519379 markings, 1055639 edges, 5044 markings/sec, 100 secs
lola: sara is running 105 secs || 544748 markings, 1109121 edges, 5074 markings/sec, 105 secs
lola: sara is running 110 secs || 570098 markings, 1162597 edges, 5070 markings/sec, 110 secs
lola: sara is running 115 secs || 595629 markings, 1209231 edges, 5106 markings/sec, 115 secs
lola: sara is running 120 secs || 621038 markings, 1262789 edges, 5082 markings/sec, 120 secs
lola: sara is running 125 secs || 646373 markings, 1316238 edges, 5067 markings/sec, 125 secs
lola: sara is running 130 secs || 671741 markings, 1369744 edges, 5074 markings/sec, 130 secs
lola: sara is running 135 secs || 697203 markings, 1416259 edges, 5092 markings/sec, 135 secs
lola: sara is running 140 secs || 722571 markings, 1469754 edges, 5074 markings/sec, 140 secs
lola: sara is running 145 secs || 747866 markings, 1523107 edges, 5059 markings/sec, 145 secs
lola: sara is running 150 secs || 772884 markings, 1575960 edges, 5004 markings/sec, 150 secs
lola: sara is running 155 secs || 797969 markings, 1621749 edges, 5017 markings/sec, 155 secs
lola: sara is running 160 secs || 822944 markings, 1674534 edges, 4995 markings/sec, 160 secs
lola: sara is running 165 secs || 847502 markings, 1726540 edges, 4912 markings/sec, 165 secs
lola: sara is running 170 secs || 871779 markings, 1778048 edges, 4855 markings/sec, 170 secs
lola: sara is running 175 secs || 893687 markings, 1818080 edges, 4382 markings/sec, 175 secs
lola: sara is running 180 secs || 916979 markings, 1867736 edges, 4658 markings/sec, 180 secs
lola: sara is running 185 secs || 941399 markings, 1919462 edges, 4884 markings/sec, 185 secs
lola: sara is running 190 secs || 966046 markings, 1964547 edges, 4929 markings/sec, 190 secs
lola: sara is running 195 secs || 990612 markings, 2016581 edges, 4913 markings/sec, 195 secs
lola: sara is running 200 secs || 1014715 markings, 2067712 edges, 4821 markings/sec, 200 secs
lola: sara is running 205 secs || 1039120 markings, 2112361 edges, 4881 markings/sec, 205 secs
lola: sara is running 210 secs || 1063295 markings, 2163612 edges, 4835 markings/sec, 210 secs
lola: sara is running 215 secs || 1087588 markings, 2215128 edges, 4859 markings/sec, 215 secs
lola: sara is running 220 secs || 1111845 markings, 2266587 edges, 4851 markings/sec, 220 secs
lola: sara is running 225 secs || 1136073 markings, 2310876 edges, 4846 markings/sec, 225 secs
lola: sara is running 230 secs || 1160262 markings, 2362219 edges, 4838 markings/sec, 230 secs
lola: sara is running 235 secs || 1184381 markings, 2413471 edges, 4824 markings/sec, 235 secs
lola: sara is running 240 secs || 1208512 markings, 2464600 edges, 4826 markings/sec, 240 secs
lola: sara is running 245 secs || 1232616 markings, 2508679 edges, 4821 markings/sec, 245 secs
lola: sara is running 250 secs || 1256601 markings, 2559666 edges, 4797 markings/sec, 250 secs
lola: sara is running 255 secs || 1280631 markings, 2610661 edges, 4806 markings/sec, 255 secs
lola: sara is running 260 secs || 1304715 markings, 2654701 edges, 4817 markings/sec, 260 secs
lola: sara is running 265 secs || 1328779 markings, 2705796 edges, 4813 markings/sec, 265 secs
lola: sara is running 270 secs || 1352743 markings, 2756717 edges, 4793 markings/sec, 270 secs
lola: sara is running 275 secs || 1376777 markings, 2807730 edges, 4807 markings/sec, 275 secs
lola: sara is running 280 secs || 1400984 markings, 2851978 edges, 4841 markings/sec, 280 secs
lola: sara is running 285 secs || 1424914 markings, 2902900 edges, 4786 markings/sec, 285 secs
lola: sara is running 290 secs || 1448732 markings, 2953499 edges, 4764 markings/sec, 290 secs
lola: sara is running 295 secs || 1472808 markings, 2997584 edges, 4815 markings/sec, 295 secs
lola: sara is running 300 secs || 1496761 markings, 3048396 edges, 4791 markings/sec, 300 secs
lola: sara is running 305 secs || 1521392 markings, 3100563 edges, 4926 markings/sec, 305 secs
lola: sara is running 310 secs || 1546227 markings, 3153047 edges, 4967 markings/sec, 310 secs
lola: sara is running 315 secs || 1571170 markings, 3198663 edges, 4989 markings/sec, 315 secs
lola: sara is running 320 secs || 1595983 markings, 3251172 edges, 4963 markings/sec, 320 secs
lola: sara is running 325 secs || 1620789 markings, 3303564 edges, 4961 markings/sec, 325 secs
lola: sara is running 330 secs || 1643762 markings, 3352619 edges, 4595 markings/sec, 330 secs
lola: sara is running 335 secs || 1668636 markings, 3398099 edges, 4975 markings/sec, 335 secs
lola: sara is running 340 secs || 1693745 markings, 3451163 edges, 5022 markings/sec, 340 secs
lola: sara is running 345 secs || 1718816 markings, 3504042 edges, 5014 markings/sec, 345 secs
lola: sara is running 350 secs || 1743886 markings, 3556972 edges, 5014 markings/sec, 350 secs
lola: sara is running 355 secs || 1768022 markings, 3601076 edges, 4827 markings/sec, 355 secs
lola: sara is running 360 secs || 1793035 markings, 3653955 edges, 5003 markings/sec, 360 secs
lola: sara is running 365 secs || 1818013 markings, 3706791 edges, 4996 markings/sec, 365 secs
lola: sara is running 370 secs || 1843173 markings, 3752680 edges, 5032 markings/sec, 370 secs
lola: sara is running 375 secs || 1868191 markings, 3805569 edges, 5004 markings/sec, 375 secs
lola: sara is running 380 secs || 1893160 markings, 3858356 edges, 4994 markings/sec, 380 secs
lola: sara is running 385 secs || 1918107 markings, 3911032 edges, 4989 markings/sec, 385 secs
lola: sara is running 390 secs || 1943229 markings, 3956907 edges, 5024 markings/sec, 390 secs
lola: sara is running 395 secs || 1968208 markings, 4009719 edges, 4996 markings/sec, 395 secs
lola: sara is running 400 secs || 1986386 markings, 4475399 edges, 3636 markings/sec, 400 secs
lola: sara is running 405 secs || 2012512 markings, 4523051 edges, 5225 markings/sec, 405 secs
lola: sara is running 410 secs || 2037472 markings, 4576160 edges, 4992 markings/sec, 410 secs
lola: sara is running 415 secs || 2062015 markings, 4628743 edges, 4909 markings/sec, 415 secs
lola: sara is running 420 secs || 2086749 markings, 4674539 edges, 4947 markings/sec, 420 secs
lola: sara is running 425 secs || 2111351 markings, 4727260 edges, 4920 markings/sec, 425 secs
lola: sara is running 430 secs || 2135873 markings, 4779798 edges, 4904 markings/sec, 430 secs
lola: sara is running 435 secs || 2160380 markings, 4832311 edges, 4901 markings/sec, 435 secs
lola: sara is running 440 secs || 2185040 markings, 4878119 edges, 4932 markings/sec, 440 secs
lola: sara is running 445 secs || 2209538 markings, 4930644 edges, 4900 markings/sec, 445 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is PolyORBNT-COL-S05J60, 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 r131-smll-152673534300283"
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 ;