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 336K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K 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 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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.9K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 154K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PolyORBLF-COL-S06J04T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265500377
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527465218963


BK_STOP 1527465555824

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBLF-COL-S06J04T04 as instance name.
Using PolyORBLF 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': 416952, 'Memory': 1024.6, 'Tool': 'lola'}, {'Time': 740122, 'Memory': 660.71, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBLF-COL-S06J04T04...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-COL-S06J04T04: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-COL-S06J04T04: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ PolyORBLF-COL-S06J04T04 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7448/65536 symbol table entries, 2235 collisions
lola: preprocessing...
lola: finding significant places
lola: 454 places, 6994 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1823 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: A ((p340 <= p138)) : A ((3 <= p335)) : A (F (X ((p182 + p183 + p184 + p185 <= p8 + p9 + p10 + p11)))) : A (F (X ((3 <= p139)))) : A (F ((p139 <= p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291))) : A (G (X (X ((1 <= p190 + p191 + p192 + p193))))) : A ((X (F ((2 <= p190 + p191 + p192 + p193))) U (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p95 + p96 + p97 + p98 + p99 <= p413 + p414 + p415 + p416 + p417))) : A (F (X (F ((3 <= p244))))) : A (X (G (F (F ((p111 + p112 + p113 + p114 <= p264 + p265 + p266 + p267)))))) : A (((1 <= p55 + p54 + p53 + p52 + p51 + p50 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p56 + p57 + p58 + p59 + p60 + p61) U ((p194 <= p249 + p250 + p251 + p252) U (3 <= p182 + p183 + p184 + p185)))) : A (X ((F ((p181 <= p292 + p293 + p294 + p295)) U G ((2 <= p300))))) : A (X (F (G (X ((p196 + p197 + p198 + p199 <= p186 + p187 + p188 + p189)))))) : A (F (((3 <= p86) U X ((3 <= p292 + p293 + p294 + p295))))) : A (G (X (((p200 <= p139) U (1 <= p20))))) : A (X (G (((1 <= p144) U (p186 + p187 + p188 + p189 <= p254 + p255 + p256 + p257))))) : A (F (((p249 + p250 + p251 + p252 <= p115 + p116 + p117 + p118 + p119 + p120) U X ((2 <= p33)))))
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 ((p340 <= p138))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p340 <= p138)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-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 ((3 <= p335))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p335)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((p182 + p183 + p184 + p185 <= p8 + p9 + p10 + p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((p182 + p183 + p184 + p185 <= p8 + p9 + p10 + p11))))
lola: processed formula: A (F (X ((p182 + p183 + p184 + p185 <= p8 + p9 + p10 + p11))))
lola: processed formula length: 62
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((3 <= p139))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((3 <= p139))))
lola: processed formula: A (F (X ((3 <= p139))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 37 markings, 37 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p139 <= p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p139 <= p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291)))
lola: processed formula: A (F ((p139 <= p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291)))
lola: processed formula length: 183
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 77 markings, 95 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (X ((1 <= p190 + p191 + p192 + p193)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (X ((1 <= p190 + p191 + p192 + p193)))))
lola: processed formula: A (G (X (X ((1 <= p190 + p191 + p192 + p193)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 37 markings, 37 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((2 <= p190 + p191 + p192 + p193))) U (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p95 + p96 + p97 + p98 + p99 <= p413 + p414 + p415 + p416 + p417)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (F ((2 <= p190 + p191 + p192 + p193))) U (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p95 + p96 + p97 + p98 + p99 <= p413 + p414 + p415 + p416 + p417)))
lola: processed formula: A ((X (F ((2 <= p190 + p191 + p192 + p193))) U (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p95 + p96 + p97 + p98 + p99 <= p413 + p414 + p415 + p416 + p417)))
lola: processed formula length: 211
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F ((3 <= p244)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F ((3 <= p244)))))
lola: processed formula: A (F (X (F ((3 <= p244)))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 37 markings, 37 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (F ((p111 + p112 + p113 + p114 <= p264 + p265 + p266 + p267))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((p111 + p112 + p113 + p114 <= p264 + p265 + p266 + p267)))))
lola: processed formula: A (X (G (F ((p111 + p112 + p113 + p114 <= p264 + p265 + p266 + p267)))))
lola: processed formula length: 72
lola: 1 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 352214 markings, 715633 edges, 70443 markings/sec, 0 secs
lola: 745948 markings, 1348052 edges, 78747 markings/sec, 5 secs
lola: 1147259 markings, 2090967 edges, 80262 markings/sec, 10 secs
lola: 1549051 markings, 2939282 edges, 80358 markings/sec, 15 secs
lola: 1942959 markings, 3714014 edges, 78782 markings/sec, 20 secs
lola: 2336445 markings, 4480004 edges, 78697 markings/sec, 25 secs
lola: 2709026 markings, 5568580 edges, 74516 markings/sec, 30 secs
lola: 3110189 markings, 6433396 edges, 80233 markings/sec, 35 secs
lola: 3501852 markings, 7384492 edges, 78333 markings/sec, 40 secs
lola: 3898531 markings, 8341859 edges, 79336 markings/sec, 45 secs
lola: 4298479 markings, 9256628 edges, 79990 markings/sec, 50 secs
lola: 4683332 markings, 10261002 edges, 76971 markings/sec, 55 secs
lola: 5059739 markings, 11222302 edges, 75281 markings/sec, 60 secs
lola: 5452017 markings, 12094761 edges, 78456 markings/sec, 65 secs
lola: 5851876 markings, 12911725 edges, 79972 markings/sec, 70 secs
lola: 6247930 markings, 13890827 edges, 79211 markings/sec, 75 secs
lola: 6605845 markings, 14700622 edges, 71583 markings/sec, 80 secs
lola: 6956221 markings, 15641154 edges, 70075 markings/sec, 85 secs
lola: 7313167 markings, 16670956 edges, 71389 markings/sec, 90 secs
lola: 7690630 markings, 17517117 edges, 75493 markings/sec, 95 secs
lola: 8046086 markings, 18402078 edges, 71091 markings/sec, 100 secs
lola: 8426293 markings, 19201487 edges, 76041 markings/sec, 105 secs
lola: 8801051 markings, 19952963 edges, 74952 markings/sec, 110 secs
lola: 9184207 markings, 20786238 edges, 76631 markings/sec, 115 secs
lola: 9550278 markings, 21654839 edges, 73214 markings/sec, 120 secs
lola: 9906737 markings, 22729847 edges, 71292 markings/sec, 125 secs
lola: 10283358 markings, 23573779 edges, 75324 markings/sec, 130 secs
lola: 10654825 markings, 24388259 edges, 74293 markings/sec, 135 secs
lola: 11033863 markings, 25052512 edges, 75808 markings/sec, 140 secs
lola: 11406972 markings, 25852830 edges, 74622 markings/sec, 145 secs
lola: 11757131 markings, 26764931 edges, 70032 markings/sec, 150 secs
lola: 12117025 markings, 27583994 edges, 71979 markings/sec, 155 secs
lola: 12485546 markings, 28410739 edges, 73704 markings/sec, 160 secs
lola: 12843663 markings, 29335365 edges, 71623 markings/sec, 165 secs
lola: 13208807 markings, 30181529 edges, 73029 markings/sec, 170 secs
lola: 13579662 markings, 30976600 edges, 74171 markings/sec, 175 secs
lola: 13945360 markings, 31720784 edges, 73140 markings/sec, 180 secs
lola: 14311261 markings, 32676118 edges, 73180 markings/sec, 185 secs
lola: 14668893 markings, 33522312 edges, 71526 markings/sec, 190 secs
lola: 15025889 markings, 34370681 edges, 71399 markings/sec, 195 secs
lola: 15376922 markings, 35265357 edges, 70207 markings/sec, 200 secs
lola: 15728103 markings, 36102146 edges, 70236 markings/sec, 205 secs
lola: 16091778 markings, 36929069 edges, 72735 markings/sec, 210 secs
lola: 16438338 markings, 37949773 edges, 69312 markings/sec, 215 secs
lola: 16778989 markings, 39078435 edges, 68130 markings/sec, 220 secs
lola: 17139938 markings, 39761990 edges, 72190 markings/sec, 225 secs
lola: 17477313 markings, 40729369 edges, 67475 markings/sec, 230 secs
lola: 17842028 markings, 41594036 edges, 72943 markings/sec, 235 secs
lola: 18181767 markings, 42626972 edges, 67948 markings/sec, 240 secs
lola: 18524131 markings, 43454275 edges, 68473 markings/sec, 245 secs
lola: 18868037 markings, 44371535 edges, 68781 markings/sec, 250 secs
lola: 19225039 markings, 45214580 edges, 71400 markings/sec, 255 secs
lola: 19561269 markings, 46259371 edges, 67246 markings/sec, 260 secs
lola: 19921956 markings, 47086396 edges, 72137 markings/sec, 265 secs
lola: 20273049 markings, 48051782 edges, 70219 markings/sec, 270 secs
lola: 20607332 markings, 48981589 edges, 66857 markings/sec, 275 secs
lola: 20962904 markings, 49819948 edges, 71114 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p55 + p54 + p53 + p52 + p51 + p50 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p56 + p57 + p58 + p59 + p60 + p61) U ((p194 <= p249 + p250 + p251 + p252) U (3 <= p182 + p183 + p184 + p185))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= p55 + p54 + p53 + p52 + p51 + p50 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p56 + p57 + p58 + p59 + p60 + p61) U ((p194 <= p249 + p250 + p251 + p252) U (3 <= p182 + p183 + p184 + p185))))
lola: processed formula: A (((1 <= p55 + p54 + p53 + p52 + p51 + p50 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p56 + p57 + p58 + p59 + p60 + p61) U ((p194 <= p249 + p250 + p251 + p252) U (3 <= p182 + p183 + p184 + p185))))
lola: processed formula length: 229
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 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: 209 markings, 209 edges
lola: ========================================
lola: subprocess 10 will run for 541 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((p181 <= p292 + p293 + p294 + p295)) U G ((2 <= p300)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F ((p181 <= p292 + p293 + p294 + p295)) U G ((2 <= p300)))))
lola: processed formula: A (X ((F ((p181 <= p292 + p293 + p294 + p295)) U G ((2 <= p300)))))
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 51 markings, 61 edges
lola: ========================================
lola: subprocess 11 will run for 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (X ((p196 + p197 + p198 + p199 <= p186 + p187 + p188 + p189))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G (X ((p196 + p197 + p198 + p199 <= p186 + p187 + p188 + p189))))))
lola: processed formula: A (X (F (G (X ((p196 + p197 + p198 + p199 <= p186 + p187 + p188 + p189))))))
lola: processed formula length: 76
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 1907 markings, 3193 edges
lola: ========================================
lola: subprocess 12 will run for 812 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= p86) U X ((3 <= p292 + p293 + p294 + p295)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= p86) U X ((3 <= p292 + p293 + p294 + p295)))))
lola: processed formula: A (F (((3 <= p86) U X ((3 <= p292 + p293 + p294 + p295)))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 37 markings, 37 edges
lola: ========================================
lola: subprocess 13 will run for 1083 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((p200 <= p139) U (1 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (((p200 <= p139) U (1 <= p20)))))
lola: processed formula: A (G (X (((p200 <= p139) U (1 <= p20)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 46 markings, 86 edges
lola: ========================================
lola: subprocess 14 will run for 1624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((1 <= p144) U (p186 + p187 + p188 + p189 <= p254 + p255 + p256 + p257)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (((1 <= p144) U (p186 + p187 + p188 + p189 <= p254 + p255 + p256 + p257)))))
lola: processed formula: A (X (G (((1 <= p144) U (p186 + p187 + p188 + p189 <= p254 + p255 + p256 + p257)))))
lola: processed formula length: 84
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 78 markings, 85 edges
lola: ========================================
lola: subprocess 15 will run for 3249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p249 + p250 + p251 + p252 <= p115 + p116 + p117 + p118 + p119 + p120) U X ((2 <= p33)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p249 + p250 + p251 + p252 <= p115 + p116 + p117 + p118 + p119 + p120) U X ((2 <= p33)))))
lola: processed formula: A (F (((p249 + p250 + p251 + p252 <= p115 + p116 + p117 + p118 + p119 + p120) U X ((2 <= p33)))))
lola: processed formula length: 97
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 37 markings, 37 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no yes no unknown no no no no no no no
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-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 stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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