fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r118-blw7-149441649900165
Last Updated
June 27, 2017

About the Execution of LoLA for S_LamportFastMutEx-COL-8

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6145.490 292379.00 292970.00 35.10 T?TFFTTTFTFTFTTF normal

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)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_LamportFastMutEx-COL-8, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441649900165
=====================================================================


--------------------
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-CTLCardinality-0
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-1
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-15
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-2
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-3
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-4
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-5
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-6
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-7
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-8
FORMULA_NAME LamportFastMutEx-COL-8-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496356614389


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_LamportFastMutEx-COL-8: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_LamportFastMutEx-COL-8: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
CTLCardinality @ S_LamportFastMutEx-COL-8 @ 3540 seconds
----- 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-CTLCardinality.task
lola: A (G ((((p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 <= 2) OR (p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 <= 0)) AND E (G (TRUE))))) : ((3 <= p9 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR E (F (E (X ((3 <= p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54)))))) : A (G ((((p313 + p311 + p297 + p309 + p299 + p307 + p301 + p305 + p303 + p304 + p302 + p306 + p300 + p308 + p298 + p310 + p312 + p314 <= 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 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206) OR (p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 <= p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p26) OR (p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63)) AND ((3 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98) OR (3 <= p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54) OR (p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p207 <= p313 + p311 + p297 + p309 + p299 + p307 + p301 + p305 + p303 + p304 + p302 + p306 + p300 + p308 + p298 + p310 + p312 + p314))))) : A (((2 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53) U E (F ((1 <= p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36))))) : A (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p99 + 1 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63) U (2 <= p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296))) : ((E (((p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p26 <= p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p207) U (3 <= p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116))) OR ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72) AND A (X ((3 <= p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p207))))) OR E (F ((1 <= p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54)))) : A (F ((2 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27))) : E (G (E (F ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p99 + 1 <= p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54))))) : (E (G (((p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 <= p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p207) AND (p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63)))) OR (p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + 1 <= 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 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)) : A ((((p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= p9 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)) U A (G ((p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 <= p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116))))) : ((NOT(A (F ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)))) OR ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p99) AND E (X ((p9 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81))))) AND ((E (X ((3 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53))) OR (p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81)) AND (E (F ((p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125))) OR E (G ((2 <= p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36)))))) : A ((TRUE U ((3 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98) AND (1 <= p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116) AND (3 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27)))) : (A (((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 <= p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72) U ((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63) AND (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 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81)))) AND A (G ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= 0)))) : (E (G (E (F ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81))))) AND NOT(E (((p313 + p311 + p297 + p309 + p299 + p307 + p301 + p305 + p303 + p304 + p302 + p306 + p300 + p308 + p298 + p310 + p312 + p314 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125) U (2 <= p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54))))) : E (G ((p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63))) : A (F (((3 <= p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36) OR E (F ((1 <= p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p207))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 <= 2) OR (p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 <= 0)) AND E (G (TRUE)))))
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 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-CTLCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p9 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR E (F (E (X ((3 <= p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p9 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p9 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X ((3 <= p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((3 <= p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54)))
lola: processed formula length: 72
lola: 2 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 623598 markings, 3460235 edges, 2962460907961057280 markings/sec, 0 secs
lola: 1175281 markings, 6754864 edges, 110337 markings/sec, 5 secs
lola: 1678322 markings, 9843550 edges, 100608 markings/sec, 10 secs
lola: 2151695 markings, 12660258 edges, 94675 markings/sec, 15 secs
lola: 2598972 markings, 15405376 edges, 89455 markings/sec, 20 secs
lola: 3062862 markings, 18245527 edges, 92778 markings/sec, 25 secs
lola: 3511068 markings, 21020144 edges, 89641 markings/sec, 30 secs
lola: 3944684 markings, 23723211 edges, 86723 markings/sec, 35 secs
lola: 4384718 markings, 26465707 edges, 88007 markings/sec, 40 secs
lola: 4930824 markings, 29851834 edges, 109221 markings/sec, 45 secs
lola: 5389573 markings, 32591614 edges, 91750 markings/sec, 50 secs
lola: 5746782 markings, 34795477 edges, 71442 markings/sec, 55 secs
lola: 6104492 markings, 37060118 edges, 71542 markings/sec, 60 secs
lola: 6554192 markings, 39872776 edges, 89940 markings/sec, 65 secs
lola: 6929160 markings, 42308127 edges, 74994 markings/sec, 70 secs
lola: 7375190 markings, 45082381 edges, 89206 markings/sec, 75 secs
lola: 7817119 markings, 47971889 edges, 88386 markings/sec, 80 secs
lola: 8287912 markings, 50838960 edges, 94159 markings/sec, 85 secs
lola: 8693402 markings, 53532188 edges, 81098 markings/sec, 90 secs
lola: 9149556 markings, 56396082 edges, 91231 markings/sec, 95 secs
lola: 9621682 markings, 59272739 edges, 94425 markings/sec, 100 secs
lola: 10062421 markings, 61952202 edges, 88148 markings/sec, 105 secs
lola: 10485482 markings, 64582523 edges, 84612 markings/sec, 110 secs
lola: 10983251 markings, 67647470 edges, 99554 markings/sec, 115 secs
lola: 11461582 markings, 70639053 edges, 95666 markings/sec, 120 secs
lola: 11966480 markings, 73740192 edges, 100980 markings/sec, 125 secs
lola: 12458031 markings, 76794035 edges, 98310 markings/sec, 130 secs
lola: 12931304 markings, 79775358 edges, 94655 markings/sec, 135 secs
lola: 13400182 markings, 82721108 edges, 93776 markings/sec, 140 secs
lola: 13797547 markings, 85261029 edges, 79473 markings/sec, 145 secs
lola: 14252347 markings, 88126441 edges, 90960 markings/sec, 150 secs
lola: 14723452 markings, 91090744 edges, 94221 markings/sec, 155 secs
lola: 15122349 markings, 93683729 edges, 79779 markings/sec, 160 secs
lola: 15509275 markings, 96147196 edges, 77385 markings/sec, 165 secs
lola: 15954308 markings, 98980749 edges, 89007 markings/sec, 170 secs
lola: 16390755 markings, 101729403 edges, 87289 markings/sec, 175 secs
lola: 16827864 markings, 104544058 edges, 87422 markings/sec, 180 secs
lola: 17178061 markings, 106830870 edges, 70039 markings/sec, 185 secs
lola: 17534828 markings, 109185201 edges, 71353 markings/sec, 190 secs
lola: 17946258 markings, 111783596 edges, 82286 markings/sec, 195 secs
lola: 18396829 markings, 114620220 edges, 90114 markings/sec, 200 secs
lola: 18819564 markings, 117294037 edges, 84547 markings/sec, 205 secs
lola: 19224523 markings, 119872927 edges, 80992 markings/sec, 210 secs
lola: 19674400 markings, 122762832 edges, 89975 markings/sec, 215 secs
lola: 20059917 markings, 125249689 edges, 77103 markings/sec, 220 secs
lola: 20420132 markings, 127596177 edges, 72043 markings/sec, 225 secs
lola: 20794166 markings, 130074065 edges, 74807 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p313 + p311 + p297 + p309 + p299 + p307 + p301 + p305 + p303 + p304 + p302 + p306 + p300 + p308 + p298 + p310 + p312 + p314 <= 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 ... (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 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-CTLCardinality-2.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: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53) U E (F ((1 <= p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A((2 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53) U E(TRUE U (1 <= p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36)))
lola: processed formula length: 132
lola: 2 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p99 + 1 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63) U (2 <= p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p99 + 1 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63) U (2 <= p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296))
lola: processed formula length: 193
lola: 1 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (((p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p26 <= p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p26 <= p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p243... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p26 <= p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p243 +... (shortened)
lola: processed formula length: 694
lola: 2 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72)
lola: processed formula length: 108
lola: 1 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p23... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((3 <= p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 +... (shortened)
lola: processed formula length: 575
lola: 2 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54)))
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 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-CTLCardinality-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(TRUE U (2 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27))
lola: processed formula length: 68
lola: 1 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p99 + 1 <= p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p99 + 1 <= p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54)))))
lola: processed formula length: 150
lola: 2 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 <= p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 <= p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + ... (shortened)
lola: processed formula length: 759
lola: 2 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1369925 markings, 3712902 edges, 2890403313923129344 markings/sec, 0 secs
lola: 2440369 markings, 7148483 edges, 214089 markings/sec, 5 secs
lola: 3441808 markings, 10369321 edges, 200288 markings/sec, 10 secs
lola: 4612138 markings, 13929461 edges, 234066 markings/sec, 15 secs
lola: 5575531 markings, 17258782 edges, 192679 markings/sec, 20 secs
lola: 6620041 markings, 20578782 edges, 208902 markings/sec, 25 secs
lola: 7650228 markings, 23971850 edges, 206037 markings/sec, 30 secs
lola: 8464862 markings, 26900437 edges, 162927 markings/sec, 35 secs
lola: 9557515 markings, 30298861 edges, 218531 markings/sec, 40 secs
lola: 10496316 markings, 33503265 edges, 187760 markings/sec, 45 secs
lola: 11256015 markings, 36309121 edges, 151940 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 9 will run for 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= p9 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)) U A (G ((p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 <= p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: ========================================
lola: processed formula: A(((p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= p9 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)) U NOT(E(TRUE U (p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + 1 <= p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72))))
lola: processed formula length: 355
lola: 3 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 541 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(A (F ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)))) OR ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p99) AND E (X ((p9 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81))))) AND ((E (X ((3 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53))) OR (p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 541 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)))
lola: processed formula length: 64
lola: 5 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((3 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((3 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53))
lola: processed formula length: 62
lola: 4 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 812 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81)
lola: processed formula length: 117
lola: 3 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 13 will run for 1082 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125)))
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 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-CTLCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((TRUE U ((3 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98) AND (1 <= p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116) AND (3 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98) AND (1 <= p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116) AND (3 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27)))
lola: processed formula length: 205
lola: 3 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 812 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 <= p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72) U ((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63) AND (p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 812 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 <= p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72) U ((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63) AND (p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 <= p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72) U ((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63) AND (p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + ... (shortened)
lola: processed formula length: 868
lola: 1 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1082 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= 0)))
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 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-CTLCardinality-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1082 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81))))) AND NOT(E (((p313 + p311 + p297 + p309 + p299 + p307 + p301 + p305 + p303 + p304 + p302 + p306 + p300 + p308 + p298 + p310 + p312 + p314 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125) U (2 <= p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1082 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81)))))
lola: processed formula length: 138
lola: 6 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + 1 <= p313 + p311 + p297 + p309 + p299 + p307 + p301 + p305 + p303 + p304 + p302 + p306 + p300 + p308 + p298 + p310 + p312 + p314) R (p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((p313 + p311 + p297 + p309 + p299 + p307 + p301 + p305 + p303 + p304 + p302 + p306 + p300 + p308 + p298 + p310 + p312 + p314 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125) U (2 <= p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54)))
lola: processed formula length: 258
lola: 7 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + 1 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27)))
lola: processed formula length: 127
lola: 2 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 3248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36) OR E (F ((1 <= p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36) OR E(TRUE U (1 <= p208 + p217 + p226 + p235 + p244 + p253 + p262 + p271 + p280 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 ... (shortened)
lola: processed formula length: 655
lola: 2 rewrites
lola: formula mentions 0 of 315 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-8-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: RESULT
lola:
SUMMARY: yes unknown no yes no yes no yes yes no yes no no yes yes yes
lola: ========================================
FORMULA LamportFastMutEx-COL-8-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496356906768

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="S_LamportFastMutEx-COL-8"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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/S_LamportFastMutEx-COL-8.tgz
mv S_LamportFastMutEx-COL-8 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_LamportFastMutEx-COL-8, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-blw7-149441649900165"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;