About the Execution of LoLA for PermAdmissibility-COL-20
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K 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 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 54K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PermAdmissibility-COL-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469500457
=====================================================================
--------------------
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 PermAdmissibility-COL-20-UpperBounds-00
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-01
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-02
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-03
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-04
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-05
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-06
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-07
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-08
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-09
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-10
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-11
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-12
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-13
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-14
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1527036245834
info: Time: 3600 - MCC
===========================================================================================
prep: translating PermAdmissibility-COL-20 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PermAdmissibility-COL-20 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ PermAdmissibility-COL-20 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6656
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-20-UpperBounds.task
lola: MAX(p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) : MAX(p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24) : MAX(p132) : MAX(p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34) : MAX(p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158) : MAX(p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83) : MAX(p84) : MAX(p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58) : MAX(p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16) : MAX(p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183) : MAX(p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) : MAX(p88 + p87 + p86 + p89 + p90 + p91 + p92 + p93) : MAX(p142) : MAX(p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175) : MAX(p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) : MAX(p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p132)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p132)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 301 markings, 300 edges
lola: ========================================
FORMULA PermAdmissibility-COL-20-UpperBounds-2 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p84)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p84)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 81 markings, 80 edges
lola: ========================================
FORMULA PermAdmissibility-COL-20-UpperBounds-6 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p142)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p142)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 221 markings, 220 edges
lola: ========================================
FORMULA PermAdmissibility-COL-20-UpperBounds-12 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 261 markings, 260 edges
lola: ========================================
FORMULA PermAdmissibility-COL-20-UpperBounds-3 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158)
lola: processed formula length: 58
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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 PermAdmissibility-COL-20-UpperBounds-4 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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: 41 markings, 40 edges
lola: ========================================
FORMULA PermAdmissibility-COL-20-UpperBounds-5 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 321 markings, 320 edges
lola: ========================================
FORMULA PermAdmissibility-COL-20-UpperBounds-1 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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: 201 markings, 200 edges
lola: ========================================
FORMULA PermAdmissibility-COL-20-UpperBounds-7 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)
lola: processed formula length: 49
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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: 181 markings, 180 edges
FORMULA PermAdmissibility-COL-20-UpperBounds-8 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183)
lola: processed formula length: 58
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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
FORMULA PermAdmissibility-COL-20-UpperBounds-9 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111)
lola: processed formula length: 58
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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: 141 markings, 140 edges
FORMULA PermAdmissibility-COL-20-UpperBounds-10 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 698 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p88 + p87 + p86 + p89 + p90 + p91 + p92 + p93)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p88 + p87 + p86 + p89 + p90 + p91 + p92 + p93)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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: 241 markings, 240 edges
lola: ========================================
FORMULA PermAdmissibility-COL-20-UpperBounds-11 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 872 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167)
lola: processed formula length: 58
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 301 markings, 300 edges
FORMULA PermAdmissibility-COL-20-UpperBounds-0 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1163 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175)
lola: processed formula length: 58
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 281 markings, 280 edges
FORMULA PermAdmissibility-COL-20-UpperBounds-13 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1745 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)
lola: processed formula length: 58
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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: 221 markings, 220 edges
FORMULA PermAdmissibility-COL-20-UpperBounds-14 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file PermAdmissibility-COL-20-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 321 markings, 320 edges
lola: ========================================
FORMULA PermAdmissibility-COL-20-UpperBounds-15 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 20 20 20 20 40 40 20 40 40 40 40 40 20 20 40 20
lola:
preliminary result: 20 20 20 20 40 40 20 40 40 40 40 40 20 20 40 20
lola: memory consumption: 20460 KB
lola: time consumption: 79 seconds
BK_STOP 1527036325083
--------------------
content from 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="PermAdmissibility-COL-20"
export BK_EXAMINATION="UpperBounds"
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/PermAdmissibility-COL-20.tgz
mv PermAdmissibility-COL-20 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 lola"
echo " Input is PermAdmissibility-COL-20, 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 r112-csrt-152666469500457"
echo "====================================================================="
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 ;