Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r251-smll-165303244900007.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is SimpleLoadBal-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r251-smll-165303244900007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 8.4K Apr 29 14:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 14:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 29 14:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 14:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7K May 9 09:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 09:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 09:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 09:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 535K May 10 09:34 model.pnml

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

=== Now, execution of the tool begins

BK_START 1653064701388

Running Version 0
[2022-05-20 16:38:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 16:38:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 16:38:24] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2022-05-20 16:38:24] [INFO ] Transformed 104 places.
[2022-05-20 16:38:24] [INFO ] Transformed 605 transitions.
[2022-05-20 16:38:24] [INFO ] Found NUPN structural information;
[2022-05-20 16:38:24] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10]
[2022-05-20 16:38:24] [INFO ] Parsed PT model containing 104 places and 605 transitions in 227 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
FORMULA SimpleLoadBal-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 475 out of 605 initially.
// Phase 1: matrix 475 rows 104 cols
[2022-05-20 16:38:24] [INFO ] Computed 29 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 15) seen :14
FORMULA SimpleLoadBal-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
[2022-05-20 16:38:25] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2022-05-20 16:38:25] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-20 16:38:25] [INFO ] [Real]Absence check using 25 positive place invariants in 18 ms returned sat
[2022-05-20 16:38:25] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-20 16:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 16:38:25] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2022-05-20 16:38:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 16:38:25] [INFO ] [Nat]Absence check using 25 positive place invariants in 14 ms returned sat
[2022-05-20 16:38:25] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 6 ms returned sat
[2022-05-20 16:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 16:38:25] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2022-05-20 16:38:26] [INFO ] State equation strengthened by 221 read => feed constraints.
[2022-05-20 16:38:26] [INFO ] [Nat]Added 221 Read/Feed constraints in 130 ms returned sat
[2022-05-20 16:38:26] [INFO ] Deduced a trap composed of 14 places in 313 ms of which 5 ms to minimize.
[2022-05-20 16:38:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 433 ms
[2022-05-20 16:38:26] [INFO ] Computed and/alt/rep : 20/40/20 causal constraints (skipped 445 transitions) in 199 ms.
[2022-05-20 16:38:27] [INFO ] Added : 20 causal constraints over 4 iterations in 603 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 104 places. Attempting structural reductions.
Drop transitions removed 55 transitions
Starting structural reductions, iteration 0 : 104/104 places, 550/550 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 163 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 95 transition count 385
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 41 place count 75 transition count 375
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 61 place count 65 transition count 365
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 71 place count 65 transition count 355
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 81 place count 55 transition count 355
Applied a total of 81 rules in 152 ms. Remains 55 /104 variables (removed 49) and now considering 355/550 (removed 195) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/104 places, 355/550 transitions.
Normalized transition count is 277 out of 355 initially.
// Phase 1: matrix 277 rows 55 cols
[2022-05-20 16:38:30] [INFO ] Computed 19 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6786 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1438 ms. (steps per millisecond=695 ) properties (out of 1) seen :0
[2022-05-20 16:38:38] [INFO ] Flow matrix only has 277 transitions (discarded 78 similar events)
// Phase 1: matrix 277 rows 55 cols
[2022-05-20 16:38:38] [INFO ] Computed 19 place invariants in 20 ms
[2022-05-20 16:38:38] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2022-05-20 16:38:38] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-20 16:38:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 16:38:38] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2022-05-20 16:38:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 16:38:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2022-05-20 16:38:38] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 5 ms returned sat
[2022-05-20 16:38:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 16:38:38] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2022-05-20 16:38:38] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-05-20 16:38:39] [INFO ] [Nat]Added 143 Read/Feed constraints in 68 ms returned sat
[2022-05-20 16:38:39] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 2 ms to minimize.
[2022-05-20 16:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2022-05-20 16:38:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 267 transitions) in 77 ms.
[2022-05-20 16:38:39] [INFO ] Added : 0 causal constraints over 0 iterations in 125 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 91400 steps, including 862 resets, run finished after 575 ms. (steps per millisecond=158 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 355/355 transitions.
Applied a total of 0 rules in 26 ms. Remains 55 /55 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/55 places, 355/355 transitions.
Starting structural reductions, iteration 0 : 55/55 places, 355/355 transitions.
Applied a total of 0 rules in 20 ms. Remains 55 /55 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2022-05-20 16:38:40] [INFO ] Flow matrix only has 277 transitions (discarded 78 similar events)
// Phase 1: matrix 277 rows 55 cols
[2022-05-20 16:38:40] [INFO ] Computed 19 place invariants in 8 ms
[2022-05-20 16:38:40] [INFO ] Implicit Places using invariants in 140 ms returned [12, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 143 ms to find 2 implicit places.
[2022-05-20 16:38:40] [INFO ] Redundant transitions in 30 ms returned []
[2022-05-20 16:38:40] [INFO ] Flow matrix only has 277 transitions (discarded 78 similar events)
// Phase 1: matrix 277 rows 53 cols
[2022-05-20 16:38:40] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-20 16:38:40] [INFO ] Dead Transitions using invariants and state equation in 383 ms returned [177, 196, 215, 234, 253, 272, 291, 310, 329, 348]
Found 10 dead transitions using SMT.
Drop transitions removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions :[348, 329, 310, 291, 272, 253, 234, 215, 196, 177]
Starting structural reductions, iteration 1 : 53/55 places, 345/355 transitions.
Graph (complete) has 877 edges and 53 vertex of which 1 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.13 ms
Discarding 52 places :
Also discarding 345 output transitions
Drop transitions removed 345 transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 16 ms. Remains 1 /53 variables (removed 52) and now considering 0/345 (removed 345) transitions.
[2022-05-20 16:38:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 16:38:40] [INFO ] Implicit Places using invariants in 9 ms returned []
[2022-05-20 16:38:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 16:38:40] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1/55 places, 0/355 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA SimpleLoadBal-PT-10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.

BK_STOP 1653064721888

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="SimpleLoadBal-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is SimpleLoadBal-PT-10, 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 r251-smll-165303244900007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-10.tgz
mv SimpleLoadBal-PT-10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;