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-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 r130-smll-152673532700073
=====================================================================

--------------------
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 1526869287403


BK_STOP 1526870258207

--------------------
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...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
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 ((p217 + p218 + p219 + p220 + p221 + p222 <= p144 + p145 + p146 + p147 + p148 + p149))) U (2 <= p229 + p230 + p231 + p232 + p233 + p234))) : (A (G (((p172 <= p154 + p155 + p156 + p157 + p158 + p159) OR (3 <= p365 + p366 + p367 + p368 + p369 + p370) OR ((p371 <= p42) AND (p195 + p196 + p197 + p198 + p199 + p200 + p201 <= p172))))) AND NOT(E (G ((p522 + p521 + p520 + p519 + p518 + p517 <= p586))))) : E (((p188 + p189 + p190 + p191 + p192 + p193 <= 0) U ((2 <= p511 + p512 + p513 + p514 + p515 + p516) AND (3 <= p209 + p210 + p211 + p212 + p213 + p214) AND (p100 + p101 + p94 + p92 + p91 + p90 + p88 + p87 + p86 + p84 + p83 + p82 + p80 + p79 + p78 + p76 + p75 + p74 + p77 + p81 + p85 + p89 + p93 + p95 + p96 + p97 + p98 + p99 + 1 <= p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549)))) : E (F (A (X (((1 <= p433) AND (1 <= p427 + p428 + p429 + p430 + p431 + p432)))))) : (NOT(E (G ((p587 + p588 + p589 + p590 + p591 + p592 <= p351 + p352 + p353 + p354 + p355 + p356)))) AND (NOT(E (G ((1 <= p126 + p127 + p128 + p129 + p130 + p131)))) OR ((p410 + p411 + p412 + p413 + p414 + p415 <= p433) AND ((2 <= p65 + p64 + p63 + p62 + p61 + p66) OR (p422 <= p277 + p278 + p279 + p280 + p281 + p282)) AND (p50 <= 2) AND (p397 + p398 + p399 + p400 + p401 + p402 + 1 <= p524)))) : NOT(((A (F ((p586 <= p209 + p210 + p211 + p212 + p213 + p214))) AND E (G ((p144 + p145 + p146 + p147 + p148 + p149 <= p59 + p58 + p57 + p56 + p55 + p60)))) AND (p229 + p230 + p231 + p232 + p233 + p234 <= p523))) : (NOT(E (F (((2 <= p217 + p218 + p219 + p220 + p221 + p222) OR (1 <= p580 + p581 + p582 + p583 + p584 + p585))))) OR (((p172 <= p433) OR ((2 <= p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509) AND (p423 + p424 + p425 + p426 <= 1))) AND E (((1 <= p50) U (p485 + p484 + p483 + p482 + p481 + p480 <= p181))))) : A (F (A (((p373 + p374 + p375 + p376 + p377 + p378 <= p65 + p64 + p63 + p62 + p61 + p66) U (1 <= p46 + p47 + p48 + p49 + p45 + p44 + p43))))) : A (F (((3 <= p365 + p366 + p367 + p368 + p369 + p370) AND (2 <= p372)))) : (((3 <= p617) AND (p46 + p47 + p48 + p49 + p45 + p44 + p43 <= p476 + p477 + p478 + p479)) AND (E (F (((p216 <= p524) AND (p511 + p512 + p513 + p514 + p515 + p516 <= p295 + p296 + p297 + p298 + p299 + p300)))) AND E (F ((p150 + p151 + p152 + p153 + 1 <= p59 + p58 + p57 + p56 + p55 + p60))))) : A (G (((((p351 + p352 + p353 + p354 + p355 + p356 <= p150 + p151 + p152 + p153) OR (2 <= p50)) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= 1)) OR (p202 + p203 + p204 + p205 + p206 + p207 + p208 <= 0)))) : A ((E (G ((p580 + p581 + p582 + p583 + p584 + p585 <= p150 + p151 + p152 + p153))) U ((p73 <= 0) AND (p216 + 1 <= p73)))) : (E (G (((p427 + p428 + p429 + p430 + p431 + p432 <= p350) OR (p523 + 1 <= p372)))) AND E (F (A (F ((1 <= p385 + p386 + p387 + p388 + p389 + p390)))))) : (A (G (((p357 + p358 + p359 + p360 + p361 + p362 + 1 <= p51 + p52 + p53 + p54) OR (p42 <= 1)))) AND (p289 + p290 + p291 + p292 + p293 + p294 <= p371)) : E ((((p194 + 1 <= p59 + p58 + p57 + p56 + p55 + p60) OR (p59 + p58 + p57 + p56 + p55 + p60 + 1 <= p485 + p484 + p483 + p482 + p481 + p480)) U A (G ((3 <= p215))))) : A (F (A (F ((2 <= p295 + p296 + p297 + p298 + p299 + p300)))))
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 ((p217 + p218 + p219 + p220 + p221 + p222 <= p144 + p145 + p146 + p147 + p148 + p149))) U (2 <= p229 + p230 + p231 + p232 + p233 + p234)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (p217 + p218 + p219 + p220 + p221 + p222 <= p144 + p145 + p146 + p147 + p148 + p149)) U (2 <= p229 + p230 + p231 + p232 + p233 + p234))
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: 928 markings, 1856 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p172 <= p154 + p155 + p156 + p157 + p158 + p159) OR (3 <= p365 + p366 + p367 + p368 + p369 + p370) OR ((p371 <= p42) AND (p195 + p196 + p197 + p198 + p199 + p200 + p201 <= p172))))) AND NOT(E (G ((p522 + p521 + p520 + p519 + p518 + p517 <= p586)))))
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 (((p172 <= p154 + p155 + p156 + p157 + p158 + p159) OR (3 <= p365 + p366 + p367 + p368 + p369 + p370) OR ((p371 <= p42) AND (p195 + p196 + p197 + p198 + p199 + p200 + p201 <= p172)))))
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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p188 + p189 + p190 + p191 + p192 + p193 <= 0) U ((2 <= p511 + p512 + p513 + p514 + p515 + p516) AND (3 <= p209 + p210 + p211 + p212 + p213 + p214) AND (p100 + p101 + p94 + p92 + p91 + p90 + p88 + p87 + p86 + p84 + p83 + p82 + p80 + p79 + p78 + p76 + p75 + p74 + p77 + p81 + p85 + p89 + p93 + p95 + p96 + p97 + p98 + p99 + 1 <= p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p188 + p189 + p190 + p191 + p192 + p193 <= 0) U ((2 <= p511 + p512 + p513 + p514 + p515 + p516) AND (3 <= p209 + p210 + p211 + p212 + p213 + p214) AND (p100 + p101 + p94 + p92 + p91 + p90 + p88 + p87 + p86 + p84 + p83 + p82 + p80 + p79 + p78 + p76 + p75 + p74 + p77 + p81 + p85 + p89 + p93 + p95 + p96 + p97 + p98 + p99 + 1 <= p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + ... (shortened)
lola: processed formula length: 498
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: 591384 markings, 1446071 edges, 2073447895104749568 markings/sec, 0 secs
lola: 1163087 markings, 2856008 edges, 114341 markings/sec, 5 secs
lola: 1709185 markings, 4233029 edges, 109220 markings/sec, 10 secs
lola: 2259827 markings, 5589619 edges, 110128 markings/sec, 15 secs
lola: 2799130 markings, 6956227 edges, 107861 markings/sec, 20 secs
lola: 3346165 markings, 8296007 edges, 109407 markings/sec, 25 secs
lola: 3880325 markings, 9621050 edges, 106832 markings/sec, 30 secs
lola: 4422695 markings, 10990617 edges, 108474 markings/sec, 35 secs
lola: 4960265 markings, 12355229 edges, 107514 markings/sec, 40 secs
lola: 5503422 markings, 13698539 edges, 108631 markings/sec, 45 secs
lola: 6047583 markings, 15073718 edges, 108832 markings/sec, 50 secs
lola: 6593175 markings, 16462483 edges, 109118 markings/sec, 55 secs
lola: 7142833 markings, 17861680 edges, 109932 markings/sec, 60 secs
lola: 7681716 markings, 19242505 edges, 107777 markings/sec, 65 secs
lola: 8185944 markings, 20598437 edges, 100846 markings/sec, 70 secs
lola: 8703626 markings, 21974137 edges, 103536 markings/sec, 75 secs
lola: 9235312 markings, 23284968 edges, 106337 markings/sec, 80 secs
lola: 9748996 markings, 24589886 edges, 102737 markings/sec, 85 secs
lola: 10276895 markings, 25883182 edges, 105580 markings/sec, 90 secs
lola: 10792498 markings, 27158088 edges, 103121 markings/sec, 95 secs
lola: 11313778 markings, 28475649 edges, 104256 markings/sec, 100 secs
lola: 11845378 markings, 29778930 edges, 106320 markings/sec, 105 secs
lola: 12351619 markings, 31074294 edges, 101248 markings/sec, 110 secs
lola: 12894823 markings, 32411560 edges, 108641 markings/sec, 115 secs
lola: 13386293 markings, 33662498 edges, 98294 markings/sec, 120 secs
lola: 13899185 markings, 34938253 edges, 102578 markings/sec, 125 secs
lola: 14401560 markings, 36202991 edges, 100475 markings/sec, 130 secs
lola: 14904922 markings, 37487657 edges, 100672 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p433) AND (1 <= p427 + p428 + p429 + p430 + p431 + p432))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(((1 <= p433) AND (1 <= p427 + p428 + p429 + p430 + p431 + p432))))
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: 113 markings, 112 edges
lola: ========================================
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G ((p587 + p588 + p589 + p590 + p591 + p592 <= p351 + p352 + p353 + p354 + p355 + p356)))) AND (NOT(E (G ((1 <= p126 + p127 + p128 + p129 + p130 + p131)))) OR ((p410 + p411 + p412 + p413 + p414 + p415 <= p433) AND ((2 <= p65 + p64 + p63 + p62 + p61 + p66) OR (p422 <= p277 + p278 + p279 + p280 + p281 + p282)) AND (p50 <= 2) AND (p397 + p398 + p399 + p400 + p401 + p402 + 1 <= p524))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p351 + p352 + p353 + p354 + p355 + p356 + 1 <= p587 + p588 + p589 + p590 + p591 + p592)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p351 + p352 + p353 + p354 + p355 + p356 + 1 <= p587 + p588 + p589 + p590 + p591 + p592)))
lola: processed formula: A (F ((p351 + p352 + p353 + p354 + p355 + p356 + 1 <= p587 + p588 + p589 + p590 + p591 + p592)))
lola: processed formula length: 96
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: 17974 markings, 22085 edges, 3595 markings/sec, 0 secs
lola: 33301 markings, 41974 edges, 3065 markings/sec, 5 secs
lola: 51519 markings, 64904 edges, 3644 markings/sec, 10 secs
lola: 71526 markings, 88943 edges, 4001 markings/sec, 15 secs
lola: 90452 markings, 110252 edges, 3785 markings/sec, 20 secs
lola: 108357 markings, 130680 edges, 3581 markings/sec, 25 secs
lola: 126024 markings, 151048 edges, 3533 markings/sec, 30 secs
lola: 143719 markings, 171436 edges, 3539 markings/sec, 35 secs
lola: 160959 markings, 191649 edges, 3448 markings/sec, 40 secs
lola: 178320 markings, 211960 edges, 3472 markings/sec, 45 secs
lola: 195508 markings, 232226 edges, 3438 markings/sec, 50 secs
lola: 215385 markings, 256002 edges, 3975 markings/sec, 55 secs
lola: 233676 markings, 278295 edges, 3658 markings/sec, 60 secs
lola: 251994 markings, 300855 edges, 3664 markings/sec, 65 secs
lola: 271653 markings, 324000 edges, 3932 markings/sec, 70 secs
lola: 289644 markings, 345878 edges, 3598 markings/sec, 75 secs
lola: 307875 markings, 369301 edges, 3646 markings/sec, 80 secs
lola: 325342 markings, 392517 edges, 3493 markings/sec, 85 secs
lola: 342727 markings, 415962 edges, 3477 markings/sec, 90 secs
lola: 362565 markings, 438355 edges, 3968 markings/sec, 95 secs
lola: 380387 markings, 458844 edges, 3564 markings/sec, 100 secs
lola: 397786 markings, 479240 edges, 3480 markings/sec, 105 secs
lola: 416470 markings, 501854 edges, 3737 markings/sec, 110 secs
lola: 434436 markings, 524211 edges, 3593 markings/sec, 115 secs
lola: 453643 markings, 547747 edges, 3841 markings/sec, 120 secs
lola: 471190 markings, 570414 edges, 3509 markings/sec, 125 secs
lola: 488141 markings, 593977 edges, 3390 markings/sec, 130 secs
lola: 505017 markings, 617039 edges, 3375 markings/sec, 135 secs
lola: 523074 markings, 638568 edges, 3611 markings/sec, 140 secs
lola: 541255 markings, 661783 edges, 3636 markings/sec, 145 secs
lola: 559433 markings, 685675 edges, 3636 markings/sec, 150 secs
lola: 577479 markings, 709562 edges, 3609 markings/sec, 155 secs
lola: 593789 markings, 733361 edges, 3262 markings/sec, 160 secs
lola: 609832 markings, 757257 edges, 3209 markings/sec, 165 secs
lola: 628540 markings, 781931 edges, 3742 markings/sec, 170 secs
lola: 646253 markings, 805654 edges, 3543 markings/sec, 175 secs
lola: 664878 markings, 829311 edges, 3725 markings/sec, 180 secs
lola: 683374 markings, 850364 edges, 3699 markings/sec, 185 secs
lola: 701027 markings, 870815 edges, 3531 markings/sec, 190 secs
lola: 718416 markings, 891253 edges, 3478 markings/sec, 195 secs
lola: 737532 markings, 914708 edges, 3823 markings/sec, 200 secs
lola: 755380 markings, 937505 edges, 3570 markings/sec, 205 secs
lola: 773733 markings, 960406 edges, 3671 markings/sec, 210 secs
lola: 791033 markings, 983792 edges, 3460 markings/sec, 215 secs
lola: 807961 markings, 1007525 edges, 3386 markings/sec, 220 secs
lola: 825545 markings, 1029542 edges, 3517 markings/sec, 225 secs
lola: 843864 markings, 1052334 edges, 3664 markings/sec, 230 secs
lola: 861645 markings, 1075580 edges, 3556 markings/sec, 235 secs
lola: 878171 markings, 1099603 edges, 3305 markings/sec, 240 secs
lola: 894660 markings, 1123175 edges, 3298 markings/sec, 245 secs
lola: 912552 markings, 1147868 edges, 3578 markings/sec, 250 secs
lola: 929786 markings, 1172168 edges, 3447 markings/sec, 255 secs
lola: 946681 markings, 1195851 edges, 3379 markings/sec, 260 secs
lola: 964478 markings, 1217737 edges, 3559 markings/sec, 265 secs
lola: 982373 markings, 1240790 edges, 3579 markings/sec, 270 secs
lola: 999997 markings, 1264768 edges, 3525 markings/sec, 275 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 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (F ((p586 <= p209 + p210 + p211 + p212 + p213 + p214))) AND E (G ((p144 + p145 + p146 + p147 + p148 + p149 <= p59 + p58 + p57 + p56 + p55 + p60)))) AND (p229 + p230 + p231 + p232 + p233 + p234 <= p523)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p209 + p210 + p211 + p212 + p213 + p214 + 1 <= p586)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p586 <= p209 + p210 + p211 + p212 + p213 + p214)))
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: 491120 markings, 1443658 edges, 98224 markings/sec, 0 secs
lola: 964886 markings, 2859257 edges, 94753 markings/sec, 5 secs
lola: 1431913 markings, 4258708 edges, 93405 markings/sec, 10 secs
lola: 1882290 markings, 5665387 edges, 90075 markings/sec, 15 secs
lola: 2343785 markings, 7028670 edges, 92299 markings/sec, 20 secs
lola: 2790176 markings, 8359351 edges, 89278 markings/sec, 25 secs
lola: 3229971 markings, 9673494 edges, 87959 markings/sec, 30 secs
lola: 3654997 markings, 11012357 edges, 85005 markings/sec, 35 secs
lola: 4108694 markings, 12353767 edges, 90739 markings/sec, 40 secs
lola: 4555794 markings, 13675905 edges, 89420 markings/sec, 45 secs
lola: 4992101 markings, 14984993 edges, 87261 markings/sec, 50 secs
lola: 5426107 markings, 16304748 edges, 86801 markings/sec, 55 secs
lola: 5869260 markings, 17669984 edges, 88631 markings/sec, 60 secs
lola: 6319505 markings, 19017007 edges, 90049 markings/sec, 65 secs
lola: 6753135 markings, 20375526 edges, 86726 markings/sec, 70 secs
lola: 7195923 markings, 21699036 edges, 88558 markings/sec, 75 secs
lola: 7634275 markings, 23035925 edges, 87670 markings/sec, 80 secs
lola: 8038027 markings, 24283539 edges, 80750 markings/sec, 85 secs
lola: 8462046 markings, 25556217 edges, 84804 markings/sec, 90 secs
lola: 8878593 markings, 26865134 edges, 83309 markings/sec, 95 secs
lola: 9309179 markings, 28171907 edges, 86117 markings/sec, 100 secs
lola: 9731532 markings, 29490187 edges, 84471 markings/sec, 105 secs
lola: 10148764 markings, 30811281 edges, 83446 markings/sec, 110 secs
lola: 10565490 markings, 32119545 edges, 83345 markings/sec, 115 secs
lola: 10973771 markings, 33464289 edges, 81656 markings/sec, 120 secs
lola: 11373164 markings, 34849696 edges, 79879 markings/sec, 125 secs
lola: 11816340 markings, 36158975 edges, 88635 markings/sec, 130 secs
lola: 12246077 markings, 37444798 edges, 85947 markings/sec, 135 secs
lola: 12665561 markings, 38700400 edges, 83897 markings/sec, 140 secs
lola: 13065689 markings, 39964673 edges, 80026 markings/sec, 145 secs
lola: 13485956 markings, 41210022 edges, 84053 markings/sec, 150 secs
lola: 13900864 markings, 42433038 edges, 82982 markings/sec, 155 secs
lola: 14306721 markings, 43651337 edges, 81171 markings/sec, 160 secs
lola: 14713801 markings, 44878921 edges, 81416 markings/sec, 165 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 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((2 <= p217 + p218 + p219 + p220 + p221 + p222) OR (1 <= p580 + p581 + p582 + p583 + p584 + p585))))) OR (((p172 <= p433) OR ((2 <= p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509) AND (p423 + p424 + p425 + p426 <= 1))) AND E (((1 <= p50) U (p485 + p484 + p483 + p482 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p217 + p218 + p219 + p220 + p221 + p222 <= 1) AND (p580 + p581 + p582 + p583 + p584 + p585 <= 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: 42 markings, 41 edges
lola: ========================================
lola: subprocess 7 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p172 <= p433) OR ((2 <= p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509) AND (p423 + p424 + p425 + p426 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p172 <= p433) OR ((2 <= p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509) AND (p423 + p424 + p425 + p426 <= 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 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((p373 + p374 + p375 + p376 + p377 + p378 <= p65 + p64 + p63 + p62 + p61 + p66) U (1 <= p46 + p47 + p48 + p49 + p45 + p44 + p43)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((p373 + p374 + p375 + p376 + p377 + p378 <= p65 + p64 + p63 + p62 + p61 + p66) U (1 <= p46 + p47 + p48 + p49 + p45 + p44 + p43)))
lola: processed formula length: 140
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: 537824 markings, 1554215 edges, 107558 markings/sec, 0 secs
lola: 1065610 markings, 3090514 edges, 105557 markings/sec, 5 secs
lola: 1584060 markings, 4649373 edges, 103690 markings/sec, 10 secs
lola: 2084618 markings, 6185736 edges, 100112 markings/sec, 15 secs
lola: 2551755 markings, 7759623 edges, 93427 markings/sec, 20 secs
lola: 3071686 markings, 9268674 edges, 103986 markings/sec, 25 secs
lola: 3571141 markings, 10728608 edges, 99891 markings/sec, 30 secs
lola: 4060464 markings, 12198041 edges, 97865 markings/sec, 35 secs
lola: 4534884 markings, 13646335 edges, 94884 markings/sec, 40 secs
lola: 4973233 markings, 15125633 edges, 87670 markings/sec, 45 secs
lola: 5479634 markings, 16646483 edges, 101280 markings/sec, 50 secs
lola: 5960357 markings, 18091942 edges, 96145 markings/sec, 55 secs
lola: 6430286 markings, 19557457 edges, 93986 markings/sec, 60 secs
lola: 6879945 markings, 21038263 edges, 89932 markings/sec, 65 secs
lola: 7361101 markings, 22474386 edges, 96231 markings/sec, 70 secs
lola: 7828990 markings, 23894005 edges, 93578 markings/sec, 75 secs
lola: 8274897 markings, 25313050 edges, 89181 markings/sec, 80 secs
lola: 8727122 markings, 26769445 edges, 90445 markings/sec, 85 secs
lola: 9206196 markings, 28174464 edges, 95815 markings/sec, 90 secs
lola: 9674394 markings, 29589044 edges, 93640 markings/sec, 95 secs
lola: 10133159 markings, 30978410 edges, 91753 markings/sec, 100 secs
lola: 10549445 markings, 32416020 edges, 83257 markings/sec, 105 secs
lola: 11029588 markings, 33824471 edges, 96029 markings/sec, 110 secs
lola: 11481043 markings, 35144889 edges, 90291 markings/sec, 115 secs
lola: 11907582 markings, 36445884 edges, 85308 markings/sec, 120 secs
lola: 12326413 markings, 37752742 edges, 83766 markings/sec, 125 secs
lola: 12728142 markings, 39118038 edges, 80346 markings/sec, 130 secs
lola: 13182309 markings, 40529027 edges, 90833 markings/sec, 135 secs
lola: 13599959 markings, 41955978 edges, 83530 markings/sec, 140 secs
lola: 14037912 markings, 43324500 edges, 87591 markings/sec, 145 secs
lola: 14455193 markings, 44706026 edges, 83456 markings/sec, 150 secs
lola: 14892292 markings, 46044712 edges, 87420 markings/sec, 155 secs
lola: 15307892 markings, 47419749 edges, 83120 markings/sec, 160 secs
lola: 15732184 markings, 48776631 edges, 84858 markings/sec, 165 secs
lola: 16155450 markings, 50082995 edges, 84653 markings/sec, 170 secs
lola: 16550142 markings, 51453184 edges, 78938 markings/sec, 175 secs
lola: 16959709 markings, 52874153 edges, 81913 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 343 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= p365 + p366 + p367 + p368 + p369 + p370) AND (2 <= p372))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= p365 + p366 + p367 + p368 + p369 + p370) AND (2 <= p372))))
lola: processed formula: A (F (((3 <= p365 + p366 + p367 + p368 + p369 + p370) AND (2 <= p372))))
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: 2197 markings, 2197 edges
lola: ========================================
lola: subprocess 9 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= p617) AND (p46 + p47 + p48 + p49 + p45 + p44 + p43 <= p476 + p477 + p478 + p479)) AND (E (F (((p216 <= p524) AND (p511 + p512 + p513 + p514 + p515 + p516 <= p295 + p296 + p297 + p298 + p299 + p300)))) AND E (F ((p150 + p151 + p152 + p153 + 1 <= p59 + p58 + p57 + p56 + p55 + p60)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p617) AND (p46 + p47 + p48 + p49 + p45 + p44 + p43 <= p476 + p477 + p478 + p479))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p617) AND (p46 + p47 + p48 + p49 + p45 + p44 + p43 <= p476 + p477 + p478 + p479))
lola: processed formula length: 88
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 (((p216 <= p524) AND (p511 + p512 + p513 + p514 + p515 + p516 <= p295 + p296 + p297 + p298 + p299 + p300))))
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: 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 549 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p150 + p151 + p152 + p153 + 1 <= p59 + p58 + p57 + p56 + p55 + p60)))
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: 6074 markings, 6351 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 457 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p351 + p352 + p353 + p354 + p355 + p356 <= p150 + p151 + p152 + p153) OR (2 <= p50)) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= 1)) OR (p202 + p203 + p204 + p205 + p206 + p207 + p208 ... (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: 32 markings, 31 edges
lola: ========================================
lola: subprocess 11 will run for 549 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((p580 + p581 + p582 + p583 + p584 + p585 <= p150 + p151 + p152 + p153))) U ((p73 <= 0) AND (p216 + 1 <= p73))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U (p150 + p151 + p152 + p153 + 1 <= p580 + p581 + p582 + p583 + p584 + p585))) U ((p73 <= 0) AND (p216 + 1 <= p73)))
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: 496871 markings, 1379846 edges, 3067841126024085504 markings/sec, 0 secs
lola: 980685 markings, 2745790 edges, 96763 markings/sec, 5 secs
lola: 1456746 markings, 4114188 edges, 95212 markings/sec, 10 secs
lola: 1923958 markings, 5482030 edges, 93442 markings/sec, 15 secs
lola: 2386775 markings, 6831583 edges, 92563 markings/sec, 20 secs
lola: 2860322 markings, 8159826 edges, 94709 markings/sec, 25 secs
lola: 3317624 markings, 9480053 edges, 91460 markings/sec, 30 secs
lola: 3775012 markings, 10798492 edges, 91478 markings/sec, 35 secs
lola: 4236471 markings, 12154194 edges, 92292 markings/sec, 40 secs
lola: 4695449 markings, 13454285 edges, 91796 markings/sec, 45 secs
lola: 5157126 markings, 14764982 edges, 92335 markings/sec, 50 secs
lola: 5611217 markings, 16072889 edges, 90818 markings/sec, 55 secs
lola: 6055529 markings, 17418119 edges, 88862 markings/sec, 60 secs
lola: 6520056 markings, 18764189 edges, 92905 markings/sec, 65 secs
lola: 6976190 markings, 20110750 edges, 91227 markings/sec, 70 secs
lola: 7423269 markings, 21453818 edges, 89416 markings/sec, 75 secs
lola: 7873398 markings, 22765199 edges, 90026 markings/sec, 80 secs
lola: 8282754 markings, 24020968 edges, 81871 markings/sec, 85 secs
lola: 8722784 markings, 25285535 edges, 88006 markings/sec, 90 secs
lola: 9159973 markings, 26559090 edges, 87438 markings/sec, 95 secs
lola: 9590984 markings, 27884693 edges, 86202 markings/sec, 100 secs
lola: 10027584 markings, 29223461 edges, 87320 markings/sec, 105 secs
lola: 10471078 markings, 30520486 edges, 88699 markings/sec, 110 secs
lola: 10903134 markings, 31834742 edges, 86411 markings/sec, 115 secs
lola: 11327916 markings, 33153530 edges, 84956 markings/sec, 120 secs
lola: 11748039 markings, 34497016 edges, 84025 markings/sec, 125 secs
lola: 12167073 markings, 35868746 edges, 83807 markings/sec, 130 secs
lola: 12623195 markings, 37148820 edges, 91224 markings/sec, 135 secs
lola: 13061278 markings, 38406901 edges, 87617 markings/sec, 140 secs
lola: 13491543 markings, 39648336 edges, 86053 markings/sec, 145 secs
lola: 13904698 markings, 40901078 edges, 82631 markings/sec, 150 secs
lola: 14343877 markings, 42130994 edges, 87836 markings/sec, 155 secs
lola: 14781604 markings, 43363261 edges, 87545 markings/sec, 160 secs
lola: 15168457 markings, 44463718 edges, 77371 markings/sec, 165 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-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 mcc4mcc-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 r130-smll-152673532700073"
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 ;