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 irma4mcc-structural
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 r115-csrt-152666474000437
=====================================================================

--------------------
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 1527153300781


BK_STOP 1527154573008

--------------------
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': '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': 'itstools'}].
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 ((((p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) OR (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134) OR ((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p100) AND (2 <= p100))) AND A (F ((2 <= p144)))))) : E (G (((p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 <= 0) OR (p88 <= 0) OR (3 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31)))) : (E (G (((p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155) OR (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= 1)))) AND E (X ((p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63)))) : A (F (((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 <= p147) AND (3 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87) AND (p118 + 1 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163) AND (3 <= p98) AND (3 <= p88) AND (p144 <= 1)))) : (NOT((E (F ((p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134))) AND A (X ((2 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126))))) OR (A (G (((2 <= p207) AND (p147 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143)))) OR E (G (((3 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87) OR (3 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71)))))) : E (G (E (F (((p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (p135 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55)))))) : E (G (NOT(A (G ((3 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31)))))) : NOT(A (F (A (G ((p99 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55)))))) : E (F (((1 <= p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96) AND E (X ((3 <= p174)))))) : A (G ((p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 <= 2))) : NOT(A (G (E (F ((3 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63)))))) : A ((E (F ((p207 <= p144))) U (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 <= p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96))) : A (X (E (((p207 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71) U (3 <= p147))))) : E (G (E (((3 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87) U (1 <= p144))))) : (A (G (((p174 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126) OR (p118 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163) OR (p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= 1)))) OR E (G (((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p109) OR (3 <= p97) OR (p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 <= 2))))) : ((3 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) OR E (G ((p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163))))
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 ((((p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) OR (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134) OR ((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p100) AND (2 <= p100))) AND A (F ((2 <= p144))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((((p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) OR (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134) OR ((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p100) AND (2 <= p100))) AND A(TRUE U (2 <= p144))))
lola: processed formula length: 341
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: 51 markings, 53 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 <= 0) OR (p88 <= 0) OR (3 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96) AND (1 <= p88) AND (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= 2))))
lola: processed formula length: 141
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: 77 markings, 76 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155) OR (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= 1)))) AND E (X ((p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63))))
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 (((p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155) OR (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + 1 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55) AND (2 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31))))
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: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63))
lola: processed formula length: 100
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 (((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 <= p147) AND (3 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87) AND (p118 + 1 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163) AND (3 <= p98) AND (3 <= p88) AND (p144 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 <= p147) AND (3 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87) AND (p118 + 1 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163) AND (3 <= p98) AND (3 <= p88) AND (p144 <= 1))))
lola: processed formula: A (F (((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 <= p147) AND (3 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87) AND (p118 + 1 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163) AND (3 <= p98) AND (3 <= p88) AND (p144 <= 1))))
lola: processed formula length: 248
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: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (F ((p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134))) AND A (X ((2 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126))))) OR (A (G (((2 <= p207) AND (p147 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143)))) OR E (G (((3 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87) OR (3 <= p70 + p69 + p64 + p65 + p66 + p67 + p68... (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 ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + 1 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87)))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 <= 1))
lola: processed formula length: 64
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 <= p207) AND (p147 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143))))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to PermAdmissibility-COL-02-CTLCardinality-6.sara
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87) OR (3 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= 2) AND (p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= 2))))
lola: processed formula length: 126
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 (((p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (p135 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (p135 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55))))))
lola: processed formula length: 196
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, 76 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (G ((3 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= 2)))))
lola: processed formula length: 82
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 ((p99 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + 1 <= p99)))))
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: 954625 markings, 2752425 edges, 3689330178019819520 markings/sec, 0 secs
lola: 1833083 markings, 5368953 edges, 175692 markings/sec, 5 secs
lola: 2767504 markings, 7758419 edges, 186884 markings/sec, 10 secs
lola: 3636892 markings, 10106761 edges, 173878 markings/sec, 15 secs
lola: 4476167 markings, 12546500 edges, 167855 markings/sec, 20 secs
lola: 5285036 markings, 14710028 edges, 161774 markings/sec, 25 secs
lola: 6109895 markings, 16886395 edges, 164972 markings/sec, 30 secs
lola: 6891696 markings, 19340678 edges, 156360 markings/sec, 35 secs
lola: 7706516 markings, 21525724 edges, 162964 markings/sec, 40 secs
lola: 8522980 markings, 23679641 edges, 163293 markings/sec, 45 secs
lola: 9291545 markings, 25766707 edges, 153713 markings/sec, 50 secs
lola: 10111712 markings, 28109824 edges, 164033 markings/sec, 55 secs
lola: 10897803 markings, 30395955 edges, 157218 markings/sec, 60 secs
lola: 11678125 markings, 32769405 edges, 156064 markings/sec, 65 secs
lola: 12438049 markings, 35125458 edges, 151985 markings/sec, 70 secs
lola: 13198744 markings, 37419218 edges, 152139 markings/sec, 75 secs
lola: 13964902 markings, 39692808 edges, 153232 markings/sec, 80 secs
lola: 14781171 markings, 41998998 edges, 163254 markings/sec, 85 secs
lola: 15601592 markings, 44211473 edges, 164084 markings/sec, 90 secs
lola: 16419789 markings, 46491827 edges, 163639 markings/sec, 95 secs
lola: 17226730 markings, 48673957 edges, 161388 markings/sec, 100 secs
lola: 17974476 markings, 50732793 edges, 149549 markings/sec, 105 secs
lola: 18716254 markings, 52936324 edges, 148356 markings/sec, 110 secs
lola: 19495204 markings, 55030745 edges, 155790 markings/sec, 115 secs
lola: 20313116 markings, 57341452 edges, 163582 markings/sec, 120 secs
lola: 21156077 markings, 59681499 edges, 168592 markings/sec, 125 secs
lola: 21943094 markings, 61885538 edges, 157403 markings/sec, 130 secs
lola: 22705040 markings, 63947183 edges, 152389 markings/sec, 135 secs
lola: 23451268 markings, 66032158 edges, 149246 markings/sec, 140 secs
lola: 24242823 markings, 68228273 edges, 158311 markings/sec, 145 secs
lola: 25051990 markings, 70488443 edges, 161833 markings/sec, 150 secs
lola: 25823118 markings, 72572119 edges, 154226 markings/sec, 155 secs
lola: 26555625 markings, 74623493 edges, 146501 markings/sec, 160 secs
lola: 27295468 markings, 76669311 edges, 147969 markings/sec, 165 secs
lola: 28069633 markings, 78853635 edges, 154833 markings/sec, 170 secs
lola: 28834991 markings, 80885417 edges, 153072 markings/sec, 175 secs
lola: 29558425 markings, 82927725 edges, 144687 markings/sec, 180 secs
lola: 30304209 markings, 85009431 edges, 149157 markings/sec, 185 secs
lola: 31025055 markings, 87024989 edges, 144169 markings/sec, 190 secs
lola: 31730589 markings, 89004834 edges, 141107 markings/sec, 195 secs
lola: 32611890 markings, 91297505 edges, 176260 markings/sec, 200 secs
lola: 33404437 markings, 93851274 edges, 158509 markings/sec, 205 secs
lola: 34134435 markings, 96335921 edges, 146000 markings/sec, 210 secs
lola: 34880208 markings, 98617017 edges, 149155 markings/sec, 215 secs
lola: 35650483 markings, 100725048 edges, 154055 markings/sec, 220 secs
lola: 36431621 markings, 102771179 edges, 156228 markings/sec, 225 secs
lola: 37239504 markings, 105045419 edges, 161577 markings/sec, 230 secs
lola: 38045309 markings, 107308100 edges, 161161 markings/sec, 235 secs
lola: 38878759 markings, 109753791 edges, 166690 markings/sec, 240 secs
lola: 39584833 markings, 111940215 edges, 141215 markings/sec, 245 secs
lola: 40337105 markings, 114113312 edges, 150454 markings/sec, 250 secs
lola: 41067665 markings, 116075693 edges, 146112 markings/sec, 255 secs
lola: 41858862 markings, 118257423 edges, 158239 markings/sec, 260 secs
lola: 42654405 markings, 120646216 edges, 159109 markings/sec, 265 secs
lola: 43331624 markings, 123080262 edges, 135444 markings/sec, 270 secs
lola: 44082122 markings, 125327496 edges, 150100 markings/sec, 275 secs
lola: 44804356 markings, 127305275 edges, 144447 markings/sec, 280 secs
lola: 45579994 markings, 129209467 edges, 155128 markings/sec, 285 secs
lola: 46302311 markings, 131439791 edges, 144463 markings/sec, 290 secs
lola: 46983209 markings, 133457128 edges, 136180 markings/sec, 295 secs
lola: 47723226 markings, 135424703 edges, 148003 markings/sec, 300 secs
lola: 48406368 markings, 137562197 edges, 136628 markings/sec, 305 secs
lola: 49090825 markings, 139471404 edges, 136891 markings/sec, 310 secs
lola: 49791248 markings, 141676156 edges, 140085 markings/sec, 315 secs
lola: 50420560 markings, 143674317 edges, 125862 markings/sec, 320 secs
lola: 51172544 markings, 145947056 edges, 150397 markings/sec, 325 secs
lola: 51857776 markings, 148206899 edges, 137046 markings/sec, 330 secs
lola: 52589025 markings, 150360534 edges, 146250 markings/sec, 335 secs
lola: 53327175 markings, 152689653 edges, 147630 markings/sec, 340 secs
lola: 54010393 markings, 154962376 edges, 136644 markings/sec, 345 secs
lola: 54724761 markings, 157125972 edges, 142874 markings/sec, 350 secs
lola: 55400680 markings, 159102350 edges, 135184 markings/sec, 355 secs
lola: 56154366 markings, 161178943 edges, 150737 markings/sec, 360 secs
lola: 56887155 markings, 163332419 edges, 146558 markings/sec, 365 secs
lola: 57616517 markings, 165475946 edges, 145872 markings/sec, 370 secs
lola: 58333696 markings, 167597399 edges, 143436 markings/sec, 375 secs
lola: 59055172 markings, 169491819 edges, 144295 markings/sec, 380 secs
lola: 59755325 markings, 171488582 edges, 140031 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 <= p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96) AND E (X ((3 <= p174))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((1 <= p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96) AND EX((3 <= p174))))
lola: processed formula length: 84
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: 949508 markings, 2733162 edges, 3689330178019819520 markings/sec, 0 secs
lola: 1811493 markings, 5303857 edges, 172397 markings/sec, 5 secs
lola: 2576615 markings, 7290273 edges, 153024 markings/sec, 10 secs
lola: 3357760 markings, 9409250 edges, 156229 markings/sec, 15 secs
lola: 4184677 markings, 11659355 edges, 165383 markings/sec, 20 secs
lola: 4901537 markings, 13635281 edges, 143372 markings/sec, 25 secs
lola: 5607197 markings, 15556967 edges, 141132 markings/sec, 30 secs
lola: 6495611 markings, 18054345 edges, 177683 markings/sec, 35 secs
lola: 7313862 markings, 20503040 edges, 163650 markings/sec, 40 secs
lola: 7955389 markings, 22094907 edges, 128305 markings/sec, 45 secs
lola: 8767730 markings, 24456633 edges, 162468 markings/sec, 50 secs
lola: 9447135 markings, 26210463 edges, 135881 markings/sec, 55 secs
lola: 10154326 markings, 28214188 edges, 141438 markings/sec, 60 secs
lola: 10846382 markings, 30244195 edges, 138411 markings/sec, 65 secs
lola: 11550499 markings, 32339912 edges, 140823 markings/sec, 70 secs
lola: 12260232 markings, 34490693 edges, 141947 markings/sec, 75 secs
lola: 12978414 markings, 36667577 edges, 143636 markings/sec, 80 secs
lola: 13690820 markings, 38828589 edges, 142481 markings/sec, 85 secs
lola: 14492338 markings, 41257884 edges, 160304 markings/sec, 90 secs
lola: 15251378 markings, 43233485 edges, 151808 markings/sec, 95 secs
lola: 15967359 markings, 45193513 edges, 143196 markings/sec, 100 secs
lola: 16748022 markings, 47387493 edges, 156133 markings/sec, 105 secs
lola: 17461255 markings, 49278169 edges, 142647 markings/sec, 110 secs
lola: 18061278 markings, 51010891 edges, 120005 markings/sec, 115 secs
lola: 18730837 markings, 52974986 edges, 133912 markings/sec, 120 secs
lola: 19341879 markings, 54669949 edges, 122208 markings/sec, 125 secs
lola: 20099210 markings, 56741899 edges, 151466 markings/sec, 130 secs
lola: 20882148 markings, 58921460 edges, 156588 markings/sec, 135 secs
lola: 21672650 markings, 61131731 edges, 158100 markings/sec, 140 secs
lola: 22394678 markings, 63147799 edges, 144406 markings/sec, 145 secs
lola: 23109427 markings, 65056492 edges, 142950 markings/sec, 150 secs
lola: 23799793 markings, 67013792 edges, 138073 markings/sec, 155 secs
lola: 24525777 markings, 69028301 edges, 145197 markings/sec, 160 secs
lola: 25204034 markings, 70930874 edges, 135651 markings/sec, 165 secs
lola: 25829106 markings, 72590598 edges, 125014 markings/sec, 170 secs
lola: 26498515 markings, 74454669 edges, 133882 markings/sec, 175 secs
lola: 27210977 markings, 76450227 edges, 142492 markings/sec, 180 secs
lola: 27899981 markings, 78377058 edges, 137801 markings/sec, 185 secs
lola: 28547571 markings, 80234311 edges, 129518 markings/sec, 190 secs
lola: 29203884 markings, 81943315 edges, 131263 markings/sec, 195 secs
lola: 29844318 markings, 83760853 edges, 128087 markings/sec, 200 secs
lola: 30513882 markings, 85586279 edges, 133913 markings/sec, 205 secs
lola: 31183147 markings, 87472313 edges, 133853 markings/sec, 210 secs
lola: 31788988 markings, 89134602 edges, 121168 markings/sec, 215 secs
lola: 32680462 markings, 91488172 edges, 178295 markings/sec, 220 secs
lola: 33484402 markings, 94132149 edges, 160788 markings/sec, 225 secs
lola: 34272627 markings, 96709949 edges, 157645 markings/sec, 230 secs
lola: 35017759 markings, 99037143 edges, 149026 markings/sec, 235 secs
lola: 35699352 markings, 100841919 edges, 136319 markings/sec, 240 secs
lola: 36378479 markings, 102643714 edges, 135825 markings/sec, 245 secs
lola: 37127795 markings, 104757584 edges, 149863 markings/sec, 250 secs
lola: 37821071 markings, 106752732 edges, 138655 markings/sec, 255 secs
lola: 38655911 markings, 108988787 edges, 166968 markings/sec, 260 secs
lola: 39350623 markings, 111385934 edges, 138942 markings/sec, 265 secs
lola: 39997555 markings, 113102567 edges, 129386 markings/sec, 270 secs
lola: 40720610 markings, 115166870 edges, 144611 markings/sec, 275 secs
lola: 41358042 markings, 116925616 edges, 127486 markings/sec, 280 secs
lola: 42261522 markings, 119356721 edges, 180696 markings/sec, 285 secs
lola: 43005652 markings, 121908599 edges, 148826 markings/sec, 290 secs
lola: 43771854 markings, 124365133 edges, 153240 markings/sec, 295 secs
lola: 44463989 markings, 126554064 edges, 138427 markings/sec, 300 secs
lola: 45085716 markings, 127950162 edges, 124345 markings/sec, 305 secs
lola: 45858907 markings, 129960779 edges, 154638 markings/sec, 310 secs
lola: 46560952 markings, 132345248 edges, 140409 markings/sec, 315 secs
lola: 47147309 markings, 133860082 edges, 117271 markings/sec, 320 secs
lola: 47916953 markings, 136052214 edges, 153929 markings/sec, 325 secs
lola: 48587935 markings, 138068353 edges, 134196 markings/sec, 330 secs
lola: 49175560 markings, 139829558 edges, 117525 markings/sec, 335 secs
lola: 49883286 markings, 142001879 edges, 141545 markings/sec, 340 secs
lola: 50395987 markings, 143605543 edges, 102540 markings/sec, 345 secs
lola: 51224737 markings, 146095921 edges, 165750 markings/sec, 350 secs
lola: 51916529 markings, 148411504 edges, 138358 markings/sec, 355 secs
lola: 52629285 markings, 150531417 edges, 142551 markings/sec, 360 secs
lola: 53311627 markings, 152638977 edges, 136468 markings/sec, 365 secs
lola: 53860605 markings, 154480620 edges, 109796 markings/sec, 370 secs
lola: 54540688 markings, 156539111 edges, 136017 markings/sec, 375 secs
lola: 55074799 markings, 158357157 edges, 106822 markings/sec, 380 secs
lola: 55672409 markings, 159831717 edges, 119522 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 ((p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 <= 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 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63))))))
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 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63))))
lola: processed formula length: 77
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: 938970 markings, 2698629 edges, 3096157673607921664 markings/sec, 0 secs
lola: 1776214 markings, 5200214 edges, 167449 markings/sec, 5 secs
lola: 2641749 markings, 7444203 edges, 173107 markings/sec, 10 secs
lola: 3539893 markings, 9863424 edges, 179629 markings/sec, 15 secs
lola: 4352675 markings, 12190701 edges, 162556 markings/sec, 20 secs
lola: 5185940 markings, 14416578 edges, 166653 markings/sec, 25 secs
lola: 6108699 markings, 16883283 edges, 184552 markings/sec, 30 secs
lola: 6900915 markings, 19363834 edges, 158443 markings/sec, 35 secs
lola: 7724316 markings, 21565103 edges, 164680 markings/sec, 40 secs
lola: 8584136 markings, 23877544 edges, 171964 markings/sec, 45 secs
lola: 9375309 markings, 25995667 edges, 158235 markings/sec, 50 secs
lola: 10159751 markings, 28227386 edges, 156888 markings/sec, 55 secs
lola: 10914093 markings, 30436331 edges, 150868 markings/sec, 60 secs
lola: 11701825 markings, 32869872 edges, 157546 markings/sec, 65 secs
lola: 12531425 markings, 35394412 edges, 165920 markings/sec, 70 secs
lola: 13451935 markings, 38117621 edges, 184102 markings/sec, 75 secs
lola: 14388699 markings, 40950537 edges, 187353 markings/sec, 80 secs
lola: 15364352 markings, 43536371 edges, 195131 markings/sec, 85 secs
lola: 16308850 markings, 46134709 edges, 188900 markings/sec, 90 secs
lola: 17222772 markings, 48665356 edges, 182784 markings/sec, 95 secs
lola: 18089576 markings, 51087633 edges, 173361 markings/sec, 100 secs
lola: 18915454 markings, 53551103 edges, 165176 markings/sec, 105 secs
lola: 19783056 markings, 55844163 edges, 173520 markings/sec, 110 secs
lola: 20654122 markings, 58307972 edges, 174213 markings/sec, 115 secs
lola: 21463908 markings, 60536662 edges, 161957 markings/sec, 120 secs
lola: 22257636 markings, 62799811 edges, 158746 markings/sec, 125 secs
lola: 23040986 markings, 64862724 edges, 156670 markings/sec, 130 secs
lola: 23798480 markings, 67010755 edges, 151499 markings/sec, 135 secs
lola: 24618504 markings, 69263966 edges, 164005 markings/sec, 140 secs
lola: 25369154 markings, 71410128 edges, 150130 markings/sec, 145 secs
lola: 26142823 markings, 73448977 edges, 154734 markings/sec, 150 secs
lola: 26941133 markings, 75720785 edges, 159662 markings/sec, 155 secs
lola: 27799065 markings, 78092269 edges, 171586 markings/sec, 160 secs
lola: 28649424 markings, 80454310 edges, 170072 markings/sec, 165 secs
lola: 29495799 markings, 82765004 edges, 169275 markings/sec, 170 secs
lola: 30320128 markings, 85054454 edges, 164866 markings/sec, 175 secs
lola: 31117586 markings, 87280322 edges, 159492 markings/sec, 180 secs
lola: 31912944 markings, 89410061 edges, 159072 markings/sec, 185 secs
lola: 32898791 markings, 92105769 edges, 197169 markings/sec, 190 secs
lola: 33736647 markings, 95032980 edges, 167571 markings/sec, 195 secs
lola: 34592992 markings, 97674958 edges, 171269 markings/sec, 200 secs
lola: 35394488 markings, 100020420 edges, 160299 markings/sec, 205 secs
lola: 36190380 markings, 102173443 edges, 159178 markings/sec, 210 secs
lola: 36972887 markings, 104401351 edges, 156501 markings/sec, 215 secs
lola: 37794380 markings, 106696284 edges, 164299 markings/sec, 220 secs
lola: 38723923 markings, 109224054 edges, 185909 markings/sec, 225 secs
lola: 39526627 markings, 111812151 edges, 160541 markings/sec, 230 secs
lola: 40395629 markings, 114327008 edges, 173800 markings/sec, 235 secs
lola: 41216758 markings, 116606842 edges, 164226 markings/sec, 240 secs
lola: 42138825 markings, 119034307 edges, 184413 markings/sec, 245 secs
lola: 42953553 markings, 121721249 edges, 162946 markings/sec, 250 secs
lola: 43782247 markings, 124393333 edges, 165739 markings/sec, 255 secs
lola: 44600548 markings, 126847753 edges, 163660 markings/sec, 260 secs
lola: 45441039 markings, 128837299 edges, 168098 markings/sec, 265 secs
lola: 46231175 markings, 131183836 edges, 158027 markings/sec, 270 secs
lola: 46916598 markings, 133305893 edges, 137085 markings/sec, 275 secs
lola: 47645767 markings, 135177841 edges, 145834 markings/sec, 280 secs
lola: 48350846 markings, 137394308 edges, 141016 markings/sec, 285 secs
lola: 49047714 markings, 139366292 edges, 139374 markings/sec, 290 secs
lola: 49765797 markings, 141600006 edges, 143617 markings/sec, 295 secs
lola: 50434526 markings, 143710968 edges, 133746 markings/sec, 300 secs
lola: 51223276 markings, 146089866 edges, 157750 markings/sec, 305 secs
lola: 52036763 markings, 148753802 edges, 162697 markings/sec, 310 secs
lola: 52844971 markings, 151292245 edges, 161642 markings/sec, 315 secs
lola: 53692325 markings, 153845524 edges, 169471 markings/sec, 320 secs
lola: 54493966 markings, 156367130 edges, 160328 markings/sec, 325 secs
lola: 55157084 markings, 158550785 edges, 132624 markings/sec, 330 secs
lola: 55935243 markings, 160557673 edges, 155632 markings/sec, 335 secs
lola: 56671766 markings, 162654813 edges, 147305 markings/sec, 340 secs
lola: 57402176 markings, 164811112 edges, 146082 markings/sec, 345 secs
lola: 58113917 markings, 166948082 edges, 142348 markings/sec, 350 secs
lola: 58831205 markings, 168888234 edges, 143458 markings/sec, 355 secs
lola: 59551112 markings, 170893201 edges, 143981 markings/sec, 360 secs
lola: 60279410 markings, 172992919 edges, 145660 markings/sec, 365 secs
lola: 60981350 markings, 175087606 edges, 140388 markings/sec, 370 secs
lola: 61685327 markings, 177196710 edges, 140795 markings/sec, 375 secs
lola: 62468027 markings, 179260192 edges, 156540 markings/sec, 380 secs
lola: 63237198 markings, 181486716 edges, 153834 markings/sec, 385 secs
lola: 63982512 markings, 183656637 edges, 149063 markings/sec, 390 secs
lola: 64671856 markings, 185695753 edges, 137869 markings/sec, 395 secs
lola: 65344498 markings, 187528816 edges, 134528 markings/sec, 400 secs
lola: 65435971 markings, 187792493 edges, 18295 markings/sec, 405 secs
lola: 65439767 markings, 187804857 edges, 759 markings/sec, 410 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((p207 <= p144))) U (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 <= p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (p207 <= p144)) U (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 <= p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96))
lola: processed formula length: 134
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: subprocess 12 will run for 580 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (((p207 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71) U (3 <= p147)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E((p207 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71) U (3 <= p147)))
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: ========================================
lola: 1321907 markings, 1771523 edges, 3067840576268271616 markings/sec, 0 secs
lola: 2533308 markings, 3477669 edges, 242280 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 770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (((3 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87) U (1 <= p144)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((3 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87) U (1 <= p144)))))
lola: processed formula length: 89
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 1156 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p174 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126) OR (p118 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163) OR (p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= 1)))) OR E (G (((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p109) OR (3 <= p97) OR (p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1156 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p174 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126) OR (p118 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163) OR (p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= 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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to PermAdmissibility-COL-02-CTLCardinality-14.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) OR E (G ((p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)
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: ========================================
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
sara: try reading problem file PermAdmissibility-COL-02-CTLCardinality-14.sara.
sara: place or transition ordering is non-deterministic

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 stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-COL-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/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 irma4mcc-structural"
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 r115-csrt-152666474000437"
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 ;