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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_ResAllocation-PT-R003C015, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443432800083
=====================================================================

--------------------
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 ResAllocation-PT-R003C015-UpperBounds-0
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-1
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-10
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-11
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-12
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-13
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-14
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-15
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-2
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-3
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-4
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-5
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-6
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-7
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-8
FORMULA_NAME ResAllocation-PT-R003C015-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1496439827613


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_ResAllocation-PT-R003C015: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_ResAllocation-PT-R003C015: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
UpperBounds @ S_ResAllocation-PT-R003C015 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 150/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 90 places, 60 transitions, 45 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 105 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C015-UpperBounds.task
lola: MAX(p_0_2) : MAX(r_13_1) : MAX(p_0_2) : MAX(r_7_0) : MAX(r_8_2) : MAX(p_14_1) : MAX(r_9_2) : MAX(r_12_1) : MAX(p_13_2) : MAX(r_4_1) : MAX(p_9_1) : MAX(p_8_0) : MAX(p_7_2) : MAX(p_1_1) : MAX(p_4_0) : MAX(r_2_2)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_0_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 2114995 markings, 5031600 edges, 422999 markings/sec, 0 secs
lola: 4029512 markings, 9875021 edges, 382903 markings/sec, 5 secs
lola: 5580252 markings, 14745796 edges, 310148 markings/sec, 10 secs
lola: 6845608 markings, 19627904 edges, 253071 markings/sec, 15 secs
lola: 7884256 markings, 24247576 edges, 207730 markings/sec, 20 secs
lola: 8763275 markings, 28747930 edges, 175804 markings/sec, 25 secs
lola: 9615011 markings, 32681944 edges, 170347 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_13_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 2960716 markings, 5023322 edges, 592143 markings/sec, 0 secs
lola: 5083105 markings, 10585198 edges, 424478 markings/sec, 5 secs
lola: 6994286 markings, 16244108 edges, 382236 markings/sec, 10 secs
lola: 8667729 markings, 21700409 edges, 334689 markings/sec, 15 secs
lola: 10180952 markings, 27188799 edges, 302645 markings/sec, 20 secs
lola: 11518672 markings, 32417136 edges, 267544 markings/sec, 25 secs
lola: 12721459 markings, 37191404 edges, 240557 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_0_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 2219801 markings, 5204823 edges, 443960 markings/sec, 0 secs
lola: 4105768 markings, 10162319 edges, 377193 markings/sec, 5 secs
lola: 5622164 markings, 14930009 edges, 303279 markings/sec, 10 secs
lola: 6773121 markings, 19381378 edges, 230191 markings/sec, 15 secs
lola: 7771832 markings, 23727442 edges, 199742 markings/sec, 20 secs
lola: 8604406 markings, 27914608 edges, 166515 markings/sec, 25 secs
lola: 9465474 markings, 31738187 edges, 172214 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_7_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 1687146 markings, 4834797 edges, 337429 markings/sec, 0 secs
lola: 3241239 markings, 9765695 edges, 310819 markings/sec, 5 secs
lola: 4751851 markings, 14700803 edges, 302122 markings/sec, 10 secs
lola: 5766814 markings, 19936408 edges, 202993 markings/sec, 15 secs
lola: 6833307 markings, 25163466 edges, 213299 markings/sec, 20 secs
lola: 7972303 markings, 30501600 edges, 227799 markings/sec, 25 secs
lola: 8893352 markings, 35388265 edges, 184210 markings/sec, 30 secs
lola: 9722783 markings, 39641990 edges, 165886 markings/sec, 35 secs
lola: 10510379 markings, 44137509 edges, 157519 markings/sec, 40 secs
lola: 11217922 markings, 48025892 edges, 141509 markings/sec, 45 secs
lola: 11873213 markings, 51912819 edges, 131058 markings/sec, 50 secs
lola: 12812649 markings, 56030880 edges, 187887 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_8_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 1740843 markings, 5125598 edges, 348169 markings/sec, 0 secs
lola: 3378880 markings, 10177957 edges, 327607 markings/sec, 5 secs
lola: 4905979 markings, 15217650 edges, 305420 markings/sec, 10 secs
lola: 5901274 markings, 20168289 edges, 199059 markings/sec, 15 secs
lola: 6852826 markings, 24944012 edges, 190310 markings/sec, 20 secs
lola: 8075080 markings, 30584421 edges, 244451 markings/sec, 25 secs
lola: 9083833 markings, 35666880 edges, 201751 markings/sec, 30 secs
lola: 9829124 markings, 39839188 edges, 149058 markings/sec, 35 secs
lola: 10553396 markings, 43765857 edges, 144854 markings/sec, 40 secs
lola: 11372045 markings, 48461509 edges, 163730 markings/sec, 45 secs
lola: 12193822 markings, 53178283 edges, 164355 markings/sec, 50 secs
lola: 12860690 markings, 56971994 edges, 133374 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_14_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 3575213 markings, 5137121 edges, 715043 markings/sec, 0 secs
lola: 5903431 markings, 11260827 edges, 465644 markings/sec, 5 secs
lola: 7767112 markings, 17079118 edges, 372736 markings/sec, 10 secs
lola: 9487284 markings, 22503483 edges, 344034 markings/sec, 15 secs
lola: 11015150 markings, 28093375 edges, 305573 markings/sec, 20 secs
lola: 12401486 markings, 33647809 edges, 277267 markings/sec, 25 secs
lola: 13608115 markings, 38819728 edges, 241326 markings/sec, 30 secs
lola: 14917719 markings, 43757141 edges, 261921 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_9_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: ========================================
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 2040615 markings, 4998129 edges, 408123 markings/sec, 0 secs
lola: 3995380 markings, 10605039 edges, 390953 markings/sec, 5 secs
lola: 5361006 markings, 15632046 edges, 273125 markings/sec, 10 secs
lola: 6458243 markings, 20875598 edges, 219447 markings/sec, 15 secs
lola: 7468517 markings, 25531601 edges, 202055 markings/sec, 20 secs
lola: 8313624 markings, 29956720 edges, 169021 markings/sec, 25 secs
lola: 9191139 markings, 34369553 edges, 175503 markings/sec, 30 secs
lola: 10279244 markings, 39727185 edges, 217621 markings/sec, 35 secs
lola: 11044450 markings, 44285004 edges, 153041 markings/sec, 40 secs
lola: 12045804 markings, 49251178 edges, 200271 markings/sec, 45 secs
lola: 12854917 markings, 53524693 edges, 161823 markings/sec, 50 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_12_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 2543717 markings, 5118353 edges, 508743 markings/sec, 0 secs
lola: 4113382 markings, 10683785 edges, 313933 markings/sec, 5 secs
lola: 5333938 markings, 16195884 edges, 244111 markings/sec, 10 secs
lola: 6973550 markings, 21905087 edges, 327922 markings/sec, 15 secs
lola: 8372114 markings, 27373495 edges, 279713 markings/sec, 20 secs
lola: 9589221 markings, 32745490 edges, 243421 markings/sec, 25 secs
lola: 10723028 markings, 37825313 edges, 226761 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 8 will run for 395 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_13_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 3093859 markings, 5339314 edges, 618772 markings/sec, 0 secs
lola: 5088237 markings, 10625283 edges, 398876 markings/sec, 5 secs
lola: 7119027 markings, 16851207 edges, 406158 markings/sec, 10 secs
lola: 8791506 markings, 22945809 edges, 334496 markings/sec, 15 secs
lola: 10225964 markings, 28914116 edges, 286892 markings/sec, 20 secs
lola: 11468972 markings, 34420136 edges, 248602 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 9 will run for 447 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_4_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 2051339 markings, 5336640 edges, 410268 markings/sec, 0 secs
lola: 3441488 markings, 10971585 edges, 278030 markings/sec, 5 secs
lola: 4581882 markings, 16041383 edges, 228079 markings/sec, 10 secs
lola: 5615732 markings, 21160194 edges, 206770 markings/sec, 15 secs
lola: 6537578 markings, 25509236 edges, 184369 markings/sec, 20 secs
lola: 7460760 markings, 30033574 edges, 184636 markings/sec, 25 secs
lola: 8220910 markings, 34247229 edges, 152030 markings/sec, 30 secs
lola: 8901274 markings, 38401796 edges, 136073 markings/sec, 35 secs
lola: 9552736 markings, 42269565 edges, 130292 markings/sec, 40 secs
lola: 10144824 markings, 45633596 edges, 118418 markings/sec, 45 secs
lola: 10618637 markings, 48690386 edges, 94763 markings/sec, 50 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 10 will run for 512 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_9_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 2144810 markings, 5049039 edges, 428962 markings/sec, 0 secs
lola: 4177540 markings, 10580344 edges, 406546 markings/sec, 5 secs
lola: 5633564 markings, 15698895 edges, 291205 markings/sec, 10 secs
lola: 6820596 markings, 21139287 edges, 237406 markings/sec, 15 secs
lola: 7821214 markings, 25750799 edges, 200124 markings/sec, 20 secs
lola: 8612457 markings, 29703079 edges, 158249 markings/sec, 25 secs
lola: 9567979 markings, 34359189 edges, 191104 markings/sec, 30 secs
lola: 10596988 markings, 39590265 edges, 205802 markings/sec, 35 secs
lola: 11445642 markings, 44359350 edges, 169731 markings/sec, 40 secs
lola: 12404956 markings, 49048351 edges, 191863 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: subprocess 11 will run for 603 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_8_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 1947308 markings, 4651000 edges, 389462 markings/sec, 0 secs
lola: 3821727 markings, 9585660 edges, 374884 markings/sec, 5 secs
lola: 5218517 markings, 14294698 edges, 279358 markings/sec, 10 secs
lola: 6338857 markings, 19499191 edges, 224068 markings/sec, 15 secs
lola: 7335370 markings, 23962593 edges, 199303 markings/sec, 20 secs
lola: 8158819 markings, 27964738 edges, 164690 markings/sec, 25 secs
lola: 8962457 markings, 32048813 edges, 160728 markings/sec, 30 secs
lola: 9980761 markings, 36984086 edges, 203661 markings/sec, 35 secs
lola: 10792093 markings, 41424813 edges, 162266 markings/sec, 40 secs
lola: 11498508 markings, 45402235 edges, 141283 markings/sec, 45 secs
lola: 12429647 markings, 50102135 edges, 186228 markings/sec, 50 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 12 will run for 739 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_7_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 2388280 markings, 5486408 edges, 477656 markings/sec, 0 secs
lola: 4163036 markings, 10806504 edges, 354951 markings/sec, 5 secs
lola: 5618615 markings, 16353880 edges, 291116 markings/sec, 10 secs
lola: 6770424 markings, 21676332 edges, 230362 markings/sec, 15 secs
lola: 7803017 markings, 26537846 edges, 206519 markings/sec, 20 secs
lola: 8584544 markings, 30292379 edges, 156305 markings/sec, 25 secs
lola: 9458099 markings, 34736017 edges, 174711 markings/sec, 30 secs
lola: 10225417 markings, 38712365 edges, 153464 markings/sec, 35 secs
lola: 10973258 markings, 42770828 edges, 149568 markings/sec, 40 secs
lola: 11735611 markings, 47006854 edges, 152471 markings/sec, 45 secs
lola: 12596046 markings, 50795041 edges, 172087 markings/sec, 50 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 13 will run for 966 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_1_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 2286399 markings, 5627656 edges, 457280 markings/sec, 0 secs
lola: 4134350 markings, 10498299 edges, 369590 markings/sec, 5 secs
lola: 5672233 markings, 15283079 edges, 307577 markings/sec, 10 secs
lola: 6886380 markings, 19673180 edges, 242829 markings/sec, 15 secs
lola: 7857104 markings, 23838476 edges, 194145 markings/sec, 20 secs
lola: 8820806 markings, 27995589 edges, 192740 markings/sec, 25 secs
lola: 9610176 markings, 31906787 edges, 157874 markings/sec, 30 secs
lola: 10415086 markings, 35247326 edges, 160982 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 14 will run for 1429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_4_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 2456098 markings, 4918139 edges, 491220 markings/sec, 0 secs
lola: 4192941 markings, 10228166 edges, 347369 markings/sec, 5 secs
lola: 5675464 markings, 15221735 edges, 296505 markings/sec, 10 secs
lola: 6708895 markings, 20526121 edges, 206686 markings/sec, 15 secs
lola: 7806508 markings, 25405112 edges, 219523 markings/sec, 20 secs
lola: 8829982 markings, 30209757 edges, 204695 markings/sec, 25 secs
lola: 9703470 markings, 34402465 edges, 174698 markings/sec, 30 secs
lola: 10483048 markings, 38381928 edges, 155916 markings/sec, 35 secs
lola: 11247816 markings, 42384485 edges, 152954 markings/sec, 40 secs
lola: 11850540 markings, 45727705 edges, 120545 markings/sec, 45 secs
lola: 12397233 markings, 48648866 edges, 109339 markings/sec, 50 secs
lola: 12912852 markings, 51605773 edges, 103124 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 15 will run for 2796 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_2_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 0 unused bits
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: 2098228 markings, 5420328 edges, 419646 markings/sec, 0 secs
lola: 3954833 markings, 10404164 edges, 371321 markings/sec, 5 secs
lola: 5267959 markings, 15655075 edges, 262625 markings/sec, 10 secs
lola: 6364169 markings, 20473600 edges, 219242 markings/sec, 15 secs
lola: 7448835 markings, 24980183 edges, 216933 markings/sec, 20 secs
lola: 8342020 markings, 29284922 edges, 178637 markings/sec, 25 secs
lola: 9186461 markings, 33621230 edges, 168888 markings/sec, 30 secs
lola: 9881114 markings, 37499375 edges, 138931 markings/sec, 35 secs
lola: 10585867 markings, 40577797 edges, 140951 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: RESULT
lola:
SUMMARY: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
lola: ========================================
FORMULA ResAllocation-PT-R003C015-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-1 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-3 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-5 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496440618801

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_ResAllocation-PT-R003C015"
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/S_ResAllocation-PT-R003C015.tgz
mv S_ResAllocation-PT-R003C015 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_ResAllocation-PT-R003C015, 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 r148-csrt-149443432800083"
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 ;