Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r165-csrt-155286441800008.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is SafeBus-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-csrt-155286441800008
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Feb 12 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 12 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 17:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 17:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 101 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 339 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.2K Feb 5 01:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K Feb 5 01:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 4 17:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 4 17:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 1 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 42K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1553105267111

info: Time: 3600 - MCC
===========================================================================================
prep: translating SafeBus-COL-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SafeBus-COL-10 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ SafeBus-COL-10 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1977/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 10432
lola: finding significant places
lola: 326 places, 1651 transitions, 271 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1013 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-10-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 <= p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316)
lola: after: (10 <= p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316)
lola: place invariant simplifies atomic proposition
lola: before: (p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 <= p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151)
lola: after: (10 <= p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151)
lola: LP says that atomic proposition is always false: (3 <= p192)
lola: place invariant simplifies atomic proposition
lola: before: (p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)
lola: after: (1 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)
lola: LP says that atomic proposition is always false: (2 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)
lola: place invariant simplifies atomic proposition
lola: before: (p172 + p173 + p174 + p175 + p176 + p177 + p178 + p181 + p180 + p179 <= p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161)
lola: after: (p172 + p173 + p174 + p175 + p176 + p177 + p178 + p181 + p180 + p179 <= 1)
lola: LP says that atomic proposition is always true: (p172 + p173 + p174 + p175 + p176 + p177 + p178 + p181 + p180 + p179 <= 1)
lola: LP says that atomic proposition is always false: (2 <= p193)
lola: place invariant simplifies atomic proposition
lola: before: (p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 <= p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315)
lola: after: (10 <= p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315)
lola: LP says that atomic proposition is always false: (10 <= p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315)
lola: LP says that atomic proposition is always false: (2 <= p195)
lola: LP says that atomic proposition is always false: (3 <= p193)
lola: place invariant simplifies atomic proposition
lola: before: (p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 <= p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161)
lola: after: (p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162)
lola: after: (0 <= 9)
lola: always true
lola: A (X (F (G ((10 <= p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316))))) : A ((1 <= p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295)) : A (F (F ((10 <= p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151)))) : A (X (G (F (X ((p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 <= p21)))))) : A (X (F (G (G ((p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 <= 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 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p50 + p49 + p48 + p47 + p46 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p45 + p42 + p43 + p44 + p41 + p51 + p61 + p71 + p81 + p91 + p99)))))) : A (G (F (FALSE))) : A ((1 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)) : A ((F (F (FALSE)) U X (F (FALSE)))) : A (X (G (FALSE))) : A (G (G (TRUE))) : A (G (FALSE)) : A (FALSE) : A ((G ((2 <= p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305)) U (1 <= p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316))) : A (FALSE) : A ((((p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) U FALSE) U X ((p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 <= 1)))) : A (X (TRUE))
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p2... (shortened)
lola: processed formula length: 704
lola: 42 rewrites
lola: closed formula file SafeBus-COL-10-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
check_solution: Constraint R1 = 6.94493289271e-310 is above its upper bound -2
check_solution: Constraint R2 = 4.66088947635e-310 is above its equality of -1
check_solution: Constraint R64 = 0 is above its equality of -1
check_solution: Constraint R94 = 0 is above its equality of -1
check_solution: Constraint R95 = 0 is above its equality of -1
check_solution: Constraint R96 = 0 is above its equality of -1
check_solution: Constraint R97 = 0 is above its equality of -1
check_solution: Constraint R98 = 0 is above its equality of -1
check_solution: Constraint R99 = 0 is above its equality of -1
check_solution: Constraint R100 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 2 (rel. error 1)

FORMULA SafeBus-COL-10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 237 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: 42 rewrites
lola: closed formula file SafeBus-COL-10-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 SafeBus-COL-10-LTLCardinality-5 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: (1 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)
lola: processed formula length: 74
lola: 42 rewrites
lola: closed formula file SafeBus-COL-10-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 SafeBus-COL-10-LTLCardinality-6 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 42 rewrites
lola: closed formula file SafeBus-COL-10-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 SafeBus-COL-10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 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: 42 rewrites
lola: closed formula file SafeBus-COL-10-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 SafeBus-COL-10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 42 rewrites
lola: closed formula file SafeBus-COL-10-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SafeBus-COL-10-LTLCardinality-9 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 42 rewrites
lola: closed formula file SafeBus-COL-10-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 SafeBus-COL-10-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 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: 42 rewrites
lola: closed formula file SafeBus-COL-10-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 SafeBus-COL-10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 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: 42 rewrites
lola: closed formula file SafeBus-COL-10-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 SafeBus-COL-10-LTLCardinality-13 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 ((p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p... (shortened)
lola: processed formula length: 712
lola: 42 rewrites
lola: closed formula file SafeBus-COL-10-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: 11 markings, 10 edges
lola: ========================================

FORMULA SafeBus-COL-10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 42 rewrites
lola: closed formula file SafeBus-COL-10-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: 11 markings, 10 edges
lola: ========================================

FORMULA SafeBus-COL-10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((10 <= p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151)))
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: (p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 <= 9)
lola: processed formula length: 74
lola: 44 rewrites
lola: closed formula file SafeBus-COL-10-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: 190 markings, 190 edges
lola: ========================================

FORMULA SafeBus-COL-10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((10 <= p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((10 <= p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316))))
lola: processed formula length: 87
lola: 42 rewrites
lola: closed formula file SafeBus-COL-10-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: 105 markings, 106 edges

FORMULA SafeBus-COL-10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 <= p21))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 <= p21))))
lola: processed formula length: 88
lola: 42 rewrites
lola: closed formula file SafeBus-COL-10-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: ========================================
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: 191 markings, 191 edges
lola: ========================================

FORMULA SafeBus-COL-10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316) OR (G ((2 <= p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305)) AND F ((1 <= p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316) OR (G ((2 <= p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305)) AND F ((1 <= p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316)))))
lola: processed formula length: 247
lola: 42 rewrites
lola: closed formula file SafeBus-COL-10-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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 189609 markings, 477843 edges, 37922 markings/sec, 0 secs
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: 244611 markings, 618662 edges
lola: ========================================

FORMULA SafeBus-COL-10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 <= 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 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 <= 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 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 +... (shortened)
lola: processed formula length: 714
lola: 42 rewrites
lola: closed formula file SafeBus-COL-10-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: 198 markings, 204 edges
lola: ========================================

FORMULA SafeBus-COL-10-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no yes no no yes no no no no yes yes
lola:
preliminary result: no no no no no no yes no no yes no no no no yes yes
lola: memory consumption: 23124 KB
lola: time consumption: 15 seconds

BK_STOP 1553105282216

--------------------
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="SafeBus-COL-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is SafeBus-COL-10, 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 r165-csrt-155286441800008"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-10.tgz
mv SafeBus-COL-10 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;