Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 5.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 154K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PolyORBLF-COL-S02J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-152673532600010
=====================================================================

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1526841648185


BK_STOP 1526842319231

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

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

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-COL-S02J04T06: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-COL-S02J04T06: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBLF-COL-S02J04T06 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
Makefile:222: recipe for target 'verify' failed
----- 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: 1396/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 476 places, 920 transitions, 430 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1243 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: A (F (((3 <= p213) AND (p317 + p318 + p319 + p320 + p321 + p322 <= p408 + p409 + p410 + p411 + p412 + p413) AND (p236 + p237 + p238 + p239 + p240 + p241 <= p293 + p294 + p295 + p296 + p297 + p298) AND (p20 + p21 + p22 + p23 + p24 + p25 <= p329 + p330 + p331 + p332 + p333 + p334) AND (p61 + p60 + p59 + p58 + p57 + p62 + 1 <= p162) AND (1 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271)))) : NOT(A (G ((((3 <= p299 + p300 + p301 + p302 + p303 + p304) AND (3 <= p210)) OR ((p161 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141)))))) : E ((((p40 + p41 + p42 + p43 + p44 + p45 <= p230 + p231 + p232 + p233 + p234 + p235) OR (1 <= p166)) U ((p420 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196) AND (1 <= p106 + p107 + p108 + p109 + p110 + p111) AND (p162 <= p165) AND (p379 + p380 + p381 + p382 + p383 <= p323 + p324 + p325 + p326 + p327 + p328)))) : A (G ((((p395 + 1 <= p8 + p9 + p10 + p11 + p12 + p13) OR ((p373 + p374 + p375 + p376 + p377 + p378 <= p384 + p385 + p386 + p387 + p388 + p389) AND (p143 + p144 + p145 + p146 + p147 + p148 <= p420))) AND (((p292 <= p100 + p101 + p102 + p103 + p104 + p105) AND (2 <= p26)) OR ((p317 + p318 + p319 + p320 + p321 + p322 <= p286 + p287 + p288 + p289 + p290 + p291) AND (p230 + p231 + p232 + p233 + p234 + p235 <= p427 + p428 + p429 + p430 + p431 + p432)))))) : ((NOT(E (G ((p61 + p60 + p59 + p58 + p57 + p62 <= p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361)))) AND (A (G ((p1 + p2 + p3 + p4 + p5 + p6 <= p61 + p60 + p59 + p58 + p57 + p62))) OR E (G ((3 <= p317 + p318 + p319 + p320 + p321 + p322))))) AND (p40 + p41 + p42 + p43 + p44 + p45 <= p55)) : (E (G (E (X ((p230 + p231 + p232 + p233 + p234 + p235 <= p362 + p363 + p364 + p365 + p366 + p367))))) AND (NOT(E (X ((2 <= p143 + p144 + p145 + p146 + p147 + p148)))) OR (A (X ((p224 + p225 + p226 + p227 + p228 + p229 <= p55))) AND A (F ((p0 <= p56)))))) : (A (F (A (X ((3 <= p211 + p212))))) AND ((A (X ((p373 + p374 + p375 + p376 + p377 + p378 <= p20 + p21 + p22 + p23 + p24 + p25))) OR A (G ((3 <= p210)))) AND (2 <= p349 + p348))) : E (G (A (F (((p395 <= p278 + p279) OR (p236 + p237 + p238 + p239 + p240 + p241 <= p210)))))) : (NOT((((p211 + p212 <= 1) OR (p27 + p28 + p29 + p30 + p31 + p32 + 1 <= p335 + p336 + p337 + p338 + p339 + p340)) AND E (F ((2 <= p395))))) OR (((p329 + p330 + p331 + p332 + p333 + p334 + 1 <= p0) AND (1 <= p278 + p279)) AND E (F (((p323 + p324 + p325 + p326 + p327 + p328 <= p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407) AND (p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 <= p61 + p60 + p59 + p58 + p57 + p62)))))) : E (F (E (G (((1 <= p20 + p21 + p22 + p23 + p24 + p25) OR (p444 + p443 + p442 + p441 + p440 + p439 <= p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361)))))) : A (F (E (G (((p34 + p35 + p36 + p37 + p38 + p39 <= p335 + p336 + p337 + p338 + p339 + p340) OR (3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209)))))) : A (G (((((p373 + p374 + p375 + p376 + p377 + p378 <= p368 + p369 + p370 + p371 + p372) AND (2 <= p349 + p348)) OR ((p230 + p231 + p232 + p233 + p234 + p235 <= p286 + p287 + p288 + p289 + p290 + p291) AND (1 <= p91 + p90 + p89 + p88 + p87 + p92))) OR E (F ((p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 <= p299 + p300 + p301 + p302 + p303 + p304)))))) : ((E (G ((p379 + p380 + p381 + p382 + p383 + 1 <= p445))) OR E (G (((1 <= p99) OR (1 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271))))) OR A (X ((3 <= p292)))) : ((p40 + p41 + p42 + p43 + p44 + p45 + 1 <= p211 + p212) OR E (F (((1 <= p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316) OR ((p293 + p294 + p295 + p296 + p297 + p298 <= p164) AND (p323 + p324 + p325 + p326 + p327 + p328 <= p292)))))) : ((((((3 <= p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223) OR (1 <= p61 + p60 + p59 + p58 + p57 + p62)) AND (3 <= p100 + p101 + p102 + p103 + p104 + p105)) OR A (F ((1 <= p445)))) AND A (G (((p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p85 + p86) OR (p155 + p156 + p157 + p158 + p159 + p160 <= p379 + p380 + p381 + p382 + p383))))) OR E ((((p224 + p225 + p226 + p227 + p228 + p229 <= p73 + p72 + p71 + p70 + p69 + p74) AND (1 <= p40 + p41 + p42 + p43 + p44 + p45)) U ((p106 + p107 + p108 + p109 + p110 + p111 <= p197) AND (1 <= p164))))) : A (((p373 + p374 + p375 + p376 + p377 + p378 <= p384 + p385 + p386 + p387 + p388 + p389) U ((p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 <= p433 + p434 + p435 + p436 + p437) AND (2 <= p165) AND (p427 + p428 + p429 + p430 + p431 + p432 <= 1))))
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 (F (((3 <= p213) AND (p317 + p318 + p319 + p320 + p321 + p322 <= p408 + p409 + p410 + p411 + p412 + p413) AND (p236 + p237 + p238 + p239 + p240 + p241 <= p293 + p294 + p295 + p296 + p297 + p298) AND (p20 + p21 + p22 + p23 + p24 + p25 <= p329 + p330 + p331 + p332 + p333 + p334) AND (p61 + p60 + p59 + p58 + p57 + p62 + 1 <= p162) AND (1 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= p213) AND (p317 + p318 + p319 + p320 + p321 + p322 <= p408 + p409 + p410 + p411 + p412 + p413) AND (p236 + p237 + p238 + p239 + p240 + p241 <= p293 + p294 + p295 + p296 + p297 + p298) AND (p20 + p21 + p22 + p23 + p24 + p25 <= p329 + p330 + p331 + p332 + p333 + p334) AND (p61 + p60 + p59 + p58 + p57 + p62 + 1 <= p162) AND (1 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271))))
lola: processed formula: A (F (((3 <= p213) AND (p317 + p318 + p319 + p320 + p321 + p322 <= p408 + p409 + p410 + p411 + p412 + p413) AND (p236 + p237 + p238 + p239 + p240 + p241 <= p293 + p294 + p295 + p296 + p297 + p298) AND (p20 + p21 + p22 + p23 + p24 + p25 <= p329 + p330 + p331 + p332 + p333 + p334) AND (p61 + p60 + p59 + p58 + p57 + p62 + 1 <= p162) AND (1 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p2... (shortened)
lola: processed formula length: 553
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 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: 650 markings, 650 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((((3 <= p299 + p300 + p301 + p302 + p303 + p304) AND (3 <= p210)) OR ((p161 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p40 + p41 + p42 + p43 + p44 + p45 <= p230 + p231 + p232 + p233 + p234 + p235) OR (1 <= p166)) U ((p420 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196) AND (1 <= p106 + p107 + p108 + p109 + p110 + p111) AND (p162 <= p165) AND (p37... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p40 + p41 + p42 + p43 + p44 + p45 <= p230 + p231 + p232 + p233 + p234 + p235) OR (1 <= p166)) U ((p420 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196) AND (1 <= p106 + p107 + p108 + p109 + p110 + p111) AND (p162 <= p165) AND (p379 ... (shortened)
lola: processed formula length: 473
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: 25 markings, 24 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p395 + 1 <= p8 + p9 + p10 + p11 + p12 + p13) OR ((p373 + p374 + p375 + p376 + p377 + p378 <= p384 + p385 + p386 + p387 + p388 + p389) AND (p143 + p144 + p145 + p146 + p147 + p148 <= p420))) AND (((p292 <= p100 + p101 + p102 + p103 + p104 + p105) AND (2 <= p26)) OR ((p317 + p318 + p319 + p320 + p321 + p322 <= p286 + p287 + p288 + p289 + p290 + p291) AND (p230 + p231 + p232 + p233 + p234 ... (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 1720 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 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (G ((p61 + p60 + p59 + p58 + p57 + p62 <= p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361)))) AND (A (G ((p1 + p2 + p3 + p4 + p5 + p6 <= p61 + p60 + p59 + p58 + p57 + p62))) OR E (G ((3 <= p317 + p318 + p319 + p320 + p321 + p322))))) AND (p40 + p41 + p42 + p43 + p44 + p45 <= p55))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + 1 <= p61 + p60 + p59 + p58 + p57 + p62)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + 1 <= p61 + p60 + p59 + p58 + p57 + p62)))
lola: processed formula: A (F ((p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + 1 <= p61 + p60 + p59 + p58 + p57 + p62)))
lola: processed formula length: 132
lola: 4 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 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: 31853 markings, 38215 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1 + p2 + p3 + p4 + p5 + p6 <= p61 + p60 + p59 + p58 + p57 + p62)))
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 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= p317 + p318 + p319 + p320 + p321 + p322)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p317 + p318 + p319 + p320 + p321 + p322 <= 2)))
lola: processed formula length: 61
lola: 6 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((p230 + p231 + p232 + p233 + p234 + p235 <= p362 + p363 + p364 + p365 + p366 + p367))))) AND (NOT(E (X ((2 <= p143 + p144 + p145 + p146 + p147 + p148)))) OR (A (X ((p224 + p225 + p226 + p227 + p228 + p229 <= p55))) AND A (F ((p0 <= p56))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((p230 + p231 + p232 + p233 + p234 + p235 <= p362 + p363 + p364 + p365 + p366 + p367)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((p230 + p231 + p232 + p233 + p234 + p235 <= p362 + p363 + p364 + p365 + p366 + p367)))))
lola: processed formula length: 108
lola: 5 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 390 markings, 390 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p143 + p144 + p145 + p146 + p147 + p148 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p143 + p144 + p145 + p146 + p147 + p148 <= 1)))
lola: processed formula: A (X ((p143 + p144 + p145 + p146 + p147 + p148 <= 1)))
lola: processed formula length: 54
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 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: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= p211 + p212))))) AND ((A (X ((p373 + p374 + p375 + p376 + p377 + p378 <= p20 + p21 + p22 + p23 + p24 + p25))) OR A (G ((3 <= p210)))) AND (2 <= p349 + p348)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= p211 + p212)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= p211 + p212)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 386 markings, 386 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p395 <= p278 + p279) OR (p236 + p237 + p238 + p239 + p240 + p241 <= p210))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((p395 <= p278 + p279) OR (p236 + p237 + p238 + p239 + p240 + p241 <= p210))))))
lola: processed formula length: 107
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: 650 markings, 1300 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((((p211 + p212 <= 1) OR (p27 + p28 + p29 + p30 + p31 + p32 + 1 <= p335 + p336 + p337 + p338 + p339 + p340)) AND E (F ((2 <= p395))))) OR (((p329 + p330 + p331 + p332 + p333 + p334 + 1 <= p0) AND (1 <= p278 + p279)) AND E (F (((p323 + p324 + p325 + p326 + p327 + p328 <= p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407) AND (p396 + p397 + p398 + p399 + p400 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p211 + p212) AND (p335 + p336 + p337 + p338 + p339 + p340 <= p27 + p28 + p29 + p30 + p31 + p32))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p211 + p212) AND (p335 + p336 + p337 + p338 + p339 + p340 <= p27 + p28 + p29 + p30 + p31 + p32))
lola: processed formula length: 103
lola: 6 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: processed formula with 2 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p395 <= 1)))
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 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T06-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 169100 markings, 197601 edges, 33820 markings/sec, 0 secs
lola: sara is running 5 secs || 343253 markings, 402731 edges, 34831 markings/sec, 5 secs
lola: sara is running 10 secs || 516589 markings, 607497 edges, 34667 markings/sec, 10 secs
lola: sara is running 15 secs || 689806 markings, 813263 edges, 34643 markings/sec, 15 secs
lola: sara is running 20 secs || 862732 markings, 1017988 edges, 34585 markings/sec, 20 secs
lola: sara is running 25 secs || 1035133 markings, 1222252 edges, 34480 markings/sec, 25 secs
lola: sara is running 30 secs || 1207156 markings, 1427269 edges, 34405 markings/sec, 30 secs
lola: sara is running 35 secs || 1379082 markings, 1635010 edges, 34385 markings/sec, 35 secs
lola: sara is running 40 secs || 1550586 markings, 1842923 edges, 34301 markings/sec, 40 secs
lola: sara is running 45 secs || 1721319 markings, 2048217 edges, 34147 markings/sec, 45 secs
lola: sara is running 50 secs || 1891880 markings, 2256053 edges, 34112 markings/sec, 50 secs
lola: sara is running 55 secs || 2062092 markings, 2463319 edges, 34042 markings/sec, 55 secs
lola: sara is running 60 secs || 2232282 markings, 2671092 edges, 34038 markings/sec, 60 secs
lola: sara is running 65 secs || 2401807 markings, 2877585 edges, 33905 markings/sec, 65 secs
lola: sara is running 70 secs || 2570334 markings, 3081888 edges, 33705 markings/sec, 70 secs
lola: sara is running 75 secs || 2737947 markings, 3283743 edges, 33523 markings/sec, 75 secs
lola: sara is running 80 secs || 2905266 markings, 3486823 edges, 33464 markings/sec, 80 secs
lola: sara is running 85 secs || 3071780 markings, 3687143 edges, 33303 markings/sec, 85 secs
lola: sara is running 90 secs || 3238119 markings, 3885502 edges, 33268 markings/sec, 90 secs
lola: sara is running 95 secs || 3403580 markings, 4082340 edges, 33092 markings/sec, 95 secs
lola: sara is running 100 secs || 3569215 markings, 4281630 edges, 33127 markings/sec, 100 secs
lola: sara is running 105 secs || 3734214 markings, 4479135 edges, 33000 markings/sec, 105 secs
lola: sara is running 110 secs || 3899537 markings, 4679533 edges, 33065 markings/sec, 110 secs
lola: sara is running 115 secs || 4062805 markings, 4876785 edges, 32654 markings/sec, 115 secs
lola: sara is running 120 secs || 4225458 markings, 5072130 edges, 32531 markings/sec, 120 secs
lola: sara is running 125 secs || 4383970 markings, 5259447 edges, 31702 markings/sec, 125 secs
lola: sara is running 130 secs || 4547029 markings, 5455920 edges, 32612 markings/sec, 130 secs
lola: sara is running 135 secs || 4710252 markings, 5653086 edges, 32645 markings/sec, 135 secs
lola: sara is running 140 secs || 4873286 markings, 5849361 edges, 32607 markings/sec, 140 secs
lola: sara is running 145 secs || 5028004 markings, 6033696 edges, 30944 markings/sec, 145 secs
lola: sara is running 150 secs || 5184452 markings, 6222366 edges, 31290 markings/sec, 150 secs
lola: sara is running 155 secs || 5347054 markings, 6418869 edges, 32520 markings/sec, 155 secs
lola: sara is running 160 secs || 5508107 markings, 6611464 edges, 32211 markings/sec, 160 secs
lola: sara is running 165 secs || 5664134 markings, 6796812 edges, 31205 markings/sec, 165 secs
lola: sara is running 170 secs || 5824508 markings, 6988449 edges, 32075 markings/sec, 170 secs
lola: sara is running 175 secs || 5983239 markings, 7179073 edges, 31746 markings/sec, 175 secs
lola: sara is running 180 secs || 6139825 markings, 7368265 edges, 31317 markings/sec, 180 secs
lola: sara is running 185 secs || 6296727 markings, 7557090 edges, 31380 markings/sec, 185 secs
lola: sara is running 190 secs || 6454184 markings, 7743922 edges, 31491 markings/sec, 190 secs
lola: sara is running 195 secs || 6610991 markings, 7929740 edges, 31361 markings/sec, 195 secs
lola: sara is running 200 secs || 6763048 markings, 8111704 edges, 30411 markings/sec, 200 secs
lola: sara is running 205 secs || 6915565 markings, 8293736 edges, 30503 markings/sec, 205 secs
lola: sara is running 210 secs || 7069625 markings, 8475646 edges, 30812 markings/sec, 210 secs
lola: sara is running 215 secs || 7221723 markings, 8657530 edges, 30420 markings/sec, 215 secs
lola: sara is running 220 secs || 7373137 markings, 8839226 edges, 30283 markings/sec, 220 secs
lola: sara is running 225 secs || 7525663 markings, 9025520 edges, 30505 markings/sec, 225 secs
lola: sara is running 230 secs || 7675811 markings, 9203571 edges, 30030 markings/sec, 230 secs
lola: sara is running 235 secs || 7827356 markings, 9383195 edges, 30309 markings/sec, 235 secs
lola: sara is running 240 secs || 7978926 markings, 9565475 edges, 30314 markings/sec, 240 secs
lola: sara is running 245 secs || 8131373 markings, 9749917 edges, 30489 markings/sec, 245 secs
lola: sara is running 250 secs || 8283187 markings, 9932570 edges, 30363 markings/sec, 250 secs
lola: sara is running 255 secs || 8432653 markings, 10112176 edges, 29893 markings/sec, 255 secs
lola: sara is running 260 secs || 8582475 markings, 10293181 edges, 29964 markings/sec, 260 secs
lola: sara is running 265 secs || 8733136 markings, 10472887 edges, 30132 markings/sec, 265 secs
lola: sara is running 270 secs || 8885228 markings, 10658912 edges, 30418 markings/sec, 270 secs
lola: sara is running 275 secs || 9037913 markings, 10845757 edges, 30537 markings/sec, 275 secs
lola: sara is running 280 secs || 9188285 markings, 11027411 edges, 30074 markings/sec, 280 secs
lola: sara is running 285 secs || 9339598 markings, 11210164 edges, 30263 markings/sec, 285 secs
lola: sara is running 290 secs || 9489981 markings, 11395179 edges, 30077 markings/sec, 290 secs
lola: sara is running 295 secs || 9640088 markings, 11578798 edges, 30021 markings/sec, 295 secs
lola: sara is running 300 secs || 9791312 markings, 11761605 edges, 30245 markings/sec, 300 secs
lola: sara is running 305 secs || 9942040 markings, 11942279 edges, 30146 markings/sec, 305 secs
lola: sara is running 310 secs || 10094950 markings, 12131012 edges, 30582 markings/sec, 310 secs
lola: sara is running 315 secs || 10248311 markings, 12317720 edges, 30672 markings/sec, 315 secs
lola: sara is running 320 secs || 10401959 markings, 12506228 edges, 30730 markings/sec, 320 secs
lola: sara is running 325 secs || 10554027 markings, 12690646 edges, 30414 markings/sec, 325 secs
lola: sara is running 330 secs || 10704922 markings, 12873187 edges, 30179 markings/sec, 330 secs
lola: sara is running 335 secs || 10854707 markings, 13053970 edges, 29957 markings/sec, 335 secs
lola: sara is running 340 secs || 11005192 markings, 13239376 edges, 30097 markings/sec, 340 secs
lola: sara is running 345 secs || 11157444 markings, 13424415 edges, 30450 markings/sec, 345 secs
lola: sara is running 350 secs || 11307568 markings, 13607975 edges, 30025 markings/sec, 350 secs
lola: sara is running 355 secs || 11456811 markings, 13788959 edges, 29849 markings/sec, 355 secs
lola: sara is running 360 secs || 11608582 markings, 13973578 edges, 30354 markings/sec, 360 secs
lola: sara is running 365 secs || 11761097 markings, 14161174 edges, 30503 markings/sec, 365 secs
lola: sara is running 370 secs || 11911745 markings, 14342761 edges, 30130 markings/sec, 370 secs
lola: sara is running 375 secs || 12062431 markings, 14531061 edges, 30137 markings/sec, 375 secs
lola: sara is running 380 secs || 12211698 markings, 14734604 edges, 29853 markings/sec, 380 secs
lola: sara is running 385 secs || 12359490 markings, 14942263 edges, 29558 markings/sec, 385 secs
lola: sara is running 390 secs || 12508479 markings, 15132860 edges, 29798 markings/sec, 390 secs
lola: sara is running 395 secs || 12659193 markings, 15323147 edges, 30143 markings/sec, 395 secs
lola: sara is running 400 secs || 12809076 markings, 15506075 edges, 29977 markings/sec, 400 secs
lola: sara is running 405 secs || 12960397 markings, 15692336 edges, 30264 markings/sec, 405 secs
lola: sara is running 410 secs || 13110955 markings, 15878779 edges, 30112 markings/sec, 410 secs
lola: sara is running 415 secs || 13259994 markings, 16071537 edges, 29808 markings/sec, 415 secs
lola: sara is running 420 secs || 13408560 markings, 16278043 edges, 29713 markings/sec, 420 secs
lola: sara is running 425 secs || 13558967 markings, 16462644 edges, 30081 markings/sec, 425 secs
lola: sara is running 430 secs || 13710105 markings, 16642757 edges, 30228 markings/sec, 430 secs
lola: sara is running 435 secs || 13860199 markings, 16846166 edges, 30019 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= p20 + p21 + p22 + p23 + p24 + p25) OR (p444 + p443 + p442 + p441 + p440 + p439 <= p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U ((p20 + p21 + p22 + p23 + p24 + p25 <= 0) AND (p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + 1 <= p444 + p443 + p442 + p441 + p440 + p439)))))
lola: processed formula length: 202
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: 5795 markings, 6746 edges
lola: ========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p34 + p35 + p36 + p37 + p38 + p39 <= p335 + p336 + p337 + p338 + p339 + p340) OR (3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((p335 + p336 + p337 + p338 + p339 + p340 + 1 <= p34 + p35 + p36 + p37 + p38 + p39) AND (p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 <= 2)))))
lola: processed formula length: 202
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: 608832 markings, 1156219 edges
lola: ========================================
lola: subprocess 11 will run for 618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p373 + p374 + p375 + p376 + p377 + p378 <= p368 + p369 + p370 + p371 + p372) AND (2 <= p349 + p348)) OR ((p230 + p231 + p232 + p233 + p234 + p235 <= p286 + p287 + p288 + p289 + p290 + p291) AND (1 <= p91 + p90 + p89 + p88 + p87 + p92))) OR E (F ((p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U ((((p368 + p369 + p370 + p371 + p372 + 1 <= p373 + p374 + p375 + p376 + p377 + p378) OR (p349 + p348 <= 1)) AND ((p286 + p287 + p288 + p289 + p290 + p291 + 1 <= p230 + p231 + p232 + p233 + p234 + p235) OR (p91 + p90 + p89 + p88 + p87 + p92 <= 0))) AND NOT(E(TRUE U (p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + ... (shortened)
lola: processed formula length: 537
lola: 4 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: 587562 markings, 1277276 edges, 3225752436249460736 markings/sec, 0 secs
lola: 1170038 markings, 2593137 edges, 116495 markings/sec, 5 secs
lola: 1736055 markings, 3884287 edges, 113203 markings/sec, 10 secs
lola: 2302671 markings, 5166049 edges, 113323 markings/sec, 15 secs
lola: 2872472 markings, 6452651 edges, 113960 markings/sec, 20 secs
lola: 3441364 markings, 7740638 edges, 113778 markings/sec, 25 secs
lola: 4008342 markings, 9021538 edges, 113396 markings/sec, 30 secs
lola: 4604160 markings, 10380794 edges, 119164 markings/sec, 35 secs
lola: 5218308 markings, 11821543 edges, 122830 markings/sec, 40 secs
lola: 5824725 markings, 13251113 edges, 121283 markings/sec, 45 secs
lola: 6426782 markings, 14661712 edges, 120411 markings/sec, 50 secs
lola: 7021160 markings, 16084178 edges, 118876 markings/sec, 55 secs
lola: 7604623 markings, 17480759 edges, 116693 markings/sec, 60 secs
lola: 8193620 markings, 18887100 edges, 117799 markings/sec, 65 secs
lola: 8813873 markings, 20354939 edges, 124051 markings/sec, 70 secs
lola: 9401171 markings, 21751527 edges, 117460 markings/sec, 75 secs
lola: 9988859 markings, 23141908 edges, 117538 markings/sec, 80 secs
lola: 10560171 markings, 24498687 edges, 114262 markings/sec, 85 secs
lola: 11140275 markings, 25890401 edges, 116021 markings/sec, 90 secs
lola: 11722449 markings, 27291024 edges, 116435 markings/sec, 95 secs
lola: 12294558 markings, 28674617 edges, 114422 markings/sec, 100 secs
lola: 12867097 markings, 30053781 edges, 114508 markings/sec, 105 secs
lola: 13442914 markings, 31458015 edges, 115163 markings/sec, 110 secs
lola: 14006900 markings, 32833229 edges, 112797 markings/sec, 115 secs
lola: 14567020 markings, 34205681 edges, 112024 markings/sec, 120 secs
lola: 15123615 markings, 35561741 edges, 111319 markings/sec, 125 secs
lola: 15686458 markings, 36954213 edges, 112569 markings/sec, 130 secs
lola: 16238896 markings, 38300071 edges, 110488 markings/sec, 135 secs
lola: 16786047 markings, 39643884 edges, 109430 markings/sec, 140 secs
lola: 17332282 markings, 40977579 edges, 109247 markings/sec, 145 secs
lola: 17881566 markings, 42325929 edges, 109857 markings/sec, 150 secs
lola: 18432172 markings, 43666727 edges, 110121 markings/sec, 155 secs
lola: 18656650 markings, 44225035 edges, 44896 markings/sec, 160 secs
lola: 18657633 markings, 44227410 edges, 197 markings/sec, 165 secs
lola: 18658673 markings, 44230265 edges, 208 markings/sec, 170 secs
lola: 18659567 markings, 44232431 edges, 179 markings/sec, 175 secs
lola: 18659601 markings, 44232506 edges, 7 markings/sec, 180 secs
lola: 18659938 markings, 44233307 edges, 67 markings/sec, 185 secs
lola: 18659970 markings, 44233382 edges, 6 markings/sec, 190 secs
lola: 18659991 markings, 44233434 edges, 4 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ' '
Aborted (core dumped)
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is PolyORBLF-COL-S02J04T06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-152673532600010"
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 ;