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-full
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 r114-csrt-152666472200103
=====================================================================

--------------------
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 1527139055022


BK_STOP 1527139625479

--------------------
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 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 ((((p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8) AND (p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244 <= 1)) OR ((p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233) AND (p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= 2))))) : A (G ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244))) : A (G (((2 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278) OR (p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 <= 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 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p188 + p187 + p186 + p185 + p184 + p183 + p182) OR (p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 <= p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269) OR (2 <= p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p26) OR (p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306)))) : A (G ((((p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p26 <= p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287) AND (p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)) OR ((3 <= p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244) AND (p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 <= 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 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p188 + p187 + p186 + p185 + p184 + p183 + p182)) OR (p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 <= p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269)))) : A (G (((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + 1 <= 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 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p188 + p187 + p186 + p185 + p184 + p183 + p182) OR (p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + 1 <= p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242) OR (p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 <= 2)))) : A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224))) : E (F (((p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244 <= p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269) AND (3 <= p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296) AND (p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 <= 1) AND ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + 1 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303) OR (p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p26 <= p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244))))) : E (F (((p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + 1 <= p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233) AND (p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + 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 (p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244 <= p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215)))) : A (G (((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8) OR (p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278) OR ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269) AND (2 <= p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233)) OR (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)))) : E (F (((2 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND (p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244 <= 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 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p188 + p187 + p186 + p185 + p184 + p183 + p182) AND (3 <= p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244) AND (p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + 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 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (2 <= p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233) OR (3 <= p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p26))))) : A (G ((((2 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278) AND (2 <= p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p26)) OR (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 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p188 + p187 + p186 + p185 + p184 + p183 + p182 <= 0) OR (p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p26 <= p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242)))) : A (G (((3 <= p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244) AND ((p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269) OR (2 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197))))) : A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + 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 <= p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287) OR (3 <= p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269)))) : E (F (((p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + 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 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8) OR (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 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p188 + p187 + p186 + p185 + p184 + p183 + p182 <= p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269)) AND (2 <= p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233)))) : A (G ((p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 <= p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244))) : 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 ((((p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8) AND (p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244 <= 1)) OR ((p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233) AND (p2... (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: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality.sara
lola: state equation: calling and running sara
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 <= p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244)))
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 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278) OR (p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 <= 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 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144... (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: 50910 markings, 260137 edges
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p26 <= p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287) AND (p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)) OR ((3 <= p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244) AND (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.
lola: ========================================
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: 171400 markings, 892670 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 <= 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 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p1... (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 ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224)))
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: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 16 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244 <= p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269) AND (3 <= p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296) AND (p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 <= 1) AND ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205... (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 (((p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + 1 <= p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233) AND (p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 +... (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 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8) OR (p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278) OR ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269) AND (2 <= p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233)) OR (1 ... (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
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-8.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 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND (p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244 <= 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 + p135 + p136 + ... (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 || 187875 markings, 898505 edges, 37575 markings/sec, 0 secs
lola: sara is running 5 secs || 361042 markings, 1754973 edges, 34633 markings/sec, 5 secs
lola: sara is running 10 secs || 535076 markings, 2652500 edges, 34807 markings/sec, 10 secs
lola: sara is running 15 secs || 722543 markings, 3625530 edges, 37493 markings/sec, 15 secs
lola: sara is running 20 secs || 916652 markings, 4640139 edges, 38822 markings/sec, 20 secs
lola: sara is running 25 secs || 1093469 markings, 5570816 edges, 35363 markings/sec, 25 secs
lola: sara is running 30 secs || 1257506 markings, 6468530 edges, 32807 markings/sec, 30 secs
lola: sara is running 35 secs || 1430622 markings, 7364478 edges, 34623 markings/sec, 35 secs
lola: sara is running 40 secs || 1597401 markings, 8233522 edges, 33356 markings/sec, 40 secs
lola: sara is running 45 secs || 1762762 markings, 9153526 edges, 33072 markings/sec, 45 secs
lola: sara is running 50 secs || 1929398 markings, 10072252 edges, 33327 markings/sec, 50 secs
lola: sara is running 55 secs || 2118685 markings, 11089413 edges, 37857 markings/sec, 55 secs
lola: sara is running 60 secs || 2289941 markings, 12050050 edges, 34251 markings/sec, 60 secs
lola: sara is running 65 secs || 2458494 markings, 12954023 edges, 33711 markings/sec, 65 secs
lola: sara is running 70 secs || 2639931 markings, 13875252 edges, 36287 markings/sec, 70 secs
lola: sara is running 75 secs || 2812115 markings, 14794918 edges, 34437 markings/sec, 75 secs
lola: sara is running 80 secs || 2983976 markings, 15706671 edges, 34372 markings/sec, 80 secs
lola: sara is running 85 secs || 3164105 markings, 16691277 edges, 36026 markings/sec, 85 secs
lola: sara is running 90 secs || 3332163 markings, 17621658 edges, 33612 markings/sec, 90 secs
lola: sara is running 95 secs || 3493758 markings, 18603235 edges, 32319 markings/sec, 95 secs
lola: sara is running 100 secs || 3670060 markings, 19569566 edges, 35260 markings/sec, 100 secs
lola: sara is running 105 secs || 3846278 markings, 20503255 edges, 35244 markings/sec, 105 secs
lola: sara is running 110 secs || 4018665 markings, 21441210 edges, 34477 markings/sec, 110 secs
lola: sara is running 115 secs || 4196279 markings, 22457788 edges, 35523 markings/sec, 115 secs
lola: sara is running 120 secs || 4375586 markings, 23426246 edges, 35861 markings/sec, 120 secs
lola: sara is running 125 secs || 4548528 markings, 24366363 edges, 34588 markings/sec, 125 secs
lola: sara is running 130 secs || 4729904 markings, 25358150 edges, 36275 markings/sec, 130 secs
lola: sara is running 135 secs || 4902870 markings, 26353809 edges, 34593 markings/sec, 135 secs
lola: sara is running 140 secs || 5075358 markings, 27319400 edges, 34498 markings/sec, 140 secs
lola: sara is running 145 secs || 5249103 markings, 28285718 edges, 34749 markings/sec, 145 secs
lola: sara is running 150 secs || 5418497 markings, 29203932 edges, 33879 markings/sec, 150 secs
lola: sara is running 155 secs || 5580713 markings, 30115059 edges, 32443 markings/sec, 155 secs
lola: sara is running 160 secs || 5744993 markings, 31008011 edges, 32856 markings/sec, 160 secs
lola: sara is running 165 secs || 5909732 markings, 31942982 edges, 32948 markings/sec, 165 secs
lola: sara is running 170 secs || 6078045 markings, 32843267 edges, 33663 markings/sec, 170 secs
lola: sara is running 175 secs || 6232899 markings, 33747557 edges, 30971 markings/sec, 175 secs
lola: sara is running 180 secs || 6407805 markings, 34743561 edges, 34981 markings/sec, 180 secs
lola: sara is running 185 secs || 6588969 markings, 35749325 edges, 36233 markings/sec, 185 secs
lola: sara is running 190 secs || 6762930 markings, 36736711 edges, 34792 markings/sec, 190 secs
lola: sara is running 195 secs || 6938897 markings, 37696666 edges, 35193 markings/sec, 195 secs
lola: sara is running 200 secs || 7101378 markings, 38631308 edges, 32496 markings/sec, 200 secs
lola: sara is running 205 secs || 7267950 markings, 39583468 edges, 33314 markings/sec, 205 secs
lola: sara is running 210 secs || 7429825 markings, 40498364 edges, 32375 markings/sec, 210 secs
lola: sara is running 215 secs || 7594819 markings, 41429769 edges, 32999 markings/sec, 215 secs
lola: sara is running 220 secs || 7756330 markings, 42345001 edges, 32302 markings/sec, 220 secs
lola: sara is running 225 secs || 7918396 markings, 43241915 edges, 32413 markings/sec, 225 secs
lola: sara is running 230 secs || 8071525 markings, 44096450 edges, 30626 markings/sec, 230 secs
lola: sara is running 235 secs || 8214209 markings, 44974915 edges, 28537 markings/sec, 235 secs
lola: sara is running 240 secs || 8364418 markings, 45869583 edges, 30042 markings/sec, 240 secs
lola: sara is running 245 secs || 8516454 markings, 46743597 edges, 30407 markings/sec, 245 secs
lola: sara is running 250 secs || 8675560 markings, 47632515 edges, 31821 markings/sec, 250 secs
lola: sara is running 255 secs || 8827869 markings, 48536386 edges, 30462 markings/sec, 255 secs
lola: sara is running 260 secs || 8984571 markings, 49440937 edges, 31340 markings/sec, 260 secs
lola: sara is running 265 secs || 9141935 markings, 50319301 edges, 31473 markings/sec, 265 secs
lola: sara is running 270 secs || 9299962 markings, 51224402 edges, 31605 markings/sec, 270 secs
lola: sara is running 275 secs || 9453679 markings, 52103868 edges, 30743 markings/sec, 275 secs
lola: sara is running 280 secs || 9609472 markings, 53018661 edges, 31159 markings/sec, 280 secs
lola: sara is running 285 secs || 9774231 markings, 53922648 edges, 32952 markings/sec, 285 secs
lola: sara is running 290 secs || 9929053 markings, 54806364 edges, 30964 markings/sec, 290 secs
lola: sara is running 295 secs || 10089115 markings, 55697029 edges, 32012 markings/sec, 295 secs
lola: sara is running 300 secs || 10245672 markings, 56581555 edges, 31311 markings/sec, 300 secs
lola: sara is running 305 secs || 10416582 markings, 57584298 edges, 34182 markings/sec, 305 secs
lola: sara is running 310 secs || 10577541 markings, 58489175 edges, 32192 markings/sec, 310 secs
lola: sara is running 315 secs || 10741017 markings, 59462232 edges, 32695 markings/sec, 315 secs
lola: sara is running 320 secs || 10902591 markings, 60348996 edges, 32315 markings/sec, 320 secs
lola: sara is running 325 secs || 11057524 markings, 61226756 edges, 30987 markings/sec, 325 secs
lola: sara is running 330 secs || 11214454 markings, 62147212 edges, 31386 markings/sec, 330 secs
lola: sara is running 335 secs || 11370662 markings, 63049189 edges, 31242 markings/sec, 335 secs
lola: sara is running 340 secs || 11535748 markings, 63952841 edges, 33017 markings/sec, 340 secs
lola: sara is running 345 secs || 11700384 markings, 64840684 edges, 32927 markings/sec, 345 secs
lola: sara is running 350 secs || 11868905 markings, 65767738 edges, 33704 markings/sec, 350 secs
lola: sara is running 355 secs || 12024995 markings, 66658538 edges, 31218 markings/sec, 355 secs
lola: sara is running 360 secs || 12192179 markings, 67579872 edges, 33437 markings/sec, 360 secs
lola: sara is running 365 secs || 12347521 markings, 68469494 edges, 31068 markings/sec, 365 secs
lola: sara is running 370 secs || 12510994 markings, 69386750 edges, 32695 markings/sec, 370 secs
lola: sara is running 375 secs || 12670734 markings, 70319167 edges, 31948 markings/sec, 375 secs
lola: sara is running 380 secs || 12825577 markings, 71234095 edges, 30969 markings/sec, 380 secs
lola: sara is running 385 secs || 12991774 markings, 72165564 edges, 33239 markings/sec, 385 secs
lola: sara is running 390 secs || 13146751 markings, 73089352 edges, 30995 markings/sec, 390 secs
lola: sara is running 395 secs || 13308247 markings, 74003436 edges, 32299 markings/sec, 395 secs
lola: sara is running 400 secs || 13462802 markings, 74948110 edges, 30911 markings/sec, 400 secs
lola: sara is running 405 secs || 13614298 markings, 75900175 edges, 30299 markings/sec, 405 secs
lola: sara is running 410 secs || 13772415 markings, 76866493 edges, 31623 markings/sec, 410 secs
lola: sara is running 415 secs || 13933253 markings, 77812696 edges, 32168 markings/sec, 415 secs
lola: sara is running 420 secs || 14092316 markings, 78733246 edges, 31813 markings/sec, 420 secs
lola: sara is running 425 secs || 14251096 markings, 79639689 edges, 31756 markings/sec, 425 secs
lola: sara is running 430 secs || 14416425 markings, 80589230 edges, 33066 markings/sec, 430 secs
lola: sara is running 435 secs || 14583072 markings, 81537518 edges, 33329 markings/sec, 435 secs
lola: sara is running 440 secs || 14734009 markings, 82404459 edges, 30187 markings/sec, 440 secs
lola: sara is running 445 secs || 14887401 markings, 83273440 edges, 30678 markings/sec, 445 secs
lola: sara is running 450 secs || 15042598 markings, 84166014 edges, 31039 markings/sec, 450 secs
lola: sara is running 455 secs || 15198906 markings, 84993658 edges, 31262 markings/sec, 455 secs
lola: sara is running 460 secs || 15351776 markings, 85836310 edges, 30574 markings/sec, 460 secs
lola: sara is running 465 secs || 15509818 markings, 86711821 edges, 31608 markings/sec, 465 secs
lola: sara is running 470 secs || 15663304 markings, 87591679 edges, 30697 markings/sec, 470 secs
lola: sara is running 475 secs || 15816666 markings, 88500987 edges, 30672 markings/sec, 475 secs
lola: sara is running 480 secs || 15966844 markings, 89410655 edges, 30036 markings/sec, 480 secs
lola: sara is running 485 secs || 16123978 markings, 90330713 edges, 31427 markings/sec, 485 secs
lola: sara is running 490 secs || 16283327 markings, 91273256 edges, 31870 markings/sec, 490 secs
lola: sara is running 495 secs || 16436369 markings, 92154963 edges, 30608 markings/sec, 495 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278) AND (2 <= p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p26)) OR (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 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p14... (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: subprocess 11 will run for 604 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244) AND ((p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269) OR (2 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197)))))
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: ========================================
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: state equation: calling and running 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 755 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + 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 + ... (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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 712 markings, 1065 edges
lola: subprocess 13 will run for 1007 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 ... (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: ========================================
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 || 165352 markings, 790209 edges, 33070 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 297262 markings, 1541839 edges
lola: ========================================
lola: subprocess 14 will run for 1507 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 <= p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244)))
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-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 3014 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 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="LamportFastMutEx-COL-8"
export BK_EXAMINATION="ReachabilityCardinality"
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/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-full"
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 r114-csrt-152666472200103"
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 ;