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 256K
-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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K 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 9.2K May 15 18:54 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-structural
Input is PolyORBNT-COL-S05J20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-152673529300262
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526855937747


BK_STOP 1526856737007

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBNT-COL-S05J20 as instance name.
Using PolyORBNT as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 3540213, 'Memory': 15951.99, 'Tool': 'lola'}, {'Time': 3540352, 'Memory': 15952.27, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBNT-COL-S05J20...

Time: 3600 - MCC
----- Start make prepare stderr -----
----- Start make prepare stdout -----
===========================================================================================
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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PolyORBNT-COL-S05J20 @ 3540 seconds
----- 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: 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-CTLCardinality.task
lola: NOT(E (F (((p93 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p91 + p90 + p89 + p88 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p76 + p75 + p74 + p73 + p71 + p70 + p69 + p68 + p66 + p65 + p64 + p63 + p61 + p60 + p59 + p58 + p56 + p55 + p54 + p53 + p51 + p50 + p49 + p48 + p46 + p45 + p44 + p43 + p18 + p19 + p20 + p21 + p41 + p23 + p24 + p25 + p26 + p40 + p28 + p29 + p30 + p31 + p39 + p33 + p34 + p35 + p36 + p38 + p37 + p32 + p27 + p22 + p42 + p47 + p52 + p57 + p62 + p67 + p72 + p77 + p82 + p87 + p92 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p125) OR (p262 + 1 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))))) : NOT(E (G (A (F ((p266 <= p168)))))) : (A (F (((p368 + 1 <= p340 + p341 + p342 + p343 + p344) AND (2 <= p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p315 + p314 + p313 + p312)))) AND (((p2 <= 0) OR (p266 <= 1) OR ((p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + 1 <= p123) AND (p338 + 1 <= p267))) AND ((p294 <= p4 + p5 + p6 + p7 + p8) AND A (F ((1 <= p340 + p341 + p342 + p343 + p344)))))) : E (F (NOT(E (F ((3 <= p123)))))) : A (G ((p216 <= p368))) : A (F (NOT(E (F ((2 <= p338)))))) : (E (X (A (X ((3 <= p123))))) OR A (F ((1 <= p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238)))) : (E (G ((((p216 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) AND (2 <= p4 + p5 + p6 + p7 + p8)) OR ((3 <= p262) AND (p4 + p5 + p6 + p7 + p8 <= p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167))))) OR ((3 <= p16) AND (E (X ((2 <= p93 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p91 + p90 + p89 + p88 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p76 + p75 + p74 + p73 + p71 + p70 + p69 + p68 + p66 + p65 + p64 + p63 + p61 + p60 + p59 + p58 + p56 + p55 + p54 + p53 + p51 + p50 + p49 + p48 + p46 + p45 + p44 + p43 + p18 + p19 + p20 + p21 + p41 + p23 + p24 + p25 + p26 + p40 + p28 + p29 + p30 + p31 + p39 + p33 + p34 + p35 + p36 + p38 + p37 + p32 + p27 + p22 + p42 + p47 + p52 + p57 + p62 + p67 + p72 + p77 + p82 + p87 + p92 + p94 + p95 + p96 + p97 + p98 + p99))) OR (2 <= p340 + p341 + p342 + p343 + p344)))) : A (F (A (G (((p1 <= p191) AND (3 <= p123)))))) : ((A (G ((p260 <= p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259))) AND E (G ((p366 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 <= p368)))) AND ((((p124 <= 2) OR (p3 <= 0)) AND ((p261 + 1 <= p367) OR (p340 + p341 + p342 + p343 + p344 + 1 <= p168))) OR NOT(A (X ((3 <= p14)))))) : E (F ((A (G ((p168 <= p1))) OR A (G ((p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= p267)))))) : E (G (((p339 <= 0) OR (p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 <= p338)))) : A (F (E (G (((p191 <= p345) AND (p215 <= p260)))))) : A ((((1 <= p261) AND (2 <= p267) AND ((3 <= p215) OR (p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 <= p216))) U E (F ((1 <= p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259))))) : A (F ((A (G ((p191 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))) AND (p169 <= p4 + p5 + p6 + p7 + p8)))) : A (G ((p214 <= 2)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((p93 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p91 + p90 + p89 + p88 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p76 + p75 + p74 + p73 + p71 + p70 + p69 + p68 + p66 + p65 + p64 + p63 + p61 + p60 + p59 + p58 + p56 + p55 + p54 + p53 + p51 + p50 + p49 + p48 + p46 +... (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 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: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((p266 <= p168))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p266 <= p168))))
lola: processed formula length: 39
lola: 8 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
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: 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: 35 markings, 69 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((p368 + 1 <= p340 + p341 + p342 + p343 + p344) AND (2 <= p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p315 + p314 + p313 + p312)))) AND (((p2 <= 0) OR (p266 <= 1) OR ((p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p368 + 1 <= p340 + p341 + p342 + p343 + p344) AND (2 <= p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p315 + p314 + p313 + p312))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p368 + 1 <= p340 + p341 + p342 + p343 + p344) AND (2 <= p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p315 + p314 + p313 + p312))))
lola: processed formula: A (F (((p368 + 1 <= p340 + p341 + p342 + p343 + p344) AND (2 <= p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p315 + p314 + p313 + p312))))
lola: processed formula length: 212
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (F ((3 <= p123))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (3 <= p123))))
lola: processed formula length: 36
lola: 6 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
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: 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: 519390 markings, 956715 edges, 103878 markings/sec, 0 secs
lola: 1089732 markings, 1970751 edges, 114068 markings/sec, 5 secs
lola: 1646986 markings, 2968841 edges, 111451 markings/sec, 10 secs
lola: 2196120 markings, 3951874 edges, 109827 markings/sec, 15 secs
lola: 2749426 markings, 4942111 edges, 110661 markings/sec, 20 secs
lola: 3549853 markings, 6815825 edges, 160085 markings/sec, 25 secs
lola: 4180927 markings, 8753043 edges, 126215 markings/sec, 30 secs
lola: 5045974 markings, 10713942 edges, 173009 markings/sec, 35 secs
lola: 5777174 markings, 12381826 edges, 146240 markings/sec, 40 secs
lola: 6490796 markings, 14004969 edges, 142724 markings/sec, 45 secs
lola: 7204138 markings, 15623220 edges, 142668 markings/sec, 50 secs
lola: 7709776 markings, 17337809 edges, 101128 markings/sec, 55 secs
lola: 8306225 markings, 18961536 edges, 119290 markings/sec, 60 secs
lola: 8898737 markings, 20625905 edges, 118502 markings/sec, 65 secs
lola: 9578497 markings, 22247370 edges, 135952 markings/sec, 70 secs
lola: 10161952 markings, 23912250 edges, 116691 markings/sec, 75 secs
lola: 10894842 markings, 25585582 edges, 146578 markings/sec, 80 secs
lola: 11530392 markings, 27009858 edges, 127110 markings/sec, 85 secs
lola: 12198339 markings, 28525892 edges, 133589 markings/sec, 90 secs
lola: 12864455 markings, 30047858 edges, 133223 markings/sec, 95 secs
lola: 13494310 markings, 31648246 edges, 125971 markings/sec, 100 secs
lola: 13974568 markings, 33269184 edges, 96052 markings/sec, 105 secs
lola: 14506245 markings, 34718315 edges, 106335 markings/sec, 110 secs
lola: 15165930 markings, 36386109 edges, 131937 markings/sec, 115 secs
lola: 15753880 markings, 37971757 edges, 117590 markings/sec, 120 secs
lola: 16386507 markings, 39625131 edges, 126525 markings/sec, 125 secs
lola: 17067918 markings, 41176720 edges, 136282 markings/sec, 130 secs
lola: 17686782 markings, 42564442 edges, 123773 markings/sec, 135 secs
lola: 18303525 markings, 43974801 edges, 123349 markings/sec, 140 secs
lola: 18911913 markings, 45343541 edges, 121678 markings/sec, 145 secs
lola: 19463822 markings, 46822844 edges, 110382 markings/sec, 150 secs
lola: 19913976 markings, 48323457 edges, 90031 markings/sec, 155 secs
lola: 20394469 markings, 49626618 edges, 96099 markings/sec, 160 secs
lola: 20959877 markings, 51140529 edges, 113082 markings/sec, 165 secs
lola: 21580846 markings, 52692048 edges, 124194 markings/sec, 170 secs
lola: 22119017 markings, 54220162 edges, 107634 markings/sec, 175 secs
lola: 22809555 markings, 55786147 edges, 138108 markings/sec, 180 secs
lola: 23416712 markings, 57153798 edges, 121431 markings/sec, 185 secs
lola: 24012072 markings, 58501465 edges, 119072 markings/sec, 190 secs
lola: 24623571 markings, 59897067 edges, 122300 markings/sec, 195 secs
lola: 25235236 markings, 61275789 edges, 122333 markings/sec, 200 secs
lola: 25635650 markings, 62777651 edges, 80083 markings/sec, 205 secs
lola: 26132468 markings, 64126402 edges, 99364 markings/sec, 210 secs
lola: 26612995 markings, 65434421 edges, 96105 markings/sec, 215 secs
lola: 27255891 markings, 66963372 edges, 128579 markings/sec, 220 secs
lola: 27786777 markings, 68505610 edges, 106177 markings/sec, 225 secs
lola: 28409333 markings, 70064515 edges, 124511 markings/sec, 230 secs
lola: 29063877 markings, 71540921 edges, 130909 markings/sec, 235 secs
lola: 29627311 markings, 72826478 edges, 112687 markings/sec, 240 secs
lola: 30240657 markings, 74226291 edges, 122669 markings/sec, 245 secs
lola: 30863078 markings, 75636074 edges, 124484 markings/sec, 250 secs
lola: 31396367 markings, 77070610 edges, 106658 markings/sec, 255 secs
lola: 31841676 markings, 78553205 edges, 89062 markings/sec, 260 secs
lola: 32317125 markings, 79844829 edges, 95090 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p216 <= p368)))
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 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J20-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (F ((2 <= p338))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((p338 <= 1)))))
lola: processed formula: A (F (A (G ((p338 <= 1)))))
lola: processed formula length: 27
lola: 3 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.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: 36574 markings, 48841 edges, 7315 markings/sec, 0 secs
lola: 83597 markings, 110864 edges, 9405 markings/sec, 5 secs
lola: 133741 markings, 175264 edges, 10029 markings/sec, 10 secs
lola: 188609 markings, 251944 edges, 10974 markings/sec, 15 secs
lola: 240830 markings, 319441 edges, 10444 markings/sec, 20 secs
lola: 295231 markings, 395836 edges, 10880 markings/sec, 25 secs
lola: 348472 markings, 464680 edges, 10648 markings/sec, 30 secs
lola: 401540 markings, 539632 edges, 10614 markings/sec, 35 secs
lola: 455617 markings, 615773 edges, 10815 markings/sec, 40 secs
lola: 507857 markings, 683299 edges, 10448 markings/sec, 45 secs
lola: 561750 markings, 758921 edges, 10779 markings/sec, 50 secs
lola: 613907 markings, 826576 edges, 10431 markings/sec, 55 secs
lola: 667627 markings, 902189 edges, 10744 markings/sec, 60 secs
lola: 721221 markings, 971510 edges, 10719 markings/sec, 65 secs
lola: 773136 markings, 1044880 edges, 10383 markings/sec, 70 secs
lola: 826430 markings, 1119903 edges, 10659 markings/sec, 75 secs
lola: 878411 markings, 1187200 edges, 10396 markings/sec, 80 secs
lola: 931584 markings, 1262099 edges, 10635 markings/sec, 85 secs
lola: 983615 markings, 1329407 edges, 10406 markings/sec, 90 secs
lola: 1036787 markings, 1404352 edges, 10634 markings/sec, 95 secs
lola: 1090069 markings, 1473323 edges, 10656 markings/sec, 100 secs
lola: 1147669 markings, 1553853 edges, 11520 markings/sec, 105 secs
lola: 1206997 markings, 1636762 edges, 11866 markings/sec, 110 secs
lola: 1265886 markings, 1712991 edges, 11778 markings/sec, 115 secs
lola: 1325123 markings, 1795776 edges, 11847 markings/sec, 120 secs
lola: 1386147 markings, 1880782 edges, 12205 markings/sec, 125 secs
lola: 1448483 markings, 1961535 edges, 12467 markings/sec, 130 secs
lola: 1504330 markings, 2039888 edges, 11169 markings/sec, 135 secs
lola: 1558243 markings, 2115854 edges, 10783 markings/sec, 140 secs
lola: 1608634 markings, 2193698 edges, 10078 markings/sec, 145 secs
lola: 1660382 markings, 2278729 edges, 10350 markings/sec, 150 secs
lola: 1712473 markings, 2359092 edges, 10418 markings/sec, 155 secs
lola: 1764368 markings, 2438570 edges, 10379 markings/sec, 160 secs
lola: 1815897 markings, 2517722 edges, 10306 markings/sec, 165 secs
lola: 1866730 markings, 2601158 edges, 10167 markings/sec, 170 secs
lola: 1918171 markings, 2680679 edges, 10288 markings/sec, 175 secs
lola: 1974386 markings, 2765703 edges, 11243 markings/sec, 180 secs
lola: 2028606 markings, 2887887 edges, 10844 markings/sec, 185 secs
lola: 2065603 markings, 2950148 edges, 7399 markings/sec, 190 secs
lola: 2105337 markings, 3009068 edges, 7947 markings/sec, 195 secs
lola: 2142530 markings, 3078787 edges, 7439 markings/sec, 200 secs
lola: 2175604 markings, 3141004 edges, 6615 markings/sec, 205 secs
lola: 2213030 markings, 3203574 edges, 7485 markings/sec, 210 secs
lola: 2252562 markings, 3262231 edges, 7906 markings/sec, 215 secs
lola: 2288481 markings, 3331582 edges, 7184 markings/sec, 220 secs
lola: 2322111 markings, 3393455 edges, 6726 markings/sec, 225 secs
lola: 2360216 markings, 3456663 edges, 7621 markings/sec, 230 secs
lola: 2399597 markings, 3514801 edges, 7876 markings/sec, 235 secs
lola: 2434181 markings, 3583927 edges, 6917 markings/sec, 240 secs
lola: 2468338 markings, 3645526 edges, 6831 markings/sec, 245 secs
lola: 2506986 markings, 3709129 edges, 7730 markings/sec, 250 secs
lola: 2546187 markings, 3767148 edges, 7840 markings/sec, 255 secs
lola: 2579718 markings, 3836025 edges, 6706 markings/sec, 260 secs
lola: 2614416 markings, 3897397 edges, 6940 markings/sec, 265 secs
lola: 2653628 markings, 3961352 edges, 7842 markings/sec, 270 secs
lola: 2692850 markings, 4019236 edges, 7844 markings/sec, 275 secs
lola: 2725047 markings, 4087558 edges, 6439 markings/sec, 280 secs
lola: 2760296 markings, 4154375 edges, 7050 markings/sec, 285 secs
lola: 2799884 markings, 4213105 edges, 7918 markings/sec, 290 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (X ((3 <= p123))))) OR A (F ((1 <= p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((3 <= p123)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((3 <= p123)))
lola: processed formula length: 19
lola: 2 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238)))
lola: processed formula: A (F ((1 <= p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238)))
lola: processed formula length: 159
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.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: 19696 markings, 24574 edges, 3939 markings/sec, 0 secs
lola: 55285 markings, 70218 edges, 7118 markings/sec, 5 secs
lola: 98426 markings, 123889 edges, 8628 markings/sec, 10 secs
lola: 140957 markings, 182850 edges, 8506 markings/sec, 15 secs
lola: 183951 markings, 242329 edges, 8599 markings/sec, 20 secs
lola: 226582 markings, 295133 edges, 8526 markings/sec, 25 secs
lola: 267382 markings, 352024 edges, 8160 markings/sec, 30 secs
lola: 309948 markings, 410952 edges, 8513 markings/sec, 35 secs
lola: 352238 markings, 463449 edges, 8458 markings/sec, 40 secs
lola: 394798 markings, 522381 edges, 8512 markings/sec, 45 secs
lola: 437017 markings, 574721 edges, 8444 markings/sec, 50 secs
lola: 479463 markings, 633523 edges, 8489 markings/sec, 55 secs
lola: 521805 markings, 692211 edges, 8468 markings/sec, 60 secs
lola: 563899 markings, 744413 edges, 8419 markings/sec, 65 secs
lola: 604498 markings, 801148 edges, 8120 markings/sec, 70 secs
lola: 646617 markings, 853375 edges, 8424 markings/sec, 75 secs
lola: 689048 markings, 912162 edges, 8486 markings/sec, 80 secs
lola: 731321 markings, 970774 edges, 8455 markings/sec, 85 secs
lola: 773590 markings, 1023171 edges, 8454 markings/sec, 90 secs
lola: 816308 markings, 1082276 edges, 8544 markings/sec, 95 secs
lola: 858871 markings, 1135367 edges, 8513 markings/sec, 100 secs
lola: 902060 markings, 1195061 edges, 8638 markings/sec, 105 secs
lola: 945235 markings, 1254682 edges, 8635 markings/sec, 110 secs
lola: 988215 markings, 1308244 edges, 8596 markings/sec, 115 secs
lola: 1035288 markings, 1372704 edges, 9415 markings/sec, 120 secs
lola: 1084124 markings, 1439506 edges, 9767 markings/sec, 125 secs
lola: 1126691 markings, 1492238 edges, 8513 markings/sec, 130 secs
lola: 1168645 markings, 1557524 edges, 8391 markings/sec, 135 secs
lola: 1210348 markings, 1627714 edges, 8341 markings/sec, 140 secs
lola: 1252313 markings, 1692513 edges, 8393 markings/sec, 145 secs
lola: 1293905 markings, 1761920 edges, 8318 markings/sec, 150 secs
lola: 1335556 markings, 1826582 edges, 8330 markings/sec, 155 secs
lola: 1377096 markings, 1890566 edges, 8308 markings/sec, 160 secs
lola: 1417914 markings, 1958782 edges, 8164 markings/sec, 165 secs
lola: 1459452 markings, 2023581 edges, 8308 markings/sec, 170 secs
lola: 1503126 markings, 2090023 edges, 8735 markings/sec, 175 secs
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: 1509267 markings, 2137113 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p216 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) AND (2 <= p4 + p5 + p6 + p7 + p8)) OR ((3 <= p262) AND (p4 + p5 + p6 + p7 + p8 <= p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p216 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) AND (2 <= p4 + p5 + p6 + p7 + p8)) OR ((3 <= p262) AND (p4 + p5 + p6 + p7 + p8 <= p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + 1 <= p216) OR (p4 + p5 + p6 + p7 + p8 <= 1)) AND ((p262 <= 2) OR (p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p... (shortened)
lola: processed formula length: 557
lola: 2 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 38 markings, 37 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((p1 <= p191) AND (3 <= p123))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((p1 <= p191) AND (3 <= p123))))))
lola: processed formula: A (F (A (G (((p1 <= p191) AND (3 <= p123))))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.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: 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: 36 markings, 37 edges
lola: ========================================
lola: subprocess 9 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G ((p260 <= p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259))) AND E (G ((p366 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 <= p368)))) AND ((((p124 <= 2) OR (p3 <= 0)) AND ((p261 + 1 <= p367) OR (p340... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p260 <= p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259)))
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 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J20-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-CTLCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 454 markings, 571 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((p168 <= p1))) OR A (G ((p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= p267))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p168 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (p1 + 1 <= p168))))
lola: processed formula length: 41
lola: 4 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
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: 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2189 markings, 5610 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p339 <= 0) OR (p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 <= p338))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= p339) AND (p338 + 1 <= p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259))))
lola: processed formula length: 191
lola: 2 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 35 markings, 34 edges
lola: ========================================
lola: subprocess 12 will run for 697 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p191 <= p345) AND (p215 <= p260))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((p345 + 1 <= p191) OR (p260 + 1 <= p215)))))
lola: processed formula length: 68
lola: 3 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
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: 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 156 markings, 156 edges
lola: ========================================
lola: subprocess 13 will run for 929 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p261) AND (2 <= p267) AND ((3 <= p215) OR (p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 <= p216))) U E (F ((1 <= p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((1 <= p261) AND (2 <= p267) AND ((3 <= p215) OR (p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 <= p216))) U E(TRUE U (1 <= p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259)))
lola: processed formula length: 373
lola: 2 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
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: 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2166 markings, 5308 edges
lola: ========================================
lola: subprocess 14 will run for 1394 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((p191 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))) AND (p169 <= p4 + p5 + p6 + p7 + p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((p191 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))) AND (p169 <= p4 + p5 + p6 + p7 + p8))))
lola: processed formula: A (F ((A (G ((p191 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))) AND (p169 <= p4 + p5 + p6 + p7 + p8))))
lola: processed formula length: 209
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.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: 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: 49780 markings, 92160 edges
lola: ========================================
lola: subprocess 15 will run for 2787 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p214 <= 2)))
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 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J20-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no unknown no unknown no yes no no yes yes yes yes no no
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-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="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-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-structural"
echo " Input is PolyORBNT-COL-S05J20, 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 r127-smll-152673529300262"
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 ;