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-3253
Executing tool lola
Input is DES-PT-00a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309000227
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494625603027


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
UpperBounds @ DES-PT-00a @ 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: 191/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 115 places, 76 transitions, 58 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 101 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-00a-UpperBounds.task
lola: MAX(p64) : MAX(p21) : MAX(p18) : MAX(p33) : MAX(p3) : MAX(p3) : MAX(p105) : MAX(p29) : MAX(p91) : MAX(p45) : MAX(p34) : MAX(p113) : MAX(p67) : MAX(p30) : MAX(p38) : MAX(p43)
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(p64)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 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: 1462847 markings, 2360219 edges, 292569 markings/sec, 0 secs
lola: 2910638 markings, 4683962 edges, 289558 markings/sec, 5 secs
lola: 4305828 markings, 6969797 edges, 279038 markings/sec, 10 secs
lola: 5636204 markings, 9242300 edges, 266075 markings/sec, 15 secs
lola: 6806522 markings, 11601808 edges, 234064 markings/sec, 20 secs
lola: 7924554 markings, 13912794 edges, 223606 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 1 will run for 233 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 8 bytes per marking, with 6 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: 1224127 markings, 2399366 edges, 244825 markings/sec, 0 secs
lola: 2508150 markings, 4826508 edges, 256805 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p18)
lola: lola: ========================================
========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 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: 1295794 markings, 2482998 edges, 259159 markings/sec, 0 secs
lola: 2499929 markings, 4913068 edges, 240827 markings/sec, 5 secs
lola: 3605936 markings, 7334003 edges, 221201 markings/sec, 10 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 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p33)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 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: 1575327 markings, 2489018 edges, 315065 markings/sec, 0 secs
lola: 2856411 markings, 4887750 edges, 256217 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: subprocess 4 will run for 288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p3)
lola: ========================================
lola: SUBTASKlola:
========================================
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 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: 1223719 markings, 2539376 edges, 244744 markings/sec, 0 secs
lola: 2348137 markings, 4937523 edges, 224884 markings/sec, 5 secs
lola: 3372169 markings, 7317383 edges, 204806 markings/sec, 10 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 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 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: 1171875 markings, 2434786 edges, 234375 markings/sec, 0 secs
lola: 2335338 markings, 4908359 edges, 232693 markings/sec, 5 secs
lola: 3406391 markings, 7404041 edges, 214211 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 6 will run for 342 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p105)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 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: 987636 markings, 2594005 edges, 197527 markings/sec, 0 secs
lola: 1941478 markings, 5230443 edges, 190768 markings/sec, 5 secs
lola: 2914852 markings, 7888078 edges, 194675 markings/sec, 10 secs
lola: 3857928 markings, 10551755 edges, 188615 markings/sec, 15 secs
lola: 4788101 markings, 13026115 edges, 186035 markings/sec, 20 secs
lola: 5535543 markings, 15607234 edges, 149488 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 7 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p29)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 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: 1192182 markings, 2465342 edges, 238436 markings/sec, 0 secs
lola: 2385627 markings, 4918969 edges, 238689 markings/sec, 5 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 422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p91)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 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: 1436861 markings, 2468250 edges, 287372 markings/sec, 0 secs
lola: 2778190 markings, 4873959 edges, 268266 markings/sec, 5 secs
lola: 4089271 markings, 7298554 edges, 262216 markings/sec, 10 secs
lola: 5307448 markings, 9724021 edges, 243635 markings/sec, 15 secs
lola: 6420732 markings, 12194519 edges, 222657 markings/sec, 20 secs
lola: 7455281 markings, 14577122 edges, 206910 markings/sec, 25 secs
lola: 8437328 markings, 16965720 edges, 196409 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 9 will run for 477 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p45)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 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: 1433599 markings, 2311565 edges, 286720 markings/sec, 0 secs
lola: 2879118 markings, 4633752 edges, 289104 markings/sec, 5 secs
lola: 4298756 markings, 6959496 edges, 283928 markings/sec, 10 secs
lola: 5649370 markings, 9268120 edges, 270123 markings/sec, 15 secs
lola: 6826183 markings, 11642683 edges, 235363 markings/sec, 20 secs
lola: 7949685 markings, 13967412 edges, 224700 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 10 will run for 551 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p34)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 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: 1586720 markings, 2508236 edges, 317344 markings/sec, 0 secs
lola: 2889924 markings, 4954350 edges, 260641 markings/sec, 5 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 659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p113)
lola: ========================================
lola: SUBTASK
lola: lola: ========================================
computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 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: 1242727 markings, 2498809 edges, 248545 markings/sec, 0 secs
lola: 2414219 markings, 4923224 edges, 234298 markings/sec, 5 secs
lola: 3547766 markings, 7339260 edges, 226709 markings/sec, 10 secs
lola: 4570006 markings, 9750119 edges, 204448 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 819 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 8 bytes per marking, with 6 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: 1484007 markings, 2381094 edges, 296801 markings/sec, 0 secs
lola: 2914290 markings, 4724509 edges, 286057 markings/sec, 5 secs
lola: 4304123 markings, 7063718 edges, 277967 markings/sec, 10 secs
lola: 5604862 markings, 9342196 edges, 260148 markings/sec, 15 secs
lola: 6791161 markings, 11742679 edges, 237260 markings/sec, 20 secs
lola: 7891031 markings, 14048505 edges, 219974 markings/sec, 25 secs
lola: 8937500 markings, 16362240 edges, 209294 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 13 will run for 1079 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 8 bytes per marking, with 6 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: 1299622 markings, 2571294 edges, 259924 markings/sec, 0 secs
lola: 2505129 markings, 5143903 edges, 241101 markings/sec, 5 secs
lola: 3727837 markings, 7763111 edges, 244542 markings/sec, 10 secs
lola: 4936551 markings, 10438918 edges, 241743 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: subprocess 14 will run for 1607 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p38)
lola: ========================================
lola: SUBTASK
lola: lola: computing bound of an expression========================================

lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 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: 1624906 markings, 2588606 edges, 324981 markings/sec, 0 secs
lola: 3000491 markings, 5096649 edges, 275117 markings/sec, 5 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 3202 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p43)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 6 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: 1488805 markings, 2409703 edges, 297761 markings/sec, 0 secs
lola: 2948343 markings, 4757157 edges, 291908 markings/sec, 5 secs
lola: 4380603 markings, 7104953 edges, 286452 markings/sec, 10 secs
lola: 5735897 markings, 9459030 edges, 271059 markings/sec, 15 secs
lola: 6904144 markings, 11869341 edges, 233649 markings/sec, 20 secs
lola: 8050093 markings, 14210946 edges, 229190 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: RESULT
lola:
SUMMARY: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
lola: ========================================
FORMULA DES-PT-00a-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-1 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-3 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-5 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA DES-PT-00a-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494625975506

--------------------
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="DES-PT-00a"
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/DES-PT-00a.tgz
mv DES-PT-00a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is DES-PT-00a, 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 r018-ebro-149436309000227"
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 ;