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 332K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K 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 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 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.9K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 154K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PolyORBLF-COL-S04J06T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-152673534000073
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526891020691


BK_STOP 1526892041021

--------------------
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 PolyORBLF-COL-S04J06T06 as instance name.
Using PolyORBLF 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': 1244395, 'Memory': 15951.98, 'Tool': 'lola'}, {'Time': 2858308, 'Memory': 15943.22, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-COL-S04J06T06...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-COL-S04J06T06: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-COL-S04J06T06: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBLF-COL-S04J06T06 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3808/65536 symbol table entries, 459 collisions
lola: preprocessing...
lola: finding significant places
lola: 618 places, 3190 transitions, 564 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2157 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J06T06-CTLCardinality.task
lola: A ((A (F ((p569 + p570 + p571 + p572 + p573 + p574 <= p103 + p104 + p105 + p106 + p107 + p108))) U (2 <= p615 + p614 + p613 + p612 + p611 + p610))) : (A (G (((p278 <= p344 + p345 + p346 + p347 + p348 + p349) OR (3 <= p121 + p122 + p123 + p124 + p125 + p126) OR ((p386 <= p240) AND (p68 + p69 + p70 + p71 + p72 + p73 + p74 <= p278))))) AND NOT(E (G ((p202 + p203 + p204 + p205 + p206 + p207 <= p16))))) : E (((p17 + p18 + p19 + p20 + p21 + p22 <= 0) U ((2 <= p23 + p24 + p25 + p26 + p27 + p28) AND (3 <= p327 + p328 + p329 + p330 + p331 + p332) AND (p358 + p359 + p360 + p362 + p363 + p364 + p366 + p367 + p368 + p370 + p371 + p372 + p374 + p375 + p376 + p378 + p379 + p380 + p382 + p383 + p384 + p385 + p381 + p377 + p373 + p369 + p365 + p361 + 1 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150)))) : E (F (A (X (((1 <= p581) AND (1 <= p95 + p94 + p93 + p92 + p91 + p96)))))) : (NOT(E (G ((p83 + p82 + p81 + p80 + p79 + p84 <= p115 + p116 + p117 + p118 + p119 + p120)))) AND (NOT(E (G ((1 <= p449 + p450 + p451 + p452 + p453 + p454)))) OR ((p588 + p589 + p590 + p591 + p592 + p593 <= p581) AND ((2 <= p100 + p101 + p102 + p98 + p97 + p99) OR (p13 <= p575 + p576 + p577 + p578 + p579 + p580)) AND (p59 <= 2) AND (p411 + p412 + p413 + p414 + p415 + p416 + 1 <= p417)))) : NOT(((A (F ((p16 <= p327 + p328 + p329 + p330 + p331 + p332))) AND E (G ((p103 + p104 + p105 + p106 + p107 + p108 <= p337 + p338 + p339 + p340 + p341 + p342)))) AND (p615 + p614 + p613 + p612 + p611 + p610 <= p455))) : (NOT(E (F (((2 <= p569 + p570 + p571 + p572 + p573 + p574) OR (1 <= p431 + p432 + p433 + p434 + p435 + p436))))) OR (((p278 <= p581) OR ((2 <= p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568) AND (p594 + p595 + p596 + p597 <= 1))) AND E (((1 <= p59) U (p109 + p110 + p111 + p112 + p113 + p114 <= p617))))) : A (F (A (((p60 + p61 + p62 + p63 + p64 + p65 <= p100 + p101 + p102 + p98 + p97 + p99) U (1 <= p241 + p242 + p243 + p244 + p245 + p246 + p247))))) : A (F (((3 <= p121 + p122 + p123 + p124 + p125 + p126) AND (2 <= p343)))) : (((3 <= p456) AND (p241 + p242 + p243 + p244 + p245 + p246 + p247 <= p333 + p334 + p335 + p336)) AND (E (F (((p0 <= p417) AND (p23 + p24 + p25 + p26 + p27 + p28 <= p29 + p30 + p31 + p32 + p33 + p34)))) AND E (F ((p457 + p458 + p459 + p460 + 1 <= p337 + p338 + p339 + p340 + p341 + p342))))) : A (G (((((p115 + p116 + p117 + p118 + p119 + p120 <= p457 + p458 + p459 + p460) OR (2 <= p59)) AND (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 <= 1)) OR (p418 + p419 + p420 + p421 + p422 + p423 + p424 <= 0)))) : A ((E (G ((p431 + p432 + p433 + p434 + p435 + p436 <= p457 + p458 + p459 + p460))) U ((p357 <= 0) AND (p0 + 1 <= p357)))) : (E (G (((p95 + p94 + p93 + p92 + p91 + p96 <= p66) OR (p455 + 1 <= p343)))) AND E (F (A (F ((1 <= p254 + p255 + p256 + p257 + p258 + p259)))))) : (A (G (((p7 + p8 + p9 + p10 + p11 + p12 + 1 <= p75 + p76 + p77 + p78) OR (p240 <= 1)))) AND (p266 + p267 + p268 + p269 + p270 + p271 <= p386)) : E ((((p14 + 1 <= p337 + p338 + p339 + p340 + p341 + p342) OR (p337 + p338 + p339 + p340 + p341 + p342 + 1 <= p109 + p110 + p111 + p112 + p113 + p114)) U A (G ((3 <= p208))))) : A (F (A (F ((2 <= p29 + p30 + p31 + p32 + p33 + p34)))))
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 ((A (F ((p569 + p570 + p571 + p572 + p573 + p574 <= p103 + p104 + p105 + p106 + p107 + p108))) U (2 <= p615 + p614 + p613 + p612 + p611 + p610)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (p569 + p570 + p571 + p572 + p573 + p574 <= p103 + p104 + p105 + p106 + p107 + p108)) U (2 <= p615 + p614 + p613 + p612 + p611 + p610))
lola: processed formula length: 146
lola: 2 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2256 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: 843 markings, 1589 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p278 <= p344 + p345 + p346 + p347 + p348 + p349) OR (3 <= p121 + p122 + p123 + p124 + p125 + p126) OR ((p386 <= p240) AND (p68 + p69 + p70 + p71 + p72 + p73 + p74 <= p278))))) AND NOT(E (G ((p202 + p203 + p204 + p205 + p206 + p207 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p278 <= p344 + p345 + p346 + p347 + p348 + p349) OR (3 <= p121 + p122 + p123 + p124 + p125 + p126) OR ((p386 <= p240) AND (p68 + p69 + p70 + p71 + p72 + p73 + p74 <= p278)))))
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 2256 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 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p17 + p18 + p19 + p20 + p21 + p22 <= 0) U ((2 <= p23 + p24 + p25 + p26 + p27 + p28) AND (3 <= p327 + p328 + p329 + p330 + p331 + p332) AND (p358 + p359 + p360 + p362 + p363 + p364 + p366 + p367 + p368 + p370 + p371 + p372 + p374 + p375 + p376 + p378 + p379 + p380 + p382 + p383 + p384 + p385 + p381 + p377 + p373 + p369 + p365 + p361 + 1 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p17 + p18 + p19 + p20 + p21 + p22 <= 0) U ((2 <= p23 + p24 + p25 + p26 + p27 + p28) AND (3 <= p327 + p328 + p329 + p330 + p331 + p332) AND (p358 + p359 + p360 + p362 + p363 + p364 + p366 + p367 + p368 + p370 + p371 + p372 + p374 + p375 + p376 + p378 + p379 + p380 + p382 + p383 + p384 + p385 + p381 + p377 + p373 + p369 + p365 + p361 + 1 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + ... (shortened)
lola: processed formula length: 512
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2256 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: 671321 markings, 1174719 edges, 3225752436249460736 markings/sec, 0 secs
lola: 1133566 markings, 2566562 edges, 92449 markings/sec, 5 secs
lola: 1719647 markings, 3862820 edges, 117216 markings/sec, 10 secs
lola: 2223683 markings, 5187858 edges, 100807 markings/sec, 15 secs
lola: 2688737 markings, 6524653 edges, 93011 markings/sec, 20 secs
lola: 3175921 markings, 7877433 edges, 97437 markings/sec, 25 secs
lola: 3702796 markings, 9159805 edges, 105375 markings/sec, 30 secs
lola: 4202685 markings, 10440235 edges, 99978 markings/sec, 35 secs
lola: 4706389 markings, 11702635 edges, 100741 markings/sec, 40 secs
lola: 5210081 markings, 12939538 edges, 100738 markings/sec, 45 secs
lola: 5695312 markings, 14173918 edges, 97046 markings/sec, 50 secs
lola: 6182511 markings, 15401204 edges, 97440 markings/sec, 55 secs
lola: 6675607 markings, 16600376 edges, 98619 markings/sec, 60 secs
lola: 7147325 markings, 17812541 edges, 94344 markings/sec, 65 secs
lola: 7494359 markings, 18919072 edges, 69407 markings/sec, 70 secs
lola: 7969142 markings, 20155344 edges, 94957 markings/sec, 75 secs
lola: 8519075 markings, 21363185 edges, 109987 markings/sec, 80 secs
lola: 9084042 markings, 22551480 edges, 112993 markings/sec, 85 secs
lola: 9582298 markings, 23828881 edges, 99651 markings/sec, 90 secs
lola: 10050076 markings, 25097240 edges, 93556 markings/sec, 95 secs
lola: 10530577 markings, 26365938 edges, 96100 markings/sec, 100 secs
lola: 10975921 markings, 27648571 edges, 89069 markings/sec, 105 secs
lola: 11468268 markings, 28898813 edges, 98469 markings/sec, 110 secs
lola: 11965063 markings, 30112291 edges, 99359 markings/sec, 115 secs
lola: 12425370 markings, 31296203 edges, 92061 markings/sec, 120 secs
lola: 12908771 markings, 32509739 edges, 96680 markings/sec, 125 secs
lola: 13395097 markings, 33703531 edges, 97265 markings/sec, 130 secs
lola: 13865630 markings, 34899288 edges, 94107 markings/sec, 135 secs
lola: 14340035 markings, 36082500 edges, 94881 markings/sec, 140 secs
lola: 14801689 markings, 37252996 edges, 92331 markings/sec, 145 secs
lola: 15275876 markings, 38426639 edges, 94837 markings/sec, 150 secs
lola: 15673111 markings, 39649212 edges, 79447 markings/sec, 155 secs
lola: 15794462 markings, 39970585 edges, 24270 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 259 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p581) AND (1 <= p95 + p94 + p93 + p92 + p91 + p96))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(((1 <= p581) AND (1 <= p95 + p94 + p93 + p92 + p91 + p96))))
lola: processed formula length: 72
lola: 2 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2256 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G ((p83 + p82 + p81 + p80 + p79 + p84 <= p115 + p116 + p117 + p118 + p119 + p120)))) AND (NOT(E (G ((1 <= p449 + p450 + p451 + p452 + p453 + p454)))) OR ((p588 + p589 + p590 + p591 + p592 + p593 <= p581) AND ((2 <= p100 + p101 + p102 + p98 + p97 + p99) OR (p13 <= p575 + p576 + p577 + p578 + p579 + p580)) AND (p59 <= 2) AND (p411 + p412 + p413 + p414 + p415 + p416 + 1 <= p417))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p115 + p116 + p117 + p118 + p119 + p120 + 1 <= p83 + p82 + p81 + p80 + p79 + p84)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p115 + p116 + p117 + p118 + p119 + p120 + 1 <= p83 + p82 + p81 + p80 + p79 + p84)))
lola: processed formula: A (F ((p115 + p116 + p117 + p118 + p119 + p120 + 1 <= p83 + p82 + p81 + p80 + p79 + p84)))
lola: processed formula length: 90
lola: 6 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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: 23448 markings, 27584 edges, 4690 markings/sec, 0 secs
lola: 45111 markings, 50824 edges, 4333 markings/sec, 5 secs
lola: 65811 markings, 73824 edges, 4140 markings/sec, 10 secs
lola: 86879 markings, 97455 edges, 4214 markings/sec, 15 secs
lola: 107590 markings, 120794 edges, 4142 markings/sec, 20 secs
lola: 129913 markings, 145265 edges, 4465 markings/sec, 25 secs
lola: 153367 markings, 170426 edges, 4691 markings/sec, 30 secs
lola: 177012 markings, 195756 edges, 4729 markings/sec, 35 secs
lola: 199387 markings, 224506 edges, 4475 markings/sec, 40 secs
lola: 221823 markings, 254585 edges, 4487 markings/sec, 45 secs
lola: 247701 markings, 282499 edges, 5176 markings/sec, 50 secs
lola: 267562 markings, 305319 edges, 3972 markings/sec, 55 secs
lola: 287011 markings, 328122 edges, 3890 markings/sec, 60 secs
lola: 306682 markings, 351421 edges, 3934 markings/sec, 65 secs
lola: 326907 markings, 374914 edges, 4045 markings/sec, 70 secs
lola: 349152 markings, 399495 edges, 4449 markings/sec, 75 secs
lola: 371704 markings, 424233 edges, 4510 markings/sec, 80 secs
lola: 393184 markings, 448438 edges, 4296 markings/sec, 85 secs
lola: 414849 markings, 478132 edges, 4333 markings/sec, 90 secs
lola: 437812 markings, 508182 edges, 4593 markings/sec, 95 secs
lola: 457547 markings, 531519 edges, 3947 markings/sec, 100 secs
lola: 478810 markings, 555923 edges, 4253 markings/sec, 105 secs
lola: 500449 markings, 580367 edges, 4328 markings/sec, 110 secs
lola: 521500 markings, 608800 edges, 4210 markings/sec, 115 secs
lola: 543032 markings, 639438 edges, 4306 markings/sec, 120 secs
lola: 563644 markings, 665431 edges, 4122 markings/sec, 125 secs
lola: 585119 markings, 696445 edges, 4295 markings/sec, 130 secs
lola: 608670 markings, 725446 edges, 4710 markings/sec, 135 secs
lola: 629616 markings, 748777 edges, 4189 markings/sec, 140 secs
lola: 650512 markings, 772500 edges, 4179 markings/sec, 145 secs
lola: 672851 markings, 797342 edges, 4468 markings/sec, 150 secs
lola: 695829 markings, 822449 edges, 4596 markings/sec, 155 secs
lola: 717282 markings, 852979 edges, 4291 markings/sec, 160 secs
lola: 740089 markings, 881597 edges, 4561 markings/sec, 165 secs
lola: 759567 markings, 904977 edges, 3896 markings/sec, 170 secs
lola: 780743 markings, 929325 edges, 4235 markings/sec, 175 secs
lola: 802068 markings, 953892 edges, 4265 markings/sec, 180 secs
lola: 823307 markings, 984836 edges, 4248 markings/sec, 185 secs
lola: 844016 markings, 1012203 edges, 4142 markings/sec, 190 secs
lola: 864917 markings, 1041869 edges, 4180 markings/sec, 195 secs
lola: 887051 markings, 1072556 edges, 4427 markings/sec, 200 secs
lola: 907992 markings, 1096663 edges, 4188 markings/sec, 205 secs
lola: 929876 markings, 1121531 edges, 4377 markings/sec, 210 secs
lola: 950592 markings, 1152219 edges, 4143 markings/sec, 215 secs
lola: 970916 markings, 1179176 edges, 4065 markings/sec, 220 secs
lola: 991779 markings, 1209562 edges, 4173 markings/sec, 225 secs
lola: 1013289 markings, 1239389 edges, 4302 markings/sec, 230 secs
lola: 1033910 markings, 1268358 edges, 4124 markings/sec, 235 secs
lola: 1055858 markings, 1299786 edges, 4390 markings/sec, 240 secs
lola: 1079827 markings, 1327275 edges, 4794 markings/sec, 245 secs
lola: 1100714 markings, 1350111 edges, 4177 markings/sec, 250 secs
lola: 1121287 markings, 1372994 edges, 4115 markings/sec, 255 secs
lola: 1141997 markings, 1396232 edges, 4142 markings/sec, 260 secs
lola: 1162584 markings, 1419551 edges, 4117 markings/sec, 265 secs
lola: 1185644 markings, 1444524 edges, 4612 markings/sec, 270 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (F ((p16 <= p327 + p328 + p329 + p330 + p331 + p332))) AND E (G ((p103 + p104 + p105 + p106 + p107 + p108 <= p337 + p338 + p339 + p340 + p341 + p342)))) AND (p615 + p614 + p613 + p612 + p611 + p610 <= p455)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p327 + p328 + p329 + p330 + p331 + p332 + 1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p16 <= p327 + p328 + p329 + p330 + p331 + p332)))
lola: processed formula length: 63
lola: 12 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2256 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: 545208 markings, 1128026 edges, 109042 markings/sec, 0 secs
lola: 1049513 markings, 2419437 edges, 100861 markings/sec, 5 secs
lola: 1480268 markings, 3851276 edges, 86151 markings/sec, 10 secs
lola: 1960889 markings, 5124967 edges, 96124 markings/sec, 15 secs
lola: 2414177 markings, 6439190 edges, 90658 markings/sec, 20 secs
lola: 2818849 markings, 7754731 edges, 80934 markings/sec, 25 secs
lola: 3237960 markings, 9075654 edges, 83822 markings/sec, 30 secs
lola: 3639210 markings, 10420591 edges, 80250 markings/sec, 35 secs
lola: 4032094 markings, 11768025 edges, 78577 markings/sec, 40 secs
lola: 4467366 markings, 13108960 edges, 87054 markings/sec, 45 secs
lola: 4895049 markings, 14420647 edges, 85537 markings/sec, 50 secs
lola: 5344475 markings, 15692010 edges, 89885 markings/sec, 55 secs
lola: 5762535 markings, 16987021 edges, 83612 markings/sec, 60 secs
lola: 6189035 markings, 18245296 edges, 85300 markings/sec, 65 secs
lola: 6604655 markings, 19514137 edges, 83124 markings/sec, 70 secs
lola: 7011730 markings, 20771326 edges, 81415 markings/sec, 75 secs
lola: 7444045 markings, 22002580 edges, 86463 markings/sec, 80 secs
lola: 7848971 markings, 23247841 edges, 80985 markings/sec, 85 secs
lola: 8266810 markings, 24472987 edges, 83568 markings/sec, 90 secs
lola: 8671249 markings, 25709197 edges, 80888 markings/sec, 95 secs
lola: 9067077 markings, 26933160 edges, 79166 markings/sec, 100 secs
lola: 9488868 markings, 28134119 edges, 84358 markings/sec, 105 secs
lola: 9885646 markings, 29348745 edges, 79356 markings/sec, 110 secs
lola: 10221216 markings, 30656065 edges, 67114 markings/sec, 115 secs
lola: 10609106 markings, 31975333 edges, 77578 markings/sec, 120 secs
lola: 10996961 markings, 33209062 edges, 77571 markings/sec, 125 secs
lola: 11430911 markings, 34394941 edges, 86790 markings/sec, 130 secs
lola: 11966085 markings, 35512425 edges, 107035 markings/sec, 135 secs
lola: 12411009 markings, 36825178 edges, 88985 markings/sec, 140 secs
lola: 12809896 markings, 38170292 edges, 79777 markings/sec, 145 secs
lola: 13294266 markings, 39341704 edges, 96874 markings/sec, 150 secs
lola: 13703079 markings, 40641850 edges, 81763 markings/sec, 155 secs
lola: 14117086 markings, 41905236 edges, 82801 markings/sec, 160 secs
lola: 14506182 markings, 43205269 edges, 77819 markings/sec, 165 secs
lola: 14889883 markings, 44489603 edges, 76740 markings/sec, 170 secs
lola: 15269366 markings, 45762700 edges, 75897 markings/sec, 175 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: ''
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((2 <= p569 + p570 + p571 + p572 + p573 + p574) OR (1 <= p431 + p432 + p433 + p434 + p435 + p436))))) OR (((p278 <= p581) OR ((2 <= p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568) AND (p594 + p595 + p596 + p597 <= 1))) AND E (((1 <= p59) U (p109 + p110 + p111 + p112 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p569 + p570 + p571 + p572 + p573 + p574 <= 1) AND (p431 + p432 + p433 + p434 + p435 + p436 <= 0))))
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 2256 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 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S04J06T06-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 89 markings, 88 edges
lola: ========================================
lola: subprocess 7 will run for 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p278 <= p581) OR ((2 <= p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568) AND (p594 + p595 + p596 + p597 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p278 <= p581) OR ((2 <= p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568) AND (p594 + p595 + p596 + p597 <= 1)))
lola: processed formula length: 232
lola: 3 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-CTLCardinality.task
lola: processed formula with 3 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 7 will run for 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((p60 + p61 + p62 + p63 + p64 + p65 <= p100 + p101 + p102 + p98 + p97 + p99) U (1 <= p241 + p242 + p243 + p244 + p245 + p246 + p247)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((p60 + p61 + p62 + p63 + p64 + p65 <= p100 + p101 + p102 + p98 + p97 + p99) U (1 <= p241 + p242 + p243 + p244 + p245 + p246 + p247)))
lola: processed formula length: 144
lola: 2 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2256 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: 496576 markings, 1486503 edges, 3067839751634550784 markings/sec, 0 secs
lola: 998568 markings, 2991680 edges, 100398 markings/sec, 5 secs
lola: 1517461 markings, 4397763 edges, 103779 markings/sec, 10 secs
lola: 1991449 markings, 5799229 edges, 94798 markings/sec, 15 secs
lola: 2402174 markings, 7283763 edges, 82145 markings/sec, 20 secs
lola: 2877472 markings, 8765114 edges, 95060 markings/sec, 25 secs
lola: 3342696 markings, 10236616 edges, 93045 markings/sec, 30 secs
lola: 3856252 markings, 11620645 edges, 102711 markings/sec, 35 secs
lola: 4361125 markings, 12955915 edges, 100975 markings/sec, 40 secs
lola: 4748368 markings, 14402868 edges, 77449 markings/sec, 45 secs
lola: 5178192 markings, 15815290 edges, 85965 markings/sec, 50 secs
lola: 5609763 markings, 17261112 edges, 86314 markings/sec, 55 secs
lola: 6111682 markings, 18614461 edges, 100384 markings/sec, 60 secs
lola: 6611775 markings, 19936797 edges, 100019 markings/sec, 65 secs
lola: 7026425 markings, 21300722 edges, 82930 markings/sec, 70 secs
lola: 7398202 markings, 22676665 edges, 74355 markings/sec, 75 secs
lola: 7860256 markings, 24061669 edges, 92411 markings/sec, 80 secs
lola: 8304885 markings, 25438749 edges, 88926 markings/sec, 85 secs
lola: 8786656 markings, 26739245 edges, 96354 markings/sec, 90 secs
lola: 9271336 markings, 28022263 edges, 96936 markings/sec, 95 secs
lola: 9637276 markings, 29377872 edges, 73188 markings/sec, 100 secs
lola: 10034762 markings, 30723831 edges, 79497 markings/sec, 105 secs
lola: 10463194 markings, 32089334 edges, 85686 markings/sec, 110 secs
lola: 10926471 markings, 33412615 edges, 92655 markings/sec, 115 secs
lola: 11394015 markings, 34677985 edges, 93509 markings/sec, 120 secs
lola: 11838729 markings, 35956369 edges, 88943 markings/sec, 125 secs
lola: 12200276 markings, 37286741 edges, 72309 markings/sec, 130 secs
lola: 12615155 markings, 38611313 edges, 82976 markings/sec, 135 secs
lola: 13019031 markings, 39976846 edges, 80775 markings/sec, 140 secs
lola: 13492622 markings, 41259101 edges, 94718 markings/sec, 145 secs
lola: 13958027 markings, 42495873 edges, 93081 markings/sec, 150 secs
lola: 14366383 markings, 43774411 edges, 81671 markings/sec, 155 secs
lola: 14729238 markings, 45070425 edges, 72571 markings/sec, 160 secs
lola: 15143990 markings, 46393282 edges, 82950 markings/sec, 165 secs
lola: 15557039 markings, 47728832 edges, 82610 markings/sec, 170 secs
lola: 16027453 markings, 48978199 edges, 94083 markings/sec, 175 secs
lola: 16472220 markings, 50168154 edges, 88953 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 339 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= p121 + p122 + p123 + p124 + p125 + p126) AND (2 <= p343))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= p121 + p122 + p123 + p124 + p125 + p126) AND (2 <= p343))))
lola: processed formula: A (F (((3 <= p121 + p122 + p123 + p124 + p125 + p126) AND (2 <= p343))))
lola: processed formula length: 72
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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: 953 markings, 953 edges
lola: ========================================
lola: subprocess 9 will run for 387 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= p456) AND (p241 + p242 + p243 + p244 + p245 + p246 + p247 <= p333 + p334 + p335 + p336)) AND (E (F (((p0 <= p417) AND (p23 + p24 + p25 + p26 + p27 + p28 <= p29 + p30 + p31 + p32 + p33 + p34)))) AND E (F ((p457 + p458 + p459 + p460 + 1 <= p337 + p338 + p339 + p340 + p341 + p342)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 387 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p456) AND (p241 + p242 + p243 + p244 + p245 + p246 + p247 <= p333 + p334 + p335 + p336))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p456) AND (p241 + p242 + p243 + p244 + p245 + p246 + p247 <= p333 + p334 + p335 + p336))
lola: processed formula length: 95
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-CTLCardinality.task
lola: processed formula with 2 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 452 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 <= p417) AND (p23 + p24 + p25 + p26 + p27 + p28 <= p29 + p30 + p31 + p32 + p33 + p34))))
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 2256 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 PolyORBLF-COL-S04J06T06-CTLCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 11 will run for 542 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p457 + p458 + p459 + p460 + 1 <= p337 + p338 + p339 + p340 + p341 + p342)))
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 2256 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 PolyORBLF-COL-S04J06T06-CTLCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 105 markings, 104 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 452 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p115 + p116 + p117 + p118 + p119 + p120 <= p457 + p458 + p459 + p460) OR (2 <= p59)) AND (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 <= 1)) ... (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 2256 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S04J06T06-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T06-CTLCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 132 markings, 131 edges
lola: ========================================
lola: subprocess 11 will run for 542 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((p431 + p432 + p433 + p434 + p435 + p436 <= p457 + p458 + p459 + p460))) U ((p357 <= 0) AND (p0 + 1 <= p357))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U (p457 + p458 + p459 + p460 + 1 <= p431 + p432 + p433 + p434 + p435 + p436))) U ((p357 <= 0) AND (p0 + 1 <= p357)))
lola: processed formula length: 129
lola: 3 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2256 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: 551616 markings, 1025014 edges, 3067839476756643840 markings/sec, 0 secs
lola: 1097972 markings, 2056133 edges, 109271 markings/sec, 5 secs
lola: 1498191 markings, 3351647 edges, 80044 markings/sec, 10 secs
lola: 1880333 markings, 4670075 edges, 76428 markings/sec, 15 secs
lola: 2384301 markings, 5694145 edges, 100794 markings/sec, 20 secs
lola: 2806151 markings, 6977075 edges, 84370 markings/sec, 25 secs
lola: 3227714 markings, 8247335 edges, 84313 markings/sec, 30 secs
lola: 3640025 markings, 9533773 edges, 82462 markings/sec, 35 secs
lola: 4036644 markings, 10810163 edges, 79324 markings/sec, 40 secs
lola: 4403356 markings, 12118942 edges, 73342 markings/sec, 45 secs
lola: 4849816 markings, 13358097 edges, 89292 markings/sec, 50 secs
lola: 5269602 markings, 14596783 edges, 83957 markings/sec, 55 secs
lola: 5701148 markings, 15813907 edges, 86309 markings/sec, 60 secs
lola: 6115969 markings, 17062126 edges, 82964 markings/sec, 65 secs
lola: 6526161 markings, 18313736 edges, 82038 markings/sec, 70 secs
lola: 6967484 markings, 19525226 edges, 88265 markings/sec, 75 secs
lola: 7378890 markings, 20757407 edges, 82281 markings/sec, 80 secs
lola: 7767907 markings, 21852105 edges, 77803 markings/sec, 85 secs
lola: 8163909 markings, 23050348 edges, 79200 markings/sec, 90 secs
lola: 8568705 markings, 24245969 edges, 80959 markings/sec, 95 secs
lola: 8988199 markings, 25406707 edges, 83899 markings/sec, 100 secs
lola: 9376622 markings, 26610456 edges, 77685 markings/sec, 105 secs
lola: 9763265 markings, 27792986 edges, 77329 markings/sec, 110 secs
lola: 10186118 markings, 28947263 edges, 84571 markings/sec, 115 secs
lola: 10579450 markings, 30121984 edges, 78666 markings/sec, 120 secs
lola: 10915769 markings, 31379199 edges, 67264 markings/sec, 125 secs
lola: 11283810 markings, 32686580 edges, 73608 markings/sec, 130 secs
lola: 11666235 markings, 33901435 edges, 76485 markings/sec, 135 secs
lola: 12079597 markings, 35053547 edges, 82672 markings/sec, 140 secs
lola: 12622667 markings, 36099476 edges, 108614 markings/sec, 145 secs
lola: 13108782 markings, 37218061 edges, 97223 markings/sec, 150 secs
lola: 13510733 markings, 38540337 edges, 80390 markings/sec, 155 secs
lola: 13935850 markings, 39773097 edges, 85023 markings/sec, 160 secs
lola: 14421740 markings, 40861898 edges, 97178 markings/sec, 165 secs
lola: 14800644 markings, 42167982 edges, 75781 markings/sec, 170 secs
lola: 15235637 markings, 43328087 edges, 86999 markings/sec, 175 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: '\ufffd'
Aborted (core dumped)
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-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="PolyORBLF-COL-S04J06T06"
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/PolyORBLF-COL-S04J06T06.tgz
mv PolyORBLF-COL-S04J06T06 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 PolyORBLF-COL-S04J06T06, 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-152673534000073"
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 ;