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.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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:49 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 14K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CSRepetitions-COL-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306500415
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526598310513

info: Time: 3600 - MCC
===========================================================================================
prep: translating CSRepetitions-COL-05 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating CSRepetitions-COL-05 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ CSRepetitions-COL-05 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 531/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6592
lola: finding significant places
lola: 206 places, 325 transitions, 176 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 501 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-COL-05-UpperBounds.task
lola: MAX(p150) : MAX(p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151) : MAX(p150) : MAX(p201 + p202 + p203 + p204 + p205) : MAX(p201 + p202 + p203 + p204 + p205) : MAX(p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151) : MAX(p201 + p202 + p203 + p204 + p205) : MAX(p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151) : MAX(p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) : MAX(p201 + p202 + p203 + p204 + p205) : MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p95 + p96 + p97 + p98 + p99) : MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p95 + p96 + p97 + p98 + p99) : MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p95 + p96 + p97 + p98 + p99) : MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p95 + p96 + p97 + p98 + p99)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p150)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p150)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CSRepetitions-COL-05-UpperBounds-0 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p150)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p150)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CSRepetitions-COL-05-UpperBounds-2 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p201 + p202 + p203 + p204 + p205)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p201 + p202 + p203 + p204 + p205)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CSRepetitions-COL-05-UpperBounds-3 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p201 + p202 + p203 + p204 + p205)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p201 + p202 + p203 + p204 + p205)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CSRepetitions-COL-05-UpperBounds-4 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p201 + p202 + p203 + p204 + p205)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p201 + p202 + p203 + p204 + p205)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CSRepetitions-COL-05-UpperBounds-6 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p201 + p202 + p203 + p204 + p205)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p201 + p202 + p203 + p204 + p205)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CSRepetitions-COL-05-UpperBounds-11 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151)
lola: processed formula length: 177
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: 25
lola: SUBRESULT
lola: result: 25
lola: produced by: state space
lola: The maximum value of the given expression is 25
lola: 26 markings, 25 edges
lola: ========================================

FORMULA CSRepetitions-COL-05-UpperBounds-1 25 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151)
lola: processed formula length: 177
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: 25
lola: SUBRESULT
lola: result: 25
lola: produced by: state space
lola: The maximum value of the given expression is 25
lola: 26 markings, 25 edges
lola: ========================================

FORMULA CSRepetitions-COL-05-UpperBounds-7 25 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151)
lola: processed formula length: 177
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: 25
lola: SUBRESULT
lola: result: 25
lola: produced by: state space
lola: The maximum value of the given expression is 25
lola: 26 markings, 25 edges
lola: ========================================

FORMULA CSRepetitions-COL-05-UpperBounds-8 25 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)
lola: processed formula length: 142
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: 25
lola: SUBRESULT
lola: result: 25
lola: produced by: state space
lola: The maximum value of the given expression is 25
lola: 0 markings, 0 edges

FORMULA CSRepetitions-COL-05-UpperBounds-9 25 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)
lola: processed formula length: 142
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: ========================================
lola: Structural Bound: 25
lola: SUBRESULT
lola: result: 25
lola: produced by: state space
lola: The maximum value of the given expression is 25
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CSRepetitions-COL-05-UpperBounds-10 25 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151)
lola: processed formula length: 177
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: 25
lola: SUBRESULT
lola: result: 25
lola: produced by: state space
lola: The maximum value of the given expression is 25
lola: 26 markings, 25 edges
lola: ========================================

FORMULA CSRepetitions-COL-05-UpperBounds-5 25 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 ... (shortened)
lola: processed formula length: 802
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 36 markings, 44 edges

FORMULA CSRepetitions-COL-05-UpperBounds-12 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 ... (shortened)
lola: processed formula length: 802
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: ========================================
lola: Structural Bound: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 36 markings, 44 edges

FORMULA CSRepetitions-COL-05-UpperBounds-13 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 ... (shortened)
lola: processed formula length: 802
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 36 markings, 44 edges
lola: ========================================

FORMULA CSRepetitions-COL-05-UpperBounds-14 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 ... (shortened)
lola: processed formula length: 802
lola: 0 rewrites
lola: closed formula file CSRepetitions-COL-05-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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 36 markings, 44 edges
lola: ========================================

FORMULA CSRepetitions-COL-05-UpperBounds-15 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 5 25 5 5 5 25 5 25 25 25 25 5 5 5 5 5
lola:
preliminary result: 5 25 5 5 5 25 5 25 25 25 25 5 5 5 5 5
lola: memory consumption: 19960 KB
lola: time consumption: 0 seconds

BK_STOP 1526598311689

--------------------
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="CSRepetitions-COL-05"
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/CSRepetitions-COL-05.tgz
mv CSRepetitions-COL-05 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 CSRepetitions-COL-05, 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 r028-ebro-152646306500415"
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 '' UpperBounds.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 ;