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 LamportFastMutEx-COL-8, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484700165
=====================================================================

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


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ 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 ((((p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 <= 2) OR (p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303 <= 0)) AND E (G (TRUE))))) : ((3 <= p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242) OR E (F (E (X ((3 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197)))))) : A (G ((((p279 + p281 + p283 + p285 + p287 + p289 + p291 + p293 + p295 + p296 + p294 + p292 + p290 + p288 + p286 + p284 + p282 + p280 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + 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) OR (p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 <= p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215) OR (p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303)) AND ((3 <= p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260) OR (3 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + 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 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p279 + p281 + p283 + p285 + p287 + p289 + p291 + p293 + p295 + p296 + p294 + p292 + p290 + p288 + p286 + p284 + p282 + p280))))) : A (((2 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188) U E (F ((1 <= p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251))))) : A (((p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303) U (2 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206))) : ((E (((p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + 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 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U (3 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278))) OR ((p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) AND A (X ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + 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 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))) OR E (F ((1 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197)))) : A (F ((2 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224))) : E (G (E (F ((p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197))))) : (E (G (((p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + 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 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303)))) OR (p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + 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)) : A ((((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) OR (p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 <= p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242)) U A (G ((p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278))))) : ((NOT(A (F ((2 <= p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233)))) OR ((2 <= p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269) AND E (X ((p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179))))) AND ((E (X ((3 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188))) OR (p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)) AND (E (F ((p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303 <= p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314))) OR E (G ((2 <= p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251)))))) : A ((TRUE U ((3 <= p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260) AND (1 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278) AND (3 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224)))) : (A (((p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) U ((p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + 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 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)))) AND A (G ((p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= 0)))) : (E (G (E (F ((p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179))))) AND NOT(E (((p279 + p281 + p283 + p285 + p287 + p289 + p291 + p293 + p295 + p296 + p294 + p292 + p290 + p288 + p286 + p284 + p282 + p280 <= p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314) U (2 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197))))) : E (G ((p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303))) : A (F (((3 <= p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251) OR E (F ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + 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 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))))
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 ((((p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 <= 2) OR (p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303 <= 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 28 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242) OR E (F (E (X ((3 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197))))))
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 <= p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242)
lola: processed formula length: 67
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 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((3 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197)))
lola: processed formula length: 81
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 28 bytes per marking, with 10 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: 639198 markings, 3317514 edges, 2983177356295798784 markings/sec, 0 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: ========================================
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p279 + p281 + p283 + p285 + p287 + p289 + p291 + p293 + p295 + p296 + p294 + p292 + p290 + p288 + p286 + p284 + p282 + p280 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 ... (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-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-CTLCardinality-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: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188) U E (F ((1 <= p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((2 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188) U E(TRUE U (1 <= p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251)))
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 28 bytes per marking, with 10 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 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303) U (2 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303) U (2 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206))
lola: processed formula length: 203
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 28 bytes per marking, with 10 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 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (((p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147... (shortened)
lola: processed formula length: 684
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 28 bytes per marking, with 10 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 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170)
lola: processed formula length: 126
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 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p15... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 +... (shortened)
lola: processed formula length: 556
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 28 bytes per marking, with 10 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 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197)))
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-CTLCardinality-8.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: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224))
lola: processed formula length: 77
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 28 bytes per marking, with 10 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 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197)))))
lola: processed formula length: 160
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 28 bytes per marking, with 10 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 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + ... (shortened)
lola: processed formula length: 767
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 28 bytes per marking, with 10 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: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) OR (p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 <= p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242)) U A (G ((p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278)))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) OR (p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 <= p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242)) U NOT(E(TRUE U (p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + 1 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 ... (shortened)
lola: processed formula length: 410
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 28 bytes per marking, with 10 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 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(A (F ((2 <= p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233)))) OR ((2 <= p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269) AND E (X ((p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179))))) AND ((E (X ((3 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188))) OR (p198 + p199 + p200... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233)))
lola: processed formula length: 82
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 28 bytes per marking, with 10 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 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((3 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((3 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188))
lola: processed formula length: 71
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 28 bytes per marking, with 10 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 882 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)
lola: processed formula length: 126
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 1176 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303 <= p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314)))
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-CTLCardinality-13.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: ================================================================================

lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((TRUE U ((3 <= p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260) AND (1 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278) AND (3 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260) AND (1 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278) AND (3 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224)))
lola: processed formula length: 223
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 28 bytes per marking, with 10 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 882 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) U ((p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p19 + p20 + p21 + p22 + p23 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 882 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) U ((p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p19 + p20 + p21 + p22 + p23 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) U ((p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p19 + p20 + p21 + p22 + p23 + p2... (shortened)
lola: processed formula length: 804
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 28 bytes per marking, with 10 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 1176 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= 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 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-CTLCardinality-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1176 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179))))) AND NOT(E (((p279 + p281 + p283 + p285 + p287 + p289 + p291 + p293 + p295 + p296 + p294 + p292 + p290 + p288 + p286 + p284 + p282 + p280 <= p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314) U (2 <= p189 + p190 + p191 + p192 + p193 + p194 + p195... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1176 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)))))
lola: processed formula length: 156
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 28 bytes per marking, with 10 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 1765 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + 1 <= p279 + p281 + p283 + p285 + p287 + p289 + p291 + p293 + p295 + p296 + p294 + p292 + p290 + p288 + p286 + p284 + p282 + p280) R (p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((p279 + p281 + p283 + p285 + p287 + p289 + p291 + p293 + p295 + p296 + p294 + p292 + p290 + p288 + p286 + p284 + p282 + p280 <= p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314) U (2 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197)))
lola: processed formula length: 267
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 28 bytes per marking, with 10 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 1765 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + 1 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224)))
lola: processed formula length: 145
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 28 bytes per marking, with 10 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 3530 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251) OR E (F ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251) OR E(TRUE U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p14... (shortened)
lola: processed formula length: 645
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 28 bytes per marking, with 10 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 yes 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 TRUE 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 1494624044295

--------------------
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="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/LamportFastMutEx-COL-8.tgz
mv 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 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 r038-blw7-149440484700165"
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 ;