fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r272-smll-152749149000242
Last Updated
June 26, 2018

About the Execution of ITS-Tools for BusinessProcesses-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15752.700 6420.00 13617.00 388.50 T normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 3.4K May 29 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 29 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 28 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 28 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 28 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 28 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.3K May 27 05:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 27 05:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 26 06:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 26 06:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 3 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 100K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is BusinessProcesses-PT-07, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r272-smll-152749149000242

=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityDeadlock-0

=== Now, execution of the tool begins

BK_START 1527885743603

Flatten gal took : 224 ms
Constant places removed 2 places and 1 transitions.
Performed 225 Post agglomeration using F-continuation condition.
Iterating post reduction 0 with 227 rules applied. Total rules applied 227 place count 384 transition count 134
Constant places removed 239 places and 2 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 466 place count 145 transition count 132
Constant places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 467 place count 144 transition count 132
Performed 19 Pre agglomeration using Quasi-Persistent + HF-interchangeable + Divergent Free condition.
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 467 place count 144 transition count 113
Constant places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 486 place count 125 transition count 113
Symmetric choice reduction at 4 with 4 rule applications. Total rules 490 place count 125 transition count 113
Constant places removed 4 places and 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 494 place count 121 transition count 109
Performed 5 Post agglomeration using F-continuation condition.
Constant places removed 5 places and 0 transitions.
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 500 place count 116 transition count 103
Performed 2 Post agglomeration using F-continuation condition.
Constant places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 502 place count 114 transition count 104
Applied a total of 502 rules in 97 ms. Remains 114 /386 variables (removed 272) and now considering 104/360 (removed 256) transitions.
// Phase 1: matrix 104 rows 114 cols
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityDeadlock.pnml.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityDeadlock.pnml.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 104 rows 114 cols
invariant :-1'p107 + -1'p109 + p110 + p112 = 0
invariant :p231 + p232 = 1
invariant :p196 + p197 = 1
invariant :p201 + p202 = 1
invariant :p352 + p353 + -1'p355 + -1'p356 = 0
invariant :p82 + -1'p94 + p95 + p97 + -1'p103 + p104 + p106 + p107 + p268 + p274 + p275 + p284 + p289 + p300 + p319 + p322 + p327 + p331 + p335 + p339 + p343 + p347 + p351 + p355 + p356 + p361 + p370 + p376 + p383 + p385 = 1
invariant :p181 + p182 = 1
invariant :p359 + p361 + -1'p365 + -1'p367 = 0
invariant :p49 + p300 = 1
invariant :p268 + p274 + p275 + p284 + p289 + p300 + p316 + p319 + p322 + p327 + p331 + p335 + p339 + p343 + p347 + p351 + p355 + p356 + p365 + p367 + p371 + p373 + p377 + p379 + p383 + p385 = 1
invariant :p216 + p217 = 1
invariant :p131 + p335 = 1
invariant :p241 + p242 = 1
invariant :p39 + p47 + p355 = 1
invariant :p58 + p66 + p69 = 1
invariant :p71 + p82 + p88 + p97 + p106 + p107 + p109 + p115 + p319 + -1'p364 + p365 + p367 + p371 + -1'p382 + p383 + p385 = 1
invariant :p226 + p227 = 1
invariant :p33 + p37 + p202 + -1'p207 + -1'p212 + p217 + p327 + -1'p335 + -1'p353 + p356 = 1
invariant :p380 + p382 + -1'p383 + -1'p385 = 0
invariant :p374 + p376 + -1'p377 + -1'p379 = 0
invariant :p368 + p370 + -1'p371 + -1'p373 = 0
invariant :p82 + -1'p88 + -1'p94 + p100 + -1'p103 + p104 + p106 + -1'p109 + p112 + -1'p116 + p268 + p274 + p275 + p284 + p289 + p300 + p319 + 2'p322 + p327 + p331 + p335 + p339 + p343 + p347 + p351 + p355 + p356 + p361 + p365 + p370 + p376 + p377 + 2'p383 + p385 = 1
invariant :p362 + p364 + -1'p365 + -1'p367 = 0
invariant :p251 + p252 = 1
invariant :p191 + p192 = 1
invariant :p34 + -1'p37 + -1'p202 + p207 + p212 + -1'p217 + -1'p327 + p335 + p353 + -1'p356 = 0
invariant :p236 + p237 = 1
invariant :-1'p82 + p85 + p94 + -1'p97 + p103 + -1'p106 + -1'p107 + -1'p115 + p116 + p118 + -1'p268 + -1'p274 + -1'p275 + -1'p284 + -1'p289 + -1'p300 + -2'p319 + -1'p322 + -1'p327 + -1'p331 + -1'p335 + -1'p339 + -1'p343 + -1'p347 + -1'p351 + -1'p355 + -1'p356 + -1'p361 + p364 + -1'p365 + -1'p367 + -1'p370 + -1'p371 + -1'p376 + p382 + -2'p383 + -2'p385 = -1
invariant :p82 + p92 + -1'p103 + p104 + p106 + p107 + p268 + p274 + p275 + p284 + p289 + p300 + p319 + p322 + p327 + p331 + p335 + p339 + p343 + p347 + p351 + p355 + p356 + p361 + p370 + p376 + p383 + p385 = 1
invariant :p186 + p187 = 1
invariant :p149 + p347 = 1
invariant :p206 + p207 = 1
invariant :p137 + p339 = 1
invariant :p211 + p212 = 1
invariant :p143 + p343 = 1
invariant :p88 + p98 + p107 + p109 + -1'p112 + p116 + -1'p322 + -1'p365 + -1'p377 + -1'p383 = 0
invariant :p16 + p284 = 1
invariant :p256 + p257 = 1
invariant :p36 + p37 = 1
invariant :p221 + p222 = 1
invariant :p44 + -1'p47 + -1'p353 + p356 = 0
invariant :p125 + p331 = 1
invariant :p23 + p289 = 1
invariant :p101 + p103 + -1'p104 + -1'p106 = 0
invariant :p246 + p247 = 1
invariant :p119 + p327 = 1
invariant :p261 + p262 = 1
invariant :p113 + p115 + -1'p116 + -1'p118 = 0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.62886e+06,1.12882,36804,2,3178,5,201123,6,0,561,90353,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,141120,1.56052,36804,2,2251,7,201123,9,1,2898,90353,2

