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 188K
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 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.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.6K 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 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 24K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DrinkVendingMachine-COL-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-blw3-152649949600327
=====================================================================

--------------------
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-00
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-01
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-02
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-03
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-04
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-05
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-06
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-07
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-08
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-09
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

=== Now, execution of the tool begins

BK_START 1527416643112


BK_STOP 1527417384237

--------------------
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 DrinkVendingMachine-COL-10 as instance name.
Using DrinkVendingMachine 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, 'State Machine': False, 'Marked Graph': False, 'Extended Free Choice': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 96637, 'Memory': 4847.84, 'Tool': 'itstools'}, {'Time': 97775, 'Memory': 4543.52, 'Tool': 'itstools'}, {'Time': 257952, 'Memory': 3843.61, 'Tool': 'gspn'}, {'Time': 488706, 'Memory': 6826.92, 'Tool': 'lola'}, {'Time': 1030009, 'Memory': 6778.27, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 5.05713132651055x far from the best tool itstools.
ReachabilityCardinality lola DrinkVendingMachine-COL-10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DrinkVendingMachine-COL-10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
DrinkVendingMachine-COL-10: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ DrinkVendingMachine-COL-10 @ 3149 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3149 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 (((1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND ((1 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)) AND (p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) AND (p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 <= 2)))) : A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR (3 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110)))) : A (G (((3 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR (1 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)))) : A (G (((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 + 1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 1) OR (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 2)))) : E (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))) : E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 0) AND ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) OR (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109))))) : E (F ((p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))) : E (F (((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) AND ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) OR (2 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) AND (3 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))) : E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 <= 2) AND (p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) AND (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 2)))) : E (F ((2 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) : A (G (((p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 0) OR (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)))) : A (G (TRUE)) : A (G ((((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) OR (2 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR (2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)) AND ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 <= 0) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110))))) : A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10))) : A (G ((3 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110))) : E (F (((p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= 0) AND ((p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) AND (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 195 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + ... (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 8 bytes per marking, with 4 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 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 || 2 markings, 1 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 86 markings, 85 edges
lola: ========================================
lola: subprocess 1 will run for 208 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR (3 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110))))
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 8 bytes per marking, with 4 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 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 || 2 markings, 1 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 222 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR (1 <= 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 8 bytes per marking, with 4 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 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 || 2 markings, 1 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 239 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p119 + p118 + p117... (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 8 bytes per marking, with 4 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 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: sara is running 5 secs || 3 markings, 2 edges, 0 markings/sec, 5 secs
lola: sara is running 10 secs || 4 markings, 3 edges, 0 markings/sec, 10 secs
lola: sara is running 15 secs || 6 markings, 5 edges, 0 markings/sec, 15 secs
lola: sara is running 20 secs || 9 markings, 8 edges, 1 markings/sec, 20 secs
lola: sara is running 25 secs || 14 markings, 13 edges, 1 markings/sec, 25 secs
lola: sara is running 30 secs || 21 markings, 20 edges, 1 markings/sec, 30 secs
lola: sara is running 35 secs || 24 markings, 23 edges, 1 markings/sec, 35 secs
lola: sara is running 40 secs || 26 markings, 25 edges, 0 markings/sec, 40 secs
lola: sara is running 45 secs || 29 markings, 28 edges, 1 markings/sec, 45 secs
lola: sara is running 50 secs || 32 markings, 31 edges, 1 markings/sec, 50 secs
lola: sara is running 55 secs || 35 markings, 34 edges, 1 markings/sec, 55 secs
lola: sara is running 60 secs || 38 markings, 37 edges, 1 markings/sec, 60 secs
lola: sara is running 65 secs || 41 markings, 40 edges, 1 markings/sec, 65 secs
lola: sara is running 70 secs || 45 markings, 44 edges, 1 markings/sec, 70 secs
lola: sara is running 75 secs || 50 markings, 49 edges, 1 markings/sec, 75 secs
lola: sara is running 80 secs || 55 markings, 54 edges, 1 markings/sec, 80 secs
lola: sara is running 85 secs || 65 markings, 64 edges, 2 markings/sec, 85 secs
lola: sara is running 90 secs || 88 markings, 87 edges, 5 markings/sec, 90 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 110 markings, 109 edges
lola: ========================================
lola: subprocess 4 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
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 8 bytes per marking, with 4 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 || 2 markings, 1 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75... (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 8 bytes per marking, with 4 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-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 || 2 markings, 1 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
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 8 bytes per marking, with 4 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-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 || 2 markings, 1 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) AND ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109... (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 8 bytes per marking, with 4 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-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 || 2 markings, 1 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 <= 2) AND (p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) AND (p19 ... (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 8 bytes per marking, with 4 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 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 || 2 markings, 1 edges, 0 markings/sec, 0 secs
lola: sara is running 5 secs || 5 markings, 4 edges, 1 markings/sec, 5 secs
lola: sara is running 10 secs || 9 markings, 8 edges, 1 markings/sec, 10 secs
lola: sara is running 15 secs || 12 markings, 11 edges, 1 markings/sec, 15 secs
lola: sara is running 20 secs || 16 markings, 15 edges, 1 markings/sec, 20 secs
lola: sara is running 25 secs || 20 markings, 19 edges, 1 markings/sec, 25 secs
lola: sara is running 30 secs || 24 markings, 23 edges, 1 markings/sec, 30 secs
lola: sara is running 35 secs || 28 markings, 27 edges, 1 markings/sec, 35 secs
lola: sara is running 40 secs || 32 markings, 31 edges, 1 markings/sec, 40 secs
lola: sara is running 45 secs || 36 markings, 35 edges, 1 markings/sec, 45 secs
lola: sara is running 50 secs || 40 markings, 39 edges, 1 markings/sec, 50 secs
lola: sara is running 55 secs || 44 markings, 43 edges, 1 markings/sec, 55 secs
lola: sara is running 60 secs || 49 markings, 48 edges, 1 markings/sec, 60 secs
lola: sara is running 65 secs || 53 markings, 52 edges, 1 markings/sec, 65 secs
lola: sara is running 70 secs || 57 markings, 56 edges, 1 markings/sec, 70 secs
lola: sara is running 75 secs || 62 markings, 61 edges, 1 markings/sec, 75 secs
lola: sara is running 80 secs || 67 markings, 66 edges, 1 markings/sec, 80 secs
lola: sara is running 85 secs || 75 markings, 74 edges, 2 markings/sec, 85 secs
lola: sara is running 90 secs || 86 markings, 85 edges, 2 markings/sec, 90 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 129 markings, 128 edges
lola: ========================================
lola: subprocess 9 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + 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 8 bytes per marking, with 4 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-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 || 2 markings, 1 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 10 will run for 481 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 0) OR (p60 + p61 + p6... (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 8 bytes per marking, with 4 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 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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 11 will run for 575 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-COL-10-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 719 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) OR (2 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR (2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)) AND ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 <= 0) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p119 + p118 + p117 + p116 + ... (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 8 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to 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: sara is running 5 secs || 6 markings, 5 edges, 1 markings/sec, 5 secs
lola: sara is running 10 secs || 14 markings, 13 edges, 2 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 13 will run for 954 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= 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 8 bytes per marking, with 4 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 || 2 markings, 1 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 14 will run for 1428 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110)))
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 8 bytes per marking, with 4 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-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 15 will run for 2850 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 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= 0) AND ((p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 +... (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 8 bytes per marking, with 4 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-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 124 markings, 123 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes yes yes yes yes yes no yes no no no 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 FALSE 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 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-6 TRUE 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 TRUE 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 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-14 FALSE 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 stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DrinkVendingMachine-COL-10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-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/DrinkVendingMachine-COL-10.tgz
mv DrinkVendingMachine-COL-10 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 mcc4mcc-full"
echo " Input is 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 r082-blw3-152649949600327"
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 ;