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 168K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K 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:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 12K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SharedMemory-COL-000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708742800009
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527104377759

info: Time: 3600 - MCC
===========================================================================================
prep: translating SharedMemory-COL-000010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating SharedMemory-COL-000010 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ SharedMemory-COL-000010 @ 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: 361/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 141
lola: finding significant places
lola: 141 places, 220 transitions, 120 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 260 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-COL-000010-UpperBounds.task
lola: LP says that atomic proposition is always false: (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 0)
lola: LP says that atomic proposition is always false: (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 0)
lola: MAX(p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131) : MAX(p100) : MAX(p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131) : MAX(p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) : MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) : MAX(p100) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p80 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p69 + p59 + p49 + p39 + p29 + p19 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p80 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p69 + p59 + p49 + p39 + p29 + p19 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) : MAX(p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131) : MAX(p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131) : MAX(p100) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p80 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p69 + p59 + p49 + p39 + p29 + p19 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p100) : MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110)
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(p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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 SharedMemory-COL-000010-UpperBounds-3 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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 SharedMemory-COL-000010-UpperBounds-9 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-UpperBounds-5 1 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(p100)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-UpperBounds-1 1 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(p100)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-UpperBounds-12 1 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(p100)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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: 11 markings, 10 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-UpperBounds-7 10 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(p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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 SharedMemory-COL-000010-UpperBounds-0 10 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(p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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 SharedMemory-COL-000010-UpperBounds-10 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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 SharedMemory-COL-000010-UpperBounds-11 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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: 11 markings, 10 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-UpperBounds-4 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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 SharedMemory-COL-000010-UpperBounds-2 10 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(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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: 11 markings, 10 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-UpperBounds-15 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 ... (shortened)
lola: processed formula length: 592
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 3 markings, 2 edges
lola:
FORMULA SharedMemory-COL-000010-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 ... (shortened)
lola: processed formula length: 592
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 3 markings, 2 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-UpperBounds-6 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 ... (shortened)
lola: processed formula length: 592
lola: 0 rewrites
lola: closed formula file SharedMemory-COL-000010-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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 3 markings, 2 edges
lola:
FORMULA SharedMemory-COL-000010-UpperBounds-8 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: RESULT
lola:
SUMMARY: 10 1 10 10 10 1 1 10 1 10 10 10 1 1 1 10
lola:
preliminary result: 10 1 10 10 10 1 1 10 1 10 10 10 1 1 1 10
lola: memory consumption: 19176 KB
lola: time consumption: 1 seconds

BK_STOP 1527104378282

--------------------
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="SharedMemory-COL-000010"
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/SharedMemory-COL-000010.tgz
mv SharedMemory-COL-000010 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 SharedMemory-COL-000010, 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 r172-smll-152708742800009"
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 ;