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 204K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K 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.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K 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 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 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 16K 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 44K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is LamportFastMutEx-COL-8, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666473600103
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527151248815


BK_STOP 1527151827832

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using LamportFastMutEx-COL-8 as instance name.
Using LamportFastMutEx as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': True, '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': False, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 1074865, 'Memory': 11616.87, 'Tool': 'lola'}, {'Time': 1080651, 'Memory': 15832.05, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola LamportFastMutEx-COL-8...

----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
LamportFastMutEx-COL-8: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
LamportFastMutEx-COL-8: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ LamportFastMutEx-COL-8 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 981/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 315 places, 666 transitions, 214 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 947 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-8-ReachabilityCardinality.task
lola: E (F ((((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) AND (p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1 <= 1)) OR ((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) AND (p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 <= 2))))) : A (G ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1))) : A (G (((2 <= p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18) OR (p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p296 + p295 + p294 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p262) OR (p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) OR (2 <= p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p53) OR (p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + 1 <= p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143)))) : A (G ((((p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p53 <= p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161) AND (p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)) OR ((3 <= p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1) AND (p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p296 + p295 + p294 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p262)) OR (p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197)))) : A (G (((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + 1 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p296 + p295 + p294 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p262) OR (p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + 1 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188) OR (p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 <= 2)))) : A (G ((p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 <= p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215))) : E (F (((p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) AND (3 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) AND (p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= 1) AND ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + 1 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303) OR (p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p53 <= p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1))))) : E (F (((p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + 1 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) AND (p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27)))) : A (G (((3 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) OR (p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18) OR ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) AND (2 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)) OR (1 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170)))) : E (F (((2 <= p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306) AND (p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p296 + p295 + p294 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p262) AND (3 <= p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1) AND (p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND ((3 <= p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306) OR (2 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) OR (3 <= p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p53))))) : A (G ((((2 <= p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18) AND (2 <= p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p53)) OR (p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p296 + p295 + p294 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p262 <= 0) OR (p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p53 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188)))) : A (G (((3 <= p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1) AND ((p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) OR (2 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152))))) : A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161) OR (3 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197)))) : E (F (((p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND ((3 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) OR (p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p296 + p295 + p294 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p262 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197)) AND (2 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)))) : A (G ((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1))) : A (G (()))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) AND (p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1 <= 1)) OR ((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) AND (p35 + p34 + ... (shortened)
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 28 bytes per marking, with 10 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: 47 markings, 46 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1)))
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 28 bytes per marking, with 10 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 LamportFastMutEx-COL-8-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18) OR (p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 +... (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 28 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 50916 markings, 243851 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p53 <= p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161) AND (p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)) OR ((3 <= p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1) AND (p207 + p208 + p209 + p210 + p... (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 28 bytes per marking, with 10 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 4 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23696 markings, 109348 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + 1 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p2... (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 28 bytes per marking, with 10 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 <= p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215)))
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 28 bytes per marking, with 10 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 LamportFastMutEx-COL-8-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) AND (3 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) AND (p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= 1) AND ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + 1 <= p305 + p304 + p297 + p... (shortened)
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 28 bytes per marking, with 10 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + 1 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) AND (p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + ... (shortened)
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 28 bytes per marking, with 10 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) OR (p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18) OR ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) AND (2 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)... (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 28 bytes per marking, with 10 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-8.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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306) AND (p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247... (shortened)
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 28 bytes per marking, with 10 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 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 167797 markings, 813836 edges, 33559 markings/sec, 0 secs
lola: sara is running 5 secs || 338358 markings, 1689654 edges, 34112 markings/sec, 5 secs
lola: sara is running 10 secs || 500286 markings, 2582604 edges, 32386 markings/sec, 10 secs
lola: sara is running 15 secs || 665653 markings, 3471055 edges, 33073 markings/sec, 15 secs
lola: sara is running 20 secs || 855935 markings, 4486475 edges, 38056 markings/sec, 20 secs
lola: sara is running 25 secs || 1035896 markings, 5454723 edges, 35992 markings/sec, 25 secs
lola: sara is running 30 secs || 1206194 markings, 6392766 edges, 34060 markings/sec, 30 secs
lola: sara is running 35 secs || 1365745 markings, 7267045 edges, 31910 markings/sec, 35 secs
lola: sara is running 40 secs || 1525760 markings, 8158334 edges, 32003 markings/sec, 40 secs
lola: sara is running 45 secs || 1684759 markings, 9054879 edges, 31800 markings/sec, 45 secs
lola: sara is running 50 secs || 1847940 markings, 9967690 edges, 32636 markings/sec, 50 secs
lola: sara is running 55 secs || 2009997 markings, 10879332 edges, 32411 markings/sec, 55 secs
lola: sara is running 60 secs || 2168923 markings, 11793914 edges, 31785 markings/sec, 60 secs
lola: sara is running 65 secs || 2329685 markings, 12661619 edges, 32152 markings/sec, 65 secs
lola: sara is running 70 secs || 2506160 markings, 13634200 edges, 35295 markings/sec, 70 secs
lola: sara is running 75 secs || 2685050 markings, 14641079 edges, 35778 markings/sec, 75 secs
lola: sara is running 80 secs || 2862103 markings, 15659814 edges, 35411 markings/sec, 80 secs
lola: sara is running 85 secs || 3035374 markings, 16592146 edges, 34654 markings/sec, 85 secs
lola: sara is running 90 secs || 3203447 markings, 17569918 edges, 33615 markings/sec, 90 secs
lola: sara is running 95 secs || 3385558 markings, 18571710 edges, 36422 markings/sec, 95 secs
lola: sara is running 100 secs || 3556623 markings, 19516889 edges, 34213 markings/sec, 100 secs
lola: sara is running 105 secs || 3725655 markings, 20470360 edges, 33806 markings/sec, 105 secs
lola: sara is running 110 secs || 3895951 markings, 21435263 edges, 34059 markings/sec, 110 secs
lola: sara is running 115 secs || 4057541 markings, 22355114 edges, 32318 markings/sec, 115 secs
lola: sara is running 120 secs || 4213781 markings, 23259496 edges, 31248 markings/sec, 120 secs
lola: sara is running 125 secs || 4384361 markings, 24216462 edges, 34116 markings/sec, 125 secs
lola: sara is running 130 secs || 4546563 markings, 25135575 edges, 32440 markings/sec, 130 secs
lola: sara is running 135 secs || 4711685 markings, 26078547 edges, 33024 markings/sec, 135 secs
lola: sara is running 140 secs || 4884405 markings, 27036514 edges, 34544 markings/sec, 140 secs
lola: sara is running 145 secs || 5050165 markings, 27977649 edges, 33152 markings/sec, 145 secs
lola: sara is running 150 secs || 5218959 markings, 28909915 edges, 33759 markings/sec, 150 secs
lola: sara is running 155 secs || 5372703 markings, 29808774 edges, 30749 markings/sec, 155 secs
lola: sara is running 160 secs || 5526257 markings, 30689019 edges, 30711 markings/sec, 160 secs
lola: sara is running 165 secs || 5683064 markings, 31598862 edges, 31361 markings/sec, 165 secs
lola: sara is running 170 secs || 5840409 markings, 32521698 edges, 31469 markings/sec, 170 secs
lola: sara is running 175 secs || 6000633 markings, 33435926 edges, 32045 markings/sec, 175 secs
lola: sara is running 180 secs || 6163037 markings, 34355890 edges, 32481 markings/sec, 180 secs
lola: sara is running 185 secs || 6318062 markings, 35245282 edges, 31005 markings/sec, 185 secs
lola: sara is running 190 secs || 6476120 markings, 36127219 edges, 31612 markings/sec, 190 secs
lola: sara is running 195 secs || 6628142 markings, 37019670 edges, 30404 markings/sec, 195 secs
lola: sara is running 200 secs || 6789616 markings, 37949646 edges, 32295 markings/sec, 200 secs
lola: sara is running 205 secs || 6956613 markings, 38888603 edges, 33399 markings/sec, 205 secs
lola: sara is running 210 secs || 7113211 markings, 39810653 edges, 31320 markings/sec, 210 secs
lola: sara is running 215 secs || 7272320 markings, 40781873 edges, 31822 markings/sec, 215 secs
lola: sara is running 220 secs || 7442920 markings, 41767519 edges, 34120 markings/sec, 220 secs
lola: sara is running 225 secs || 7597505 markings, 42702827 edges, 30917 markings/sec, 225 secs
lola: sara is running 230 secs || 7755531 markings, 43633978 edges, 31605 markings/sec, 230 secs
lola: sara is running 235 secs || 7916385 markings, 44567754 edges, 32171 markings/sec, 235 secs
lola: sara is running 240 secs || 8075397 markings, 45485742 edges, 31802 markings/sec, 240 secs
lola: sara is running 245 secs || 8235547 markings, 46394903 edges, 32030 markings/sec, 245 secs
lola: sara is running 250 secs || 8392198 markings, 47306526 edges, 31330 markings/sec, 250 secs
lola: sara is running 255 secs || 8551760 markings, 48231410 edges, 31912 markings/sec, 255 secs
lola: sara is running 260 secs || 8708871 markings, 49156804 edges, 31422 markings/sec, 260 secs
lola: sara is running 265 secs || 8864471 markings, 50065988 edges, 31120 markings/sec, 265 secs
lola: sara is running 270 secs || 9019055 markings, 50969274 edges, 30917 markings/sec, 270 secs
lola: sara is running 275 secs || 9172585 markings, 51839732 edges, 30706 markings/sec, 275 secs
lola: sara is running 280 secs || 9334153 markings, 52765181 edges, 32314 markings/sec, 280 secs
lola: sara is running 285 secs || 9505342 markings, 53680879 edges, 34238 markings/sec, 285 secs
lola: sara is running 290 secs || 9661127 markings, 54580593 edges, 31157 markings/sec, 290 secs
lola: sara is running 295 secs || 9823378 markings, 55526123 edges, 32450 markings/sec, 295 secs
lola: sara is running 300 secs || 9984642 markings, 56491733 edges, 32253 markings/sec, 300 secs
lola: sara is running 305 secs || 10141010 markings, 57402847 edges, 31274 markings/sec, 305 secs
lola: sara is running 310 secs || 10299688 markings, 58310905 edges, 31736 markings/sec, 310 secs
lola: sara is running 315 secs || 10462263 markings, 59262208 edges, 32515 markings/sec, 315 secs
lola: sara is running 320 secs || 10639897 markings, 60276861 edges, 35527 markings/sec, 320 secs
lola: sara is running 325 secs || 10797252 markings, 61209681 edges, 31471 markings/sec, 325 secs
lola: sara is running 330 secs || 10953389 markings, 62101509 edges, 31227 markings/sec, 330 secs
lola: sara is running 335 secs || 11113082 markings, 63022759 edges, 31939 markings/sec, 335 secs
lola: sara is running 340 secs || 11284750 markings, 63955418 edges, 34334 markings/sec, 340 secs
lola: sara is running 345 secs || 11449449 markings, 64848144 edges, 32940 markings/sec, 345 secs
lola: sara is running 350 secs || 11609989 markings, 65734448 edges, 32108 markings/sec, 350 secs
lola: sara is running 355 secs || 11771705 markings, 66718555 edges, 32343 markings/sec, 355 secs
lola: sara is running 360 secs || 11940203 markings, 67716375 edges, 33700 markings/sec, 360 secs
lola: sara is running 365 secs || 12086680 markings, 68621139 edges, 29295 markings/sec, 365 secs
lola: sara is running 370 secs || 12239106 markings, 69519148 edges, 30485 markings/sec, 370 secs
lola: sara is running 375 secs || 12403676 markings, 70453029 edges, 32914 markings/sec, 375 secs
lola: sara is running 380 secs || 12564588 markings, 71436101 edges, 32182 markings/sec, 380 secs
lola: sara is running 385 secs || 12733309 markings, 72449071 edges, 33744 markings/sec, 385 secs
lola: sara is running 390 secs || 12899145 markings, 73404442 edges, 33167 markings/sec, 390 secs
lola: sara is running 395 secs || 13065476 markings, 74322040 edges, 33266 markings/sec, 395 secs
lola: sara is running 400 secs || 13227016 markings, 75312456 edges, 32308 markings/sec, 400 secs
lola: sara is running 405 secs || 13391703 markings, 76232391 edges, 32937 markings/sec, 405 secs
lola: sara is running 410 secs || 13556732 markings, 77148350 edges, 33006 markings/sec, 410 secs
lola: sara is running 415 secs || 13715621 markings, 78073945 edges, 31778 markings/sec, 415 secs
lola: sara is running 420 secs || 13870847 markings, 79007233 edges, 31045 markings/sec, 420 secs
lola: sara is running 425 secs || 14036407 markings, 79966679 edges, 33112 markings/sec, 425 secs
lola: sara is running 430 secs || 14200137 markings, 80875679 edges, 32746 markings/sec, 430 secs
lola: sara is running 435 secs || 14367967 markings, 81812889 edges, 33566 markings/sec, 435 secs
lola: sara is running 440 secs || 14527004 markings, 82768036 edges, 31807 markings/sec, 440 secs
lola: sara is running 445 secs || 14689399 markings, 83742532 edges, 32479 markings/sec, 445 secs
lola: sara is running 450 secs || 14842273 markings, 84599985 edges, 30575 markings/sec, 450 secs
lola: sara is running 455 secs || 14994768 markings, 85521152 edges, 30499 markings/sec, 455 secs
lola: sara is running 460 secs || 15150842 markings, 86420682 edges, 31215 markings/sec, 460 secs
lola: sara is running 465 secs || 15306358 markings, 87343531 edges, 31103 markings/sec, 465 secs
lola: sara is running 470 secs || 15457981 markings, 88263160 edges, 30325 markings/sec, 470 secs
lola: sara is running 475 secs || 15613091 markings, 89182720 edges, 31022 markings/sec, 475 secs
lola: sara is running 480 secs || 15782143 markings, 90158385 edges, 33810 markings/sec, 480 secs
lola: sara is running 485 secs || 15940832 markings, 91076720 edges, 31738 markings/sec, 485 secs
lola: sara is running 490 secs || 16086135 markings, 92001502 edges, 29061 markings/sec, 490 secs
lola: sara is running 495 secs || 16241773 markings, 92948508 edges, 31128 markings/sec, 495 secs
sara: warning, failure of lp_solve (at job 29475)
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18) AND (2 <= p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p53)) OR (p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 ... (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 28 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1) AND ((p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) OR (2 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)))))
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 28 bytes per marking, with 10 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 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 12 will run for 757 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78... (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 28 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 13 will run for 1010 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p... (shortened)
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 28 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 176947 markings, 886424 edges, 35389 markings/sec, 0 secs
lola: sara is running 5 secs || 369716 markings, 1883946 edges, 38554 markings/sec, 5 secs
lola: sara is running 10 secs || 554635 markings, 2846674 edges, 36984 markings/sec, 10 secs
lola: sara is running 15 secs || 726968 markings, 3766934 edges, 34467 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 893892 markings, 4658537 edges
lola: subprocess 14 will run for 1502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p0 + p2 + p4 + p6 + p8 + p16 + p14 + p12 + p10 + p11 + p13 + p15 + p17 + p9 + p7 + p5 + p3 + p1)))
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 28 bytes per marking, with 10 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: ========================================
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 15 will run for 3004 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-ReachabilityCardinality.task
lola: processed formula with 0 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: RESULT
lola:
SUMMARY: yes yes no no no no no no no unknown yes no no yes yes yes
lola: ========================================
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- 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="LamportFastMutEx-COL-8"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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