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 240K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 15K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K 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.7K 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 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 69K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is NeoElection-COL-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472400241
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527139782820


BK_STOP 1527139828097

--------------------
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 NeoElection-COL-2 as instance name.
Using NeoElection 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': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': False, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 189, 'Memory': 111.05, 'Tool': 'lola'}, {'Time': 253, 'Memory': 111.66, 'Tool': 'lola'}, {'Time': 3405, 'Memory': 2230.41, 'Tool': 'marcie'}, {'Time': 3407, 'Memory': 2230.45, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola NeoElection-COL-2...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
NeoElection-COL-2: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
NeoElection-COL-2: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ NeoElection-COL-2 @ 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: 813/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 438 places, 375 transitions, 156 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 249 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-2-CTLCardinality.task
lola: A (X (E (G ((p413 + p412 + p411 + p410 + p409 + p408 <= 1))))) : NOT((E (G (((p407 + p406 + p405 + p404 + p403 + p402 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5) AND (p423 + p424 + p425 <= p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194)))) AND (((p221 + p220 + p219 <= 1) OR (p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422 <= 0)) AND ((p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + 1 <= p407 + p406 + p405 + p404 + p403 + p402) OR (p428 + p427 + p426 <= 0))))) : (E (G (((p221 + p220 + p219 <= 1) AND ((2 <= p180 + p181 + p182) OR (1 <= p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422))))) OR ((1 <= p180 + p181 + p182))) : E (G (A (F (((3 <= p186 + p187 + p188) OR (p435 + p436 + p437 <= p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194)))))) : (E (G ((((2 <= p189 + p190 + p191) OR (p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422)) AND (p428 + p427 + p426 <= 0)))) OR E (G (((1 <= p180 + p181 + p182) AND (p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194 <= p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422) AND (3 <= p221 + p220 + p219))))) : A (X (A (F ((3 <= p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p263 + p262 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p243 + p242 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p241 + p240 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401))))) : E (G (NOT(A (F ((p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p435 + p436 + p437)))))) : E (G (((p413 + p412 + p411 + p410 + p409 + p408 + 1 <= p432 + p433 + p434) OR (p407 + p406 + p405 + p404 + p403 + p402 <= 1) OR (p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p263 + p262 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p243 + p242 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p241 + p240 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 <= 2)))) : E (G (A (((p186 + p187 + p188 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5) U (p186 + p187 + p188 <= p435 + p436 + p437))))) : A (F (A (F ((p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194 + 1 <= p186 + p187 + p188))))) : A (X (E (G ((p413 + p412 + p411 + p410 + p409 + p408 <= 1))))) : (((p413 + p412 + p411 + p410 + p409 + p408 <= 0) OR (2 <= p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222) OR ((3 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5) AND ((p432 + p433 + p434 <= 1) OR (p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422 <= 0)))) AND NOT(A (F ((p186 + p187 + p188 + 1 <= p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p263 + p262 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p243 + p242 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p241 + p240 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401))))) : E (G (NOT(A (G ((1 <= p423 + p424 + p425)))))) : NOT(A (F ((3 <= p180 + p181 + p182)))) : (A (F ((3 <= p186 + p187 + p188))) OR A ((((3 <= p99 + p96 + p95 + p102 + p94 + p93 + p105 + p90 + p87 + p108 + p84 + p81 + p111 + p112 + p113 + p114 + p78 + p77 + p117 + p76 + p75 + p120 + p72 + p69 + p123 + p66 + p63 + p126 + p60 + p59 + p129 + p130 + p131 + p132 + p58 + p57 + p135 + p54 + p51 + p138 + p48 + p45 + p141 + p42 + p41 + p144 + p40 + p39 + p147 + p148 + p149 + p150 + p36 + p33 + p153 + p30 + p27 + p156 + p24 + p23 + p159 + p22 + p21 + p162 + p18 + p165 + p166 + p167 + p168 + p171 + p174 + p177 + p179 + p178 + p176 + p175 + p173 + p172 + p170 + p169 + p164 + p163 + p19 + p20 + p161 + p160 + p158 + p157 + p25 + p26 + p155 + p28 + p29 + p154 + p31 + p32 + p152 + p34 + p35 + p151 + p37 + p38 + p146 + p145 + p143 + p142 + p43 + p44 + p140 + p46 + p47 + p139 + p49 + p50 + p137 + p52 + p53 + p136 + p55 + p56 + p134 + p133 + p128 + p127 + p61 + p62 + p125 + p64 + p65 + p124 + p67 + p68 + p122 + p70 + p71 + p121 + p73 + p74 + p119 + p118 + p116 + p115 + p79 + p80 + p110 + p82 + p83 + p109 + p85 + p86 + p107 + p88 + p89 + p106 + p91 + p92 + p104 + p103 + p101 + p100 + p97 + p98) OR (1 <= p183 + p184 + p185)) U ((2 <= p429 + p430 + p431) AND (2 <= p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194))))) : NOT((((p186 + p187 + p188 <= 2) OR (p423 + p424 + p425 <= 1) OR (1 <= p189 + p190 + p191)) AND A (F (((2 <= p186 + p187 + p188))))))
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 (X (E (G ((p413 + p412 + p411 + p410 + p409 + p408 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (2 <= p413 + p412 + p411 + p410 + p409 + p408))))
lola: processed formula length: 65
lola: 3 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 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: 39 markings, 39 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G (((p407 + p406 + p405 + p404 + p403 + p402 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5) AND (p423 + p424 + p425 <= p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194)))) AND (((p221 + p220 + p219 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 + 1 <= p407 + p406 + p405 + p404 + p403 + p402) OR (p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194 + 1 <= p423 + p424 + p425))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 + 1 <= p407 + p406 + p405 + p404 + p403 + p402) OR (p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194 + 1 <= p423 + p424 + p425))))
lola: processed formula: A (F (((p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 + 1 <= p407 + p406 + p405 + p404 + p403 + p402) OR (p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194 + 1 <= p423 + p424 + p425))))
lola: processed formula length: 373
lola: 5 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 3 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p221 + p220 + p219) AND (1 <= p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422)) OR ((p407 + p406 + p405 + p404 + p403 + p402 <= p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222) AND (1 <= p428 + p427 + p426)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= p221 + p220 + p219) AND (1 <= p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422)) OR ((p407 + p406 + p405 + p404 + p403 + p402 <= p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222) AND (1 <= p428 + p427 + p426)))
lola: processed formula length: 306
lola: 5 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((p221 + p220 + p219 <= 1) AND ((2 <= p180 + p181 + p182) OR (1 <= p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422))))) OR ((1 <= p180 + p181 + p182)))
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: E (G (((p221 + p220 + p219 <= 1) AND ((2 <= p180 + p181 + p182) OR (1 <= p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= p221 + p220 + p219) OR ((p180 + p181 + p182 <= 1) AND (p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422 <= 0)))))
lola: processed formula length: 146
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 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: 33 markings, 32 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((3 <= p186 + p187 + p188) OR (p435 + p436 + p437 <= p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((3 <= p186 + p187 + p188) OR (p435 + p436 + p437 <= p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194))))))
lola: processed formula length: 272
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 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: 33 markings, 65 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((((2 <= p189 + p190 + p191) OR (p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422)) AND (p428 + p427 + p426 <= 0)))) OR E (G (((1 <= p180 + p181 + p182) AND (p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 ... (shortened)
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: E (G ((((2 <= p189 + p190 + p191) OR (p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422)) AND (p428 + p427 + p426 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p189 + p190 + p191 <= 1) AND (p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422 + 1 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5)) OR (1 <= p428 + p427 + p426))))
lola: processed formula length: 244
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 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: 33 markings, 32 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((3 <= p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p263 + p262 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p243 + p242 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p241 + p240 + p282... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (3 <= p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p263 + p262 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p243 + p242 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p241 + p240 + p282... (shortened)
lola: processed formula length: 1152
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 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: 32 markings, 31 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (F ((p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p435 + p436 + p437))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p435 + p436 + p437))))
lola: processed formula length: 144
lola: 7 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 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: 33 markings, 97 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p413 + p412 + p411 + p410 + p409 + p408 + 1 <= p432 + p433 + p434) OR (p407 + p406 + p405 + p404 + p403 + p402 <= 1) OR (p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p263 + p262 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p243 + p242 + p264 + p265 + p26... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p432 + p433 + p434 <= p413 + p412 + p411 + p410 + p409 + p408) AND (2 <= p407 + p406 + p405 + p404 + p403 + p402) AND (3 <= p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p263 + p262 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p243 + p242 + p264 + p2... (shortened)
lola: processed formula length: 1274
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 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: 33 markings, 32 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((p186 + p187 + p188 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5) U (p186 + p187 + p188 <= p435 + p436 + p437)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((p186 + p187 + p188 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5) U (p186 + p187 + p188 <= p435 + p436 + p437)))))
lola: processed formula length: 187
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 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: 175 markings, 271 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (F ((p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194 + 1 <= p186 + p187 + p188)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194 + 1 <= p186 + p187 + p188)))
lola: processed formula: A (F ((p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194 + 1 <= p186 + p187 + p188)))
lola: processed formula length: 222
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 3 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((p413 + p412 + p411 + p410 + p409 + p408 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (2 <= p413 + p412 + p411 + p410 + p409 + p408))))
lola: processed formula length: 65
lola: 3 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 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: 39 markings, 39 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p413 + p412 + p411 + p410 + p409 + p408 <= 0) OR (2 <= p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222) OR ((3 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5) AND ((p432 + p433 + p434 <= 1) OR (p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422 <= 0)))) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p413 + p412 + p411 + p410 + p409 + p408 <= 0) OR (2 <= p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222) OR ((3 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5) AND ((p432 + p433 + p434 <= 1) OR (p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p413 + p412 + p411 + p410 + p409 + p408 <= 0) OR (2 <= p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222) OR ((3 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5) AND ((p432 + p433 + p434 <= 1) OR (p421 + p420 + p418 + p417 + p415 + p414 + p416 + p419 + p422 <= 0))))
lola: processed formula length: 396
lola: 3 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p263 + p262 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p243 + p242 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p241 + p240 + p282 + p283 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p186 + p187 + p188 + 1 <= p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p263 + p262 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p243 + p242 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p27... (shortened)
lola: processed formula length: 1174
lola: 5 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 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: 33 markings, 32 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (G ((1 <= p423 + p424 + p425))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p423 + p424 + p425 <= 0)))))
lola: processed formula length: 55
lola: 5 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 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: 33 markings, 65 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((3 <= p180 + p181 + p182))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p180 + p181 + p182)))
lola: processed formula length: 40
lola: 5 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 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: 33 markings, 32 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((3 <= p186 + p187 + p188))) OR A ((((3 <= p99 + p96 + p95 + p102 + p94 + p93 + p105 + p90 + p87 + p108 + p84 + p81 + p111 + p112 + p113 + p114 + p78 + p77 + p117 + p76 + p75 + p120 + p72 + p69 + p123 + p66 + p63 + p126 + p60 + p59 + p129 + p130 + p131 + p132 + p58 + p57 + p135 + p54 + p51 + p138 + p48 + p45 + p141 + p42 + p41 + p144 + p40 + p39 + p147 + p148 + p149 + p150 + p36 + p33 + p153... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p186 + p187 + p188)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p186 + p187 + p188)))
lola: processed formula: A (F ((3 <= p186 + p187 + p188)))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 3 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p99 + p96 + p95 + p102 + p94 + p93 + p105 + p90 + p87 + p108 + p84 + p81 + p111 + p112 + p113 + p114 + p78 + p77 + p117 + p76 + p75 + p120 + p72 + p69 + p123 + p66 + p63 + p126 + p60 + p59 + p129 + p130 + p131 + p132 + p58 + p57 + p135 + p54 + p51 + p138 + p48 + p45 + p141 + p42 + p41 + p144 + p40 + p39 + p147 + p148 + p149 + p150 + p36 + p33 + p153 + p30 + p27 + p156 + p24 + p23 + p159... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((3 <= p99 + p96 + p95 + p102 + p94 + p93 + p105 + p90 + p87 + p108 + p84 + p81 + p111 + p112 + p113 + p114 + p78 + p77 + p117 + p76 + p75 + p120 + p72 + p69 + p123 + p66 + p63 + p126 + p60 + p59 + p129 + p130 + p131 + p132 + p58 + p57 + p135 + p54 + p51 + p138 + p48 + p45 + p141 + p42 + p41 + p144 + p40 + p39 + p147 + p148 + p149 + p150 + p36 + p33 + p153 + p30 + p27 + p156 + p24 + p23 + p159 + p22 + p21 + p162 + p18 + p165 + p166 + p167 + p168 + p171 + p174 + p177 + p179 + p178 + p176 + p175 + p173 + p172 + p170 + p169 + p164 + p163 + p19 + p20 + p161 + p160 + p158 + p157 + p25 + p26 + p155 + p28 + p29 + p154 + p31 + p32 + p152 + p34 + p35 + p151 + p37 + p38 + p146 + p145 + p143 + p142 + p43 + p44 + p140 + p46 + p47 + p139 + p49 + p50 + p137 + p52 + p53 + p136 + p55 + p56 + p134 + p133 + p128 + p127 + p61 + p62 + p125 + p64 + p65 + p124 + p67 + p68 + p122 + p70 + p71 + p121 + p73 + p74 + p119 + p118 + p116 + p115 + p79 + p80 + p110 + p82 + p83 + p109 + p85 + p86 + p107 + p88 + p89 + p106 + p91 + p92 + p104 + p103 + p101 + p100 + p97 + p98) OR (1 <= p183 + p184 + p185)) U ((2 <= p429 + p430 + p431) AND (2 <= p192 + p193 + p195 + p196 + p198 + p199 + p201 + p202 + p204 + p205 + p207 + p208 + p210 + p211 + p213 + p214 + p216 + p217 + p218 + p215 + p212 + p209 + p206 + p203 + p200 + p197 + p194))))
lola: processed formula: A ((((3 <= p99 + p96 + p95 + p102 + p94 + p93 + p105 + p90 + p87 + p108 + p84 + p81 + p111 + p112 + p113 + p114 + p78 + p77 + p117 + p76 + p75 + p120 + p72 + p69 + p123 + p66 + p63 + p126 + p60 + p59 + p129 + p130 + p131 + p132 + p58 + p57 + p135 + p54 + p51 + p138 + p48 + p45 + p141 + p42 + p41 + p144 + p40 + p39 + p147 + p148 + p149 + p150 + p36 + p33 + p153 + p30 + p27 + p156 + p24 + p23 + p159... (shortened)
lola: processed formula length: 1322
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 2 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: 33 markings, 33 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((p186 + p187 + p188 <= 2) OR (p423 + p424 + p425 <= 1) OR (1 <= p189 + p190 + p191)) AND A (F (((2 <= p186 + p187 + p188))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p186 + p187 + p188) AND (2 <= p423 + p424 + p425) AND (p189 + p190 + p191 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p186 + p187 + p188) AND (2 <= p423 + p424 + p425) AND (p189 + p190 + p191 <= 0))
lola: processed formula length: 87
lola: 5 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes no yes yes yes no yes yes yes yes no unknown
FORMULA NeoElection-COL-2-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is NeoElection-COL-2, 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 r114-csrt-152666472400241"
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 ;