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)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_DrinkVendingMachine-COL-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612200196
=====================================================================

--------------------
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 DrinkVendingMachine-COL-10-ReachabilityCardinality-0
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-1
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-15
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-2
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-3
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-4
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-5
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-6
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-7
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-8
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1496354759101


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_DrinkVendingMachine-COL-10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_DrinkVendingMachine-COL-10: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
ReachabilityCardinality @ S_DrinkVendingMachine-COL-10 @ 2996 seconds
----- Start make result stdout -----
lola: LoLA will run for 2996 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 111280/65536 symbol table entries, 87056 collisions
lola: preprocessing...
lola: finding significant places
lola: 120 places, 111160 transitions, 60 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 48320 transition conflict sets
lola: TASK
lola: reading formula from DrinkVendingMachine-COL-10-ReachabilityCardinality.task
lola: E (F ((3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) : A (G ((3 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10))) : E (F ((((p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + 1 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30) OR ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) AND ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))) : A (G ((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10))) : A (G (((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30)))) : A (G ((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10))) : A (G ((((2 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30) OR (1 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30) OR (3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) AND ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30))))) : E (F (((p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND ((p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + 1 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30))))) : E (F (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND ((p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) OR (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) AND (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))) : E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) OR (p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 <= 2) OR ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 2) AND (p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))) : A (G ((((2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 1) OR (p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= 0) OR ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))) : A (G (((1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79)))) : A (G ((((1 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (2 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (2 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79)) AND ((p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (2 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 <= 0))))) : E (F ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) : E (F ((((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (3 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)) AND (p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + 1 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30) AND ((1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))) : E (F ((p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 186 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
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 240 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 DrinkVendingMachine-COL-10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 198 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)))
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 240 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 DrinkVendingMachine-COL-10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 211 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + 1 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30) OR ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p19 + p18 + p17 + p16 ... (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 240 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 227 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)))
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 240 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 246 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30))))
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 240 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)))
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 240 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30) OR (1 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30) OR (3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) AND ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 <= p59 + ... (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 240 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: sara is running 5 secs || 1057 markings, 1536 edges, 211 markings/sec, 5 secs
lola: sara is running 10 secs || 2390 markings, 4976 edges, 267 markings/sec, 10 secs
lola: sara is running 15 secs || 3838 markings, 8769 edges, 290 markings/sec, 15 secs
lola: sara is running 20 secs || 5162 markings, 12740 edges, 265 markings/sec, 20 secs
lola: sara is running 25 secs || 6535 markings, 16991 edges, 275 markings/sec, 25 secs
lola: sara is running 30 secs || 8031 markings, 21971 edges, 299 markings/sec, 30 secs
lola: sara is running 35 secs || 9479 markings, 27208 edges, 290 markings/sec, 35 secs
lola: sara is running 40 secs || 10937 markings, 32755 edges, 292 markings/sec, 40 secs
lola: sara is running 45 secs || 12431 markings, 38505 edges, 299 markings/sec, 45 secs
lola: sara is running 50 secs || 13844 markings, 43090 edges, 283 markings/sec, 50 secs
lola: sara is running 55 secs || 15158 markings, 47118 edges, 263 markings/sec, 55 secs
lola: sara is running 60 secs || 16700 markings, 51701 edges, 308 markings/sec, 60 secs
lola: sara is running 65 secs || 18213 markings, 57011 edges, 303 markings/sec, 65 secs
lola: sara is running 70 secs || 19646 markings, 62100 edges, 287 markings/sec, 70 secs
lola: sara is running 75 secs || 21016 markings, 67155 edges, 274 markings/sec, 75 secs
lola: sara is running 80 secs || 22422 markings, 72734 edges, 281 markings/sec, 80 secs
lola: sara is running 85 secs || 23811 markings, 77375 edges, 278 markings/sec, 85 secs
lola: sara is running 90 secs || 25230 markings, 81860 edges, 284 markings/sec, 90 secs
lola: sara is running 95 secs || 26638 markings, 87575 edges, 282 markings/sec, 95 secs
lola: sara is running 100 secs || 28000 markings, 93135 edges, 272 markings/sec, 100 secs
lola: sara is running 105 secs || 29284 markings, 96735 edges, 257 markings/sec, 105 secs
lola: sara is running 110 secs || 30525 markings, 101244 edges, 248 markings/sec, 110 secs
lola: sara is running 115 secs || 31793 markings, 105629 edges, 254 markings/sec, 115 secs
lola: sara is running 120 secs || 33041 markings, 110215 edges, 250 markings/sec, 120 secs
lola: sara is running 125 secs || 34238 markings, 114565 edges, 239 markings/sec, 125 secs
lola: sara is running 130 secs || 35191 markings, 118498 edges, 191 markings/sec, 130 secs
lola: sara is running 135 secs || 36291 markings, 122332 edges, 220 markings/sec, 135 secs
lola: sara is running 140 secs || 37455 markings, 126159 edges, 233 markings/sec, 140 secs
lola: sara is running 145 secs || 38472 markings, 130357 edges, 203 markings/sec, 145 secs
lola: sara is running 150 secs || 39511 markings, 134846 edges, 208 markings/sec, 150 secs
lola: sara is running 155 secs || 40514 markings, 138269 edges, 201 markings/sec, 155 secs
lola: sara is running 160 secs || 41538 markings, 141580 edges, 205 markings/sec, 160 secs
lola: sara is running 165 secs || 42534 markings, 145127 edges, 199 markings/sec, 165 secs
lola: sara is running 170 secs || 43497 markings, 148576 edges, 193 markings/sec, 170 secs
lola: sara is running 175 secs || 44315 markings, 151544 edges, 164 markings/sec, 175 secs
lola: sara is running 180 secs || 45253 markings, 154910 edges, 188 markings/sec, 180 secs
lola: sara is running 185 secs || 46168 markings, 158536 edges, 183 markings/sec, 185 secs
lola: sara is running 190 secs || 47014 markings, 161867 edges, 169 markings/sec, 190 secs
lola: sara is running 195 secs || 48009 markings, 165836 edges, 199 markings/sec, 195 secs
lola: sara is running 200 secs || 49031 markings, 169954 edges, 204 markings/sec, 200 secs
lola: sara is running 205 secs || 49924 markings, 173393 edges, 179 markings/sec, 205 secs
lola: sara is running 210 secs || 50857 markings, 175979 edges, 187 markings/sec, 210 secs
lola: sara is running 215 secs || 51760 markings, 179048 edges, 181 markings/sec, 215 secs
lola: sara is running 220 secs || 52810 markings, 182626 edges, 210 markings/sec, 220 secs
lola: sara is running 225 secs || 53694 markings, 186034 edges, 177 markings/sec, 225 secs
lola: sara is running 230 secs || 54643 markings, 189495 edges, 190 markings/sec, 230 secs
lola: sara is running 235 secs || 55596 markings, 192753 edges, 191 markings/sec, 235 secs
lola: sara is running 240 secs || 56415 markings, 195904 edges, 164 markings/sec, 240 secs
lola: sara is running 245 secs || 57132 markings, 198742 edges, 143 markings/sec, 245 secs
lola: sara is running 250 secs || 57969 markings, 202332 edges, 167 markings/sec, 250 secs
lola: sara is running 255 secs || 58901 markings, 206091 edges, 186 markings/sec, 255 secs
lola: sara is running 260 secs || 59855 markings, 209253 edges, 191 markings/sec, 260 secs
lola: sara is running 265 secs || 60831 markings, 212136 edges, 195 markings/sec, 265 secs
lola: sara is running 270 secs || 61744 markings, 215381 edges, 183 markings/sec, 270 secs
lola: sara is running 275 secs || 62593 markings, 218346 edges, 170 markings/sec, 275 secs
lola: sara is running 280 secs || 63499 markings, 221465 edges, 181 markings/sec, 280 secs
lola: sara is running 285 secs || 64382 markings, 225040 edges, 177 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND ((p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 240 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: sara is running 5 secs || 404 markings, 514 edges, 81 markings/sec, 5 secs
lola: sara is running 10 secs || 1088 markings, 1415 edges, 137 markings/sec, 10 secs
lola: sara is running 15 secs || 1766 markings, 2312 edges, 136 markings/sec, 15 secs
lola: sara is running 20 secs || 2517 markings, 3295 edges, 150 markings/sec, 20 secs
lola: sara is running 25 secs || 3278 markings, 4317 edges, 152 markings/sec, 25 secs
lola: sara is running 30 secs || 4011 markings, 5339 edges, 147 markings/sec, 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND ((p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) OR (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p8... (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 240 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 371 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 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) OR (p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 <= 2)... (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 240 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 1... (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 240 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p80... (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 240 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: sara is running 5 secs || 364 markings, 457 edges, 73 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (2 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 240 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 854 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 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + 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 240 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (3 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)) AND (p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + 1 <= p39 + 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 240 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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2546 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
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 240 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: sara is running 5 secs || 429 markings, 546 edges, 86 markings/sec, 5 secs
lola: sara is running 10 secs || 1097 markings, 1429 edges, 134 markings/sec, 10 secs
lola: sara is running 15 secs || 1759 markings, 2301 edges, 132 markings/sec, 15 secs
lola: sara is running 20 secs || 2544 markings, 3329 edges, 157 markings/sec, 20 secs
lola: sara is running 25 secs || 3448 markings, 4552 edges, 181 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no no unknown yes yes yes no no no yes yes yes
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496355789110

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_DrinkVendingMachine-COL-10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
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/S_DrinkVendingMachine-COL-10.tgz
mv S_DrinkVendingMachine-COL-10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_DrinkVendingMachine-COL-10, 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 r108-blw3-149441612200196"
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 ;