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 252K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 92K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PolyORBNT-COL-S05J20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-152732260900425
=====================================================================

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1527432855258


BK_STOP 1527433416016

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBNT-COL-S05J20 as instance name.
Using PolyORBNT as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 843946, 'Memory': 15951.93, 'Tool': 'lola'}, {'Time': 921929, 'Memory': 15942.9, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBNT-COL-S05J20...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBNT-COL-S05J20: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBNT-COL-S05J20: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ PolyORBNT-COL-S05J20 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1599/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 369 places, 1230 transitions, 307 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 688 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J20-LTLCardinality.task
lola: A ((3 <= p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327)) : A (G ((F ((1 <= p45 + p46 + p47 + p48 + p49)) U F ((2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24))))) : A (G ((p51 <= p333))) : A (F (F (G (X ((2 <= p213)))))) : A ((X (X ((2 <= p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366))) U X (G ((p282 <= p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327))))) : A (F (F (((2 <= p282) U (3 <= p180 + p181 + p182 + p183 + p184))))) : A ((X ((1 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24)) U G (G ((3 <= p52))))) : A (X (G ((p334 + p335 + p336 + p337 + p338 <= p328)))) : A ((G (X ((p282 <= p340 + p341 + p342 + p343 + p344))) U X (F ((p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178))))) : A (F ((G ((3 <= p211)) U (3 <= p209)))) : A (F ((F ((2 <= p23)) U F ((1 <= p1))))) : A (F ((p214 <= p345))) : A ((G (G ((2 <= p215))) U ((2 <= p283) U (2 <= p214)))) : A (G ((p334 + p335 + p336 + p337 + p338 <= p306))) : A (F (F (X (X ((2 <= p345)))))) : A (X (G ((p368 <= p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208))))
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 ((3 <= p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327)
lola: processed formula length: 151
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((1 <= p45 + p46 + p47 + p48 + p49)) U F ((2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((1 <= p45 + p46 + p47 + p48 + p49)) U F ((2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24)))))
lola: processed formula: A (G ((F ((1 <= p45 + p46 + p47 + p48 + p49)) U F ((2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24)))))
lola: processed formula length: 185
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 110780 markings, 174482 edges, 22156 markings/sec, 0 secs
lola: 167240 markings, 262104 edges, 11292 markings/sec, 5 secs
lola: 238230 markings, 366946 edges, 14198 markings/sec, 10 secs
lola: 294240 markings, 458388 edges, 11202 markings/sec, 15 secs
lola: 350081 markings, 546334 edges, 11168 markings/sec, 20 secs
lola: 413158 markings, 642827 edges, 12615 markings/sec, 25 secs
lola: 469140 markings, 729955 edges, 11196 markings/sec, 30 secs
lola: 523019 markings, 817060 edges, 10776 markings/sec, 35 secs
lola: 582224 markings, 908557 edges, 11841 markings/sec, 40 secs
lola: 645627 markings, 1003813 edges, 12681 markings/sec, 45 secs
lola: 698741 markings, 1091591 edges, 10623 markings/sec, 50 secs
lola: 754926 markings, 1179701 edges, 11237 markings/sec, 55 secs
lola: 820927 markings, 1276124 edges, 13200 markings/sec, 60 secs
lola: 873577 markings, 1363223 edges, 10530 markings/sec, 65 secs
lola: 929548 markings, 1450360 edges, 11194 markings/sec, 70 secs
lola: 991046 markings, 1545276 edges, 12300 markings/sec, 75 secs
lola: 1047950 markings, 1634150 edges, 11381 markings/sec, 80 secs
lola: 1101358 markings, 1720027 edges, 10682 markings/sec, 85 secs
lola: 1160053 markings, 1810861 edges, 11739 markings/sec, 90 secs
lola: 1221971 markings, 1905732 edges, 12384 markings/sec, 95 secs
lola: 1271846 markings, 1988590 edges, 9975 markings/sec, 100 secs
lola: 1330365 markings, 2080689 edges, 11704 markings/sec, 105 secs
lola: 1395068 markings, 2176689 edges, 12941 markings/sec, 110 secs
lola: 1445593 markings, 2262105 edges, 10105 markings/sec, 115 secs
lola: 1501587 markings, 2348911 edges, 11199 markings/sec, 120 secs
lola: 1565184 markings, 2443478 edges, 12719 markings/sec, 125 secs
lola: 1614773 markings, 2527548 edges, 9918 markings/sec, 130 secs
lola: 1670218 markings, 2613604 edges, 11089 markings/sec, 135 secs
lola: 1733786 markings, 2708103 edges, 12714 markings/sec, 140 secs
lola: 1783581 markings, 2792453 edges, 9959 markings/sec, 145 secs
lola: 1838378 markings, 2912029 edges, 10959 markings/sec, 150 secs
lola: 1881941 markings, 3097219 edges, 8713 markings/sec, 155 secs
lola: 1921052 markings, 3168251 edges, 7822 markings/sec, 160 secs
lola: 1960239 markings, 3241376 edges, 7837 markings/sec, 165 secs
lola: 2000123 markings, 3313067 edges, 7977 markings/sec, 170 secs
lola: 2040080 markings, 3384787 edges, 7991 markings/sec, 175 secs
lola: 2080136 markings, 3456651 edges, 8011 markings/sec, 180 secs
lola: 2120041 markings, 3528247 edges, 7981 markings/sec, 185 secs
lola: 2159638 markings, 3602539 edges, 7919 markings/sec, 190 secs
lola: 2200096 markings, 3674661 edges, 8092 markings/sec, 195 secs
lola: 2240130 markings, 3749710 edges, 8007 markings/sec, 200 secs
lola: 2280006 markings, 3822108 edges, 7975 markings/sec, 205 secs
lola: 2319914 markings, 3894519 edges, 7982 markings/sec, 210 secs
lola: 2360515 markings, 3969652 edges, 8120 markings/sec, 215 secs
lola: 2401490 markings, 4042963 edges, 8195 markings/sec, 220 secs
lola: 2442539 markings, 4116372 edges, 8210 markings/sec, 225 secs
lola: 2483728 markings, 4191384 edges, 8238 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p51 <= p333)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1228 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((2 <= p213))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((2 <= p213)))))
lola: processed formula: A (F (G (X ((2 <= p213)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((2 <= p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366))) U X (G ((p282 <= p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((2 <= p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366)) U G ((p282 <= p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327)))))
lola: processed formula: A (X ((X ((2 <= p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366)) U G ((p282 <= p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327)))))
lola: processed formula length: 326
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 797855 markings, 2228128 edges, 159571 markings/sec, 0 secs
lola: 1407815 markings, 4299673 edges, 121992 markings/sec, 5 secs
lola: 2107677 markings, 6290627 edges, 139972 markings/sec, 10 secs
lola: 2892857 markings, 8322257 edges, 157036 markings/sec, 15 secs
lola: 3642406 markings, 10287484 edges, 149910 markings/sec, 20 secs
lola: 4305954 markings, 12008721 edges, 132710 markings/sec, 25 secs
lola: 4950641 markings, 13697728 edges, 128937 markings/sec, 30 secs
lola: 5394037 markings, 15703994 edges, 88679 markings/sec, 35 secs
lola: 5981298 markings, 17596275 edges, 117452 markings/sec, 40 secs
lola: 6577559 markings, 19549617 edges, 119252 markings/sec, 45 secs
lola: 7295529 markings, 21564396 edges, 143594 markings/sec, 50 secs
lola: 7824972 markings, 23539406 edges, 105889 markings/sec, 55 secs
lola: 8587534 markings, 25507566 edges, 152512 markings/sec, 60 secs
lola: 9348077 markings, 27504347 edges, 152109 markings/sec, 65 secs
lola: 10052826 markings, 29335724 edges, 140950 markings/sec, 70 secs
lola: 10696038 markings, 31007791 edges, 128642 markings/sec, 75 secs
lola: 11196993 markings, 32753917 edges, 100191 markings/sec, 80 secs
lola: 11755691 markings, 34719762 edges, 111740 markings/sec, 85 secs
lola: 12309506 markings, 36501979 edges, 110763 markings/sec, 90 secs
lola: 12962869 markings, 38579816 edges, 130673 markings/sec, 95 secs
lola: 13680459 markings, 40588903 edges, 143518 markings/sec, 100 secs
lola: 14238765 markings, 42593214 edges, 111661 markings/sec, 105 secs
lola: 14986027 markings, 44532292 edges, 149452 markings/sec, 110 secs
lola: 15759817 markings, 46559302 edges, 154758 markings/sec, 115 secs
lola: 16440975 markings, 48333111 edges, 136232 markings/sec, 120 secs
lola: 17087504 markings, 50010867 edges, 129306 markings/sec, 125 secs
lola: 17527796 markings, 51833999 edges, 88058 markings/sec, 130 secs
lola: 18157513 markings, 53860214 edges, 125943 markings/sec, 135 secs
lola: 18662222 markings, 55634805 edges, 100942 markings/sec, 140 secs
lola: 19447320 markings, 57877096 edges, 157020 markings/sec, 145 secs
lola: 20046139 markings, 59900823 edges, 119764 markings/sec, 150 secs
lola: 20734895 markings, 61870123 edges, 137751 markings/sec, 155 secs
lola: 21513568 markings, 63885678 edges, 155735 markings/sec, 160 secs
lola: 22268256 markings, 65863159 edges, 150938 markings/sec, 165 secs
lola: 22925905 markings, 67573079 edges, 131530 markings/sec, 170 secs
lola: 23571666 markings, 69239729 edges, 129152 markings/sec, 175 secs
lola: 24007041 markings, 71220827 edges, 87075 markings/sec, 180 secs
lola: 24599376 markings, 73132484 edges, 118467 markings/sec, 185 secs
lola: 25194825 markings, 75107327 edges, 119090 markings/sec, 190 secs
lola: 25958367 markings, 77244778 edges, 152708 markings/sec, 195 secs
lola: 26503625 markings, 79256223 edges, 109052 markings/sec, 200 secs
lola: 27269591 markings, 81243960 edges, 153193 markings/sec, 205 secs
lola: 28046719 markings, 83270550 edges, 155426 markings/sec, 210 secs
lola: 28759416 markings, 85113891 edges, 142539 markings/sec, 215 secs
lola: 29403870 markings, 86807209 edges, 128891 markings/sec, 220 secs
lola: 29868745 markings, 88582505 edges, 92975 markings/sec, 225 secs
lola: 30484164 markings, 90613108 edges, 123084 markings/sec, 230 secs
lola: 30872518 markings, 91863411 edges, 77671 markings/sec, 235 secs
lola: 30873945 markings, 91867591 edges, 285 markings/sec, 240 secs
lola: 30874900 markings, 91870287 edges, 191 markings/sec, 245 secs
lola: 30877104 markings, 91876734 edges, 441 markings/sec, 250 secs
lola: 30877113 markings, 91876759 edges, 2 markings/sec, 255 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((2 <= p282) U (3 <= p180 + p181 + p182 + p183 + p184)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p282) U (3 <= p180 + p181 + p182 + p183 + p184))))
lola: processed formula: A (F (((2 <= p282) U (3 <= p180 + p181 + p182 + p183 + p184))))
lola: processed formula length: 63
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 6 will run for 302 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((1 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24)) U G (G ((3 <= p52)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((1 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24)) U G (G ((3 <= p52)))))
lola: processed formula: A ((X ((1 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24)) U G (G ((3 <= p52)))))
lola: processed formula length: 161
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 30 edges
lola: ========================================
lola: subprocess 7 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p334 + p335 + p336 + p337 + p338 <= p328))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((p334 + p335 + p336 + p337 + p338 <= p328))))
lola: processed formula: A (X (G ((p334 + p335 + p336 + p337 + p338 <= p328))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 8 will run for 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((p282 <= p340 + p341 + p342 + p343 + p344))) U X (F ((p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X ((p282 <= p340 + p341 + p342 + p343 + p344))) U X (F ((p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178)))))
lola: processed formula: A ((G (X ((p282 <= p340 + p341 + p342 + p343 + p344))) U X (F ((p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178)))))
lola: processed formula length: 361
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 9 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((3 <= p211)) U (3 <= p209))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((3 <= p211)) U (3 <= p209))))
lola: processed formula: A (F ((G ((3 <= p211)) U (3 <= p209))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 10 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((2 <= p23)) U F ((1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((2 <= p23)) U F ((1 <= p1)))))
lola: processed formula: A (F ((F ((2 <= p23)) U F ((1 <= p1)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 11 will run for 605 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p214 <= p345)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p214 <= p345)))
lola: processed formula: A (F ((p214 <= p345)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 756 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((2 <= p215))) U ((2 <= p283) U (2 <= p214))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((2 <= p215))) U ((2 <= p283) U (2 <= p214))))
lola: processed formula: A ((G (G ((2 <= p215))) U ((2 <= p283) U (2 <= p214))))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 13 will run for 1008 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p334 + p335 + p336 + p337 + p338 <= p306)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1228 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 14 will run for 1512 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (X ((2 <= p345))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (X ((2 <= p345)))))
lola: processed formula: A (F (X (X ((2 <= p345)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 23 markings, 37 edges
lola: ========================================
lola: subprocess 15 will run for 3025 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p368 <= p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((p368 <= p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208))))
lola: processed formula: A (X (G ((p368 <= p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208))))
lola: processed formula length: 166
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no unknown no no no yes no no yes no no yes no
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is PolyORBNT-COL-S05J20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-smll-152732260900425"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;