Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 44K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is LamportFastMutEx-COL-8, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-csrt-152732582700029
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527429897980

info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-COL-8 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating LamportFastMutEx-COL-8 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ LamportFastMutEx-COL-8 @ 3569 seconds
lola: LoLA will run for 3569 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: Size of bit vector: 315
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-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 <= p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242)
lola: after: (p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 <= p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244)
lola: after: (p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 <= 8)
lola: LP says that atomic proposition is always true: (p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 <= 8)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 <= p243 + p245 + p247 + p249 + p251 + p253 + p255 + p257 + p259 + p260 + p258 + p256 + p254 + p252 + p250 + p248 + p246 + p244)
lola: after: (p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 <= 8)
lola: LP says that atomic proposition is always true: (p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 <= 8)
lola: A (F (G (F (X ((p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62)))))) : A (F (G (((1 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27) U (3 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303))))) : A (X (G ((p9 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p309 + p308 + p307 + p306 + p310 + p311 + p312 + p313 + p314)))) : A (F ((X (FALSE) U F ((2 <= p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18))))) : A (F (G (G ((p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27))))) : A (X (X (F ((p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 <= 1))))) : A ((X (F ((p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p190 + p199 + p208 + p217 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303))) U ((2 <= 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 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U (p309 + p308 + p307 + p306 + p310 + p311 + p312 + p313 + p314 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)))) : A ((X (F ((p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 <= p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18))) U (TRUE U (p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p190 + p199 + p208 + p217 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27)))) : A (((3 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27) U X (X ((p309 + p308 + p307 + p306 + p310 + p311 + p312 + p313 + p314 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27))))) : A (FALSE) : A ((2 <= p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18)) : A ((p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 <= p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233)) : A (F (G (((1 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27) U (3 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278))))) : A ((F ((p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 <= p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45)) U X (F (TRUE)))) : A (G ((F ((p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 <= p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45)) U X ((3 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27))))) : A (X (X ((p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18)
lola: processed formula length: 58
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.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: 0 markings, 0 edges
lola:
FORMULA LamportFastMutEx-COL-8-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 <= p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 <= p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233)
lola: processed formula length: 126
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.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: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27) U X (X ((p309 + p308 + p307 + p306 + p310 + p311 + p312 + p313 + p314 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27) U X (X ((p309 + p308 + p307 + p306 + p310 + p311 + p312 + p313 + p314 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27)))))
lola: processed formula length: 192
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 125 markings, 208 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p9 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p309 + p308 + p307 + p306 + p310 + p311 + p312 + p313 + p314))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p9 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p309 + p308 + p307 + p306 + p310 + p311 + p312 + p313 + p314))))
lola: processed formula length: 128
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 11 markings, 11 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 <= 1)))))
lola: processed formula length: 74
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 45 markings, 72 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p190 + p199 + p208 + p217 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p190 + p199 + p208 + p217 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210... (shortened)
lola: processed formula length: 1294
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 <= p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45)) U X (TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 <= p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45)) U X (TRUE)))
lola: processed formula length: 129
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((3 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27)))) AND A (G ((F ((p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 <= p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45)) OR X ((3 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27))))
lola: processed formula length: 70
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 12 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8))))
lola: processed formula length: 120
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 45 markings, 72 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 <= 1)
lola: processed formula length: 58
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 12 markings, 12 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p190 + p199 + p208 + p217 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + 1 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p190 + p199 + p208 + p217 + p224 + p223 + p222 + p221 + p220 + p219 + p218... (shortened)
lola: processed formula length: 625
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((3 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278)) AND ((1 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27) OR (3 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((3 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278)) AND ((1 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27) OR (3 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278))))))
lola: processed formula length: 221
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 13 markings, 14 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((3 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303)) AND ((1 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27) OR (3 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((3 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303)) AND ((1 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27) OR (3 <= p305 + p304 + p297 + p298 + p299 + p300 + p301 + p302 + p303))))))
lola: processed formula length: 221
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 13 markings, 14 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 <= p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27))))
lola: processed formula length: 129
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 52 markings, 64 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62))))
lola: processed formula length: 120
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-COL-8-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 179 markings, 189 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-8-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no yes yes yes yes no no yes no yes no yes
lola:
preliminary result: no no no no no yes yes yes yes no no yes no yes no yes
lola: memory consumption: 21088 KB
lola: time consumption: 1 seconds

BK_STOP 1527429899178

--------------------
content from 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="LTLCardinality"
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
cd execution
pwd
ls -lh

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