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 FlexibleBarrier-PT-06a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034100020
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496481391920


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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-06a: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
UpperBounds @ FlexibleBarrier-PT-06a @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 229/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 75 places, 154 transitions, 67 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 142 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-06a-UpperBounds.task
lola: MAX(p52) : MAX(p48) : MAX(p9) : MAX(p18) : MAX(p18) : MAX(p16) : MAX(p30) : MAX(p40) : MAX(p20) : MAX(p22) : MAX(p21) : MAX(p64) : MAX(p56) : MAX(p1) : MAX(p18) : MAX(p67)
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(p52)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1412481 markings, 2118473 edges, 282496 markings/sec, 0 secs
lola: 2601093 markings, 4680911 edges, 237722 markings/sec, 5 secs
lola: 2983201 markings, 8885603 edges, 76422 markings/sec, 10 secs
lola: 2985627 markings, 14031847 edges, 485 markings/sec, 15 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 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p48)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 882299 markings, 2056484 edges, 176460 markings/sec, 0 secs
lola: 1523410 markings, 4448755 edges, 128222 markings/sec, 5 secs
lola: 2095527 markings, 7386812 edges, 114423 markings/sec, 10 secs
lola: 2591814 markings, 10942815 edges, 99257 markings/sec, 15 secs
lola: 2962867 markings, 14366068 edges, 74211 markings/sec, 20 secs
lola: 2969657 markings, 17981898 edges, 1358 markings/sec, 25 secs
lola: 2973389 markings, 21442373 edges, 746 markings/sec, 30 secs
lola: 2985838 markings, 24984401 edges, 2490 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 2 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1398086 markings, 1997836 edges, 279617 markings/sec, 0 secs
lola: 2344205 markings, 3867057 edges, 189224 markings/sec, 5 secs
lola: 2949577 markings, 6275653 edges, 121074 markings/sec, 10 secs
lola: 2972987 markings, 9729063 edges, 4682 markings/sec, 15 secs
lola: 2982704 markings, 13642885 edges, 1943 markings/sec, 20 secs
lola: 2985715 markings, 18268718 edges, 602 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 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1240039 markings, 1896566 edges, 248008 markings/sec, 0 secs
lola: 2225387 markings, 3948132 edges, 197070 markings/sec, 5 secs
lola: 2964273 markings, 6364819 edges, 147777 markings/sec, 10 secs
lola: 2979798 markings, 10176565 edges, 3105 markings/sec, 15 secs
lola: 2984640 markings, 14294840 edges, 968 markings/sec, 20 secs
lola: 2985981 markings, 18948203 edges, 268 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 4 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1326183 markings, 2049510 edges, 265237 markings/sec, 0 secs
lola: 2341638 markings, 4234027 edges, 203091 markings/sec, 5 secs
lola: 2968078 markings, 6964145 edges, 125288 markings/sec, 10 secs
lola: 2980774 markings, 10749825 edges, 2539 markings/sec, 15 secs
lola: 2985032 markings, 14964370 edges, 852 markings/sec, 20 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 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p16)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1335547 markings, 1969888 edges, 267109 markings/sec, 0 secs
lola: 2343084 markings, 4019956 edges, 201507 markings/sec, 5 secs
lola: 2980243 markings, 6726353 edges, 127432 markings/sec, 10 secs
lola: 2984687 markings, 10653412 edges, 889 markings/sec, 15 secs
lola: 2985859 markings, 15387487 edges, 234 markings/sec, 20 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 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p30)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1276942 markings, 1962128 edges, 255388 markings/sec, 0 secs
lola: 2272316 markings, 4073613 edges, 199075 markings/sec, 5 secs
lola: 2966728 markings, 6737028 edges, 138882 markings/sec, 10 secs
lola: 2980550 markings, 10515895 edges, 2764 markings/sec, 15 secs
lola: 2985055 markings, 14824689 edges, 901 markings/sec, 20 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 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p40)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1203649 markings, 1741862 edges, 240730 markings/sec, 0 secs
lola: 2354013 markings, 4053711 edges, 230073 markings/sec, 5 secs
lola: 2981127 markings, 7339713 edges, 125423 markings/sec, 10 secs
lola: 2985121 markings, 12147929 edges, 799 markings/sec, 15 secs
lola: 2985971 markings, 17642852 edges, 170 markings/sec, 20 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 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p20)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1430419 markings, 2048140 edges, 286084 markings/sec, 0 secs
lola: 2523838 markings, 4303349 edges, 218684 markings/sec, 5 secs
lola: 2960780 markings, 7511091 edges, 87388 markings/sec, 10 secs
lola: 2979781 markings, 11971055 edges, 3800 markings/sec, 15 secs
lola: 2985484 markings, 17013125 edges, 1141 markings/sec, 20 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 467 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p22)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1406646 markings, 2139229 edges, 281329 markings/sec, 0 secs
lola: 2471019 markings, 4387087 edges, 212875 markings/sec, 5 secs
lola: 2958597 markings, 7477381 edges, 97516 markings/sec, 10 secs
lola: 2978753 markings, 11759494 edges, 4031 markings/sec, 15 secs
lola: 2985189 markings, 16565492 edges, 1287 markings/sec, 20 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 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p21)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1330385 markings, 1890331 edges, 266077 markings/sec, 0 secs
lola: 2382549 markings, 3958380 edges, 210433 markings/sec, 5 secs
lola: 2953299 markings, 6704345 edges, 114150 markings/sec, 10 secs
lola: 2975691 markings, 10516808 edges, 4478 markings/sec, 15 secs
lola: 2984424 markings, 15170367 edges, 1747 markings/sec, 20 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 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p64)
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1527849 markings, 2288547 edges, 305570 markings/sec, 0 secs
lola: 2697277 markings, 4845403 edges, 233886 markings/sec, 5 secs
lola: 2984137 markings, 8991721 edges, 57372 markings/sec, 10 secs
lola: 2985867 markings, 14519240 edges, 346 markings/sec, 15 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 798 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p56)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1470059 markings, 2134087 edges, 294012 markings/sec, 0 secs
lola: 2623512 markings, 4580815 edges, 230691 markings/sec, 5 secs
lola: 2970503 markings, 9237906 edges, 69398 markings/sec, 10 secs
lola: 2984427 markings, 15181157 edges, 2785 markings/sec, 15 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 1056 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1426342 markings, 2106194 edges, 285268 markings/sec, 0 secs
lola: 2506426 markings, 4366458 edges, 216017 markings/sec, 5 secs
lola: 2960640 markings, 7597599 edges, 90843 markings/sec, 10 secs
lola: 2978456 markings, 11565570 edges, 3563 markings/sec, 15 secs
lola: 2985174 markings, 16477000 edges, 1344 markings/sec, 20 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 1571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1291394 markings, 1988609 edges, 258279 markings/sec, 0 secs
lola: 2335861 markings, 4219578 edges, 208893 markings/sec, 5 secs
lola: 2968733 markings, 7071471 edges, 126574 markings/sec, 10 secs
lola: 2981630 markings, 11251202 edges, 2579 markings/sec, 15 secs
lola: 2985477 markings, 15847416 edges, 769 markings/sec, 20 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 3114 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p67)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1498687 markings, 2441966 edges, 299737 markings/sec, 0 secs
lola: 2626687 markings, 4975605 edges, 225600 markings/sec, 5 secs
lola: 2977722 markings, 9033424 edges, 70207 markings/sec, 10 secs
lola: 2985132 markings, 14237236 edges, 1482 markings/sec, 15 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 FlexibleBarrier-PT-06a-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-1 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-3 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-5 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA FlexibleBarrier-PT-06a-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496481839790

--------------------
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="FlexibleBarrier-PT-06a"
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/FlexibleBarrier-PT-06a.tgz
mv FlexibleBarrier-PT-06a 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 FlexibleBarrier-PT-06a, 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 r188-blw3-149581034100020"
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 ;