System contains 141120 deadlocks (shown below if less than --print-limit option) !
FORMULA BusinessProcesses-PT-07-ReachabilityDeadlock-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 141120 states ] showing 10 first states
[ p251=1 p247=1 p71=1 p257=1 p149=1 p262=1 p143=1 p231=1 p137=1 p216=1 p131=1 p39=1 p212=1 p125=1 p221=1 p201=1 p327=1 p242=1 p237=1 p182=1 p49=1 p187=1 p206=1 p16=1 p34=1 p192=1 p226=1 p37=1 p23=1 p197=1 p58=1 ]
[ p251=1 p247=1 p71=1 p257=1 p149=1 p262=1 p143=1 p231=1 p137=1 p216=1 p131=1 p39=1 p212=1 p125=1 p221=1 p201=1 p327=1 p242=1 p237=1 p182=1 p49=1 p187=1 p206=1 p16=1 p34=1 p192=1 p226=1 p37=1 p23=1 p196=1 p58=1 ]
[ p251=1 p247=1 p71=1 p257=1 p149=1 p262=1 p143=1 p231=1 p137=1 p216=1 p131=1 p39=1 p212=1 p125=1 p221=1 p201=1 p327=1 p242=1 p237=1 p182=1 p49=1 p187=1 p206=1 p16=1 p34=1 p192=1 p226=1 p37=1 p23=1 p66=1 p197=1 ]
[ p251=1 p247=1 p71=1 p257=1 p149=1 p262=1 p143=1 p231=1 p137=1 p216=1 p131=1 p39=1 p212=1 p125=1 p221=1 p201=1 p327=1 p242=1 p237=1 p182=1 p49=1 p187=1 p206=1 p16=1 p34=1 p192=1 p226=1 p37=1 p23=1 p66=1 p196=1 ]
[ p251=1 p247=1 p71=1 p257=1 p149=1 p262=1 p143=1 p231=1 p137=1 p216=1 p131=1 p39=1 p212=1 p125=1 p221=1 p201=1 p327=1 p242=1 p237=1 p182=1 p49=1 p187=1 p206=1 p16=1 p34=1 p192=1 p227=1 p37=1 p23=1 p197=1 p58=1 ]
[ p251=1 p247=1 p71=1 p257=1 p149=1 p262=1 p143=1 p231=1 p137=1 p216=1 p131=1 p39=1 p212=1 p125=1 p221=1 p201=1 p327=1 p242=1 p237=1 p182=1 p49=1 p187=1 p206=1 p16=1 p34=1 p192=1 p227=1 p37=1 p23=1 p196=1 p58=1 ]
[ p251=1 p247=1 p71=1 p257=1 p149=1 p262=1 p143=1 p231=1 p137=1 p216=1 p131=1 p39=1 p212=1 p125=1 p221=1 p201=1 p327=1 p242=1 p237=1 p182=1 p49=1 p187=1 p206=1 p16=1 p34=1 p192=1 p227=1 p37=1 p23=1 p66=1 p197=1 ]
[ p251=1 p247=1 p71=1 p257=1 p149=1 p262=1 p143=1 p231=1 p137=1 p216=1 p131=1 p39=1 p212=1 p125=1 p221=1 p201=1 p327=1 p242=1 p237=1 p182=1 p49=1 p187=1 p206=1 p16=1 p34=1 p192=1 p227=1 p37=1 p23=1 p66=1 p196=1 ]
[ p251=1 p247=1 p71=1 p257=1 p149=1 p262=1 p143=1 p231=1 p137=1 p216=1 p131=1 p39=1 p212=1 p125=1 p221=1 p201=1 p327=1 p242=1 p237=1 p182=1 p49=1 p187=1 p206=1 p16=1 p34=1 p191=1 p226=1 p37=1 p23=1 p197=1 p58=1 ]
[ p251=1 p247=1 p71=1 p257=1 p149=1 p262=1 p143=1 p231=1 p137=1 p216=1 p131=1 p39=1 p212=1 p125=1 p221=1 p201=1 p327=1 p242=1 p237=1 p182=1 p49=1 p187=1 p206=1 p16=1 p34=1 p191=1 p226=1 p37=1 p23=1 p196=1 p58=1 ]
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527885750023

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 01, 2018 8:42:25 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
Jun 01, 2018 8:42:25 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 8:42:26 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 109 ms
Jun 01, 2018 8:42:26 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 386 places.
Jun 01, 2018 8:42:26 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 360 transitions.
Jun 01, 2018 8:42:26 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 01, 2018 8:42:26 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 33 ms
Jun 01, 2018 8:42:26 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 216 ms
Jun 01, 2018 8:42:26 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.simple.gal : 13 ms
Jun 01, 2018 8:42:26 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 360 transitions.
Jun 01, 2018 8:42:27 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 2 ms
Jun 01, 2018 8:42:27 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 104 transitions.
Jun 01, 2018 8:42:27 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 48 place invariants in 23 ms
Jun 01, 2018 8:42:27 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 114 variables to be positive in 252 ms
Jun 01, 2018 8:42:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 104 transitions.
Jun 01, 2018 8:42:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/104 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 8:42:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 8:42:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 104 transitions.
Jun 01, 2018 8:42:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 8:42:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 104 transitions.
SMT solver raised 'unknown', retrying with same input.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:490)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Jun 01, 2018 8:42:28 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1661ms conformant to PINS in folder :/home/mcc/execution

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="BusinessProcesses-PT-07"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
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/BusinessProcesses-PT-07.tgz
mv BusinessProcesses-PT-07 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-07, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r272-smll-152749149000242"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.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 ;