About the Execution of 2018-Gold for DrinkVendingMachine-COL-10
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r077-smll-155234766300004.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is DrinkVendingMachine-COL-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r077-smll-155234766300004
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.5K Feb 10 22:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 10 22:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 6 20:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 6 20:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.8K Feb 4 23:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 3 07:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 3 07:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Jan 31 00:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jan 31 00:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 24K Mar 10 17:31 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-00
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-01
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-02
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-03
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-04
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-05
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-06
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-07
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-08
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-09
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-10
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-11
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-12
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-13
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-14
FORMULA_NAME DrinkVendingMachine-COL-10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1552400778043
info: Time: 3600 - MCC
===========================================================================================
prep: translating DrinkVendingMachine-COL-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating DrinkVendingMachine-COL-10 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ DrinkVendingMachine-COL-10 @ 3011 seconds
lola: LoLA will run for 3011 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: Size of bit vector: 3840
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-UpperBounds.task
lola: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) : MAX(p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) : MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) : MAX(p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89) : MAX(p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) : MAX(p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) : MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) : MAX(p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) : MAX(p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) : MAX(p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) : MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 52
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-10-UpperBounds-0 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 3 markings, 2 edges, 0 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 11 markings, 10 edges
FORMULA DrinkVendingMachine-COL-10-UpperBounds-1 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 203 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 52
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
lola:
========================================
FORMULA DrinkVendingMachine-COL-10-UpperBounds-3 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: processed formula length: 62
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 10
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 2 markings, 1 edges, 0 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 5 markings, 4 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-10-UpperBounds-5 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
FORMULA DrinkVendingMachine-COL-10-UpperBounds-6 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 3 markings, 2 edges, 0 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 11 markings, 10 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-10-UpperBounds-7 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: processed formula length: 62
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 10
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 2 markings, 1 edges, 0 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 5 markings, 4 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-10-UpperBounds-9 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 52
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
lola:
FORMULA DrinkVendingMachine-COL-10-UpperBounds-11 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 11 markings, 10 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-10-UpperBounds-12 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: processed formula length: 62
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 10
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 2 markings, 1 edges, 0 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 5 markings, 4 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-10-UpperBounds-13 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 11 markings, 10 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-10-UpperBounds-14 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)
lola: processed formula length: 242
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 0 markings, 0 edges
lola:
FORMULA DrinkVendingMachine-COL-10-UpperBounds-2 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 12 will run for 684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)
lola: processed formula length: 242
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 0 markings, 0 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-10-UpperBounds-8 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 911 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89)
lola: processed formula length: 242
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 124 markings, 153 edges, 25 markings/sec, 10 secs
lola: 679 markings, 841 edges, 111 markings/sec, 15 secs
lola: 1265 markings, 1587 edges, 117 markings/sec, 20 secs
lola: 1915 markings, 2415 edges, 130 markings/sec, 25 secs
lola: 2510 markings, 3170 edges, 119 markings/sec, 30 secs
lola: 3170 markings, 4014 edges, 132 markings/sec, 35 secs
lola: 3775 markings, 4783 edges, 121 markings/sec, 40 secs
lola: 4464 markings, 5670 edges, 138 markings/sec, 45 secs
lola: 5179 markings, 6584 edges, 143 markings/sec, 50 secs
lola: 5950 markings, 7568 edges, 154 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 6591 markings, 8399 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-10-UpperBounds-4 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89)
lola: processed formula length: 242
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 220 markings, 271 edges, 44 markings/sec, 10 secs
lola: 780 markings, 969 edges, 112 markings/sec, 15 secs
lola: 1401 markings, 1763 edges, 124 markings/sec, 20 secs
lola: 2027 markings, 2561 edges, 125 markings/sec, 25 secs
lola: 2629 markings, 3326 edges, 120 markings/sec, 30 secs
lola: 3282 markings, 4160 edges, 131 markings/sec, 35 secs
lola: 3928 markings, 4984 edges, 129 markings/sec, 40 secs
lola: 4622 markings, 5871 edges, 139 markings/sec, 45 secs
lola: 5373 markings, 6833 edges, 150 markings/sec, 50 secs
lola: 6116 markings, 7780 edges, 149 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 6591 markings, 8399 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-10-UpperBounds-10 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2606 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)
lola: processed formula length: 242
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-COL-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 0 markings, 0 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-10-UpperBounds-15 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 10 10 40 10 40 10 10 10 40 10 40 10 10 10 10 40
lola:
preliminary result: 10 10 40 10 40 10 10 10 40 10 40 10 10 10 10 40
lola: memory consumption: 7468840 KB
lola: time consumption: 409 seconds
BK_STOP 1552401747277
--------------------
content from stderr:
grep: GenericPropertiesVerdict.xml: No such file or directory
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="UpperBounds"
export BK_TOOL="win2018"
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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
echo " Input is DrinkVendingMachine-COL-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r077-smll-155234766300004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-10.tgz
mv DrinkVendingMachine-COL-10 execution
cd execution
if [ "UpperBounds" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "UpperBounds" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;