About the Execution of 2018-Gold for AirplaneLD-COL-0050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1668.860 | 204408.00 | 207319.00 | 436.30 | FTTFTFTFTTFTFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r011-smll-155225030100071.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is AirplaneLD-COL-0050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-smll-155225030100071
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 4.5K Feb 9 05:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 9 05:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 5 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 5 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 106 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 344 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 22:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K Feb 4 22:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K Feb 4 22:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 1 23:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 1 23:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jan 29 09:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Jan 29 09:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 46K 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 AirplaneLD-COL-0050-LTLCardinality-00
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-01
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-02
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-03
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-04
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-05
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-06
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-07
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-08
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-09
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-10
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-11
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-12
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-13
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-14
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552330097664
info: Time: 3600 - MCC
===========================================================================================
prep: translating AirplaneLD-COL-0050 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating AirplaneLD-COL-0050 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ AirplaneLD-COL-0050 @ 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: 777/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 11808
lola: finding significant places
lola: 369 places, 408 transitions, 214 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 315 transition conflict sets
lola: TASK
lola: reading formula from AirplaneLD-COL-0050-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p101 <= p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162)
lola: after: (p101 <= 50)
lola: LP says that atomic proposition is always true: (p101 <= 50)
lola: LP says that atomic proposition is always false: (3 <= p104 + p105)
lola: LP says that atomic proposition is always false: (2 <= p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304 + 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 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303)
lola: place invariant simplifies atomic proposition
lola: before: (p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338 + p337 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 <= p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162)
lola: after: (p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338 + p337 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 <= 50)
lola: LP says that atomic proposition is always true: (p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338 + p337 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 <= 50)
lola: LP says that atomic proposition is always false: (2 <= p366)
lola: place invariant simplifies atomic proposition
lola: before: (p364 + p365 <= p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162)
lola: after: (p364 + p365 <= 50)
lola: LP says that atomic proposition is always true: (p364 + p365 <= 50)
lola: place invariant simplifies atomic proposition
lola: before: (p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304 + 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 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 <= p9 + p8 + p7 + p6 + p5 + p4 + p3 + p2 + p1 + p0 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: after: (p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304 + 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 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 <= 100)
lola: LP says that atomic proposition is always true: (p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304 + 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 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 <= 100)
lola: LP says that atomic proposition is always false: (3 <= p364 + p365)
lola: place invariant simplifies atomic proposition
lola: before: (p156 <= p158 + p157)
lola: after: (p156 <= 2)
lola: LP says that atomic proposition is always true: (p156 <= 2)
lola: place invariant simplifies atomic proposition
lola: before: (p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 <= p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162)
lola: after: (p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 <= 50)
lola: LP says that atomic proposition is always true: (p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 <= 50)
lola: A (F (F (F (G ((1 <= p161)))))) : A (TRUE) : A (F (G (F (G ((p160 <= p159)))))) : A (F (G (FALSE))) : A (X (F (((1 <= p367) U (p103 <= p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304 + 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 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303))))) : A (G (G (G (X (FALSE))))) : A (G (F (X (TRUE)))) : A (G (F (FALSE))) : A (G ((G ((1 <= p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338 + p337 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314)) U F ((p156 <= p102))))) : A (X (X (TRUE))) : A (G ((p102 <= p103))) : A (G (X (G (G (TRUE))))) : A (G (FALSE)) : A (F (F (G (TRUE)))) : A (G ((F ((p101 <= p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338 + p337 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314)) U X ((1 <= p104 + p105))))) : A (G (TRUE))
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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 AirplaneLD-COL-0050-LTLCardinality-1 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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 AirplaneLD-COL-0050-LTLCardinality-3 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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 AirplaneLD-COL-0050-LTLCardinality-5 FALSE 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: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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 AirplaneLD-COL-0050-LTLCardinality-7 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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 AirplaneLD-COL-0050-LTLCardinality-12 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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 AirplaneLD-COL-0050-LTLCardinality-13 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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 AirplaneLD-COL-0050-LTLCardinality-15 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 (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: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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: 205 markings, 204 edges
FORMULA AirplaneLD-COL-0050-LTLCardinality-11 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 (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: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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: ========================================
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: 205 markings, 204 edges
lola: ========================================
FORMULA AirplaneLD-COL-0050-LTLCardinality-6 TRUE 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 (F ((p103 <= p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304 + 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p103 <= p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304 + 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... (shortened)
lola: processed formula length: 719
lola: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1036939 markings, 1050226 edges, 207388 markings/sec, 0 secs
lola: 2116172 markings, 2143451 edges, 215847 markings/sec, 5 secs
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: 2379915 markings, 2433618 edges
lola: ========================================
FORMULA AirplaneLD-COL-0050-LTLCardinality-4 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 (G (F ((1 <= p104 + p105)))) AND A (G ((F ((p101 <= p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338 + p337 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= p104 + p105))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p104 + p105))))
lola: processed formula length: 30
lola: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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: 22609 markings, 25112 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA AirplaneLD-COL-0050-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 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: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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: 205 markings, 204 edges
lola: ========================================
FORMULA AirplaneLD-COL-0050-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p102 <= p103)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p102 <= p103)))
lola: processed formula length: 22
lola: 54 rewrites
lola: closed formula file AirplaneLD-COL-0050-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p103 + 1 <= p102)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to AirplaneLD-COL-0050-LTLCardinality-12-0.sara
lola: ========================================
FORMULA AirplaneLD-COL-0050-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p161))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p161))))
lola: processed formula length: 23
lola: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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: 9 markings, 10 edges
lola: ========================================
FORMULA AirplaneLD-COL-0050-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p160 <= p159))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p160 <= p159))))
lola: processed formula length: 26
lola: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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: 516072 markings, 1552727 edges, 103214 markings/sec, 0 secs
lola: 1008367 markings, 3032146 edges, 98459 markings/sec, 5 secs
lola: 1393698 markings, 4178801 edges, 77066 markings/sec, 10 secs
lola: 1818935 markings, 5457822 edges, 85047 markings/sec, 15 secs
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: 2025935 markings, 6086774 edges
FORMULA AirplaneLD-COL-0050-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((p156 <= p102)) OR (G ((1 <= p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338 + p337 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314)) AND F ((p15... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((p156 <= p102)) OR (G ((1 <= p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338 + p337 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314)) AND F ((p15... (shortened)
lola: processed formula length: 415
lola: 52 rewrites
lola: closed formula file AirplaneLD-COL-0050-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: 601980 markings, 1602234 edges, 120396 markings/sec, 0 secs
lola: 1112244 markings, 3048540 edges, 102053 markings/sec, 5 secs
lola: 1551077 markings, 4216658 edges, 87767 markings/sec, 10 secs
lola: 1993831 markings, 5440417 edges, 88551 markings/sec, 15 secs
lola: 2418603 markings, 6576106 edges, 84954 markings/sec, 20 secs
lola: 2793668 markings, 7633642 edges, 75013 markings/sec, 25 secs
lola: 3183046 markings, 8664335 edges, 77876 markings/sec, 30 secs
lola: 3542592 markings, 9679609 edges, 71909 markings/sec, 35 secs
lola: 3875090 markings, 10633123 edges, 66500 markings/sec, 40 secs
lola: 4215707 markings, 11558654 edges, 68123 markings/sec, 45 secs
lola: 4538916 markings, 12450158 edges, 64642 markings/sec, 50 secs
lola: 4870235 markings, 13321686 edges, 66264 markings/sec, 55 secs
lola: 5177028 markings, 14139170 edges, 61359 markings/sec, 60 secs
lola: 5472813 markings, 14960410 edges, 59157 markings/sec, 65 secs
lola: 5758241 markings, 15754640 edges, 57086 markings/sec, 70 secs
lola: 6053253 markings, 16503609 edges, 59002 markings/sec, 75 secs
lola: 6311428 markings, 17266128 edges, 51635 markings/sec, 80 secs
lola: 6601995 markings, 17980913 edges, 58113 markings/sec, 85 secs
lola: 6862840 markings, 18722495 edges, 52169 markings/sec, 90 secs
lola: 7119765 markings, 19415257 edges, 51385 markings/sec, 95 secs
lola: 7380847 markings, 20088109 edges, 52216 markings/sec, 100 secs
lola: 7628940 markings, 20783457 edges, 49619 markings/sec, 105 secs
lola: 7859701 markings, 21442299 edges, 46152 markings/sec, 110 secs
lola: 8111539 markings, 22097370 edges, 50368 markings/sec, 115 secs
lola: 8348378 markings, 22730544 edges, 47368 markings/sec, 120 secs
lola: 8592025 markings, 23352888 edges, 48729 markings/sec, 125 secs
lola: 8820401 markings, 23976032 edges, 45675 markings/sec, 130 secs
lola: 9046136 markings, 24590162 edges, 45147 markings/sec, 135 secs
lola: 9269111 markings, 25193564 edges, 44595 markings/sec, 140 secs
lola: 9488986 markings, 25785677 edges, 43975 markings/sec, 145 secs
lola: 9705790 markings, 26366981 edges, 43361 markings/sec, 150 secs
lola: 9960779 markings, 27100255 edges, 50998 markings/sec, 155 secs
lola: 10560195 markings, 28699613 edges, 119883 markings/sec, 160 secs
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: 11067055 markings, 30121602 edges
FORMULA AirplaneLD-COL-0050-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no yes no yes no yes yes no yes no yes no yes
lola:
preliminary result: no yes yes no yes no yes no yes yes no yes no yes no yes
lola: ========================================
lola: memory consumption: 18744 KB
lola: time consumption: 205 seconds
BK_STOP 1552330302072
--------------------
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="AirplaneLD-COL-0050"
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-3957"
echo " Executing tool win2018"
echo " Input is AirplaneLD-COL-0050, 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 r011-smll-155225030100071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-COL-0050.tgz
mv AirplaneLD-COL-0050 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 '
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 ;