About the Execution of Irma.full for PolyORBLF-COL-S04J06T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15919.210 | 957138.00 | 903509.00 | 5050.90 | ???????????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 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 irma4mcc-full
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 r126-smll-152673528300073
=====================================================================
--------------------
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 1526812416323
BK_STOP 1526813373461
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using 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 @ 3540 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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 ((p336 + p337 + p338 + p339 + p340 + p341 <= p41 + p42 + p43 + p44 + p45 + p46))) U (2 <= p10 + p11 + p12 + p13 + p14 + p15))) : (A (G (((p166 <= p302 + p303 + p304 + p305 + p306 + p307) OR (3 <= p509 + p510 + p511 + p512 + p513 + p514) OR ((p348 <= p603) AND (p316 + p317 + p318 + p319 + p320 + p321 + p322 <= p166))))) AND NOT(E (G ((p378 + p379 + p380 + p381 + p382 + p383 <= p314))))) : E (((p342 + p343 + p344 + p345 + p346 + p347 <= 0) U ((2 <= p460 + p461 + p462 + p463 + p464 + p465) AND (3 <= p308 + p309 + p310 + p311 + p312 + p313) AND (p100 + p101 + p102 + p103 + p104 + p105 + p94 + p92 + p91 + p90 + p88 + p87 + p86 + p84 + p83 + p82 + p80 + p79 + p78 + p81 + p85 + p89 + p93 + p95 + p96 + p97 + p98 + p99 + 1 <= p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508)))) : E (F (A (X (((1 <= p602) AND (1 <= p472 + p473 + p474 + p475 + p476 + p477)))))) : (NOT(E (G ((p76 + p75 + p74 + p73 + p72 + p77 <= p266 + p267 + p268 + p269 + p270 + p271)))) AND (NOT(E (G ((1 <= p233 + p234 + p235 + p236 + p237 + p238)))) OR ((p118 + p119 + p120 + p121 + p122 + p123 <= p602) AND ((2 <= p179 + p180 + p181 + p182 + p183 + p184) OR (p245 <= p357 + p358 + p359 + p360 + p361 + p362)) AND (p604 <= 2) AND (p167 + p168 + p169 + p170 + p171 + p172 + 1 <= p40)))) : NOT(((A (F ((p314 <= p308 + p309 + p310 + p311 + p312 + p313))) AND E (G ((p41 + p42 + p43 + p44 + p45 + p46 <= p479 + p480 + p481 + p482 + p483 + p484)))) AND (p10 + p11 + p12 + p13 + p14 + p15 <= p65))) : (NOT(E (F (((2 <= p336 + p337 + p338 + p339 + p340 + p341) OR (1 <= p589 + p590 + p591 + p592 + p593 + p594))))) OR (((p166 <= p602) OR ((2 <= p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295) AND (p614 + p615 + p616 + p617 <= 1))) AND E (((1 <= p604) U (p47 + p48 + p49 + p50 + p51 + p52 <= p595))))) : A (F (A (((p389 + p388 + p387 + p386 + p385 + p384 <= p179 + p180 + p181 + p182 + p183 + p184) U (1 <= p246 + p247 + p248 + p249 + p250 + p251 + p252))))) : A (F (((3 <= p509 + p510 + p511 + p512 + p513 + p514) AND (2 <= p9)))) : (((3 <= p7) AND (p246 + p247 + p248 + p249 + p250 + p251 + p252 <= p432 + p433 + p434 + p435)) AND (E (F (((p315 <= p40) AND (p460 + p461 + p462 + p463 + p464 + p465 <= p57 + p56 + p55 + p54 + p53 + p58)))) AND E (F ((p610 + p611 + p612 + p613 + 1 <= p479 + p480 + p481 + p482 + p483 + p484))))) : A (G (((((p266 + p267 + p268 + p269 + p270 + p271 <= p610 + p611 + p612 + p613) OR (2 <= p604)) AND (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 + p578 + p579 + p586 + p585 + p584 + p583 + p582 + p581 + p580 <= 1)) OR (p363 + p364 + p365 + p366 + p367 + p368 + p369 <= 0)))) : A ((E (G ((p589 + p590 + p591 + p592 + p593 + p594 <= p610 + p611 + p612 + p613))) U ((p265 <= 0) AND (p315 + 1 <= p265)))) : (E (G (((p472 + p473 + p474 + p475 + p476 + p477 <= p587) OR (p65 + 1 <= p9)))) AND E (F (A (F ((1 <= p372 + p373 + p374 + p375 + p376 + p377)))))) : (A (G (((p466 + p467 + p468 + p469 + p470 + p471 + 1 <= p608 + p607 + p606 + p605) OR (p603 <= 1)))) AND (p112 + p113 + p114 + p115 + p116 + p117 <= p348)) : E ((((p349 + 1 <= p479 + p480 + p481 + p482 + p483 + p484) OR (p479 + p480 + p481 + p482 + p483 + p484 + 1 <= p47 + p48 + p49 + p50 + p51 + p52)) U A (G ((3 <= p371))))) : A (F (A (F ((2 <= p57 + p56 + p55 + p54 + p53 + p58)))))
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 ((p336 + p337 + p338 + p339 + p340 + p341 <= p41 + p42 + p43 + p44 + p45 + p46))) U (2 <= p10 + p11 + p12 + p13 + p14 + p15)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (p336 + p337 + p338 + p339 + p340 + p341 <= p41 + p42 + p43 + p44 + p45 + p46)) U (2 <= p10 + p11 + p12 + p13 + p14 + p15))
lola: processed formula length: 134
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: 924 markings, 1848 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p166 <= p302 + p303 + p304 + p305 + p306 + p307) OR (3 <= p509 + p510 + p511 + p512 + p513 + p514) OR ((p348 <= p603) AND (p316 + p317 + p318 + p319 + p320 + p321 + p322 <= p166))))) AND NOT(E (G ((p378 + p379 + p380 + p381 + p382 + p383 <= p314)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p166 <= p302 + p303 + p304 + p305 + p306 + p307) OR (3 <= p509 + p510 + p511 + p512 + p513 + p514) OR ((p348 <= p603) AND (p316 + p317 + p318 + p319 + p320 + p321 + p322 <= p166)))))
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: 25 markings, 24 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 (((p342 + p343 + p344 + p345 + p346 + p347 <= 0) U ((2 <= p460 + p461 + p462 + p463 + p464 + p465) AND (3 <= p308 + p309 + p310 + p311 + p312 + p313) AND (p100 + p101 + p102 + p103 + p104 + p105 + p94 + p92 + p91 + p90 + p88 + p87 + p86 + p84 + p83 + p82 + p80 + p79 + p78 + p81 + p85 + p89 + p93 + p95 + p96 + p97 + p98 + p99 + 1 <= p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p342 + p343 + p344 + p345 + p346 + p347 <= 0) U ((2 <= p460 + p461 + p462 + p463 + p464 + p465) AND (3 <= p308 + p309 + p310 + p311 + p312 + p313) AND (p100 + p101 + p102 + p103 + p104 + p105 + p94 + p92 + p91 + p90 + p88 + p87 + p86 + p84 + p83 + p82 + p80 + p79 + p78 + p81 + p85 + p89 + p93 + p95 + p96 + p97 + p98 + p99 + 1 <= p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p49... (shortened)
lola: processed formula length: 502
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: 578884 markings, 1387305 edges, 2994362413207257088 markings/sec, 0 secs
lola: 1115252 markings, 2756468 edges, 107274 markings/sec, 5 secs
lola: 1680807 markings, 4136808 edges, 113111 markings/sec, 10 secs
lola: 2240556 markings, 5488312 edges, 111950 markings/sec, 15 secs
lola: 2792461 markings, 6891705 edges, 110381 markings/sec, 20 secs
lola: 3358020 markings, 8265516 edges, 113112 markings/sec, 25 secs
lola: 3889360 markings, 9629526 edges, 106268 markings/sec, 30 secs
lola: 4433543 markings, 10936745 edges, 108837 markings/sec, 35 secs
lola: 4953007 markings, 12272001 edges, 103893 markings/sec, 40 secs
lola: 5483929 markings, 13563782 edges, 106184 markings/sec, 45 secs
lola: 5997143 markings, 14874899 edges, 102643 markings/sec, 50 secs
lola: 6539340 markings, 16188028 edges, 108439 markings/sec, 55 secs
lola: 7074988 markings, 17488275 edges, 107130 markings/sec, 60 secs
lola: 7478366 markings, 18919564 edges, 80676 markings/sec, 65 secs
lola: 7996427 markings, 20262457 edges, 103612 markings/sec, 70 secs
lola: 8520267 markings, 21586667 edges, 104768 markings/sec, 75 secs
lola: 9055593 markings, 22886305 edges, 107065 markings/sec, 80 secs
lola: 9577327 markings, 24214021 edges, 104347 markings/sec, 85 secs
lola: 10121652 markings, 25536824 edges, 108865 markings/sec, 90 secs
lola: 10648337 markings, 26890072 edges, 105337 markings/sec, 95 secs
lola: 11188078 markings, 28187180 edges, 107948 markings/sec, 100 secs
lola: 11711832 markings, 29506161 edges, 104751 markings/sec, 105 secs
lola: 12234542 markings, 30791467 edges, 104542 markings/sec, 110 secs
lola: 12752958 markings, 32051960 edges, 103683 markings/sec, 115 secs
lola: 13253476 markings, 33343771 edges, 100104 markings/sec, 120 secs
lola: 13785193 markings, 34622263 edges, 106343 markings/sec, 125 secs
lola: 13925204 markings, 34965123 edges, 28002 markings/sec, 130 secs
lola: 13925880 markings, 34966556 edges, 135 markings/sec, 135 secs
lola: 13926951 markings, 34969255 edges, 214 markings/sec, 140 secs
lola: 13927236 markings, 34969909 edges, 57 markings/sec, 145 secs
lola: 13927977 markings, 34971796 edges, 148 markings/sec, 150 secs
lola: 13927985 markings, 34971830 edges, 2 markings/sec, 155 secs
lola: 13928002 markings, 34971886 edges, 3 markings/sec, 160 secs
lola: 13928021 markings, 34971925 edges, 4 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p602) AND (1 <= p472 + p473 + p474 + p475 + p476 + p477))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(((1 <= p602) AND (1 <= p472 + p473 + p474 + p475 + p476 + p477))))
lola: processed formula length: 78
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: 184 markings, 183 edges
lola: ========================================
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G ((p76 + p75 + p74 + p73 + p72 + p77 <= p266 + p267 + p268 + p269 + p270 + p271)))) AND (NOT(E (G ((1 <= p233 + p234 + p235 + p236 + p237 + p238)))) OR ((p118 + p119 + p120 + p121 + p122 + p123 <= p602) AND ((2 <= p179 + p180 + p181 + p182 + p183 + p184) OR (p245 <= p357 + p358 + p359 + p360 + p361 + p362)) AND (p604 <= 2) AND (p167 + p168 + p169 + p170 + p171 + p172 + 1 <= p40))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p266 + p267 + p268 + p269 + p270 + p271 + 1 <= p76 + p75 + p74 + p73 + p72 + p77)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p266 + p267 + p268 + p269 + p270 + p271 + 1 <= p76 + p75 + p74 + p73 + p72 + p77)))
lola: processed formula: A (F ((p266 + p267 + p268 + p269 + p270 + p271 + 1 <= p76 + p75 + p74 + p73 + p72 + p77)))
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: 18769 markings, 24311 edges, 3754 markings/sec, 0 secs
lola: 37133 markings, 49075 edges, 3673 markings/sec, 5 secs
lola: 55678 markings, 73692 edges, 3709 markings/sec, 10 secs
lola: 73177 markings, 94930 edges, 3500 markings/sec, 15 secs
lola: 90278 markings, 114077 edges, 3420 markings/sec, 20 secs
lola: 106228 markings, 132429 edges, 3190 markings/sec, 25 secs
lola: 122426 markings, 151073 edges, 3240 markings/sec, 30 secs
lola: 138372 markings, 169705 edges, 3189 markings/sec, 35 secs
lola: 154349 markings, 188368 edges, 3195 markings/sec, 40 secs
lola: 170395 markings, 207116 edges, 3209 markings/sec, 45 secs
lola: 186635 markings, 226119 edges, 3248 markings/sec, 50 secs
lola: 202879 markings, 245725 edges, 3249 markings/sec, 55 secs
lola: 221648 markings, 267725 edges, 3754 markings/sec, 60 secs
lola: 239633 markings, 289865 edges, 3597 markings/sec, 65 secs
lola: 257877 markings, 312167 edges, 3649 markings/sec, 70 secs
lola: 276451 markings, 334177 edges, 3715 markings/sec, 75 secs
lola: 294537 markings, 356311 edges, 3617 markings/sec, 80 secs
lola: 313038 markings, 381186 edges, 3700 markings/sec, 85 secs
lola: 331477 markings, 407215 edges, 3688 markings/sec, 90 secs
lola: 349551 markings, 432857 edges, 3615 markings/sec, 95 secs
lola: 366959 markings, 453200 edges, 3482 markings/sec, 100 secs
lola: 383552 markings, 472378 edges, 3319 markings/sec, 105 secs
lola: 400027 markings, 491688 edges, 3295 markings/sec, 110 secs
lola: 416818 markings, 511945 edges, 3358 markings/sec, 115 secs
lola: 435414 markings, 534509 edges, 3719 markings/sec, 120 secs
lola: 452700 markings, 556239 edges, 3457 markings/sec, 125 secs
lola: 470771 markings, 578484 edges, 3614 markings/sec, 130 secs
lola: 488888 markings, 603855 edges, 3623 markings/sec, 135 secs
lola: 506636 markings, 629959 edges, 3550 markings/sec, 140 secs
lola: 524618 markings, 654632 edges, 3596 markings/sec, 145 secs
lola: 542091 markings, 675962 edges, 3495 markings/sec, 150 secs
lola: 558891 markings, 697543 edges, 3360 markings/sec, 155 secs
lola: 576915 markings, 722910 edges, 3605 markings/sec, 160 secs
lola: 594523 markings, 746062 edges, 3522 markings/sec, 165 secs
lola: 612847 markings, 773949 edges, 3665 markings/sec, 170 secs
lola: 630077 markings, 801314 edges, 3446 markings/sec, 175 secs
lola: 648747 markings, 827173 edges, 3734 markings/sec, 180 secs
lola: 667432 markings, 853600 edges, 3737 markings/sec, 185 secs
lola: 685310 markings, 877113 edges, 3576 markings/sec, 190 secs
lola: 701984 markings, 896157 edges, 3335 markings/sec, 195 secs
lola: 718149 markings, 914980 edges, 3233 markings/sec, 200 secs
lola: 734030 markings, 933616 edges, 3176 markings/sec, 205 secs
lola: 751584 markings, 955025 edges, 3511 markings/sec, 210 secs
lola: 769313 markings, 977499 edges, 3546 markings/sec, 215 secs
lola: 787622 markings, 1000143 edges, 3662 markings/sec, 220 secs
lola: 805437 markings, 1024119 edges, 3563 markings/sec, 225 secs
lola: 823738 markings, 1050935 edges, 3660 markings/sec, 230 secs
lola: 841595 markings, 1076071 edges, 3571 markings/sec, 235 secs
lola: 858067 markings, 1095974 edges, 3294 markings/sec, 240 secs
lola: 875101 markings, 1118230 edges, 3407 markings/sec, 245 secs
lola: 892250 markings, 1142107 edges, 3430 markings/sec, 250 secs
lola: 909294 markings, 1164716 edges, 3409 markings/sec, 255 secs
lola: 926411 markings, 1190920 edges, 3423 markings/sec, 260 secs
lola: 944184 markings, 1218951 edges, 3555 markings/sec, 265 secs
lola: 961764 markings, 1244964 edges, 3516 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 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (F ((p314 <= p308 + p309 + p310 + p311 + p312 + p313))) AND E (G ((p41 + p42 + p43 + p44 + p45 + p46 <= p479 + p480 + p481 + p482 + p483 + p484)))) AND (p10 + p11 + p12 + p13 + p14 + p15 <= p65)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p308 + p309 + p310 + p311 + p312 + p313 + 1 <= p314)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p314 <= p308 + p309 + p310 + p311 + p312 + p313)))
lola: processed formula length: 64
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: 461559 markings, 1352437 edges, 92312 markings/sec, 0 secs
lola: 909052 markings, 2706619 edges, 89499 markings/sec, 5 secs
lola: 1355328 markings, 4018217 edges, 89255 markings/sec, 10 secs
lola: 1774032 markings, 5444644 edges, 83741 markings/sec, 15 secs
lola: 2235853 markings, 6808150 edges, 92364 markings/sec, 20 secs
lola: 2689979 markings, 8174418 edges, 90825 markings/sec, 25 secs
lola: 3136996 markings, 9509666 edges, 89403 markings/sec, 30 secs
lola: 3567829 markings, 10953786 edges, 86167 markings/sec, 35 secs
lola: 4025436 markings, 12336105 edges, 91521 markings/sec, 40 secs
lola: 4455643 markings, 13604158 edges, 86041 markings/sec, 45 secs
lola: 4889429 markings, 15036859 edges, 86757 markings/sec, 50 secs
lola: 5340600 markings, 16435286 edges, 90234 markings/sec, 55 secs
lola: 5799815 markings, 17782713 edges, 91843 markings/sec, 60 secs
lola: 6240075 markings, 19116583 edges, 88052 markings/sec, 65 secs
lola: 6655298 markings, 20507359 edges, 83045 markings/sec, 70 secs
lola: 7106883 markings, 21859704 edges, 90317 markings/sec, 75 secs
lola: 7553706 markings, 23177699 edges, 89365 markings/sec, 80 secs
lola: 7996669 markings, 24514538 edges, 88593 markings/sec, 85 secs
lola: 8398650 markings, 25895207 edges, 80396 markings/sec, 90 secs
lola: 8855830 markings, 27238688 edges, 91436 markings/sec, 95 secs
lola: 9295699 markings, 28570212 edges, 87974 markings/sec, 100 secs
lola: 9745128 markings, 29892011 edges, 89886 markings/sec, 105 secs
lola: 10110730 markings, 31354132 edges, 73120 markings/sec, 110 secs
lola: 10429565 markings, 32903774 edges, 63767 markings/sec, 115 secs
lola: 10851059 markings, 34328253 edges, 84299 markings/sec, 120 secs
lola: 11249251 markings, 35713564 edges, 79638 markings/sec, 125 secs
lola: 11697652 markings, 37036696 edges, 89680 markings/sec, 130 secs
lola: 12128689 markings, 38335672 edges, 86207 markings/sec, 135 secs
lola: 12566444 markings, 39629911 edges, 87551 markings/sec, 140 secs
lola: 12972545 markings, 41017752 edges, 81220 markings/sec, 145 secs
lola: 13414454 markings, 42322158 edges, 88382 markings/sec, 150 secs
lola: 13852574 markings, 43645304 edges, 87624 markings/sec, 155 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 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((2 <= p336 + p337 + p338 + p339 + p340 + p341) OR (1 <= p589 + p590 + p591 + p592 + p593 + p594))))) OR (((p166 <= p602) OR ((2 <= p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295) AND (p614 + p615 + p616 + p617 <= 1))) AND E (((1 <= p604) U (p47 + p48 + p49 + p50 + p5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p336 + p337 + p338 + p339 + p340 + p341 <= 1) AND (p589 + p590 + p591 + p592 + p593 + p594 <= 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: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 67 markings, 66 edges
lola: ========================================
lola: subprocess 7 will run for 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p166 <= p602) OR ((2 <= p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295) AND (p614 + p615 + p616 + p617 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p166 <= p602) OR ((2 <= p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295) AND (p614 + p615 + p616 + p617 <= 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 (((p389 + p388 + p387 + p386 + p385 + p384 <= p179 + p180 + p181 + p182 + p183 + p184) U (1 <= p246 + p247 + p248 + p249 + p250 + p251 + p252)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((p389 + p388 + p387 + p386 + p385 + p384 <= p179 + p180 + p181 + p182 + p183 + p184) U (1 <= p246 + p247 + p248 + p249 + p250 + p251 + p252)))
lola: processed formula length: 153
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: 587161 markings, 1533637 edges, 2948049334177890304 markings/sec, 0 secs
lola: 1172167 markings, 3066624 edges, 117001 markings/sec, 5 secs
lola: 1715726 markings, 4547092 edges, 108712 markings/sec, 10 secs
lola: 2160636 markings, 6102307 edges, 88982 markings/sec, 15 secs
lola: 2622133 markings, 7617497 edges, 92299 markings/sec, 20 secs
lola: 3171532 markings, 9109864 edges, 109880 markings/sec, 25 secs
lola: 3725684 markings, 10573437 edges, 110830 markings/sec, 30 secs
lola: 4271872 markings, 12013040 edges, 109238 markings/sec, 35 secs
lola: 4686537 markings, 13543082 edges, 82933 markings/sec, 40 secs
lola: 5143515 markings, 15009990 edges, 91396 markings/sec, 45 secs
lola: 5682079 markings, 16476396 edges, 107713 markings/sec, 50 secs
lola: 6229924 markings, 17922106 edges, 109569 markings/sec, 55 secs
lola: 6772854 markings, 19348624 edges, 108586 markings/sec, 60 secs
lola: 7170233 markings, 20825397 edges, 79476 markings/sec, 65 secs
lola: 7624242 markings, 22289907 edges, 90802 markings/sec, 70 secs
lola: 8163870 markings, 23762272 edges, 107926 markings/sec, 75 secs
lola: 8705297 markings, 25172998 edges, 108285 markings/sec, 80 secs
lola: 9213808 markings, 26544811 edges, 101702 markings/sec, 85 secs
lola: 9625043 markings, 27999603 edges, 82247 markings/sec, 90 secs
lola: 10028143 markings, 29416388 edges, 80620 markings/sec, 95 secs
lola: 10533626 markings, 30867619 edges, 101097 markings/sec, 100 secs
lola: 10961796 markings, 32341095 edges, 85634 markings/sec, 105 secs
lola: 11485533 markings, 33852877 edges, 104747 markings/sec, 110 secs
lola: 11935317 markings, 35385237 edges, 89957 markings/sec, 115 secs
lola: 12459161 markings, 36866581 edges, 104769 markings/sec, 120 secs
lola: 12896499 markings, 38358154 edges, 87468 markings/sec, 125 secs
lola: 13430973 markings, 39824129 edges, 106895 markings/sec, 130 secs
lola: 13883014 markings, 41315361 edges, 90408 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= p509 + p510 + p511 + p512 + p513 + p514) AND (2 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= p509 + p510 + p511 + p512 + p513 + p514) AND (2 <= p9))))
lola: processed formula: A (F (((3 <= p509 + p510 + p511 + p512 + p513 + p514) AND (2 <= p9))))
lola: processed formula length: 70
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: 994 markings, 994 edges
lola: ========================================
lola: subprocess 9 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= p7) AND (p246 + p247 + p248 + p249 + p250 + p251 + p252 <= p432 + p433 + p434 + p435)) AND (E (F (((p315 <= p40) AND (p460 + p461 + p462 + p463 + p464 + p465 <= p57 + p56 + p55 + p54 + p53 + p58)))) AND E (F ((p610 + p611 + p612 + p613 + 1 <= p479 + p480 + p481 + p482 + p483 + p484)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p7) AND (p246 + p247 + p248 + p249 + p250 + p251 + p252 <= p432 + p433 + p434 + p435))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p7) AND (p246 + p247 + p248 + p249 + p250 + p251 + p252 <= p432 + p433 + p434 + p435))
lola: processed formula length: 93
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 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p315 <= p40) AND (p460 + p461 + p462 + p463 + p464 + p465 <= p57 + p56 + p55 + p54 + p53 + p58))))
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 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p610 + p611 + p612 + p613 + 1 <= p479 + p480 + p481 + p482 + p483 + p484)))
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
sara: try reading problem file PolyORBLF-COL-S04J06T06-CTLCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1526 markings, 1582 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p266 + p267 + p268 + p269 + p270 + p271 <= p610 + p611 + p612 + p613) OR (2 <= p604)) AND (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 + p578 + p579 + p586 + p585 + p584 + p583 + p582 + p581 + p580 <= 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: 37 markings, 36 edges
lola: ========================================
lola: subprocess 11 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((p589 + p590 + p591 + p592 + p593 + p594 <= p610 + p611 + p612 + p613))) U ((p265 <= 0) AND (p315 + 1 <= p265))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U (p610 + p611 + p612 + p613 + 1 <= p589 + p590 + p591 + p592 + p593 + p594))) U ((p265 <= 0) AND (p315 + 1 <= p265)))
lola: processed formula length: 131
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: 463057 markings, 1269850 edges, 3067841126024085504 markings/sec, 0 secs
lola: 933236 markings, 2584763 edges, 94036 markings/sec, 5 secs
lola: 1367462 markings, 3838938 edges, 86845 markings/sec, 10 secs
lola: 1792936 markings, 5240254 edges, 85095 markings/sec, 15 secs
lola: 2271702 markings, 6576529 edges, 95753 markings/sec, 20 secs
lola: 2743092 markings, 7909622 edges, 94278 markings/sec, 25 secs
lola: 3201925 markings, 9241586 edges, 91767 markings/sec, 30 secs
lola: 3626759 markings, 10661477 edges, 84967 markings/sec, 35 secs
lola: 4107858 markings, 12001141 edges, 96220 markings/sec, 40 secs
lola: 4577121 markings, 13368284 edges, 93853 markings/sec, 45 secs
lola: 5040568 markings, 14679894 edges, 92689 markings/sec, 50 secs
lola: 5465825 markings, 16091313 edges, 85051 markings/sec, 55 secs
lola: 5925430 markings, 17381403 edges, 91921 markings/sec, 60 secs
lola: 6366602 markings, 18675836 edges, 88234 markings/sec, 65 secs
lola: 6815930 markings, 19941213 edges, 89866 markings/sec, 70 secs
lola: 7214805 markings, 21292380 edges, 79775 markings/sec, 75 secs
lola: 7668273 markings, 22566278 edges, 90694 markings/sec, 80 secs
lola: 8113942 markings, 23826027 edges, 89134 markings/sec, 85 secs
lola: 8556514 markings, 25120243 edges, 88514 markings/sec, 90 secs
lola: 8959406 markings, 26462936 edges, 80578 markings/sec, 95 secs
lola: 9416814 markings, 27754863 edges, 91482 markings/sec, 100 secs
lola: 9867490 markings, 29035052 edges, 90135 markings/sec, 105 secs
lola: 10307621 markings, 30315705 edges, 88026 markings/sec, 110 secs
lola: 10714224 markings, 31654430 edges, 81321 markings/sec, 115 secs
lola: 11000835 markings, 33251039 edges, 57322 markings/sec, 120 secs
lola: 11423225 markings, 34678209 edges, 84478 markings/sec, 125 secs
lola: 11831387 markings, 36064538 edges, 81632 markings/sec, 130 secs
lola: 12263988 markings, 37382761 edges, 86520 markings/sec, 135 secs
lola: 12707154 markings, 38642856 edges, 88633 markings/sec, 140 secs
lola: 13146253 markings, 39877840 edges, 87820 markings/sec, 145 secs
lola: 13575306 markings, 41131580 edges, 85811 markings/sec, 150 secs
lola: 13990591 markings, 42476189 edges, 83057 markings/sec, 155 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="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/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 irma4mcc-full"
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 r126-smll-152673528300073"
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 '
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 ;