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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 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-full
Input is PermAdmissibility-COL-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478500437
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527294861611


BK_STOP 1527296162580

--------------------
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 PermAdmissibility-COL-02 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 1581329, 'Memory': 15944.15, 'Tool': 'lola'}, {'Time': 1758215, 'Memory': 15952.46, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PermAdmissibility-COL-02...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PermAdmissibility-COL-02 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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-CTLCardinality.task
lola: E (X ((((p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) OR (p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152) OR ((p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99 <= p119) AND (2 <= p119))) AND A (F ((2 <= p33)))))) : E (G (((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= 0) OR (p207 <= 0) OR (3 <= p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160)))) : (E (G (((p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59) OR (p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 <= 1)))) AND E (X ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))) : A (F (((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p188) AND (3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) AND (p128 + 1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) AND (3 <= p84) AND (3 <= p207) AND (p33 <= 1)))) : (NOT((E (F ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152))) AND A (X ((2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))))) OR (A (G (((2 <= p110) AND (p188 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196)))) OR E (G (((3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) OR (3 <= p89 + p88 + p87 + p86 + p85 + p90 + p91 + p92)))))) : E (G (E (F (((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) AND (p169 <= p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)))))) : E (G (NOT(A (G ((3 <= p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160)))))) : NOT(A (F (A (G ((p42 <= p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)))))) : E (F (((1 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41) AND E (X ((3 <= p51)))))) : A (G ((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 <= 2))) : NOT(A (G (E (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))) : A ((E (F ((p110 <= p33))) U (p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41))) : A (X (E (((p110 <= p89 + p88 + p87 + p86 + p85 + p90 + p91 + p92) U (3 <= p188))))) : E (G (E (((3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) U (1 <= p33))))) : (A (G (((p51 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR (p128 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) OR (p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= 1)))) OR E (G (((p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= p206) OR (3 <= p93) OR (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= 2))))) : ((3 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168) OR E (G ((p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((((p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) OR (p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152) OR ((p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99 <= p119) AND (2 <= p119))) AND A (F ((2 <= p33))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((((p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) OR (p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152) OR ((p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99 <= p119) AND (2 <= p119))) AND A(TRUE U (2 <= p33))))
lola: processed formula length: 342
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 128 markings, 127 edges
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= 0) OR (p207 <= 0) OR (3 <= p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41) AND (1 <= p207) AND (p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 <= 2))))
lola: processed formula length: 150
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 69 markings, 68 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59) OR (p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 <= 1)))) AND E (X ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59) OR (p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + 1 <= p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) AND (2 <= p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160))))
lola: processed formula length: 182
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33 markings, 32 edges
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))
lola: processed formula length: 92
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p188) AND (3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) AND (p128 + 1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) AND (3 <= p84) AND (3 <= p207) AND (p33 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p188) AND (3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) AND (p128 + 1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) AND (3 <= p84) AND (3 <= p207) AND (p33 <= 1))))
lola: processed formula: A (F (((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p188) AND (3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) AND (p128 + 1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) AND (3 <= p84) AND (3 <= p207) AND (p33 <= 1))))
lola: processed formula length: 240
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 33 markings, 33 edges
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (F ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152))) AND A (X ((2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))))) OR (A (G (((2 <= p110) AND (p188 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196)))) OR E (G (((3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) OR (3 <= p89 + p88 + p87 + p86 + p85 + p90... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + 1 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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: ========================================
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: EX((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= 1))
lola: processed formula length: 54
lola: 9 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p110) AND (p188 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-CTLCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) OR (3 <= p89 + p88 + p87 + p86 + p85 + p90 + p91 + p92))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= 2) AND (p89 + p88 + p87 + p86 + p85 + p90 + p91 + p92 <= 2))))
lola: processed formula length: 134
lola: 10 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 956 markings, 1276 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) AND (p169 <= p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) AND (p169 <= p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))))))
lola: processed formula length: 204
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33 markings, 82 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (G ((3 <= p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 <= 2)))))
lola: processed formula length: 90
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33 markings, 65 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G ((p42 <= p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + 1 <= p42)))))
lola: processed formula length: 88
lola: 7 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 857325 markings, 2426390 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1563149 markings, 5032365 edges, 141165 markings/sec, 5 secs
lola: 2350244 markings, 7622040 edges, 157419 markings/sec, 10 secs
lola: 3177397 markings, 9873416 edges, 165431 markings/sec, 15 secs
lola: 3947141 markings, 12305810 edges, 153949 markings/sec, 20 secs
lola: 4726214 markings, 14628373 edges, 155815 markings/sec, 25 secs
lola: 5540976 markings, 16787008 edges, 162952 markings/sec, 30 secs
lola: 6246151 markings, 19200461 edges, 141035 markings/sec, 35 secs
lola: 6943168 markings, 21637429 edges, 139403 markings/sec, 40 secs
lola: 7699715 markings, 23758412 edges, 151309 markings/sec, 45 secs
lola: 8465006 markings, 25845579 edges, 153058 markings/sec, 50 secs
lola: 9191648 markings, 28213380 edges, 145328 markings/sec, 55 secs
lola: 9877990 markings, 30464771 edges, 137268 markings/sec, 60 secs
lola: 10568393 markings, 32454301 edges, 138081 markings/sec, 65 secs
lola: 11311196 markings, 34585814 edges, 148561 markings/sec, 70 secs
lola: 11939779 markings, 36893273 edges, 125717 markings/sec, 75 secs
lola: 12665168 markings, 38978010 edges, 145078 markings/sec, 80 secs
lola: 13314944 markings, 40954281 edges, 129955 markings/sec, 85 secs
lola: 14039403 markings, 43341919 edges, 144892 markings/sec, 90 secs
lola: 14756372 markings, 45627717 edges, 143394 markings/sec, 95 secs
lola: 15467449 markings, 47915806 edges, 142215 markings/sec, 100 secs
lola: 16198270 markings, 50139013 edges, 146164 markings/sec, 105 secs
lola: 16903144 markings, 52338817 edges, 140975 markings/sec, 110 secs
lola: 17512344 markings, 54502866 edges, 121840 markings/sec, 115 secs
lola: 18307820 markings, 56885209 edges, 159095 markings/sec, 120 secs
lola: 19072016 markings, 59093752 edges, 152839 markings/sec, 125 secs
lola: 19828959 markings, 61334624 edges, 151389 markings/sec, 130 secs
lola: 20581083 markings, 63689531 edges, 150425 markings/sec, 135 secs
lola: 21327140 markings, 65988961 edges, 149211 markings/sec, 140 secs
lola: 22059526 markings, 68223213 edges, 146477 markings/sec, 145 secs
lola: 22786033 markings, 70451974 edges, 145301 markings/sec, 150 secs
lola: 23509812 markings, 72758743 edges, 144756 markings/sec, 155 secs
lola: 24238741 markings, 74916270 edges, 145786 markings/sec, 160 secs
lola: 24917013 markings, 77050450 edges, 135654 markings/sec, 165 secs
lola: 25630095 markings, 79307422 edges, 142616 markings/sec, 170 secs
lola: 26282686 markings, 81264276 edges, 130518 markings/sec, 175 secs
lola: 27061212 markings, 83783539 edges, 155705 markings/sec, 180 secs
lola: 27791296 markings, 85912945 edges, 146017 markings/sec, 185 secs
lola: 28460113 markings, 88115283 edges, 133763 markings/sec, 190 secs
lola: 29146907 markings, 90134354 edges, 137359 markings/sec, 195 secs
lola: 29848559 markings, 92434684 edges, 140330 markings/sec, 200 secs
lola: 30542927 markings, 94525605 edges, 138874 markings/sec, 205 secs
lola: 31209031 markings, 96567740 edges, 133221 markings/sec, 210 secs
lola: 31892327 markings, 98711430 edges, 136659 markings/sec, 215 secs
lola: 32532960 markings, 100826977 edges, 128127 markings/sec, 220 secs
lola: 33261645 markings, 103053263 edges, 145737 markings/sec, 225 secs
lola: 33968490 markings, 105253936 edges, 141369 markings/sec, 230 secs
lola: 34676611 markings, 107418855 edges, 141624 markings/sec, 235 secs
lola: 35319400 markings, 109418704 edges, 128558 markings/sec, 240 secs
lola: 36132137 markings, 111314481 edges, 162547 markings/sec, 245 secs
lola: 36908987 markings, 113663142 edges, 155370 markings/sec, 250 secs
lola: 37567958 markings, 116132577 edges, 131794 markings/sec, 255 secs
lola: 38293122 markings, 118464852 edges, 145033 markings/sec, 260 secs
lola: 39029306 markings, 120421186 edges, 147237 markings/sec, 265 secs
lola: 39701691 markings, 122536854 edges, 134477 markings/sec, 270 secs
lola: 40374880 markings, 124687180 edges, 134638 markings/sec, 275 secs
lola: 41123247 markings, 126545677 edges, 149673 markings/sec, 280 secs
lola: 41830096 markings, 128729979 edges, 141370 markings/sec, 285 secs
lola: 42430882 markings, 130984180 edges, 120157 markings/sec, 290 secs
lola: 43109232 markings, 133030976 edges, 135670 markings/sec, 295 secs
lola: 43773368 markings, 135016419 edges, 132827 markings/sec, 300 secs
lola: 44495519 markings, 136899900 edges, 144430 markings/sec, 305 secs
lola: 45154838 markings, 139169861 edges, 131864 markings/sec, 310 secs
lola: 45811882 markings, 141240446 edges, 131409 markings/sec, 315 secs
lola: 46454753 markings, 143095473 edges, 128574 markings/sec, 320 secs
lola: 47162680 markings, 145109996 edges, 141585 markings/sec, 325 secs
lola: 47744498 markings, 147286091 edges, 116364 markings/sec, 330 secs
lola: 48421969 markings, 149227613 edges, 135494 markings/sec, 335 secs
lola: 49056394 markings, 151173574 edges, 126885 markings/sec, 340 secs
lola: 49692045 markings, 153233490 edges, 127130 markings/sec, 345 secs
lola: 50346076 markings, 155185715 edges, 130806 markings/sec, 350 secs
lola: 50958837 markings, 157254356 edges, 122552 markings/sec, 355 secs
lola: 51609313 markings, 159380987 edges, 130095 markings/sec, 360 secs
lola: 52265650 markings, 161387841 edges, 131267 markings/sec, 365 secs
lola: 52868343 markings, 163258864 edges, 120539 markings/sec, 370 secs
lola: 53460072 markings, 164993555 edges, 118346 markings/sec, 375 secs
lola: 54141629 markings, 167268640 edges, 136311 markings/sec, 380 secs
lola: 54882713 markings, 169372391 edges, 148217 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41) AND E (X ((3 <= p51))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((1 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41) AND EX((3 <= p51))))
lola: processed formula length: 83
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 880277 markings, 2496751 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1575278 markings, 5084889 edges, 139000 markings/sec, 5 secs
lola: 2337933 markings, 7581648 edges, 152531 markings/sec, 10 secs
lola: 3031880 markings, 9489787 edges, 138789 markings/sec, 15 secs
lola: 3752222 markings, 11676855 edges, 144068 markings/sec, 20 secs
lola: 4486560 markings, 14042540 edges, 146868 markings/sec, 25 secs
lola: 5189099 markings, 15782800 edges, 140508 markings/sec, 30 secs
lola: 5981013 markings, 18227869 edges, 158383 markings/sec, 35 secs
lola: 6660687 markings, 20725358 edges, 135935 markings/sec, 40 secs
lola: 7326282 markings, 22622231 edges, 133119 markings/sec, 45 secs
lola: 8008234 markings, 24698642 edges, 136390 markings/sec, 50 secs
lola: 8742322 markings, 26626810 edges, 146818 markings/sec, 55 secs
lola: 9408516 markings, 29039141 edges, 133239 markings/sec, 60 secs
lola: 10081785 markings, 31129438 edges, 134654 markings/sec, 65 secs
lola: 10684109 markings, 32754438 edges, 120465 markings/sec, 70 secs
lola: 11448269 markings, 35084417 edges, 152832 markings/sec, 75 secs
lola: 12060144 markings, 37167321 edges, 122375 markings/sec, 80 secs
lola: 12749400 markings, 39229532 edges, 137851 markings/sec, 85 secs
lola: 13268606 markings, 40832100 edges, 103841 markings/sec, 90 secs
lola: 13911441 markings, 42928190 edges, 128567 markings/sec, 95 secs
lola: 14533152 markings, 44781126 edges, 124342 markings/sec, 100 secs
lola: 15080802 markings, 46629781 edges, 109530 markings/sec, 105 secs
lola: 15758795 markings, 48850299 edges, 135599 markings/sec, 110 secs
lola: 16379493 markings, 50730995 edges, 124140 markings/sec, 115 secs
lola: 16949138 markings, 52459805 edges, 113929 markings/sec, 120 secs
lola: 17402825 markings, 54166108 edges, 90737 markings/sec, 125 secs
lola: 18147471 markings, 56414750 edges, 148929 markings/sec, 130 secs
lola: 18770451 markings, 58292864 edges, 124596 markings/sec, 135 secs
lola: 19454466 markings, 60232740 edges, 136803 markings/sec, 140 secs
lola: 20099375 markings, 62076198 edges, 128982 markings/sec, 145 secs
lola: 20806574 markings, 64421693 edges, 141440 markings/sec, 150 secs
lola: 21481584 markings, 66354310 edges, 135002 markings/sec, 155 secs
lola: 22137125 markings, 68491093 edges, 131108 markings/sec, 160 secs
lola: 22769115 markings, 70398432 edges, 126398 markings/sec, 165 secs
lola: 23401599 markings, 72427282 edges, 126497 markings/sec, 170 secs
lola: 24055870 markings, 74307310 edges, 130854 markings/sec, 175 secs
lola: 24694467 markings, 76313422 edges, 127719 markings/sec, 180 secs
lola: 25300874 markings, 78323375 edges, 121281 markings/sec, 185 secs
lola: 25897154 markings, 80121570 edges, 119256 markings/sec, 190 secs
lola: 26410959 markings, 81716934 edges, 102761 markings/sec, 195 secs
lola: 27118417 markings, 83964945 edges, 141492 markings/sec, 200 secs
lola: 27782940 markings, 85884674 edges, 132905 markings/sec, 205 secs
lola: 28451304 markings, 88078256 edges, 133673 markings/sec, 210 secs
lola: 29081792 markings, 89927846 edges, 126098 markings/sec, 215 secs
lola: 29756334 markings, 92149812 edges, 134908 markings/sec, 220 secs
lola: 30392389 markings, 94032837 edges, 127211 markings/sec, 225 secs
lola: 31022623 markings, 95986878 edges, 126047 markings/sec, 230 secs
lola: 31620373 markings, 97827855 edges, 119550 markings/sec, 235 secs
lola: 32171654 markings, 99613141 edges, 110256 markings/sec, 240 secs
lola: 32802797 markings, 101684046 edges, 126229 markings/sec, 245 secs
lola: 33450746 markings, 103604239 edges, 129590 markings/sec, 250 secs
lola: 34112503 markings, 105730484 edges, 132351 markings/sec, 255 secs
lola: 34720990 markings, 107533950 edges, 121697 markings/sec, 260 secs
lola: 35289677 markings, 109315212 edges, 113737 markings/sec, 265 secs
lola: 35819408 markings, 110452621 edges, 105946 markings/sec, 270 secs
lola: 36587677 markings, 112607032 edges, 153654 markings/sec, 275 secs
lola: 37244884 markings, 114904719 edges, 131441 markings/sec, 280 secs
lola: 37915156 markings, 117246675 edges, 134054 markings/sec, 285 secs
lola: 38627872 markings, 119437007 edges, 142543 markings/sec, 290 secs
lola: 39307147 markings, 121285073 edges, 135855 markings/sec, 295 secs
lola: 39977901 markings, 123437009 edges, 134151 markings/sec, 300 secs
lola: 40620662 markings, 125284197 edges, 128552 markings/sec, 305 secs
lola: 41327852 markings, 127144794 edges, 141438 markings/sec, 310 secs
lola: 42010441 markings, 129391957 edges, 136518 markings/sec, 315 secs
lola: 42626971 markings, 131659251 edges, 123306 markings/sec, 320 secs
lola: 43223651 markings, 133286953 edges, 119336 markings/sec, 325 secs
lola: 43853009 markings, 135245608 edges, 125872 markings/sec, 330 secs
lola: 44509559 markings, 136940526 edges, 131310 markings/sec, 335 secs
lola: 45155629 markings, 139170232 edges, 129214 markings/sec, 340 secs
lola: 45784306 markings, 141165114 edges, 125735 markings/sec, 345 secs
lola: 46347937 markings, 142854141 edges, 112726 markings/sec, 350 secs
lola: 47026054 markings, 144668219 edges, 135623 markings/sec, 355 secs
lola: 47613722 markings, 146790621 edges, 117534 markings/sec, 360 secs
lola: 48136670 markings, 148272727 edges, 104590 markings/sec, 365 secs
lola: 48780456 markings, 150255528 edges, 128757 markings/sec, 370 secs
lola: 49287207 markings, 151851649 edges, 101350 markings/sec, 375 secs
lola: 49891923 markings, 153882636 edges, 120943 markings/sec, 380 secs
lola: 50461165 markings, 155589641 edges, 113848 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-02-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))
lola: processed formula length: 69
lola: 8 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 857170 markings, 2425661 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1559021 markings, 5019493 edges, 140370 markings/sec, 5 secs
lola: 2315055 markings, 7518897 edges, 151207 markings/sec, 10 secs
lola: 3096095 markings, 9651112 edges, 156208 markings/sec, 15 secs
lola: 3863350 markings, 12039724 edges, 153451 markings/sec, 20 secs
lola: 4619793 markings, 14403221 edges, 151289 markings/sec, 25 secs
lola: 5462454 markings, 16549449 edges, 168532 markings/sec, 30 secs
lola: 6219738 markings, 19110663 edges, 151457 markings/sec, 35 secs
lola: 6951146 markings, 21665747 edges, 146282 markings/sec, 40 secs
lola: 7707210 markings, 23784078 edges, 151213 markings/sec, 45 secs
lola: 8489176 markings, 25911800 edges, 156393 markings/sec, 50 secs
lola: 9227091 markings, 28352924 edges, 147583 markings/sec, 55 secs
lola: 9923454 markings, 30592985 edges, 139273 markings/sec, 60 secs
lola: 10605006 markings, 32532962 edges, 136310 markings/sec, 65 secs
lola: 11340102 markings, 34690085 edges, 147019 markings/sec, 70 secs
lola: 11970062 markings, 36968628 edges, 125992 markings/sec, 75 secs
lola: 12690928 markings, 39048452 edges, 144173 markings/sec, 80 secs
lola: 13334563 markings, 41014583 edges, 128727 markings/sec, 85 secs
lola: 14041433 markings, 43349388 edges, 141374 markings/sec, 90 secs
lola: 14739666 markings, 45564692 edges, 139647 markings/sec, 95 secs
lola: 15426703 markings, 47766530 edges, 137407 markings/sec, 100 secs
lola: 16132506 markings, 49899824 edges, 141161 markings/sec, 105 secs
lola: 16816907 markings, 52067440 edges, 136880 markings/sec, 110 secs
lola: 17370404 markings, 54035245 edges, 110699 markings/sec, 115 secs
lola: 18116668 markings, 56321565 edges, 149253 markings/sec, 120 secs
lola: 18836894 markings, 58425749 edges, 144045 markings/sec, 125 secs
lola: 19607228 markings, 60660973 edges, 154067 markings/sec, 130 secs
lola: 20310817 markings, 62748642 edges, 140718 markings/sec, 135 secs
lola: 20986216 markings, 64981466 edges, 135080 markings/sec, 140 secs
lola: 21706015 markings, 67013329 edges, 143960 markings/sec, 145 secs
lola: 22375494 markings, 69152188 edges, 133896 markings/sec, 150 secs
lola: 23044961 markings, 71192982 edges, 133893 markings/sec, 155 secs
lola: 23733543 markings, 73495865 edges, 137716 markings/sec, 160 secs
lola: 24451664 markings, 75654234 edges, 143624 markings/sec, 165 secs
lola: 25154027 markings, 77836512 edges, 140473 markings/sec, 170 secs
lola: 25855707 markings, 79994039 edges, 140336 markings/sec, 175 secs
lola: 26535759 markings, 82106054 edges, 136010 markings/sec, 180 secs
lola: 27286761 markings, 84532161 edges, 150200 markings/sec, 185 secs
lola: 28009534 markings, 86643808 edges, 144555 markings/sec, 190 secs
lola: 28701632 markings, 88755752 edges, 138420 markings/sec, 195 secs
lola: 29382370 markings, 90925425 edges, 136148 markings/sec, 200 secs
lola: 30073009 markings, 93016360 edges, 138128 markings/sec, 205 secs
lola: 30754290 markings, 95112113 edges, 136256 markings/sec, 210 secs
lola: 31417940 markings, 97260063 edges, 132730 markings/sec, 215 secs
lola: 32076582 markings, 99283990 edges, 131728 markings/sec, 220 secs
lola: 32684339 markings, 101291752 edges, 121551 markings/sec, 225 secs
lola: 33386548 markings, 103463671 edges, 140442 markings/sec, 230 secs
lola: 34065690 markings, 105553228 edges, 135828 markings/sec, 235 secs
lola: 34722821 markings, 107540316 edges, 131426 markings/sec, 240 secs
lola: 35338093 markings, 109473055 edges, 123054 markings/sec, 245 secs
lola: 36113334 markings, 111262187 edges, 155048 markings/sec, 250 secs
lola: 36874672 markings, 113533064 edges, 152268 markings/sec, 255 secs
lola: 37532030 markings, 115996716 edges, 131472 markings/sec, 260 secs
lola: 38273503 markings, 118385419 edges, 148295 markings/sec, 265 secs
lola: 39014295 markings, 120379910 edges, 148158 markings/sec, 270 secs
lola: 39692428 markings, 122508228 edges, 135627 markings/sec, 275 secs
lola: 40361625 markings, 124659794 edges, 133839 markings/sec, 280 secs
lola: 41103080 markings, 126499470 edges, 148291 markings/sec, 285 secs
lola: 41810538 markings, 128658745 edges, 141492 markings/sec, 290 secs
lola: 42405336 markings, 130886141 edges, 118960 markings/sec, 295 secs
lola: 43071399 markings, 132948163 edges, 133213 markings/sec, 300 secs
lola: 43768603 markings, 134999508 edges, 139441 markings/sec, 305 secs
lola: 44502599 markings, 136920745 edges, 146799 markings/sec, 310 secs
lola: 45175534 markings, 139237397 edges, 134587 markings/sec, 315 secs
lola: 45833909 markings, 141310505 edges, 131675 markings/sec, 320 secs
lola: 46482382 markings, 143154948 edges, 129695 markings/sec, 325 secs
lola: 47201415 markings, 145250984 edges, 143807 markings/sec, 330 secs
lola: 47790458 markings, 147448803 edges, 117809 markings/sec, 335 secs
lola: 48460131 markings, 149346578 edges, 133935 markings/sec, 340 secs
lola: 49069233 markings, 151223402 edges, 121820 markings/sec, 345 secs
lola: 49712656 markings, 153299597 edges, 128685 markings/sec, 350 secs
lola: 50356208 markings, 155218209 edges, 128710 markings/sec, 355 secs
lola: 50949541 markings, 157209617 edges, 118667 markings/sec, 360 secs
lola: 51615256 markings, 159399335 edges, 133143 markings/sec, 365 secs
lola: 52283090 markings, 161437902 edges, 133567 markings/sec, 370 secs
lola: 52894537 markings, 163371605 edges, 122289 markings/sec, 375 secs
lola: 53534757 markings, 165234990 edges, 128044 markings/sec, 380 secs
lola: 54254275 markings, 167559853 edges, 143904 markings/sec, 385 secs
lola: 54989820 markings, 169736032 edges, 147109 markings/sec, 390 secs
lola: 55686521 markings, 171946518 edges, 139340 markings/sec, 395 secs
lola: 56385773 markings, 174053084 edges, 139850 markings/sec, 400 secs
lola: 57060389 markings, 176283529 edges, 134923 markings/sec, 405 secs
lola: 57724874 markings, 178277717 edges, 132897 markings/sec, 410 secs
lola: 58355349 markings, 180192850 edges, 126095 markings/sec, 415 secs
lola: 58994995 markings, 182214613 edges, 127929 markings/sec, 420 secs
lola: 59605973 markings, 184005276 edges, 122196 markings/sec, 425 secs
lola: 60371408 markings, 185997531 edges, 153087 markings/sec, 430 secs
lola: 61069393 markings, 188286925 edges, 139597 markings/sec, 435 secs
lola: 61735152 markings, 190649647 edges, 133152 markings/sec, 440 secs
lola: 62437777 markings, 192894292 edges, 140525 markings/sec, 445 secs
lola: 63176702 markings, 194820842 edges, 147785 markings/sec, 450 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((p110 <= p33))) U (p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (p110 <= p33)) U (p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41))
lola: processed formula length: 133
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9067 markings, 16294 edges
lola: ========================================
lola: subprocess 12 will run for 573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (((p110 <= p89 + p88 + p87 + p86 + p85 + p90 + p91 + p92) U (3 <= p188)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E((p110 <= p89 + p88 + p87 + p86 + p85 + p90 + p91 + p92) U (3 <= p188)))
lola: processed formula length: 76
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1319590 markings, 1785608 edges, 3689329903141912576 markings/sec, 0 secs
lola: 2502407 markings, 3429994 edges, 236563 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2644638 markings, 3646667 edges
lola: ========================================
lola: subprocess 13 will run for 761 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (((3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) U (1 <= p33)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) U (1 <= p33)))))
lola: processed formula length: 96
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 956 markings, 1277 edges
lola: ========================================
lola: subprocess 14 will run for 1141 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p51 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR (p128 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) OR (p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= 1)))) OR E (G (((p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= p206) OR (3 <= p93) OR (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1141 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p51 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR (p128 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) OR (p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168) OR E (G ((p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168)
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes yes unknown unknown yes unknown yes no no yes unknown
lola: ========================================
FORMULA PermAdmissibility-COL-02-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-15 CANNOT_COMPUTE 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="CTLCardinality"
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/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-full"
echo " Input is PermAdmissibility-COL-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-csrt-152666478500437"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;