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 220K
-rw-r--r-- 1 mcc users 3.3K 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.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K 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.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 54K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PermAdmissibility-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-csrt-152732587500125
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527830997859


BK_STOP 1527831257181

--------------------
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 PermAdmissibility-COL-02 as instance name.
Using PermAdmissibility 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': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 728600, 'Memory': 15925.49, 'Tool': 'lola'}, {'Time': 766351, 'Memory': 15930.29, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PermAdmissibility-COL-02...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PermAdmissibility-COL-02: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-02: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ PermAdmissibility-COL-02 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-02-LTLCardinality.task
lola: A (G (X (X ((3 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))))) : A (F (G (((1 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p99))))) : A ((F (F ((2 <= p191))) U G ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 <= p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121)))) : A ((p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)) : A ((G (G ((p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p97))) U G (F ((2 <= p8))))) : A (X (F ((2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))) : A (((2 <= p87) U X ((p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113)))) : A ((X (G ((1 <= p86))) U F (X ((1 <= p131))))) : A (F (G (F (X ((2 <= p130)))))) : A (F (X (((p182 <= p87) U (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p87))))) : A ((2 <= p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121)) : A (G (X (G ((3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34))))) : A ((p156 <= p173)) : A ((X (F ((p156 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42))) U (p173 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84))) : A ((p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74 <= p156)) : A (G (F (X (F ((3 <= p97))))))
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 (G (X (X ((3 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (X ((3 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))))
lola: processed formula: A (G (X (X ((3 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((1 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p99)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((1 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p99)))))
lola: processed formula: A (F (G (((1 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p99)))))
lola: processed formula length: 135
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 34 markings, 35 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((2 <= p191))) U G ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 <= p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((2 <= p191)) U G ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 <= p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121))))
lola: processed formula: A ((F ((2 <= p191)) U G ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 <= p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121))))
lola: processed formula length: 140
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)
lola: processed formula length: 104
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p97))) U G (F ((2 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p97))) U G (F ((2 <= p8)))))
lola: processed formula: A ((G (G ((p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p97))) U G (F ((2 <= p8)))))
lola: processed formula length: 88
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))))
lola: processed formula: A (X (F ((2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 1149430 markings, 1501322 edges, 229886 markings/sec, 0 secs
lola: 2249028 markings, 2942906 edges, 219920 markings/sec, 5 secs
lola: 3354665 markings, 4474085 edges, 221127 markings/sec, 10 secs
lola: 4532455 markings, 6032957 edges, 235558 markings/sec, 15 secs
lola: 5702177 markings, 7634232 edges, 233944 markings/sec, 20 secs
lola: 6895242 markings, 9253708 edges, 238613 markings/sec, 25 secs
lola: 8000031 markings, 10744412 edges, 220958 markings/sec, 30 secs
lola: 9087889 markings, 12247058 edges, 217572 markings/sec, 35 secs
lola: 10190776 markings, 13713893 edges, 220577 markings/sec, 40 secs
lola: 11242153 markings, 15113157 edges, 210275 markings/sec, 45 secs
lola: 12235163 markings, 16506525 edges, 198602 markings/sec, 50 secs
lola: 13265913 markings, 17888257 edges, 206150 markings/sec, 55 secs
lola: 14278907 markings, 19314736 edges, 202599 markings/sec, 60 secs
lola: 15275534 markings, 20667637 edges, 199325 markings/sec, 65 secs
lola: 16253038 markings, 21999064 edges, 195501 markings/sec, 70 secs
lola: 17255339 markings, 23413388 edges, 200460 markings/sec, 75 secs
lola: 18323833 markings, 24851582 edges, 213699 markings/sec, 80 secs
lola: 19303449 markings, 26168043 edges, 195923 markings/sec, 85 secs
lola: 20264036 markings, 27529193 edges, 192117 markings/sec, 90 secs
lola: 21253229 markings, 28870011 edges, 197839 markings/sec, 95 secs
lola: 22210871 markings, 30175905 edges, 191528 markings/sec, 100 secs
lola: 23157790 markings, 31534596 edges, 189384 markings/sec, 105 secs
lola: 24134957 markings, 32876866 edges, 195433 markings/sec, 110 secs
lola: 25101586 markings, 34196149 edges, 193326 markings/sec, 115 secs
lola: 26000095 markings, 35593239 edges, 179702 markings/sec, 120 secs
lola: 27062264 markings, 37024227 edges, 212434 markings/sec, 125 secs
lola: 28113506 markings, 38481762 edges, 210248 markings/sec, 130 secs
lola: 29109609 markings, 39849583 edges, 199221 markings/sec, 135 secs
lola: 30142891 markings, 41256246 edges, 206656 markings/sec, 140 secs
lola: 31087267 markings, 42587744 edges, 188875 markings/sec, 145 secs
lola: 32010187 markings, 43857333 edges, 184584 markings/sec, 150 secs
lola: 32960399 markings, 45136223 edges, 190042 markings/sec, 155 secs
lola: 33873355 markings, 46441536 edges, 182591 markings/sec, 160 secs
lola: 34875720 markings, 47841678 edges, 200473 markings/sec, 165 secs
lola: 35933898 markings, 49282780 edges, 211636 markings/sec, 170 secs
lola: 36942045 markings, 50731333 edges, 201629 markings/sec, 175 secs
lola: 37974992 markings, 52154912 edges, 206589 markings/sec, 180 secs
lola: 38991901 markings, 53586816 edges, 203382 markings/sec, 185 secs
lola: 40003488 markings, 55007282 edges, 202317 markings/sec, 190 secs
lola: 41031050 markings, 56433505 edges, 205512 markings/sec, 195 secs
lola: 42004113 markings, 57951673 edges, 194613 markings/sec, 200 secs
lola: 43034831 markings, 59378526 edges, 206144 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p87) U X ((p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p87) U X ((p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113))))
lola: processed formula: A (((2 <= p87) U X ((p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113))))
lola: processed formula length: 135
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 9 markings, 8 edges
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((1 <= p86))) U F (X ((1 <= p131)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((1 <= p86))) U F (X ((1 <= p131)))))
lola: processed formula: A ((X (G ((1 <= p86))) U F (X ((1 <= p131)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: ========================================
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: 27041 markings, 37280 edges
lola: ========================================
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F (X ((2 <= p130))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X ((2 <= p130)))))
lola: processed formula: A (G (F (X ((2 <= p130)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 42 markings, 42 edges
lola: ========================================
lola: subprocess 9 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((p182 <= p87) U (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p87)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((p182 <= p87) U (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p87)))))
lola: processed formula: A (F (X (((p182 <= p87) U (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p87)))))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121)
lola: processed formula length: 60
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 11 will run for 665 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G ((3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G ((3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34)))))
lola: processed formula: A (G (X (G ((3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34)))))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 12 will run for 831 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p156 <= p173))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p156 <= p173)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1108 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((p156 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42))) U (p173 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (F ((p156 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42))) U (p173 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84)))
lola: processed formula: A ((X (F ((p156 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42))) U (p173 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84)))
lola: processed formula length: 127
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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 14 will run for 1662 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74 <= p156))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74 <= p156)
lola: processed formula length: 55
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 15 will run for 3324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X (F ((3 <= p97))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X (F ((3 <= p97))))))
lola: processed formula: A (G (F (X (F ((3 <= p97))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 33 markings, 33 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no unknown yes yes no yes no no yes yes no no
FORMULA PermAdmissibility-COL-02-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="PermAdmissibility-COL-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-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/PermAdmissibility-COL-02.tgz
mv PermAdmissibility-COL-02 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-structural"
echo " Input is PermAdmissibility-COL-02, 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 r263-csrt-152732587500125"
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 ;