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 252K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K 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.8K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 92K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PolyORBNT-COL-S05J20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732262000425
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527446121463


BK_STOP 1527446684899

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

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

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBNT-COL-S05J20: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBNT-COL-S05J20: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PolyORBNT-COL-S05J20 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1599/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 369 places, 1230 transitions, 307 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 688 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J20-LTLCardinality.task
lola: A ((3 <= p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368)) : A (G ((F ((1 <= p318 + p317 + p316 + p315 + p314)) U F ((2 <= p180 + p181 + p182 + p183 + p184 + p185 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186))))) : A (G ((p279 <= p245))) : A (F (F (G (X ((2 <= p347)))))) : A ((X (X ((2 <= p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271))) U X (G ((p68 <= p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368))))) : A (F (F (((2 <= p68) U (3 <= p342 + p343 + p344 + p345 + p346))))) : A ((X ((1 <= p180 + p181 + p182 + p183 + p184 + p185 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186)) U G (G ((3 <= p71))))) : A (X (G ((p285 + p286 + p287 + p288 + p289 <= p43)))) : A ((G (X ((p68 <= p273 + p274 + p275 + p276 + p277))) U X (F ((p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 <= p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313))))) : A (F ((G ((3 <= p178)) U (3 <= p283)))) : A (F ((F ((2 <= p282)) U F ((1 <= p250))))) : A (F ((p319 <= p291))) : A ((G (G ((2 <= p67))) U ((2 <= p246) U (2 <= p319)))) : A (G ((p285 + p286 + p287 + p288 + p289 <= p70))) : A (F (F (X (X ((2 <= p291)))))) : A (X (G ((p44 <= p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368)
lola: processed formula length: 151
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((1 <= p318 + p317 + p316 + p315 + p314)) U F ((2 <= p180 + p181 + p182 + p183 + p184 + p185 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((1 <= p318 + p317 + p316 + p315 + p314)) U F ((2 <= p180 + p181 + p182 + p183 + p184 + p185 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186)))))
lola: processed formula: A (G ((F ((1 <= p318 + p317 + p316 + p315 + p314)) U F ((2 <= p180 + p181 + p182 + p183 + p184 + p185 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186)))))
lola: processed formula length: 211
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 56542 markings, 89800 edges, 11308 markings/sec, 0 secs
lola: 113333 markings, 180061 edges, 11358 markings/sec, 5 secs
lola: 173776 markings, 275911 edges, 12089 markings/sec, 10 secs
lola: 230769 markings, 369494 edges, 11399 markings/sec, 15 secs
lola: 289811 markings, 466160 edges, 11808 markings/sec, 20 secs
lola: 350404 markings, 565713 edges, 12119 markings/sec, 25 secs
lola: 409130 markings, 665413 edges, 11745 markings/sec, 30 secs
lola: 467409 markings, 767339 edges, 11656 markings/sec, 35 secs
lola: 526953 markings, 875539 edges, 11909 markings/sec, 40 secs
lola: 588612 markings, 1002022 edges, 12332 markings/sec, 45 secs
lola: 661290 markings, 1109885 edges, 14536 markings/sec, 50 secs
lola: 734112 markings, 1217809 edges, 14564 markings/sec, 55 secs
lola: 808543 markings, 1327465 edges, 14886 markings/sec, 60 secs
lola: 879937 markings, 1433790 edges, 14279 markings/sec, 65 secs
lola: 951450 markings, 1540933 edges, 14303 markings/sec, 70 secs
lola: 1024052 markings, 1648727 edges, 14520 markings/sec, 75 secs
lola: 1096842 markings, 1757724 edges, 14558 markings/sec, 80 secs
lola: 1171206 markings, 1867351 edges, 14873 markings/sec, 85 secs
lola: 1244998 markings, 1978043 edges, 14758 markings/sec, 90 secs
lola: 1313001 markings, 2082655 edges, 13601 markings/sec, 95 secs
lola: 1384397 markings, 2190636 edges, 14279 markings/sec, 100 secs
lola: 1458215 markings, 2301739 edges, 14764 markings/sec, 105 secs
lola: 1528156 markings, 2409660 edges, 13988 markings/sec, 110 secs
lola: 1598894 markings, 2518706 edges, 14148 markings/sec, 115 secs
lola: 1672165 markings, 2631081 edges, 14654 markings/sec, 120 secs
lola: 1744110 markings, 2742933 edges, 14389 markings/sec, 125 secs
lola: 1814751 markings, 2855193 edges, 14128 markings/sec, 130 secs
lola: 1887731 markings, 2970590 edges, 14596 markings/sec, 135 secs
lola: 1958772 markings, 3086369 edges, 14208 markings/sec, 140 secs
lola: 2031384 markings, 3206901 edges, 14522 markings/sec, 145 secs
lola: 2104946 markings, 3334820 edges, 14712 markings/sec, 150 secs
lola: 2170100 markings, 3467506 edges, 13031 markings/sec, 155 secs
lola: 2219760 markings, 3558183 edges, 9932 markings/sec, 160 secs
lola: 2267826 markings, 3645922 edges, 9613 markings/sec, 165 secs
lola: 2317019 markings, 3735898 edges, 9839 markings/sec, 170 secs
lola: 2365499 markings, 3822908 edges, 9696 markings/sec, 175 secs
lola: 2413143 markings, 3912201 edges, 9529 markings/sec, 180 secs
lola: 2461386 markings, 4002030 edges, 9649 markings/sec, 185 secs
lola: 2510127 markings, 4092220 edges, 9748 markings/sec, 190 secs
lola: 2559464 markings, 4182667 edges, 9867 markings/sec, 195 secs
lola: 2607353 markings, 4274861 edges, 9578 markings/sec, 200 secs
lola: 2656187 markings, 4367942 edges, 9767 markings/sec, 205 secs
lola: 2705068 markings, 4461244 edges, 9776 markings/sec, 210 secs
lola: 2753577 markings, 4557913 edges, 9702 markings/sec, 215 secs
lola: 2802077 markings, 4657832 edges, 9700 markings/sec, 220 secs
lola: 2851408 markings, 4774795 edges, 9866 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p279 <= p245)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1228 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((2 <= p347))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((2 <= p347)))))
lola: processed formula: A (F (G (X ((2 <= p347)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 30 unused bits
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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((2 <= p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271))) U X (G ((p68 <= p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((2 <= p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271)) U G ((p68 <= p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368)))))
lola: processed formula: A (X ((X ((2 <= p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271)) U G ((p68 <= p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368)))))
lola: processed formula length: 325
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 847793 markings, 2305266 edges, 169559 markings/sec, 0 secs
lola: 1510161 markings, 4668516 edges, 132474 markings/sec, 5 secs
lola: 2357620 markings, 6940715 edges, 169492 markings/sec, 10 secs
lola: 3204016 markings, 9192424 edges, 169279 markings/sec, 15 secs
lola: 4029257 markings, 11439200 edges, 165048 markings/sec, 20 secs
lola: 4801047 markings, 13695813 edges, 154358 markings/sec, 25 secs
lola: 5463462 markings, 15936925 edges, 132483 markings/sec, 30 secs
lola: 6126684 markings, 18175015 edges, 132644 markings/sec, 35 secs
lola: 6922587 markings, 20375121 edges, 159181 markings/sec, 40 secs
lola: 7590074 markings, 22735215 edges, 133497 markings/sec, 45 secs
lola: 8388779 markings, 24989897 edges, 159741 markings/sec, 50 secs
lola: 9241014 markings, 27248340 edges, 170447 markings/sec, 55 secs
lola: 10078771 markings, 29519180 edges, 167551 markings/sec, 60 secs
lola: 10873956 markings, 31798828 edges, 159037 markings/sec, 65 secs
lola: 11536794 markings, 34016457 edges, 132568 markings/sec, 70 secs
lola: 12212782 markings, 36258229 edges, 135198 markings/sec, 75 secs
lola: 12977900 markings, 38481379 edges, 153024 markings/sec, 80 secs
lola: 13680776 markings, 40789711 edges, 140575 markings/sec, 85 secs
lola: 14386306 markings, 42986401 edges, 141106 markings/sec, 90 secs
lola: 15225314 markings, 45185846 edges, 167802 markings/sec, 95 secs
lola: 16049602 markings, 47402281 edges, 164858 markings/sec, 100 secs
lola: 16841412 markings, 49605424 edges, 158362 markings/sec, 105 secs
lola: 17499463 markings, 51743059 edges, 131610 markings/sec, 110 secs
lola: 18160096 markings, 53894377 edges, 132127 markings/sec, 115 secs
lola: 18811562 markings, 56046772 edges, 130293 markings/sec, 120 secs
lola: 19596100 markings, 58272056 edges, 156908 markings/sec, 125 secs
lola: 20221023 markings, 60535356 edges, 124985 markings/sec, 130 secs
lola: 21042668 markings, 62685465 edges, 164329 markings/sec, 135 secs
lola: 21864497 markings, 64869053 edges, 164366 markings/sec, 140 secs
lola: 22676476 markings, 67072706 edges, 162396 markings/sec, 145 secs
lola: 23432429 markings, 69275696 edges, 151191 markings/sec, 150 secs
lola: 24057279 markings, 71393776 edges, 124970 markings/sec, 155 secs
lola: 24704547 markings, 73551392 edges, 129454 markings/sec, 160 secs
lola: 25432814 markings, 75666784 edges, 145653 markings/sec, 165 secs
lola: 26056834 markings, 77865789 edges, 124804 markings/sec, 170 secs
lola: 26799531 markings, 79978794 edges, 148539 markings/sec, 175 secs
lola: 27596277 markings, 82104036 edges, 159349 markings/sec, 180 secs
lola: 28369088 markings, 84236573 edges, 154562 markings/sec, 185 secs
lola: 29061434 markings, 86338469 edges, 138469 markings/sec, 190 secs
lola: 29674214 markings, 88421120 edges, 122556 markings/sec, 195 secs
lola: 30166857 markings, 90140206 edges, 98529 markings/sec, 200 secs
lola: 30184624 markings, 90231676 edges, 3553 markings/sec, 205 secs
lola: 30185782 markings, 90233791 edges, 232 markings/sec, 210 secs
lola: 30187064 markings, 90236204 edges, 256 markings/sec, 215 secs
lola: 30187468 markings, 90236989 edges, 81 markings/sec, 220 secs
lola: 30187497 markings, 90237040 edges, 6 markings/sec, 225 secs
lola: 30188332 markings, 90238733 edges, 167 markings/sec, 230 secs
lola: 30188341 markings, 90238756 edges, 2 markings/sec, 235 secs
lola: 30188352 markings, 90238780 edges, 2 markings/sec, 240 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((2 <= p68) U (3 <= p342 + p343 + p344 + p345 + p346)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p68) U (3 <= p342 + p343 + p344 + p345 + p346))))
lola: processed formula: A (F (((2 <= p68) U (3 <= p342 + p343 + p344 + p345 + p346))))
lola: processed formula length: 62
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 6 will run for 302 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((1 <= p180 + p181 + p182 + p183 + p184 + p185 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186)) U G (G ((3 <= p71)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((1 <= p180 + p181 + p182 + p183 + p184 + p185 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186)) U G (G ((3 <= p71)))))
lola: processed formula: A ((X ((1 <= p180 + p181 + p182 + p183 + p184 + p185 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186)) U G (G ((3 <= p71)))))
lola: processed formula length: 182
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 29 unused bits
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: 27 markings, 30 edges
lola: ========================================
lola: subprocess 7 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p285 + p286 + p287 + p288 + p289 <= p43))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((p285 + p286 + p287 + p288 + p289 <= p43))))
lola: processed formula: A (X (G ((p285 + p286 + p287 + p288 + p289 <= p43))))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 30 unused bits
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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 8 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((p68 <= p273 + p274 + p275 + p276 + p277))) U X (F ((p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 <= p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X ((p68 <= p273 + p274 + p275 + p276 + p277))) U X (F ((p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 <= p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313)))))
lola: processed formula: A ((G (X ((p68 <= p273 + p274 + p275 + p276 + p277))) U X (F ((p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 <= p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313)))))
lola: processed formula length: 360
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 29 unused bits
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: 19 markings, 18 edges
lola: ========================================
lola: subprocess 9 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((3 <= p178)) U (3 <= p283))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((3 <= p178)) U (3 <= p283))))
lola: processed formula: A (F ((G ((3 <= p178)) U (3 <= p283))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 10 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((2 <= p282)) U F ((1 <= p250)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((2 <= p282)) U F ((1 <= p250)))))
lola: processed formula: A (F ((F ((2 <= p282)) U F ((1 <= p250)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 11 will run for 604 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p319 <= p291)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p319 <= p291)))
lola: processed formula: A (F ((p319 <= p291)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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: ========================================
lola: subprocess 12 will run for 755 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((2 <= p67))) U ((2 <= p246) U (2 <= p319))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((2 <= p67))) U ((2 <= p246) U (2 <= p319))))
lola: processed formula: A ((G (G ((2 <= p67))) U ((2 <= p246) U (2 <= p319))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 13 will run for 1007 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p285 + p286 + p287 + p288 + p289 <= p70)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1228 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 14 will run for 1511 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (X ((2 <= p291))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (X ((2 <= p291)))))
lola: processed formula: A (F (X (X ((2 <= p291)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 30 unused bits
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: 23 markings, 37 edges
lola: ========================================
lola: subprocess 15 will run for 3022 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p44 <= p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((p44 <= p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340))))
lola: processed formula: A (X (G ((p44 <= p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340))))
lola: processed formula length: 165
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 30 unused bits
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: 13 markings, 13 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no unknown no no no yes no no yes no no yes no
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="PolyORBNT-COL-S05J20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-structural"
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/PolyORBNT-COL-S05J20.tgz
mv PolyORBNT-COL-S05J20 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 irma4mcc-structural"
echo " Input is PolyORBNT-COL-S05J20, 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 r211-smll-152732262000425"
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 ;