About the Execution of Irma.struct for BridgeAndVehicles-COL-V80P50N20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 699.840 | 969783.00 | 1541616.00 | 309.80 | FF?FF?F?FTTFFFTT | normal |
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.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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 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-structural
Input is BridgeAndVehicles-COL-V80P50N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309300243
=====================================================================
--------------------
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-V80P50N20-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526824504746
BK_STOP 1526825474529
--------------------
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 BridgeAndVehicles-COL-V80P50N20 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': 2662744, 'Memory': 621.73, 'Tool': 'lola'}, {'Time': 2663140, 'Memory': 735.46, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola BridgeAndVehicles-COL-V80P50N20...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
BridgeAndVehicles-COL-V80P50N20: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V80P50N20: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ BridgeAndVehicles-COL-V80P50N20 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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-V80P50N20-ReachabilityCardinality.task
lola: A (G ((((p175 + p176 <= p7) AND (1 <= p5)) OR (2 <= p6) OR (((p3 + p4 <= 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 + p168 + p169 + p170 + p171 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p92 + p99) OR (1 <= p1 + p2)) AND (p1 + p2 + 1 <= p175 + p176))))) : E (F (((2 <= p1 + p2) AND ((p175 + p176 <= 2) OR (p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p7))))) : E (F ((((p89 + 1 <= p173) AND (p7 + 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 + p168 + p169 + p170 + p171 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p92 + p99))))) : E (F ((2 <= p175 + p176))) : A (G ((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 + p86 + p87 + p88 <= p173))) : E (F (((p7 <= p172) AND ((p6 <= 1) OR ((p174 <= p173) AND (3 <= p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197)))))) : E (F (((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 + p86 + p87 + p88 <= p90) AND (1 <= p173) AND (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 + p168 + p169 + p170 + p171 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p92 + p99 <= 0)))) : A (G (((1 <= p173) OR (1 <= p7)))) : E (F ((2 <= p1 + p2))) : A (G (((p175 + p176 <= 2) OR (p89 + 1 <= p173) OR (p6 <= p174)))) : A (G ((((1 <= p174) AND (1 <= p172)) OR (p172 <= p7) OR (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 + p168 + p169 + p170 + p171 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p92 + p99)))) : E (F (((p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= 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 + p86 + p87 + p88) AND (p1 + p2 + 1 <= p172) AND (p5 <= p173)))) : E (F (((3 <= p175 + p176) OR (p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p175 + p176)))) : A (G (((p89 <= 1) OR (p5 <= 1) OR (p7 + 1 <= p5) OR (p175 + p176 <= 0)))) : E (F (((p173 <= p174) AND ((3 <= p172) OR ((p0 <= p5) 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 + p168 + p169 + p170 + p171 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p92 + p99)))))) : A (G ((p3 + p4 <= 2)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p175 + p176 <= p7) AND (1 <= p5)) OR (2 <= p6) OR (((p3 + p4 <= 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 + p14... (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 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 315 markings, 314 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p1 + p2) AND ((p175 + p176 <= 2) OR (p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p7)))))
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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p89 + 1 <= p173) AND (p7 + 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 + 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 10390 markings, 15894 edges, 2078 markings/sec, 0 secs
lola: sara is running 5 secs || 15496 markings, 26060 edges, 1021 markings/sec, 5 secs
lola: sara is running 10 secs || 23342 markings, 45185 edges, 1569 markings/sec, 10 secs
lola: sara is running 15 secs || 28692 markings, 55559 edges, 1070 markings/sec, 15 secs
lola: sara is running 20 secs || 35258 markings, 66096 edges, 1313 markings/sec, 20 secs
lola: sara is running 25 secs || 38605 markings, 76050 edges, 669 markings/sec, 25 secs
lola: sara is running 30 secs || 44404 markings, 91974 edges, 1160 markings/sec, 30 secs
lola: sara is running 35 secs || 50550 markings, 107721 edges, 1229 markings/sec, 35 secs
lola: sara is running 40 secs || 55094 markings, 118362 edges, 909 markings/sec, 40 secs
lola: sara is running 45 secs || 59425 markings, 128563 edges, 866 markings/sec, 45 secs
lola: sara is running 50 secs || 66237 markings, 139062 edges, 1362 markings/sec, 50 secs
lola: sara is running 55 secs || 71166 markings, 148955 edges, 986 markings/sec, 55 secs
lola: sara is running 60 secs || 75193 markings, 160047 edges, 805 markings/sec, 60 secs
lola: sara is running 65 secs || 78162 markings, 169523 edges, 594 markings/sec, 65 secs
lola: sara is running 70 secs || 83722 markings, 185685 edges, 1112 markings/sec, 70 secs
lola: sara is running 75 secs || 90006 markings, 203334 edges, 1257 markings/sec, 75 secs
lola: sara is running 80 secs || 93882 markings, 213396 edges, 775 markings/sec, 80 secs
lola: sara is running 85 secs || 98101 markings, 224386 edges, 844 markings/sec, 85 secs
lola: sara is running 90 secs || 101566 markings, 233448 edges, 693 markings/sec, 90 secs
lola: sara is running 95 secs || 105710 markings, 243392 edges, 829 markings/sec, 95 secs
lola: sara is running 100 secs || 112594 markings, 254340 edges, 1377 markings/sec, 100 secs
lola: sara is running 105 secs || 117044 markings, 264247 edges, 890 markings/sec, 105 secs
lola: sara is running 110 secs || 123043 markings, 277269 edges, 1200 markings/sec, 110 secs
lola: sara is running 115 secs || 127933 markings, 287266 edges, 978 markings/sec, 115 secs
lola: sara is running 120 secs || 131266 markings, 297178 edges, 667 markings/sec, 120 secs
lola: sara is running 125 secs || 135208 markings, 308543 edges, 788 markings/sec, 125 secs
lola: sara is running 130 secs || 138281 markings, 318656 edges, 615 markings/sec, 130 secs
lola: sara is running 135 secs || 142015 markings, 330189 edges, 747 markings/sec, 135 secs
lola: sara is running 140 secs || 147663 markings, 347317 edges, 1130 markings/sec, 140 secs
lola: sara is running 145 secs || 153033 markings, 362894 edges, 1074 markings/sec, 145 secs
lola: sara is running 150 secs || 156961 markings, 373768 edges, 786 markings/sec, 150 secs
lola: sara is running 155 secs || 160584 markings, 383869 edges, 725 markings/sec, 155 secs
lola: sara is running 160 secs || 164373 markings, 394437 edges, 758 markings/sec, 160 secs
lola: sara is running 165 secs || 167625 markings, 403577 edges, 650 markings/sec, 165 secs
lola: sara is running 170 secs || 171700 markings, 414951 edges, 815 markings/sec, 170 secs
lola: sara is running 175 secs || 177074 markings, 424843 edges, 1075 markings/sec, 175 secs
lola: sara is running 180 secs || 182527 markings, 434303 edges, 1091 markings/sec, 180 secs
lola: sara is running 185 secs || 186600 markings, 445221 edges, 815 markings/sec, 185 secs
lola: sara is running 190 secs || 192553 markings, 457208 edges, 1191 markings/sec, 190 secs
lola: sara is running 195 secs || 196808 markings, 467184 edges, 851 markings/sec, 195 secs
lola: sara is running 200 secs || 201112 markings, 479611 edges, 861 markings/sec, 200 secs
lola: sara is running 205 secs || 206708 markings, 492726 edges, 1119 markings/sec, 205 secs
lola: sara is running 210 secs || 210909 markings, 502764 edges, 840 markings/sec, 210 secs
lola: sara is running 215 secs || 215091 markings, 512759 edges, 836 markings/sec, 215 secs
sara: warning, failure of lp_solve (at job 15)
lola: sara is running 220 secs || 218677 markings, 523112 edges, 717 markings/sec, 220 secs
lola: sara is running 225 secs || 221560 markings, 532561 edges, 577 markings/sec, 225 secs
lola: sara is running 230 secs || 225795 markings, 545015 edges, 847 markings/sec, 230 secs
lola: sara is running 235 secs || 228737 markings, 554974 edges, 588 markings/sec, 235 secs
lola: sara is running 240 secs || 231747 markings, 564964 edges, 602 markings/sec, 240 secs
lola: sara is running 245 secs || 237302 markings, 581941 edges, 1111 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p175 + p176)))
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-V80P50N20-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((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 +... (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-V80P50N20-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 81 markings, 80 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p7 <= p172) AND ((p6 <= 1) OR ((p174 <= p173) AND (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 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 7532 markings, 18029 edges, 1506 markings/sec, 0 secs
lola: sara is running 5 secs || 15069 markings, 36036 edges, 1507 markings/sec, 5 secs
lola: sara is running 10 secs || 27472 markings, 67367 edges, 2481 markings/sec, 10 secs
lola: sara is running 15 secs || 34170 markings, 89644 edges, 1340 markings/sec, 15 secs
lola: sara is running 20 secs || 38427 markings, 99949 edges, 851 markings/sec, 20 secs
lola: sara is running 25 secs || 42552 markings, 110882 edges, 825 markings/sec, 25 secs
lola: sara is running 30 secs || 46705 markings, 122376 edges, 831 markings/sec, 30 secs
lola: sara is running 35 secs || 52889 markings, 139453 edges, 1237 markings/sec, 35 secs
lola: sara is running 40 secs || 57538 markings, 152585 edges, 930 markings/sec, 40 secs
lola: sara is running 45 secs || 62495 markings, 167008 edges, 991 markings/sec, 45 secs
lola: sara is running 50 secs || 67324 markings, 181343 edges, 966 markings/sec, 50 secs
lola: sara is running 55 secs || 71984 markings, 195471 edges, 932 markings/sec, 55 secs
lola: sara is running 60 secs || 77505 markings, 212349 edges, 1104 markings/sec, 60 secs
lola: sara is running 65 secs || 83203 markings, 230171 edges, 1140 markings/sec, 65 secs
lola: sara is running 70 secs || 88602 markings, 249019 edges, 1080 markings/sec, 70 secs
lola: sara is running 75 secs || 92272 markings, 259011 edges, 734 markings/sec, 75 secs
lola: sara is running 80 secs || 95785 markings, 268615 edges, 703 markings/sec, 80 secs
lola: sara is running 85 secs || 99327 markings, 278311 edges, 708 markings/sec, 85 secs
lola: sara is running 90 secs || 102578 markings, 287401 edges, 650 markings/sec, 90 secs
lola: sara is running 95 secs || 105856 markings, 296621 edges, 656 markings/sec, 95 secs
lola: sara is running 100 secs || 110384 markings, 308773 edges, 906 markings/sec, 100 secs
lola: sara is running 105 secs || 114827 markings, 321319 edges, 889 markings/sec, 105 secs
lola: sara is running 110 secs || 119483 markings, 334616 edges, 931 markings/sec, 110 secs
lola: sara is running 115 secs || 123811 markings, 347131 edges, 866 markings/sec, 115 secs
lola: sara is running 120 secs || 127008 markings, 355900 edges, 639 markings/sec, 120 secs
lola: sara is running 125 secs || 131489 markings, 369181 edges, 896 markings/sec, 125 secs
lola: sara is running 130 secs || 134288 markings, 376829 edges, 560 markings/sec, 130 secs
lola: sara is running 135 secs || 138821 markings, 390490 edges, 907 markings/sec, 135 secs
lola: sara is running 140 secs || 141576 markings, 398038 edges, 551 markings/sec, 140 secs
lola: sara is running 145 secs || 146505 markings, 413051 edges, 986 markings/sec, 145 secs
lola: sara is running 150 secs || 148327 markings, 418185 edges, 364 markings/sec, 150 secs
lola: sara is running 155 secs || 153708 markings, 434863 edges, 1076 markings/sec, 155 secs
lola: sara is running 160 secs || 156614 markings, 442778 edges, 581 markings/sec, 160 secs
lola: sara is running 165 secs || 158882 markings, 448968 edges, 454 markings/sec, 165 secs
lola: sara is running 170 secs || 164309 markings, 466226 edges, 1085 markings/sec, 170 secs
lola: sara is running 175 secs || 170234 markings, 486578 edges, 1185 markings/sec, 175 secs
lola: sara is running 180 secs || 172508 markings, 493476 edges, 455 markings/sec, 180 secs
lola: sara is running 185 secs || 176105 markings, 503407 edges, 719 markings/sec, 185 secs
lola: sara is running 190 secs || 179536 markings, 513090 edges, 686 markings/sec, 190 secs
lola: sara is running 195 secs || 182714 markings, 522344 edges, 636 markings/sec, 195 secs
lola: sara is running 200 secs || 185853 markings, 531506 edges, 628 markings/sec, 200 secs
lola: sara is running 205 secs || 189178 markings, 541183 edges, 665 markings/sec, 205 secs
lola: sara is running 210 secs || 192208 markings, 550053 edges, 606 markings/sec, 210 secs
lola: sara is running 215 secs || 195063 markings, 558599 edges, 571 markings/sec, 215 secs
lola: sara is running 220 secs || 199744 markings, 572146 edges, 936 markings/sec, 220 secs
lola: sara is running 225 secs || 203139 markings, 581907 edges, 679 markings/sec, 225 secs
lola: sara is running 230 secs || 207715 markings, 595563 edges, 915 markings/sec, 230 secs
lola: sara is running 235 secs || 212089 markings, 609203 edges, 875 markings/sec, 235 secs
lola: sara is running 240 secs || 215356 markings, 618542 edges, 653 markings/sec, 240 secs
lola: sara is running 245 secs || 219662 markings, 632115 edges, 861 markings/sec, 245 secs
lola: sara is running 250 secs || 222192 markings, 639412 edges, 506 markings/sec, 250 secs
lola: sara is running 255 secs || 225945 markings, 650720 edges, 751 markings/sec, 255 secs
lola: sara is running 260 secs || 230182 markings, 663752 edges, 847 markings/sec, 260 secs
lola: sara is running 265 secs || 232657 markings, 671044 edges, 495 markings/sec, 265 secs
lola: sara is running 270 secs || 237008 markings, 685224 edges, 870 markings/sec, 270 secs
lola: sara is running 275 secs || 240289 markings, 694671 edges, 656 markings/sec, 275 secs
lola: sara is running 280 secs || 241944 markings, 699818 edges, 331 markings/sec, 280 secs
lola: sara is running 285 secs || 245538 markings, 710645 edges, 719 markings/sec, 285 secs
lola: sara is running 290 secs || 250562 markings, 726469 edges, 1005 markings/sec, 290 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((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 ... (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-V80P50N20-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p173) OR (1 <= p7))))
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-V80P50N20-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4631 markings, 9524 edges, 926 markings/sec, 0 secs
lola: sara is running 5 secs || 9195 markings, 20352 edges, 913 markings/sec, 5 secs
lola: sara is running 10 secs || 12895 markings, 28925 edges, 740 markings/sec, 10 secs
lola: sara is running 15 secs || 16588 markings, 37717 edges, 739 markings/sec, 15 secs
lola: sara is running 20 secs || 20382 markings, 46716 edges, 759 markings/sec, 20 secs
lola: sara is running 25 secs || 23628 markings, 54691 edges, 649 markings/sec, 25 secs
lola: sara is running 30 secs || 27166 markings, 63230 edges, 708 markings/sec, 30 secs
lola: sara is running 35 secs || 30592 markings, 71727 edges, 685 markings/sec, 35 secs
lola: sara is running 40 secs || 33573 markings, 78914 edges, 596 markings/sec, 40 secs
lola: sara is running 45 secs || 36817 markings, 87244 edges, 649 markings/sec, 45 secs
lola: sara is running 50 secs || 40333 markings, 95544 edges, 703 markings/sec, 50 secs
lola: sara is running 55 secs || 44770 markings, 107260 edges, 887 markings/sec, 55 secs
lola: sara is running 60 secs || 47636 markings, 115554 edges, 573 markings/sec, 60 secs
lola: sara is running 65 secs || 49787 markings, 121744 edges, 430 markings/sec, 65 secs
lola: sara is running 70 secs || 53956 markings, 132739 edges, 834 markings/sec, 70 secs
lola: sara is running 75 secs || 56808 markings, 140647 edges, 570 markings/sec, 75 secs
lola: sara is running 80 secs || 59924 markings, 148153 edges, 623 markings/sec, 80 secs
lola: sara is running 85 secs || 63292 markings, 157290 edges, 674 markings/sec, 85 secs
lola: sara is running 90 secs || 66344 markings, 164960 edges, 610 markings/sec, 90 secs
lola: sara is running 95 secs || 69420 markings, 172573 edges, 615 markings/sec, 95 secs
lola: sara is running 100 secs || 72226 markings, 180122 edges, 561 markings/sec, 100 secs
lola: sara is running 105 secs || 75812 markings, 189359 edges, 717 markings/sec, 105 secs
lola: sara is running 110 secs || 78687 markings, 197125 edges, 575 markings/sec, 110 secs
lola: sara is running 115 secs || 81624 markings, 204827 edges, 587 markings/sec, 115 secs
lola: sara is running 120 secs || 84583 markings, 212407 edges, 592 markings/sec, 120 secs
lola: sara is running 125 secs || 88165 markings, 222082 edges, 716 markings/sec, 125 secs
lola: sara is running 130 secs || 91023 markings, 229349 edges, 572 markings/sec, 130 secs
lola: sara is running 135 secs || 93904 markings, 237434 edges, 576 markings/sec, 135 secs
lola: sara is running 140 secs || 97063 markings, 245205 edges, 632 markings/sec, 140 secs
lola: sara is running 145 secs || 99833 markings, 252794 edges, 554 markings/sec, 145 secs
lola: sara is running 150 secs || 103146 markings, 261553 edges, 663 markings/sec, 150 secs
lola: sara is running 155 secs || 106220 markings, 269663 edges, 615 markings/sec, 155 secs
lola: sara is running 160 secs || 109045 markings, 277622 edges, 565 markings/sec, 160 secs
lola: sara is running 165 secs || 112171 markings, 285364 edges, 625 markings/sec, 165 secs
lola: sara is running 170 secs || 114906 markings, 292853 edges, 547 markings/sec, 170 secs
lola: sara is running 175 secs || 118567 markings, 302751 edges, 732 markings/sec, 175 secs
lola: sara is running 180 secs || 121209 markings, 309614 edges, 528 markings/sec, 180 secs
lola: sara is running 185 secs || 124279 markings, 318106 edges, 614 markings/sec, 185 secs
lola: sara is running 190 secs || 127006 markings, 325787 edges, 545 markings/sec, 190 secs
lola: sara is running 195 secs || 130191 markings, 333614 edges, 637 markings/sec, 195 secs
lola: sara is running 200 secs || 132817 markings, 340897 edges, 525 markings/sec, 200 secs
lola: sara is running 205 secs || 136178 markings, 350008 edges, 672 markings/sec, 205 secs
lola: sara is running 210 secs || 139473 markings, 358561 edges, 659 markings/sec, 210 secs
lola: sara is running 215 secs || 142300 markings, 366518 edges, 565 markings/sec, 215 secs
lola: sara is running 220 secs || 144962 markings, 374049 edges, 532 markings/sec, 220 secs
lola: sara is running 225 secs || 148055 markings, 381641 edges, 619 markings/sec, 225 secs
lola: sara is running 230 secs || 150765 markings, 389175 edges, 542 markings/sec, 230 secs
lola: sara is running 235 secs || 153995 markings, 397789 edges, 646 markings/sec, 235 secs
lola: sara is running 240 secs || 157187 markings, 406334 edges, 638 markings/sec, 240 secs
lola: sara is running 245 secs || 160341 markings, 415028 edges, 631 markings/sec, 245 secs
lola: sara is running 250 secs || 163037 markings, 422688 edges, 539 markings/sec, 250 secs
lola: sara is running 255 secs || 165776 markings, 430003 edges, 548 markings/sec, 255 secs
lola: sara is running 260 secs || 168924 markings, 438108 edges, 630 markings/sec, 260 secs
lola: sara is running 265 secs || 171657 markings, 445714 edges, 547 markings/sec, 265 secs
lola: sara is running 270 secs || 174886 markings, 454475 edges, 646 markings/sec, 270 secs
lola: sara is running 275 secs || 177871 markings, 462359 edges, 597 markings/sec, 275 secs
lola: sara is running 280 secs || 181104 markings, 471301 edges, 647 markings/sec, 280 secs
lola: sara is running 285 secs || 183876 markings, 479182 edges, 554 markings/sec, 285 secs
lola: sara is running 290 secs || 186645 markings, 486636 edges, 554 markings/sec, 290 secs
lola: sara is running 295 secs || 189717 markings, 494509 edges, 614 markings/sec, 295 secs
lola: sara is running 300 secs || 192382 markings, 501955 edges, 533 markings/sec, 300 secs
lola: sara is running 305 secs || 195980 markings, 511665 edges, 720 markings/sec, 305 secs
lola: sara is running 310 secs || 198907 markings, 519442 edges, 585 markings/sec, 310 secs
lola: sara is running 315 secs || 202048 markings, 528096 edges, 628 markings/sec, 315 secs
lola: sara is running 320 secs || 204698 markings, 535661 edges, 530 markings/sec, 320 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 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p1 + p2)))
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-V80P50N20-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p175 + p176 <= 2) OR (p89 + 1 <= p173) OR (p6 <= p174))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1005 markings, 1393 edges, 201 markings/sec, 0 secs
lola: sara is running 5 secs || 1834 markings, 2969 edges, 166 markings/sec, 5 secs
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 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p174) AND (1 <= p172)) OR (p172 <= p7) OR (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 + ... (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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-10.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 11 will run for 525 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= 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 + p4... (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-V80P50N20-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p175 + p176) OR (p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p175 + p176))))
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 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 873 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p89 <= 1) OR (p5 <= 1) OR (p7 + 1 <= p5) OR (p175 + p176 <= 0))))
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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 38 markings, 37 edges
lola: ========================================
lola: subprocess 14 will run for 1309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p173 <= p174) AND ((3 <= p172) OR ((p0 <= p5) 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 +... (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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 90 markings, 89 edges
lola: ========================================
lola: subprocess 15 will run for 2619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3 + p4 <= 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-V80P50N20-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-15.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: RESULT
lola:
SUMMARY: no no unknown no no unknown no unknown no yes yes no no no yes yes
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-15 TRUE 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="BridgeAndVehicles-COL-V80P50N20"
export BK_EXAMINATION="ReachabilityCardinality"
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/BridgeAndVehicles-COL-V80P50N20.tgz
mv BridgeAndVehicles-COL-V80P50N20 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 BridgeAndVehicles-COL-V80P50N20, 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 r031-ebro-152646309300243"
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 '
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 ;