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-full
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 r030-ebro-152646308300243
=====================================================================

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


BK_STOP 1526760813402

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

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3538 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 ((((p2 + p3 <= p90) AND (1 <= p197)) OR (2 <= p7) OR (((p4 + p5 <= 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 + p89) OR (1 <= p91 + p92)) AND (p91 + p92 + 1 <= p2 + p3))))) : E (F (((2 <= p91 + p92) AND ((p2 + p3 <= 2) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p98 + p97 + p96 + p95 + p99 + 1 <= p90))))) : E (F ((((p6 + 1 <= p94) AND (p90 + 1 <= 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 + p89))))) : E (F ((2 <= p2 + p3))) : A (G ((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 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 <= p94))) : E (F (((p90 <= p0) AND ((p7 <= 1) OR ((p1 <= p94) AND (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p98 + p97 + p96 + p95 + p99)))))) : E (F (((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 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 <= p8) AND (1 <= p94) AND (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 + p89 <= 0)))) : A (G (((1 <= p94) OR (1 <= p90)))) : E (F ((2 <= p91 + p92))) : A (G (((p2 + p3 <= 2) OR (p6 + 1 <= p94) OR (p7 <= p1)))) : A (G ((((1 <= p1) AND (1 <= p0)) OR (p0 <= p90) OR (1 <= 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 + p89)))) : E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p98 + p97 + p96 + p95 + p99 + 1 <= 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 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196) AND (p91 + p92 + 1 <= p0) AND (p197 <= p94)))) : E (F (((3 <= p2 + p3) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p98 + p97 + p96 + p95 + p99 + 1 <= p2 + p3)))) : A (G (((p6 <= 1) OR (p197 <= 1) OR (p90 + 1 <= p197) OR (p2 + p3 <= 0)))) : E (F (((p94 <= p1) AND ((3 <= p0) OR ((p93 <= p197) AND (3 <= 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 + p89)))))) : A (G ((p4 + p5 <= 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 ((((p2 + p3 <= p90) AND (1 <= p197)) OR (2 <= p7) OR (((p4 + p5 <= 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... (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 <= p91 + p92) AND ((p2 + p3 <= 2) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p98 + p97 + p96 + p95 + p99 + 1 <= p90)))))
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 ((((p6 + 1 <= p94) AND (p90 + 1 <= 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 + p... (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
sara: warning, failure of lp_solve (at job 9)
lola: sara is running 0 secs || 6107 markings, 8956 edges, 1221 markings/sec, 0 secs
lola: sara is running 5 secs || 10214 markings, 15271 edges, 821 markings/sec, 5 secs
lola: sara is running 10 secs || 12789 markings, 19133 edges, 515 markings/sec, 10 secs
lola: sara is running 15 secs || 16604 markings, 27518 edges, 763 markings/sec, 15 secs
lola: sara is running 20 secs || 20570 markings, 34386 edges, 793 markings/sec, 20 secs
lola: sara is running 25 secs || 23677 markings, 39534 edges, 621 markings/sec, 25 secs
lola: sara is running 30 secs || 26104 markings, 43621 edges, 485 markings/sec, 30 secs
lola: sara is running 35 secs || 28890 markings, 47905 edges, 557 markings/sec, 35 secs
lola: sara is running 40 secs || 32302 markings, 52743 edges, 682 markings/sec, 40 secs
lola: sara is running 45 secs || 35230 markings, 59879 edges, 586 markings/sec, 45 secs
lola: sara is running 50 secs || 37640 markings, 65062 edges, 482 markings/sec, 50 secs
lola: sara is running 55 secs || 41917 markings, 72481 edges, 855 markings/sec, 55 secs
lola: sara is running 60 secs || 44922 markings, 77857 edges, 601 markings/sec, 60 secs
lola: sara is running 65 secs || 47519 markings, 82511 edges, 519 markings/sec, 65 secs
lola: sara is running 70 secs || 49908 markings, 86755 edges, 478 markings/sec, 70 secs
lola: sara is running 75 secs || 51989 markings, 90564 edges, 416 markings/sec, 75 secs
lola: sara is running 80 secs || 55452 markings, 95300 edges, 693 markings/sec, 80 secs
lola: sara is running 85 secs || 59123 markings, 101066 edges, 734 markings/sec, 85 secs
lola: sara is running 90 secs || 61971 markings, 105361 edges, 570 markings/sec, 90 secs
lola: sara is running 95 secs || 64655 markings, 109710 edges, 537 markings/sec, 95 secs
lola: sara is running 100 secs || 66921 markings, 114707 edges, 453 markings/sec, 100 secs
lola: sara is running 105 secs || 69277 markings, 120810 edges, 471 markings/sec, 105 secs
lola: sara is running 110 secs || 72435 markings, 126850 edges, 632 markings/sec, 110 secs
lola: sara is running 115 secs || 76293 markings, 134147 edges, 772 markings/sec, 115 secs
lola: sara is running 120 secs || 79503 markings, 140101 edges, 642 markings/sec, 120 secs
lola: sara is running 125 secs || 82131 markings, 145137 edges, 526 markings/sec, 125 secs
lola: sara is running 130 secs || 84649 markings, 149841 edges, 504 markings/sec, 130 secs
lola: sara is running 135 secs || 86850 markings, 154006 edges, 440 markings/sec, 135 secs
lola: sara is running 140 secs || 88981 markings, 158079 edges, 426 markings/sec, 140 secs
lola: sara is running 145 secs || 90973 markings, 161819 edges, 398 markings/sec, 145 secs
lola: sara is running 150 secs || 94439 markings, 166710 edges, 693 markings/sec, 150 secs
lola: sara is running 155 secs || 98072 markings, 172445 edges, 727 markings/sec, 155 secs
lola: sara is running 160 secs || 100857 markings, 176661 edges, 557 markings/sec, 160 secs
lola: sara is running 165 secs || 103620 markings, 181443 edges, 553 markings/sec, 165 secs
lola: sara is running 170 secs || 107702 markings, 188401 edges, 816 markings/sec, 170 secs
lola: sara is running 175 secs || 110601 markings, 193281 edges, 580 markings/sec, 175 secs
lola: sara is running 180 secs || 113018 markings, 197331 edges, 483 markings/sec, 180 secs
lola: sara is running 185 secs || 115369 markings, 201293 edges, 470 markings/sec, 185 secs
lola: sara is running 190 secs || 117577 markings, 205361 edges, 442 markings/sec, 190 secs
lola: sara is running 195 secs || 120043 markings, 211584 edges, 493 markings/sec, 195 secs
lola: sara is running 200 secs || 122002 markings, 216049 edges, 392 markings/sec, 200 secs
lola: sara is running 205 secs || 123832 markings, 220374 edges, 366 markings/sec, 205 secs
lola: sara is running 210 secs || 128653 markings, 229063 edges, 964 markings/sec, 210 secs
lola: sara is running 215 secs || 132045 markings, 235728 edges, 678 markings/sec, 215 secs
lola: sara is running 220 secs || 135050 markings, 241592 edges, 601 markings/sec, 220 secs
lola: sara is running 225 secs || 137772 markings, 246928 edges, 544 markings/sec, 225 secs
lola: sara is running 230 secs || 140248 markings, 251730 edges, 495 markings/sec, 230 secs
lola: sara is running 235 secs || 142666 markings, 256451 edges, 484 markings/sec, 235 secs
lola: sara is running 240 secs || 144861 markings, 260773 edges, 439 markings/sec, 240 secs
lola: sara is running 245 secs || 146858 markings, 264775 edges, 399 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 <= p2 + p3)))
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 ((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 + 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: 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 (((p90 <= p0) AND ((p7 <= 1) OR ((p1 <= p94) AND (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p98 + p97 + p96 + p95 + p99))))))
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 || 2657 markings, 5256 edges, 531 markings/sec, 0 secs
lola: sara is running 5 secs || 4857 markings, 9981 edges, 440 markings/sec, 5 secs
lola: sara is running 10 secs || 7227 markings, 15260 edges, 474 markings/sec, 10 secs
lola: sara is running 15 secs || 9461 markings, 20118 edges, 447 markings/sec, 15 secs
lola: sara is running 20 secs || 11656 markings, 24841 edges, 439 markings/sec, 20 secs
lola: sara is running 25 secs || 13802 markings, 29488 edges, 429 markings/sec, 25 secs
lola: sara is running 30 secs || 15948 markings, 34174 edges, 429 markings/sec, 30 secs
lola: sara is running 35 secs || 18064 markings, 38776 edges, 423 markings/sec, 35 secs
lola: sara is running 40 secs || 20190 markings, 43367 edges, 425 markings/sec, 40 secs
lola: sara is running 45 secs || 22302 markings, 47917 edges, 422 markings/sec, 45 secs
lola: sara is running 50 secs || 24212 markings, 52110 edges, 382 markings/sec, 50 secs
lola: sara is running 55 secs || 26321 markings, 56837 edges, 422 markings/sec, 55 secs
lola: sara is running 60 secs || 28553 markings, 61593 edges, 446 markings/sec, 60 secs
lola: sara is running 65 secs || 30375 markings, 65668 edges, 364 markings/sec, 65 secs
lola: sara is running 70 secs || 34299 markings, 74197 edges, 785 markings/sec, 70 secs
lola: sara is running 75 secs || 36737 markings, 79854 edges, 488 markings/sec, 75 secs
lola: sara is running 80 secs || 39056 markings, 85115 edges, 464 markings/sec, 80 secs
lola: sara is running 85 secs || 41354 markings, 90380 edges, 460 markings/sec, 85 secs
lola: sara is running 90 secs || 43506 markings, 95317 edges, 430 markings/sec, 90 secs
lola: sara is running 95 secs || 45614 markings, 100141 edges, 422 markings/sec, 95 secs
lola: sara is running 100 secs || 47724 markings, 104915 edges, 422 markings/sec, 100 secs
lola: sara is running 105 secs || 49639 markings, 109266 edges, 383 markings/sec, 105 secs
lola: sara is running 110 secs || 51730 markings, 114182 edges, 418 markings/sec, 110 secs
lola: sara is running 115 secs || 53883 markings, 119017 edges, 431 markings/sec, 115 secs
lola: sara is running 120 secs || 55676 markings, 123236 edges, 359 markings/sec, 120 secs
lola: sara is running 125 secs || 57886 markings, 128272 edges, 442 markings/sec, 125 secs
lola: sara is running 130 secs || 59677 markings, 132474 edges, 358 markings/sec, 130 secs
lola: sara is running 135 secs || 61951 markings, 137595 edges, 455 markings/sec, 135 secs
lola: sara is running 140 secs || 63697 markings, 141805 edges, 349 markings/sec, 140 secs
lola: sara is running 145 secs || 65802 markings, 146365 edges, 421 markings/sec, 145 secs
lola: sara is running 150 secs || 67765 markings, 151165 edges, 393 markings/sec, 150 secs
lola: sara is running 155 secs || 69478 markings, 155185 edges, 343 markings/sec, 155 secs
lola: sara is running 160 secs || 71765 markings, 160259 edges, 457 markings/sec, 160 secs
lola: sara is running 165 secs || 73601 markings, 164732 edges, 367 markings/sec, 165 secs
lola: sara is running 170 secs || 75339 markings, 168811 edges, 348 markings/sec, 170 secs
lola: sara is running 175 secs || 77642 markings, 173862 edges, 461 markings/sec, 175 secs
lola: sara is running 180 secs || 79461 markings, 178331 edges, 364 markings/sec, 180 secs
lola: sara is running 185 secs || 81185 markings, 182457 edges, 345 markings/sec, 185 secs
lola: sara is running 190 secs || 83033 markings, 186473 edges, 370 markings/sec, 190 secs
lola: sara is running 195 secs || 86265 markings, 194223 edges, 646 markings/sec, 195 secs
lola: sara is running 200 secs || 88980 markings, 200686 edges, 543 markings/sec, 200 secs
lola: sara is running 205 secs || 91381 markings, 206431 edges, 480 markings/sec, 205 secs
lola: sara is running 210 secs || 93793 markings, 212040 edges, 482 markings/sec, 210 secs
lola: sara is running 215 secs || 96064 markings, 217401 edges, 454 markings/sec, 215 secs
lola: sara is running 220 secs || 98199 markings, 222571 edges, 427 markings/sec, 220 secs
lola: sara is running 225 secs || 100495 markings, 228041 edges, 459 markings/sec, 225 secs
lola: sara is running 230 secs || 102490 markings, 232706 edges, 399 markings/sec, 230 secs
lola: sara is running 235 secs || 104696 markings, 237953 edges, 441 markings/sec, 235 secs
lola: sara is running 240 secs || 106963 markings, 243241 edges, 453 markings/sec, 240 secs
lola: sara is running 245 secs || 108911 markings, 247935 edges, 390 markings/sec, 245 secs
lola: sara is running 250 secs || 111194 markings, 253215 edges, 457 markings/sec, 250 secs
lola: sara is running 255 secs || 113134 markings, 257968 edges, 388 markings/sec, 255 secs
lola: sara is running 260 secs || 115194 markings, 262594 edges, 412 markings/sec, 260 secs
lola: sara is running 265 secs || 117419 markings, 268074 edges, 445 markings/sec, 265 secs
lola: sara is running 270 secs || 119275 markings, 272388 edges, 371 markings/sec, 270 secs
lola: sara is running 275 secs || 121645 markings, 277905 edges, 474 markings/sec, 275 secs
lola: sara is running 280 secs || 123617 markings, 282787 edges, 394 markings/sec, 280 secs
lola: sara is running 285 secs || 125435 markings, 287009 edges, 364 markings/sec, 285 secs
lola: sara is running 290 secs || 127766 markings, 292292 edges, 466 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 (((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 + ... (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 <= p94) OR (1 <= p90))))
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 || 3284 markings, 6152 edges, 657 markings/sec, 0 secs
lola: sara is running 5 secs || 6335 markings, 12700 edges, 610 markings/sec, 5 secs
lola: sara is running 10 secs || 9254 markings, 19186 edges, 584 markings/sec, 10 secs
lola: sara is running 15 secs || 12139 markings, 25540 edges, 577 markings/sec, 15 secs
lola: sara is running 20 secs || 14823 markings, 31823 edges, 537 markings/sec, 20 secs
lola: sara is running 25 secs || 17818 markings, 38508 edges, 599 markings/sec, 25 secs
lola: sara is running 30 secs || 20795 markings, 45015 edges, 595 markings/sec, 30 secs
lola: sara is running 35 secs || 23572 markings, 51539 edges, 555 markings/sec, 35 secs
lola: sara is running 40 secs || 26635 markings, 58256 edges, 613 markings/sec, 40 secs
lola: sara is running 45 secs || 29492 markings, 64738 edges, 571 markings/sec, 45 secs
lola: sara is running 50 secs || 32522 markings, 71555 edges, 606 markings/sec, 50 secs
lola: sara is running 55 secs || 35382 markings, 78039 edges, 572 markings/sec, 55 secs
lola: sara is running 60 secs || 38432 markings, 84866 edges, 610 markings/sec, 60 secs
lola: sara is running 65 secs || 41302 markings, 91606 edges, 574 markings/sec, 65 secs
lola: sara is running 70 secs || 44336 markings, 98111 edges, 607 markings/sec, 70 secs
lola: sara is running 75 secs || 47295 markings, 105161 edges, 592 markings/sec, 75 secs
lola: sara is running 80 secs || 49938 markings, 110942 edges, 529 markings/sec, 80 secs
lola: sara is running 85 secs || 53266 markings, 118514 edges, 666 markings/sec, 85 secs
lola: sara is running 90 secs || 56233 markings, 125449 edges, 593 markings/sec, 90 secs
lola: sara is running 95 secs || 59195 markings, 131620 edges, 592 markings/sec, 95 secs
lola: sara is running 100 secs || 62225 markings, 138895 edges, 606 markings/sec, 100 secs
lola: sara is running 105 secs || 65057 markings, 145442 edges, 566 markings/sec, 105 secs
lola: sara is running 110 secs || 68084 markings, 151781 edges, 605 markings/sec, 110 secs
lola: sara is running 115 secs || 71190 markings, 159231 edges, 621 markings/sec, 115 secs
lola: sara is running 120 secs || 74183 markings, 166132 edges, 599 markings/sec, 120 secs
lola: sara is running 125 secs || 76787 markings, 171642 edges, 521 markings/sec, 125 secs
lola: sara is running 130 secs || 80109 markings, 179411 edges, 664 markings/sec, 130 secs
lola: sara is running 135 secs || 83183 markings, 186696 edges, 615 markings/sec, 135 secs
lola: sara is running 140 secs || 85968 markings, 192775 edges, 557 markings/sec, 140 secs
lola: sara is running 145 secs || 89140 markings, 199728 edges, 634 markings/sec, 145 secs
lola: sara is running 150 secs || 92364 markings, 207458 edges, 645 markings/sec, 150 secs
lola: sara is running 155 secs || 95552 markings, 214557 edges, 638 markings/sec, 155 secs
lola: sara is running 160 secs || 97801 markings, 219533 edges, 450 markings/sec, 160 secs
lola: sara is running 165 secs || 101444 markings, 227902 edges, 729 markings/sec, 165 secs
lola: sara is running 170 secs || 104701 markings, 235649 edges, 651 markings/sec, 170 secs
lola: sara is running 175 secs || 107950 markings, 242836 edges, 650 markings/sec, 175 secs
lola: sara is running 180 secs || 110405 markings, 248060 edges, 491 markings/sec, 180 secs
lola: sara is running 185 secs || 113918 markings, 256332 edges, 703 markings/sec, 185 secs
lola: sara is running 190 secs || 117222 markings, 264186 edges, 661 markings/sec, 190 secs
lola: sara is running 195 secs || 120581 markings, 271600 edges, 672 markings/sec, 195 secs
lola: sara is running 200 secs || 122756 markings, 276354 edges, 435 markings/sec, 200 secs
lola: sara is running 205 secs || 126496 markings, 284980 edges, 748 markings/sec, 205 secs
lola: sara is running 210 secs || 129872 markings, 293048 edges, 675 markings/sec, 210 secs
lola: sara is running 215 secs || 133667 markings, 301247 edges, 759 markings/sec, 215 secs
lola: sara is running 220 secs || 137103 markings, 309508 edges, 687 markings/sec, 220 secs
lola: sara is running 225 secs || 140438 markings, 317429 edges, 667 markings/sec, 225 secs
lola: sara is running 230 secs || 144229 markings, 325458 edges, 758 markings/sec, 230 secs
lola: sara is running 235 secs || 146229 markings, 330202 edges, 400 markings/sec, 235 secs
lola: sara is running 240 secs || 148891 markings, 336029 edges, 532 markings/sec, 240 secs
lola: sara is running 245 secs || 150880 markings, 340616 edges, 398 markings/sec, 245 secs
lola: sara is running 250 secs || 154452 markings, 348480 edges, 714 markings/sec, 250 secs
lola: sara is running 255 secs || 157689 markings, 356244 edges, 647 markings/sec, 255 secs
lola: sara is running 260 secs || 161023 markings, 364025 edges, 667 markings/sec, 260 secs
lola: sara is running 265 secs || 164765 markings, 372321 edges, 748 markings/sec, 265 secs
lola: sara is running 270 secs || 167989 markings, 380051 edges, 645 markings/sec, 270 secs
lola: sara is running 275 secs || 171251 markings, 387583 edges, 652 markings/sec, 275 secs
lola: sara is running 280 secs || 174304 markings, 394593 edges, 611 markings/sec, 280 secs
lola: sara is running 285 secs || 176136 markings, 398927 edges, 366 markings/sec, 285 secs
lola: sara is running 290 secs || 178956 markings, 405161 edges, 564 markings/sec, 290 secs
lola: sara is running 295 secs || 180930 markings, 409695 edges, 395 markings/sec, 295 secs
lola: sara is running 300 secs || 184447 markings, 417395 edges, 703 markings/sec, 300 secs
lola: sara is running 305 secs || 187675 markings, 425155 edges, 646 markings/sec, 305 secs
lola: sara is running 310 secs || 190535 markings, 431768 edges, 572 markings/sec, 310 secs
lola: sara is running 315 secs || 194260 markings, 439825 edges, 745 markings/sec, 315 secs
lola: sara is running 320 secs || 197473 markings, 447589 edges, 643 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 <= p91 + p92)))
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: subprocess 9 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2 + p3 <= 2) OR (p6 + 1 <= p94) OR (p7 <= p1))))
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: ========================================
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 || 2602 markings, 3450 edges, 520 markings/sec, 0 secs
lola: sara is running 5 secs || 4163 markings, 5840 edges, 312 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 <= p1) AND (1 <= p0)) OR (p0 <= p90) OR (1 <= 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 + ... (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 (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p98 + p97 + p96 + p95 + p99 + 1 <= 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 + ... (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: subprocess 12 will run for 655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p2 + p3) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p98 + p97 + p96 + p95 + p99 + 1 <= p2 + p3))))
lola: ========================================
lola: SUBTASK
lola: ========================================
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 (((p6 <= 1) OR (p197 <= 1) OR (p90 + 1 <= p197) OR (p2 + p3 <= 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 (((p94 <= p1) AND ((3 <= p0) OR ((p93 <= p197) AND (3 <= 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 + p6... (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 ((p4 + p5 <= 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: RESULT
lola:
SUMMARY: no no unknown no no unknown no unknown no yes yes no no no yes yes
lola: ========================================
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 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-V80P50N20"
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-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-full"
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 r030-ebro-152646308300243"
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 ;