fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r118-csrt-152666478000094
Last Updated
June 26, 2018

About the Execution of M4M.full for LamportFastMutEx-COL-7

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4511.670 379907.00 363400.00 259.00 FFFFF?TTTTFFFTTT 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)
............................................................................
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 43K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is LamportFastMutEx-COL-7, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478000094
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527290443260


BK_STOP 1527290823167

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using LamportFastMutEx-COL-7 as instance name.
Using LamportFastMutEx as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 1302737, 'Memory': 15944.7, 'Tool': 'lola'}, {'Time': 1710862, 'Memory': 14762.38, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola LamportFastMutEx-COL-7...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
LamportFastMutEx-COL-7: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
LamportFastMutEx-COL-7: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ LamportFastMutEx-COL-7 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 800/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 264 places, 536 transitions, 182 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 762 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-7-CTLCardinality.task
lola: A (F (((2 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175) AND (2 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) AND (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151) AND (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 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 0) AND (p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + 1 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175)))) : A (G (((p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 <= 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 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64)))) : A (F ((1 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255))) : NOT((E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17) AND (1 <= p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24)))) AND A (((3 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32) U (p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175))))) : A (F ((2 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64))) : E (F (A (G (((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 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (1 <= p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24)))))) : E (((p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255) U E (G ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40))))) : E (F (E (G (((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) AND (1 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64)))))) : E (F (E (G ((p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= 2))))) : E (G (E (F ((p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + 1 <= p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196))))) : A (((((p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17) OR (p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= p62 + p60 + p58 + p56 + p54 + p52 + p50 + p48 + p49 + p51 + p53 + p55 + p57 + p59 + p61 + p63)) AND (p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 <= 2)) U A (X ((2 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64))))) : A (G ((E (G ((1 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175))) OR ((p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 <= 0) OR ((p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263) AND (1 <= p62 + p60 + p58 + p56 + p54 + p52 + p50 + p48 + p49 + p51 + p53 + p55 + p57 + p59 + p61 + p63)))))) : ((((((3 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175)) AND (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + 1 <= p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)) OR A (G ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)))) AND (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 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) AND ((((p62 + p60 + p58 + p56 + p54 + p52 + p50 + p48 + p49 + p51 + p53 + p55 + p57 + p59 + p61 + p63 + 1 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 <= 1)) OR (p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 <= p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)) OR E (X ((p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159))))) : E (F (E (F (((1 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32) AND (p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263)))))) : A (X (E (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255))))) : NOT(A (G (E (G ((p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151))))))
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 (F (((2 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175) AND (2 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) AND (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175) AND (2 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) AND (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151) AND (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 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 0) AND (p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + 1 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175))))
lola: processed formula: A (F (((2 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175) AND (2 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) AND (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221... (shortened)
lola: processed formula length: 1186
lola: 0 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 <= 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 + p80 + p81 + p82 + p83 + p84... (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 24 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-7-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-7-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 277344 markings, 1058489 edges, 55469 markings/sec, 0 secs
lola: sara is running 5 secs || 541490 markings, 2152268 edges, 52829 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 678688 markings, 2727482 edges
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255)))
lola: processed formula: A (F ((1 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255)))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 17 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17) AND (1 <= p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24)))) AND A (((3 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32) U (p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) OR (p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 <= 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 24 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-7-CTLCardinality-3.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: 47 markings, 47 edges
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 <= 2) R (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + 1 <= p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((3 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32) U (p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175)))
lola: processed formula length: 175
lola: 11 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64)))
lola: processed formula: A (F ((2 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64)))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((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 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(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 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p9... (shortened)
lola: processed formula length: 516
lola: 3 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 691916 markings, 3975654 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1278788 markings, 7664754 edges, 117374 markings/sec, 5 secs
lola: 1862739 markings, 11366374 edges, 116790 markings/sec, 10 secs
lola: 2475761 markings, 14883900 edges, 122604 markings/sec, 15 secs
lola: 3204370 markings, 19198094 edges, 145722 markings/sec, 20 secs
lola: 3902291 markings, 23547358 edges, 139584 markings/sec, 25 secs
lola: 4491225 markings, 27474376 edges, 117787 markings/sec, 30 secs
lola: 5052982 markings, 31099941 edges, 112351 markings/sec, 35 secs
lola: 5604314 markings, 34628375 edges, 110266 markings/sec, 40 secs
lola: 6172737 markings, 38234691 edges, 113685 markings/sec, 45 secs
lola: 6712834 markings, 41751139 edges, 108019 markings/sec, 50 secs
lola: 7270167 markings, 45340346 edges, 111467 markings/sec, 55 secs
lola: 7811017 markings, 48936065 edges, 108170 markings/sec, 60 secs
lola: 8362663 markings, 52619552 edges, 110329 markings/sec, 65 secs
lola: 8946937 markings, 56385151 edges, 116855 markings/sec, 70 secs
lola: 9500604 markings, 59880275 edges, 110733 markings/sec, 75 secs
lola: 10082715 markings, 63742670 edges, 116422 markings/sec, 80 secs
lola: 10620618 markings, 67305616 edges, 107581 markings/sec, 85 secs
lola: 11142323 markings, 70714959 edges, 104341 markings/sec, 90 secs
lola: 11701531 markings, 74457179 edges, 111842 markings/sec, 95 secs
lola: 12202083 markings, 77828288 edges, 100110 markings/sec, 100 secs
lola: 12732648 markings, 81252586 edges, 106113 markings/sec, 105 secs
lola: 13265920 markings, 84681168 edges, 106654 markings/sec, 110 secs
lola: 13826029 markings, 88358130 edges, 112022 markings/sec, 115 secs
lola: 14367618 markings, 91915132 edges, 108318 markings/sec, 120 secs
lola: 14872263 markings, 95238028 edges, 100929 markings/sec, 125 secs
lola: 15377075 markings, 98535524 edges, 100962 markings/sec, 130 secs
lola: 15918940 markings, 102061231 edges, 108373 markings/sec, 135 secs
lola: 16436938 markings, 105482010 edges, 103600 markings/sec, 140 secs
lola: 16931632 markings, 108728752 edges, 98939 markings/sec, 145 secs
lola: 17445014 markings, 112169687 edges, 102676 markings/sec, 150 secs
lola: 17985492 markings, 115726955 edges, 108096 markings/sec, 155 secs
lola: 18502386 markings, 119124882 edges, 103379 markings/sec, 160 secs
lola: 19010861 markings, 122464365 edges, 101695 markings/sec, 165 secs
lola: 19559898 markings, 125910663 edges, 109807 markings/sec, 170 secs
lola: 20074340 markings, 129265655 edges, 102888 markings/sec, 175 secs
lola: 20565195 markings, 132493050 edges, 98171 markings/sec, 180 secs
lola: 21105745 markings, 135950326 edges, 108110 markings/sec, 185 secs
lola: 21624858 markings, 139395590 edges, 103823 markings/sec, 190 secs
lola: 22149771 markings, 142895644 edges, 104983 markings/sec, 195 secs
lola: 22670865 markings, 146383921 edges, 104219 markings/sec, 200 secs
lola: 23235631 markings, 149949569 edges, 112953 markings/sec, 205 secs
lola: 23791342 markings, 153502488 edges, 111142 markings/sec, 210 secs
lola: 24298231 markings, 156870438 edges, 101378 markings/sec, 215 secs
lola: 24771697 markings, 160107704 edges, 94693 markings/sec, 220 secs
lola: 25273432 markings, 163450395 edges, 100347 markings/sec, 225 secs
lola: 25773527 markings, 166763965 edges, 100019 markings/sec, 230 secs
lola: 26292307 markings, 170163151 edges, 103756 markings/sec, 235 secs
lola: 26786443 markings, 173525033 edges, 98827 markings/sec, 240 secs
lola: 27303505 markings, 176876092 edges, 103412 markings/sec, 245 secs
lola: 27788669 markings, 180184692 edges, 97033 markings/sec, 250 secs
lola: 28302337 markings, 183600892 edges, 102734 markings/sec, 255 secs
lola: 28804238 markings, 186934582 edges, 100380 markings/sec, 260 secs
lola: 29289794 markings, 190246330 edges, 97111 markings/sec, 265 secs
lola: 29784260 markings, 193546258 edges, 98893 markings/sec, 270 secs
lola: 30298783 markings, 197017524 edges, 102905 markings/sec, 275 secs
lola: 30782742 markings, 200376413 edges, 96792 markings/sec, 280 secs
lola: 31296023 markings, 203793602 edges, 102656 markings/sec, 285 secs
lola: 31809697 markings, 207259051 edges, 102735 markings/sec, 290 secs
lola: 32318151 markings, 210538024 edges, 101691 markings/sec, 295 secs
lola: 32830273 markings, 213965724 edges, 102424 markings/sec, 300 secs
lola: 33324810 markings, 217284850 edges, 98907 markings/sec, 305 secs
lola: 33822674 markings, 220558300 edges, 99573 markings/sec, 310 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p20... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 ... (shortened)
lola: processed formula length: 625
lola: 3 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 15 markings, 16 edges
lola: ========================================
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) AND (1 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U ((p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 <= 0)))))
lola: processed formula length: 192
lola: 3 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 11542 markings, 21797 edges
lola: ========================================
lola: subprocess 8 will run for 400 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (3 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175))))
lola: processed formula length: 85
lola: 3 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 15 markings, 16 edges
lola: ========================================
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + 1 <= p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + 1 <= p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 ... (shortened)
lola: processed formula length: 530
lola: 2 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 117 markings, 234 edges
lola: ========================================
lola: subprocess 10 will run for 534 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((((p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17) OR (p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= p62 + p60 + p58 + p56 + p54 + p52 + p50 + p48 + p49 + p51 + p53 + p55 + p57 + p59 + p61 + p63)) AND (p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 <= 2)) U A (X ((2 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((((p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17) OR (p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= p62 + p60 + p58 + p56 + p54 + p52 + p50 + p48 + p49 + p51 + p53 + p55 + p57 + p59 + p61 + p63)) AND (p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 <= 2)) U AX((2 <= p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64)))
lola: processed formula length: 384
lola: 2 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 11 will run for 641 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((1 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175))) OR ((p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 <= 0) OR ((p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263) AND (1 <= p62 + p60 + p58 + p56 + p54 + p52 + p50 + p48 + p49 + p51 + p53 + p55 + p57 + p59 + p61 + p63))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (A(TRUE U (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= 0)) AND ((1 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151) AND ((p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + 1 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32) OR (p62 + p60 + p58 + p56 + p54 + p52 + p50 + p48 + p49 + p51 + p53 + p55 + p57 + p59 + p61 + p63 <= 0))))))
lola: processed formula length: 374
lola: 6 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 747245 markings, 2103269 edges
lola: ========================================
lola: subprocess 12 will run for 801 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((((3 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175)) AND (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + 1 <= p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)) OR A (G ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)))) AND (p100 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 801 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175)) AND (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + 1 <= p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((3 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175)) AND (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + 1 <= p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40))
lola: processed formula length: 276
lola: 1 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1068 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)))
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 24 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-7-CTLCardinality-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1068 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((1 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32) AND (p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263))))))
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 24 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-7-CTLCardinality-13.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 14 will run for 1602 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255)))
lola: processed formula length: 114
lola: 2 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 236 markings, 342 edges
lola: ========================================
lola: subprocess 15 will run for 3204 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (G ((p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + 1 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17)))
lola: processed formula length: 128
lola: 7 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 129 markings, 446 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no unknown yes yes yes yes no no no yes yes yes
FORMULA LamportFastMutEx-COL-7-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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