About the Execution of LoLA for QuasiCertifProtocol-COL-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
168.560 | 31541.00 | 22100.00 | 7808.40 | 7 49 7 7 3 7 7 7 7 49 7 3 3 3 7 1 | normal |
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 244K
-rw-r--r-- 1 mcc users 3.6K 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 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.4K 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.8K 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 9.7K 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 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 61K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-COL-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700016
=====================================================================
--------------------
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 QuasiCertifProtocol-COL-06-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1526905607649
info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-COL-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-COL-06 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ QuasiCertifProtocol-COL-06 @ 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: 386/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 151 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-06-UpperBounds.task
lola: MAX(p23 + p22 + p21 + p20 + p19 + p18 + p17) : MAX(p191 + p198 + p233 + p226 + p219 + p212 + p205 + p204 + p206 + p207 + p208 + p209 + p210 + p211 + p203 + p213 + p214 + p215 + p216 + p217 + p218 + p202 + p220 + p221 + p222 + p223 + p224 + p225 + p201 + p227 + p228 + p229 + p230 + p231 + p232 + p200 + p234 + p235 + p236 + p237 + p238 + p239 + p199 + p197 + p196 + p195 + p194 + p193 + p192) : MAX(p189 + p188 + p187 + p186 + p185 + p184 + p183) : MAX(p168 + p169 + p170 + p171 + p172 + p173 + p174) : MAX(p166) : MAX(p159 + p160 + p161 + p162 + p163 + p164 + p165) : MAX(p10 + p11 + p12 + p13 + p14 + p15 + p16) : MAX(p267 + p266 + p265 + p264 + p263 + p262 + p261) : MAX(p10 + p11 + p12 + p13 + p14 + p15 + p16) : MAX(p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p124 + p131 + p138 + p145 + p152 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132 + p130 + p129 + p128 + p127 + p126 + p125 + p123 + p122 + p121 + p120 + p119 + p118) : MAX(p23 + p22 + p21 + p20 + p19 + p18 + p17) : MAX(p166) : MAX(p166) : MAX(p268) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6) : MAX(p182)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p166)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p166)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 40 markings, 39 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-4 3 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(p166)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p166)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 40 markings, 39 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-11 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p166)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p166)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 40 markings, 39 edges
lola:
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-12 3 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(p268)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p268)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 4 markings, 3 edges
lola:
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-13 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p182)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p182)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 10 markings, 9 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p10 + p11 + p12 + p13 + p14 + p15 + p16)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p10 + p11 + p12 + p13 + p14 + p15 + p16)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 11 markings, 10 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-6 7 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(p267 + p266 + p265 + p264 + p263 + p262 + p261)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p267 + p266 + p265 + p264 + p263 + p262 + p261)
lola: processed formula length: 51
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 0 markings, 0 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-7 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p10 + p11 + p12 + p13 + p14 + p15 + p16)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p10 + p11 + p12 + p13 + p14 + p15 + p16)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 11 markings, 10 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-8 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p23 + p22 + p21 + p20 + p19 + p18 + p17)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p23 + p22 + p21 + p20 + p19 + p18 + p17)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 34 markings, 33 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-10 7 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(p189 + p188 + p187 + p186 + p185 + p184 + p183)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p189 + p188 + p187 + p186 + p185 + p184 + p183)
lola: processed formula length: 51
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 62 markings, 61 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-2 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p168 + p169 + p170 + p171 + p172 + p173 + p174)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p168 + p169 + p170 + p171 + p172 + p173 + p174)
lola: processed formula length: 51
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 48 markings, 47 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-3 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p23 + p22 + p21 + p20 + p19 + p18 + p17)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p23 + p22 + p21 + p20 + p19 + p18 + p17)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 34 markings, 33 edges
lola:
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-0 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 55 markings, 54 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-14 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p159 + p160 + p161 + p162 + p163 + p164 + p165)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p159 + p160 + p161 + p162 + p163 + p164 + p165)
lola: processed formula length: 51
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 27 markings, 26 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-5 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p191 + p198 + p233 + p226 + p219 + p212 + p205 + p204 + p206 + p207 + p208 + p209 + p210 + p211 + p203 + p213 + p214 + p215 + p216 + p217 + p218 + p202 + p220 + p221 + p222 + p223 + p224 + p225 + p201 + p227 + p228 + p229 + p230 + p231 + p232 + p200 + p234 + p235 + p236 + p237 + p238 + p239 + p199 + p197 + p196 + p195 + p194 + p193 + p192)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p191 + p198 + p233 + p226 + p219 + p212 + p205 + p204 + p206 + p207 + p208 + p209 + p210 + p211 + p203 + p213 + p214 + p215 + p216 + p217 + p218 + p202 + p220 + p221 + p222 + p223 + p224 + p225 + p201 + p227 + p228 + p229 + p230 + p231 + p232 + p200 + p234 + p235 + p236 + p237 + p238 + p239 + p199 + p197 + p196 + p195 + p194 + p193 + p192)
lola: processed formula length: 345
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 49
lola: SUBRESULT
lola: result: 49
lola: produced by: state space
lola: The maximum value of the given expression is 49
lola: 34 markings, 33 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-1 49 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p124 + p131 + p138 + p145 + p152 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132 + p130 + p129 + p128 + p127 + p126 + p125 + p123 + p122 + p121 + p120 + p119 + p118)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p124 + p131 + p138 + p145 + p152 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132 + p130 + p129 + p128 + p127 + p126 + p125 + p123 + p122 + p121 + p120 + p119 + p118)
lola: processed formula length: 345
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: 49
lola: SUBRESULT
lola: result: 49
lola: produced by: state space
lola: The maximum value of the given expression is 49
lola: 41 markings, 40 edges
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-9 49 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 7 49 7 7 3 7 7 7 7 49 7 3 3 3 7 1
lola:
preliminary result: 7 49 7 7 3 7 7 7 7 49 7 3 3 3 7 1
lola: ========================================
lola: memory consumption: 18596 KB
lola: time consumption: 7 seconds
BK_STOP 1526905639190
--------------------
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="QuasiCertifProtocol-COL-06"
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/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 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 QuasiCertifProtocol-COL-06, 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 r136-qhx2-152673578700016"
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 ;