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 212K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 45K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is BridgeAndVehicles-COL-V80P20N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-ebro-152646308300222
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526755774621


BK_STOP 1526756486845

--------------------
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 BridgeAndVehicles-COL-V80P20N20 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 13538, 'Memory': 211.45, 'Tool': 'lola'}, {'Time': 14369, 'Memory': 220.87, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola BridgeAndVehicles-COL-V80P20N20...

Time: 3600 - MCC
----- Start make prepare stderr -----
----- Start make prepare stdout -----
===========================================================================================
BridgeAndVehicles-COL-V80P20N20: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V80P20N20: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ BridgeAndVehicles-COL-V80P20N20 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3926/65536 symbol table entries, 711 collisions
lola: preprocessing...
lola: finding significant places
lola: 198 places, 3728 transitions, 191 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4253 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality.task
lola: E (F ((((p0 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p98 + p97 + p96 + p95 + p94 + p93 + p87 + p88 + p89 + p90 + p91 + p92 + p99) OR (p172 + 1 <= p170 + p171)) AND (((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p98 + p97 + p96 + p95 + p94 + p93 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND (p168 <= p169)) OR (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 <= 0))))) : A (G (())) : A (G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p98 + p97 + p96 + p95 + p94 + p93 + p87 + p88 + p89 + p90 + p91 + p92 + p99))) : E (F (((((p175 <= p172)) OR ((p3 + p4 <= p170 + p171) AND (p175 <= p172))) AND ((p169 <= p0) OR (3 <= p170 + p171) OR (p173 <= 0))))) : E (F ((p175 <= 2))) : A (G (((1 <= p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) AND ((p3 + p4 <= p175) OR (2 <= p1 + p2))))) : E (F (((p169 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p98 + p97 + p96 + p95 + p94 + p93 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND (p170 + p171 + 1 <= p174) AND (p168 <= p170 + p171)))) : A (G (((p170 + p171 <= p176) OR (2 <= p176) OR ((2 <= p176) AND (2 <= p170 + p171)) OR (p169 <= p86)))) : E (F (((1 <= p174) AND (2 <= p0) AND (p176 + 1 <= p3 + p4) AND ((1 <= p173) OR (1 <= p170 + p171))))) : A (G (((3 <= p168) OR (p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p170 + p171)))) : A (G (())) : A (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p98 + p97 + p96 + p95 + p94 + p93 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85))) : A (G ((p170 + p171 <= 2))) : A (G (((3 <= p168) OR (3 <= p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197)))) : A (G ((p176 <= p175))) : A (G (((p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p168) OR (3 <= p174) OR ((2 <= p175) AND (2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p98 + p97 + p96 + p95 + p94 + p93 + p87 + p88 + p89 + p90 + p91 + p92 + p99)) OR (2 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85))))
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 (F ((((p0 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p15... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 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 10 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p15... (shortened)
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 764 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 BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((p175 <= p172)) OR ((p3 + p4 <= p170 + p171) AND (p175 <= p172))) AND ((p169 <= p0) OR (3 <= p170 + p171) OR (p173 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 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 15 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p175 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 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 BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 55 markings, 54 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) AND ((p3 + p4 <= p175) OR (2 <= p1 + p2)))))
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 764 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 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 65 markings, 64 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p169 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 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: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 2)
lola: sara is running 0 secs || 3277 markings, 3998 edges, 655 markings/sec, 0 secs
lola: sara is running 5 secs || 6453 markings, 7920 edges, 635 markings/sec, 5 secs
lola: sara is running 10 secs || 9643 markings, 11924 edges, 638 markings/sec, 10 secs
lola: sara is running 15 secs || 12748 markings, 15749 edges, 621 markings/sec, 15 secs
lola: sara is running 20 secs || 15908 markings, 19706 edges, 632 markings/sec, 20 secs
lola: sara is running 25 secs || 19002 markings, 23563 edges, 619 markings/sec, 25 secs
lola: sara is running 30 secs || 22220 markings, 27549 edges, 644 markings/sec, 30 secs
lola: sara is running 35 secs || 25367 markings, 31488 edges, 629 markings/sec, 35 secs
lola: sara is running 40 secs || 28529 markings, 35389 edges, 632 markings/sec, 40 secs
lola: sara is running 45 secs || 31733 markings, 39414 edges, 641 markings/sec, 45 secs
lola: sara is running 50 secs || 34835 markings, 43236 edges, 620 markings/sec, 50 secs
lola: sara is running 55 secs || 37983 markings, 47173 edges, 630 markings/sec, 55 secs
lola: sara is running 60 secs || 41554 markings, 51768 edges, 714 markings/sec, 60 secs
lola: sara is running 65 secs || 45344 markings, 56788 edges, 758 markings/sec, 65 secs
lola: sara is running 70 secs || 49213 markings, 61962 edges, 774 markings/sec, 70 secs
lola: sara is running 75 secs || 53041 markings, 67068 edges, 766 markings/sec, 75 secs
lola: sara is running 80 secs || 56804 markings, 72061 edges, 753 markings/sec, 80 secs
lola: sara is running 85 secs || 60569 markings, 77056 edges, 753 markings/sec, 85 secs
lola: sara is running 90 secs || 64334 markings, 82051 edges, 753 markings/sec, 90 secs
lola: sara is running 95 secs || 68170 markings, 87117 edges, 767 markings/sec, 95 secs
lola: sara is running 100 secs || 72168 markings, 92478 edges, 800 markings/sec, 100 secs
lola: sara is running 105 secs || 75888 markings, 97404 edges, 744 markings/sec, 105 secs
lola: sara is running 110 secs || 79444 markings, 102129 edges, 711 markings/sec, 110 secs
lola: sara is running 115 secs || 83216 markings, 107151 edges, 754 markings/sec, 115 secs
lola: sara is running 120 secs || 86801 markings, 111861 edges, 717 markings/sec, 120 secs
lola: sara is running 125 secs || 90477 markings, 116787 edges, 735 markings/sec, 125 secs
lola: sara is running 130 secs || 94143 markings, 121637 edges, 733 markings/sec, 130 secs
lola: sara is running 135 secs || 97729 markings, 126414 edges, 717 markings/sec, 135 secs
lola: sara is running 140 secs || 101634 markings, 131571 edges, 781 markings/sec, 140 secs
lola: sara is running 145 secs || 105319 markings, 136526 edges, 737 markings/sec, 145 secs
lola: sara is running 150 secs || 108828 markings, 141178 edges, 702 markings/sec, 150 secs
lola: sara is running 155 secs || 112336 markings, 145829 edges, 702 markings/sec, 155 secs
lola: sara is running 160 secs || 115965 markings, 150608 edges, 726 markings/sec, 160 secs
lola: sara is running 165 secs || 119640 markings, 155546 edges, 735 markings/sec, 165 secs
lola: sara is running 170 secs || 123148 markings, 160197 edges, 702 markings/sec, 170 secs
lola: sara is running 175 secs || 126656 markings, 164848 edges, 702 markings/sec, 175 secs
lola: sara is running 180 secs || 130293 markings, 169641 edges, 727 markings/sec, 180 secs
lola: sara is running 185 secs || 133976 markings, 174589 edges, 737 markings/sec, 185 secs
lola: sara is running 190 secs || 137497 markings, 179271 edges, 704 markings/sec, 190 secs
lola: sara is running 195 secs || 141017 markings, 183952 edges, 704 markings/sec, 195 secs
lola: sara is running 200 secs || 144538 markings, 188634 edges, 704 markings/sec, 200 secs
lola: sara is running 205 secs || 147919 markings, 193076 edges, 676 markings/sec, 205 secs
lola: sara is running 210 secs || 151374 markings, 197663 edges, 691 markings/sec, 210 secs
lola: sara is running 215 secs || 154802 markings, 202252 edges, 686 markings/sec, 215 secs
lola: sara is running 220 secs || 158316 markings, 206927 edges, 703 markings/sec, 220 secs
lola: sara is running 225 secs || 161834 markings, 211606 edges, 704 markings/sec, 225 secs
lola: sara is running 230 secs || 165368 markings, 216307 edges, 707 markings/sec, 230 secs
lola: sara is running 235 secs || 168711 markings, 220698 edges, 669 markings/sec, 235 secs
lola: sara is running 240 secs || 172140 markings, 225306 edges, 686 markings/sec, 240 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p170 + p171 <= p176) OR (2 <= p176) OR ((2 <= p176) AND (2 <= p170 + p171)) OR (p169 <= p86))))
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 764 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 148 markings, 147 edges
lola: ========================================
lola: subprocess 8 will run for 411 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p174) AND (2 <= p0) AND (p176 + 1 <= p3 + p4) AND ((1 <= p173) OR (1 <= p170 + p171)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3914 markings, 6818 edges, 783 markings/sec, 0 secs
lola: sara is running 5 secs || 7166 markings, 13910 edges, 650 markings/sec, 5 secs
lola: sara is running 10 secs || 10367 markings, 20785 edges, 640 markings/sec, 10 secs
lola: sara is running 15 secs || 13498 markings, 28165 edges, 626 markings/sec, 15 secs
lola: sara is running 20 secs || 16377 markings, 34693 edges, 576 markings/sec, 20 secs
lola: sara is running 25 secs || 19677 markings, 42156 edges, 660 markings/sec, 25 secs
lola: sara is running 30 secs || 22805 markings, 49176 edges, 626 markings/sec, 30 secs
lola: sara is running 35 secs || 25802 markings, 56460 edges, 599 markings/sec, 35 secs
lola: sara is running 40 secs || 28712 markings, 63057 edges, 582 markings/sec, 40 secs
lola: sara is running 45 secs || 31373 markings, 69460 edges, 532 markings/sec, 45 secs
lola: sara is running 50 secs || 34189 markings, 76203 edges, 563 markings/sec, 50 secs
lola: sara is running 55 secs || 37103 markings, 83066 edges, 583 markings/sec, 55 secs
lola: sara is running 60 secs || 40351 markings, 90269 edges, 650 markings/sec, 60 secs
lola: sara is running 65 secs || 43454 markings, 97115 edges, 621 markings/sec, 65 secs
lola: sara is running 70 secs || 46673 markings, 105143 edges, 644 markings/sec, 70 secs
lola: sara is running 75 secs || 49574 markings, 112129 edges, 580 markings/sec, 75 secs
lola: sara is running 80 secs || 52275 markings, 118519 edges, 540 markings/sec, 80 secs
lola: sara is running 85 secs || 55027 markings, 125010 edges, 550 markings/sec, 85 secs
lola: sara is running 90 secs || 57621 markings, 130912 edges, 519 markings/sec, 90 secs
lola: sara is running 95 secs || 60335 markings, 137861 edges, 543 markings/sec, 95 secs
lola: sara is running 100 secs || 62954 markings, 144035 edges, 524 markings/sec, 100 secs
lola: sara is running 105 secs || 65679 markings, 150643 edges, 545 markings/sec, 105 secs
lola: sara is running 110 secs || 68463 markings, 157571 edges, 557 markings/sec, 110 secs
lola: sara is running 115 secs || 71418 markings, 164677 edges, 591 markings/sec, 115 secs
lola: sara is running 120 secs || 74956 markings, 172576 edges, 708 markings/sec, 120 secs
lola: sara is running 125 secs || 77702 markings, 178695 edges, 549 markings/sec, 125 secs
lola: sara is running 130 secs || 81227 markings, 186907 edges, 705 markings/sec, 130 secs
lola: sara is running 135 secs || 84424 markings, 195008 edges, 639 markings/sec, 135 secs
lola: sara is running 140 secs || 87509 markings, 202544 edges, 617 markings/sec, 140 secs
lola: sara is running 145 secs || 90374 markings, 209394 edges, 573 markings/sec, 145 secs
lola: sara is running 150 secs || 93092 markings, 215926 edges, 544 markings/sec, 150 secs
lola: sara is running 155 secs || 95673 markings, 222004 edges, 516 markings/sec, 155 secs
lola: sara is running 160 secs || 98378 markings, 228845 edges, 541 markings/sec, 160 secs
lola: sara is running 165 secs || 101198 markings, 235326 edges, 564 markings/sec, 165 secs
lola: sara is running 170 secs || 103895 markings, 241566 edges, 539 markings/sec, 170 secs
lola: sara is running 175 secs || 106361 markings, 247407 edges, 493 markings/sec, 175 secs
lola: sara is running 180 secs || 109035 markings, 254443 edges, 535 markings/sec, 180 secs
lola: sara is running 185 secs || 111550 markings, 260313 edges, 503 markings/sec, 185 secs
lola: sara is running 190 secs || 114261 markings, 267563 edges, 542 markings/sec, 190 secs
lola: sara is running 195 secs || 116895 markings, 273626 edges, 527 markings/sec, 195 secs
lola: sara is running 200 secs || 119674 markings, 280779 edges, 556 markings/sec, 200 secs
lola: sara is running 205 secs || 122255 markings, 287318 edges, 516 markings/sec, 205 secs
lola: sara is running 210 secs || 125038 markings, 294168 edges, 557 markings/sec, 210 secs
lola: sara is running 215 secs || 128045 markings, 301387 edges, 601 markings/sec, 215 secs
lola: sara is running 220 secs || 131685 markings, 309729 edges, 728 markings/sec, 220 secs
lola: sara is running 225 secs || 134605 markings, 316226 edges, 584 markings/sec, 225 secs
lola: sara is running 230 secs || 137351 markings, 322315 edges, 549 markings/sec, 230 secs
lola: sara is running 235 secs || 140939 markings, 330553 edges, 718 markings/sec, 235 secs
lola: sara is running 240 secs || 144367 markings, 339310 edges, 686 markings/sec, 240 secs
lola: sara is running 245 secs || 147624 markings, 347489 edges, 651 markings/sec, 245 secs
lola: sara is running 250 secs || 150741 markings, 355245 edges, 623 markings/sec, 250 secs
lola: sara is running 255 secs || 153768 markings, 362692 edges, 605 markings/sec, 255 secs
lola: sara is running 260 secs || 156656 markings, 369707 edges, 578 markings/sec, 260 secs
lola: sara is running 265 secs || 159410 markings, 376152 edges, 551 markings/sec, 265 secs
lola: sara is running 270 secs || 161882 markings, 381826 edges, 494 markings/sec, 270 secs
lola: sara is running 275 secs || 164318 markings, 387401 edges, 487 markings/sec, 275 secs
lola: sara is running 280 secs || 166996 markings, 394352 edges, 536 markings/sec, 280 secs
lola: sara is running 285 secs || 169642 markings, 400917 edges, 529 markings/sec, 285 secs
lola: sara is running 290 secs || 172347 markings, 407733 edges, 541 markings/sec, 290 secs
lola: sara is running 295 secs || 175103 markings, 414257 edges, 551 markings/sec, 295 secs
lola: sara is running 300 secs || 178077 markings, 421102 edges, 595 markings/sec, 300 secs
lola: sara is running 305 secs || 180143 markings, 425968 edges, 413 markings/sec, 305 secs
lola: sara is running 310 secs || 182620 markings, 431886 edges, 495 markings/sec, 310 secs
lola: sara is running 315 secs || 185298 markings, 439171 edges, 536 markings/sec, 315 secs
lola: sara is running 320 secs || 188087 markings, 446190 edges, 558 markings/sec, 320 secs
lola: sara is running 325 secs || 190123 markings, 450752 edges, 407 markings/sec, 325 secs
lola: sara is running 330 secs || 192966 markings, 458225 edges, 569 markings/sec, 330 secs
lola: sara is running 335 secs || 195773 markings, 465501 edges, 561 markings/sec, 335 secs
lola: sara is running 340 secs || 198071 markings, 470761 edges, 460 markings/sec, 340 secs
lola: sara is running 345 secs || 200766 markings, 477959 edges, 539 markings/sec, 345 secs
lola: sara is running 350 secs || 203397 markings, 484420 edges, 526 markings/sec, 350 secs
lola: sara is running 355 secs || 206013 markings, 491049 edges, 523 markings/sec, 355 secs
lola: sara is running 360 secs || 208699 markings, 497730 edges, 537 markings/sec, 360 secs
lola: sara is running 365 secs || 211404 markings, 504740 edges, 541 markings/sec, 365 secs
lola: sara is running 370 secs || 214204 markings, 511533 edges, 560 markings/sec, 370 secs
lola: sara is running 375 secs || 217030 markings, 518620 edges, 565 markings/sec, 375 secs
lola: sara is running 380 secs || 219900 markings, 525772 edges, 574 markings/sec, 380 secs
lola: sara is running 385 secs || 223914 markings, 534784 edges, 803 markings/sec, 385 secs
lola: sara is running 390 secs || 227032 markings, 541901 edges, 624 markings/sec, 390 secs
lola: sara is running 395 secs || 229360 markings, 546915 edges, 466 markings/sec, 395 secs
lola: sara is running 400 secs || 232983 markings, 555196 edges, 725 markings/sec, 400 secs
lola: sara is running 405 secs || 236597 markings, 563833 edges, 723 markings/sec, 405 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 411 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p168) OR (p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p170 + p171))))
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 764 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 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 79 markings, 78 edges
lola: ========================================
lola: subprocess 10 will run for 479 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 575 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p... (shortened)
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 764 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: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 719 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p170 + p171 <= 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 764 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 BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-12.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 13 will run for 958 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p168) OR (3 <= p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197))))
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 764 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 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 79 markings, 78 edges
lola: ========================================
lola: subprocess 14 will run for 1436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p176 <= p175)))
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 764 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 BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 15 will run for 2873 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p168) OR (3 <= p174) OR ((2 <= p175) AND (2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 +... (shortened)
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 764 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 81 markings, 80 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no yes no unknown no yes yes yes no no no
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V80P20N20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-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/BridgeAndVehicles-COL-V80P20N20.tgz
mv BridgeAndVehicles-COL-V80P20N20 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-full"
echo " Input is BridgeAndVehicles-COL-V80P20N20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-ebro-152646308300222"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;