Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 4.0K 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-V80P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-ebro-152646308300215
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526755171713


BK_STOP 1526756104676

--------------------
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-V80P20N10 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': 2621763, 'Memory': 1500.81, 'Tool': 'lola'}, {'Time': 2622123, 'Memory': 2043.38, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola BridgeAndVehicles-COL-V80P20N10...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
BridgeAndVehicles-COL-V80P20N10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V80P20N10: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ BridgeAndVehicles-COL-V80P20N10 @ 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: 2296/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 188 places, 2108 transitions, 181 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2613 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality.task
lola: A (G (((1 <= p173) OR (p86 + p87 <= p90 + p91)))) : A (G (((1 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83) OR (p86 + p87 + 1 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83) OR ((1 <= p185) AND (p186 <= p185) AND ((p0 <= p84) OR (p90 + p91 <= p173)))))) : A (G ((1 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83))) : E (F (((3 <= p90 + p91) OR (p1 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83)))) : E (F ((((p185 <= p2) OR (3 <= p86 + p87)) AND (p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p86 + p87) AND (p173 <= p2) AND (1 <= p187) AND (3 <= p185)))) : A (G ((p88 + p89 <= 1))) : E (F (((p173 <= p85) AND (3 <= p187)))) : E (F (((3 <= p186) AND (p84 <= p187) 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 + p172 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99) OR (1 <= p187)) AND ((p86 + p87 <= 0) OR (p185 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83))))) : E (F ((((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 + p172 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99 <= 0) AND (p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 <= 0)) OR ((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 + p172 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99 <= p1) 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 + p172 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99) AND (p186 + 1 <= p86 + p87))))) : E (F ((((p187 <= 2) AND (p1 + 1 <= p90 + p91)) OR (p1 <= 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 + p172 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99)))) : E (F ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99))) : E (F ((3 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83))) : E (F ((p185 <= 2))) : E (F ((p1 <= 2))) : A (G ((p0 <= p1))) : A (G (((1 <= p2) OR (p88 + p89 <= 1) OR (3 <= p186))))
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 (((1 <= p173) OR (p86 + p87 <= p90 + p91))))
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 724 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-V80P20N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 82 markings, 81 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 ... (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 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 +... (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 724 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)
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p90 + p91) OR (p1 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + ... (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 724 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-V80P20N10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p185 <= p2) OR (3 <= p86 + p87)) AND (p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 +... (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 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 167 markings, 166 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p88 + p89 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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-V80P20N10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic

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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p173 <= p85) AND (3 <= p187))))
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 724 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-V80P20N10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 55 markings, 54 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p186) AND (p84 <= p187) 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 + 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 724 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 8 will run for 442 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 + 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 +... (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 724 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-8.sara
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p187 <= 2) AND (p1 + 1 <= p90 + p91)) OR (p1 <= 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 +... (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 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p15... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-10.sara
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 +... (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 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-11.sara
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p185 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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-V80P20N10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 14)
lola: sara is running 0 secs || 9303 markings, 15669 edges, 1861 markings/sec, 0 secs
lola: sara is running 5 secs || 16965 markings, 30513 edges, 1532 markings/sec, 5 secs
lola: sara is running 10 secs || 24956 markings, 46344 edges, 1598 markings/sec, 10 secs
lola: sara is running 15 secs || 32199 markings, 60973 edges, 1449 markings/sec, 15 secs
lola: sara is running 20 secs || 39374 markings, 75515 edges, 1435 markings/sec, 20 secs
lola: sara is running 25 secs || 46842 markings, 90859 edges, 1494 markings/sec, 25 secs
lola: sara is running 30 secs || 53648 markings, 104384 edges, 1361 markings/sec, 30 secs
lola: sara is running 35 secs || 60610 markings, 118287 edges, 1392 markings/sec, 35 secs
lola: sara is running 40 secs || 66711 markings, 131071 edges, 1220 markings/sec, 40 secs
lola: sara is running 45 secs || 75450 markings, 147899 edges, 1748 markings/sec, 45 secs
lola: sara is running 50 secs || 81706 markings, 160852 edges, 1251 markings/sec, 50 secs
lola: sara is running 55 secs || 88949 markings, 174966 edges, 1449 markings/sec, 55 secs
lola: sara is running 60 secs || 95930 markings, 188867 edges, 1396 markings/sec, 60 secs
lola: sara is running 65 secs || 102240 markings, 202061 edges, 1262 markings/sec, 65 secs
lola: sara is running 70 secs || 109617 markings, 215916 edges, 1475 markings/sec, 70 secs
lola: sara is running 75 secs || 116519 markings, 229701 edges, 1380 markings/sec, 75 secs
lola: sara is running 80 secs || 122953 markings, 242955 edges, 1287 markings/sec, 80 secs
lola: sara is running 85 secs || 129999 markings, 256486 edges, 1409 markings/sec, 85 secs
lola: sara is running 90 secs || 137058 markings, 270280 edges, 1412 markings/sec, 90 secs
lola: sara is running 95 secs || 143622 markings, 283750 edges, 1313 markings/sec, 95 secs
lola: sara is running 100 secs || 149652 markings, 296135 edges, 1206 markings/sec, 100 secs
lola: sara is running 105 secs || 157375 markings, 310332 edges, 1545 markings/sec, 105 secs
lola: sara is running 110 secs || 164588 markings, 324507 edges, 1443 markings/sec, 110 secs
lola: sara is running 115 secs || 170658 markings, 337054 edges, 1214 markings/sec, 115 secs
lola: sara is running 120 secs || 176885 markings, 350189 edges, 1245 markings/sec, 120 secs
lola: sara is running 125 secs || 184684 markings, 364194 edges, 1560 markings/sec, 125 secs
lola: sara is running 130 secs || 191501 markings, 377798 edges, 1363 markings/sec, 130 secs
lola: sara is running 135 secs || 198195 markings, 391432 edges, 1339 markings/sec, 135 secs
lola: sara is running 140 secs || 204222 markings, 403678 edges, 1205 markings/sec, 140 secs
lola: sara is running 145 secs || 211620 markings, 417393 edges, 1480 markings/sec, 145 secs
lola: sara is running 150 secs || 219181 markings, 431860 edges, 1512 markings/sec, 150 secs
lola: sara is running 155 secs || 225298 markings, 444261 edges, 1223 markings/sec, 155 secs
lola: sara is running 160 secs || 231764 markings, 457440 edges, 1293 markings/sec, 160 secs
lola: sara is running 165 secs || 237972 markings, 470644 edges, 1242 markings/sec, 165 secs
lola: sara is running 170 secs || 245953 markings, 484701 edges, 1596 markings/sec, 170 secs
lola: sara is running 175 secs || 252953 markings, 498436 edges, 1400 markings/sec, 175 secs
lola: sara is running 180 secs || 259245 markings, 511228 edges, 1258 markings/sec, 180 secs
lola: sara is running 185 secs || 266337 markings, 525382 edges, 1418 markings/sec, 185 secs
lola: sara is running 190 secs || 271812 markings, 537192 edges, 1095 markings/sec, 190 secs
lola: sara is running 195 secs || 279463 markings, 552732 edges, 1530 markings/sec, 195 secs
lola: sara is running 200 secs || 285751 markings, 565087 edges, 1258 markings/sec, 200 secs
lola: sara is running 205 secs || 293226 markings, 580965 edges, 1495 markings/sec, 205 secs
lola: sara is running 210 secs || 299795 markings, 594623 edges, 1314 markings/sec, 210 secs
lola: sara is running 215 secs || 305978 markings, 607386 edges, 1237 markings/sec, 215 secs
lola: sara is running 220 secs || 312236 markings, 620421 edges, 1252 markings/sec, 220 secs
lola: sara is running 225 secs || 318555 markings, 633699 edges, 1264 markings/sec, 225 secs
lola: sara is running 230 secs || 324877 markings, 647162 edges, 1264 markings/sec, 230 secs
lola: sara is running 235 secs || 330983 markings, 660089 edges, 1221 markings/sec, 235 secs
lola: sara is running 240 secs || 337394 markings, 673020 edges, 1282 markings/sec, 240 secs
lola: sara is running 245 secs || 344612 markings, 688599 edges, 1444 markings/sec, 245 secs
lola: sara is running 250 secs || 351112 markings, 701628 edges, 1300 markings/sec, 250 secs
lola: sara is running 255 secs || 360000 markings, 718344 edges, 1778 markings/sec, 255 secs
lola: sara is running 260 secs || 367571 markings, 734259 edges, 1514 markings/sec, 260 secs
lola: sara is running 265 secs || 374404 markings, 748404 edges, 1367 markings/sec, 265 secs
lola: sara is running 270 secs || 380773 markings, 761560 edges, 1274 markings/sec, 270 secs
lola: sara is running 275 secs || 386968 markings, 774812 edges, 1239 markings/sec, 275 secs
lola: sara is running 280 secs || 393243 markings, 787630 edges, 1255 markings/sec, 280 secs
lola: sara is running 285 secs || 399773 markings, 800752 edges, 1306 markings/sec, 285 secs
lola: sara is running 290 secs || 406564 markings, 814244 edges, 1358 markings/sec, 290 secs
lola: sara is running 295 secs || 412353 markings, 827004 edges, 1158 markings/sec, 295 secs
lola: sara is running 300 secs || 418446 markings, 839540 edges, 1219 markings/sec, 300 secs
lola: sara is running 305 secs || 425898 markings, 855417 edges, 1490 markings/sec, 305 secs
lola: sara is running 310 secs || 432612 markings, 868602 edges, 1343 markings/sec, 310 secs
lola: sara is running 315 secs || 439267 markings, 881283 edges, 1331 markings/sec, 315 secs
lola: sara is running 320 secs || 446893 markings, 896955 edges, 1525 markings/sec, 320 secs
lola: sara is running 325 secs || 453557 markings, 910936 edges, 1333 markings/sec, 325 secs
lola: sara is running 330 secs || 460081 markings, 924473 edges, 1305 markings/sec, 330 secs
lola: sara is running 335 secs || 465997 markings, 936918 edges, 1183 markings/sec, 335 secs
lola: sara is running 340 secs || 472640 markings, 951029 edges, 1329 markings/sec, 340 secs
lola: sara is running 345 secs || 478658 markings, 963897 edges, 1204 markings/sec, 345 secs
lola: sara is running 350 secs || 485418 markings, 977539 edges, 1352 markings/sec, 350 secs
lola: sara is running 355 secs || 491457 markings, 990062 edges, 1208 markings/sec, 355 secs
lola: sara is running 360 secs || 497613 markings, 1003583 edges, 1231 markings/sec, 360 secs
lola: sara is running 365 secs || 504635 markings, 1017330 edges, 1404 markings/sec, 365 secs
lola: sara is running 370 secs || 510389 markings, 1030202 edges, 1151 markings/sec, 370 secs
lola: sara is running 375 secs || 518639 markings, 1047359 edges, 1650 markings/sec, 375 secs
lola: sara is running 380 secs || 525167 markings, 1060706 edges, 1306 markings/sec, 380 secs
lola: sara is running 385 secs || 531892 markings, 1073279 edges, 1345 markings/sec, 385 secs
lola: sara is running 390 secs || 540034 markings, 1090416 edges, 1628 markings/sec, 390 secs
lola: sara is running 395 secs || 546689 markings, 1104441 edges, 1331 markings/sec, 395 secs
lola: sara is running 400 secs || 553398 markings, 1118329 edges, 1342 markings/sec, 400 secs
lola: sara is running 405 secs || 559650 markings, 1131648 edges, 1250 markings/sec, 405 secs
lola: sara is running 410 secs || 566125 markings, 1145865 edges, 1295 markings/sec, 410 secs
lola: sara is running 415 secs || 572499 markings, 1158863 edges, 1275 markings/sec, 415 secs
lola: sara is running 420 secs || 578795 markings, 1171535 edges, 1259 markings/sec, 420 secs
lola: sara is running 425 secs || 585200 markings, 1186155 edges, 1281 markings/sec, 425 secs
lola: sara is running 430 secs || 592033 markings, 1199524 edges, 1367 markings/sec, 430 secs
lola: sara is running 435 secs || 598222 markings, 1212869 edges, 1238 markings/sec, 435 secs
lola: sara is running 440 secs || 604472 markings, 1225836 edges, 1250 markings/sec, 440 secs
lola: sara is running 445 secs || 611588 markings, 1241475 edges, 1423 markings/sec, 445 secs
lola: sara is running 450 secs || 619073 markings, 1256902 edges, 1497 markings/sec, 450 secs
lola: sara is running 455 secs || 625816 markings, 1270807 edges, 1349 markings/sec, 455 secs
lola: sara is running 460 secs || 632500 markings, 1283358 edges, 1337 markings/sec, 460 secs
lola: sara is running 465 secs || 640727 markings, 1300652 edges, 1645 markings/sec, 465 secs
lola: sara is running 470 secs || 647470 markings, 1315015 edges, 1349 markings/sec, 470 secs
lola: sara is running 475 secs || 654334 markings, 1329765 edges, 1373 markings/sec, 475 secs
lola: sara is running 480 secs || 660348 markings, 1342689 edges, 1203 markings/sec, 480 secs
lola: sara is running 485 secs || 667281 markings, 1356949 edges, 1387 markings/sec, 485 secs
lola: sara is running 490 secs || 673629 markings, 1370242 edges, 1270 markings/sec, 490 secs
lola: sara is running 495 secs || 679705 markings, 1383589 edges, 1215 markings/sec, 495 secs
lola: sara is running 500 secs || 686979 markings, 1398161 edges, 1455 markings/sec, 500 secs
lola: sara is running 505 secs || 693285 markings, 1412219 edges, 1261 markings/sec, 505 secs
lola: sara is running 510 secs || 699494 markings, 1424709 edges, 1242 markings/sec, 510 secs
lola: sara is running 515 secs || 705825 markings, 1438606 edges, 1266 markings/sec, 515 secs
lola: sara is running 520 secs || 712120 markings, 1451298 edges, 1259 markings/sec, 520 secs
lola: sara is running 525 secs || 717567 markings, 1463793 edges, 1089 markings/sec, 525 secs
lola: sara is running 530 secs || 726414 markings, 1482491 edges, 1769 markings/sec, 530 secs
lola: sara is running 535 secs || 733109 markings, 1496191 edges, 1339 markings/sec, 535 secs
lola: sara is running 540 secs || 739888 markings, 1509663 edges, 1356 markings/sec, 540 secs
lola: sara is running 545 secs || 746242 markings, 1522549 edges, 1271 markings/sec, 545 secs
lola: sara is running 550 secs || 754747 markings, 1540280 edges, 1701 markings/sec, 550 secs
lola: sara is running 555 secs || 761184 markings, 1553877 edges, 1287 markings/sec, 555 secs
lola: sara is running 560 secs || 768212 markings, 1569161 edges, 1406 markings/sec, 560 secs
lola: sara is running 565 secs || 774075 markings, 1581868 edges, 1173 markings/sec, 565 secs
lola: sara is running 570 secs || 781285 markings, 1596451 edges, 1442 markings/sec, 570 secs
lola: sara is running 575 secs || 787754 markings, 1610669 edges, 1294 markings/sec, 575 secs
lola: sara is running 580 secs || 793749 markings, 1623360 edges, 1199 markings/sec, 580 secs
lola: sara is running 585 secs || 800404 markings, 1637165 edges, 1331 markings/sec, 585 secs
lola: sara is running 590 secs || 806605 markings, 1650759 edges, 1240 markings/sec, 590 secs
lola: sara is running 595 secs || 813208 markings, 1664186 edges, 1321 markings/sec, 595 secs
lola: sara is running 600 secs || 819519 markings, 1678109 edges, 1262 markings/sec, 600 secs
lola: sara is running 605 secs || 826171 markings, 1691742 edges, 1330 markings/sec, 605 secs
lola: sara is running 610 secs || 832553 markings, 1705478 edges, 1276 markings/sec, 610 secs
lola: sara is running 615 secs || 839372 markings, 1720447 edges, 1364 markings/sec, 615 secs
lola: sara is running 620 secs || 847451 markings, 1737627 edges, 1616 markings/sec, 620 secs
lola: sara is running 625 secs || 854387 markings, 1752075 edges, 1387 markings/sec, 625 secs
lola: sara is running 630 secs || 861411 markings, 1766098 edges, 1405 markings/sec, 630 secs
lola: sara is running 635 secs || 867867 markings, 1779011 edges, 1291 markings/sec, 635 secs
lola: sara is running 640 secs || 876372 markings, 1796823 edges, 1701 markings/sec, 640 secs
lola: sara is running 645 secs || 883490 markings, 1812325 edges, 1424 markings/sec, 645 secs
lola: sara is running 650 secs || 889633 markings, 1825897 edges, 1229 markings/sec, 650 secs
lola: sara is running 655 secs || 896631 markings, 1840237 edges, 1400 markings/sec, 655 secs
lola: sara is running 660 secs || 903311 markings, 1854487 edges, 1336 markings/sec, 660 secs
lola: sara is running 665 secs || 909371 markings, 1867859 edges, 1212 markings/sec, 665 secs
lola: sara is running 670 secs || 916037 markings, 1881179 edges, 1333 markings/sec, 670 secs
lola: sara is running 675 secs || 922534 markings, 1896062 edges, 1299 markings/sec, 675 secs
lola: sara is running 680 secs || 929965 markings, 1910567 edges, 1486 markings/sec, 680 secs
lola: sara is running 685 secs || 935299 markings, 1922977 edges, 1067 markings/sec, 685 secs
lola: sara is running 690 secs || 941983 markings, 1936237 edges, 1337 markings/sec, 690 secs
lola: sara is running 695 secs || 948311 markings, 1950708 edges, 1266 markings/sec, 695 secs
lola: sara is running 700 secs || 955174 markings, 1964648 edges, 1373 markings/sec, 700 secs
lola: sara is running 705 secs || 961590 markings, 1978489 edges, 1283 markings/sec, 705 secs
lola: sara is running 710 secs || 967672 markings, 1991846 edges, 1216 markings/sec, 710 secs
lola: sara is running 715 secs || 976308 markings, 2010669 edges, 1727 markings/sec, 715 secs
lola: sara is running 720 secs || 983874 markings, 2026316 edges, 1513 markings/sec, 720 secs
lola: sara is running 725 secs || 990389 markings, 2039991 edges, 1303 markings/sec, 725 secs
lola: sara is running 730 secs || 997571 markings, 2053884 edges, 1436 markings/sec, 730 secs
lola: sara is running 735 secs || 1005439 markings, 2070864 edges, 1574 markings/sec, 735 secs
lola: sara is running 740 secs || 1012279 markings, 2085247 edges, 1368 markings/sec, 740 secs
lola: sara is running 745 secs || 1019065 markings, 2099216 edges, 1357 markings/sec, 745 secs
lola: sara is running 750 secs || 1026523 markings, 2115819 edges, 1492 markings/sec, 750 secs
lola: sara is running 755 secs || 1032369 markings, 2128245 edges, 1169 markings/sec, 755 secs
lola: sara is running 760 secs || 1039271 markings, 2142640 edges, 1380 markings/sec, 760 secs
lola: sara is running 765 secs || 1045379 markings, 2156321 edges, 1222 markings/sec, 765 secs
lola: sara is running 770 secs || 1052188 markings, 2170023 edges, 1362 markings/sec, 770 secs
lola: sara is running 775 secs || 1058471 markings, 2184272 edges, 1257 markings/sec, 775 secs
lola: sara is running 780 secs || 1065313 markings, 2198034 edges, 1368 markings/sec, 780 secs
lola: sara is running 785 secs || 1071640 markings, 2212237 edges, 1265 markings/sec, 785 secs
lola: sara is running 790 secs || 1078644 markings, 2226687 edges, 1401 markings/sec, 790 secs
lola: sara is running 795 secs || 1085093 markings, 2240479 edges, 1290 markings/sec, 795 secs
lola: sara is running 800 secs || 1092137 markings, 2255957 edges, 1409 markings/sec, 800 secs
lola: sara is running 805 secs || 1098745 markings, 2268943 edges, 1322 markings/sec, 805 secs
lola: sara is running 810 secs || 1103943 markings, 2281427 edges, 1040 markings/sec, 810 secs
lola: sara is running 815 secs || 1111680 markings, 2298031 edges, 1547 markings/sec, 815 secs
lola: sara is running 820 secs || 1119487 markings, 2314662 edges, 1561 markings/sec, 820 secs
lola: sara is running 825 secs || 1126584 markings, 2329353 edges, 1419 markings/sec, 825 secs
lola: sara is running 830 secs || 1133259 markings, 2343550 edges, 1335 markings/sec, 830 secs
lola: sara is running 835 secs || 1140584 markings, 2357774 edges, 1465 markings/sec, 835 secs
lola: sara is running 840 secs || 1147826 markings, 2373628 edges, 1448 markings/sec, 840 secs
lola: sara is running 845 secs || 1155612 markings, 2389731 edges, 1557 markings/sec, 845 secs
lola: sara is running 850 secs || 1162525 markings, 2404445 edges, 1383 markings/sec, 850 secs
lola: sara is running 855 secs || 1168748 markings, 2418569 edges, 1245 markings/sec, 855 secs
lola: sara is running 860 secs || 1176089 markings, 2433367 edges, 1468 markings/sec, 860 secs
lola: sara is running 865 secs || 1183192 markings, 2449184 edges, 1421 markings/sec, 865 secs
lola: sara is running 870 secs || 1189243 markings, 2461747 edges, 1210 markings/sec, 870 secs
lola: sara is running 875 secs || 1196367 markings, 2477320 edges, 1425 markings/sec, 875 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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-V80P20N10-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 79 markings, 78 edges
lola: ========================================
lola: subprocess 14 will run for 1326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 <= 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 724 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-V80P20N10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 84 markings, 83 edges
lola: ========================================
lola: subprocess 15 will run for 2653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p2) OR (p88 + p89 <= 1) OR (3 <= p186))))
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 724 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-V80P20N10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-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 yes yes yes yes yes yes yes no yes no no unknown yes no yes
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V80P20N10"
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-V80P20N10.tgz
mv BridgeAndVehicles-COL-V80P20N10 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-V80P20N10, 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-152646308300215"
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 ;