fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r150-csrt-149443434600005
Last Updated
June 27, 2017

About the Execution of ITS-Tools for S_Raft-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
246.680 3002.00 5386.00 140.50 FTFFFTFFFFFFTFFF 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)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is S_Raft-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-csrt-149443434600005
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496650756148


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F(X(("u6.p25>=1")U(("u5.p21==0")||("u4.p18==1"))))))
Formula 0 simplified : !FX("u6.p25>=1" U ("u4.p18==1" | "u5.p21==0"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.044679,23516,1,0,838,189,455,856,190,591,2074
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Raft-PT-02-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F("u1.p2>=1"))U(("u2.p10==0")||("u2.p6==1"))))
Formula 1 simplified : !(F"u1.p2>=1" U ("u2.p6==1" | "u2.p10==0"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.046553,23840,1,0,838,189,475,856,197,591,2089
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Raft-PT-02-LTLCardinality-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("u1.p2>=2"))
Formula 2 simplified : !"u1.p2>=2"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.049074,23976,1,0,932,191,509,993,199,644,2356
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Raft-PT-02-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(F(G(G(("u6.p27==0")||("u7.p0==1")))))))
Formula 3 simplified : !FG("u6.p27==0" | "u7.p0==1")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.059742,24188,1,0,1610,193,538,1708,199,726,3900
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Raft-PT-02-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((G("u2.p6>=1"))U("u7.p0>=2"))))
Formula 4 simplified : !X(G"u2.p6>=1" U "u7.p0>=2")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.061601,24900,1,0,1616,193,552,1719,202,726,3953
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Raft-PT-02-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(G(("u3.p14==0")||("u4.p17==1")))))
Formula 5 simplified : !G("u3.p14==0" | "u4.p17==1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.07005,25156,1,0,2113,195,581,2326,206,820,5361
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Raft-PT-02-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("u4.p20==0")||("u6.p26==1")))
Formula 6 simplified : !("u4.p20==0" | "u6.p26==1")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.070604,25156,1,0,2113,195,589,2326,206,820,5370
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Raft-PT-02-LTLCardinality-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((("u7.p0==0")||("u3.p12==1")))
Formula 7 simplified : !("u3.p12==1" | "u7.p0==0")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.071087,25208,1,0,2113,195,597,2326,206,820,5379
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Raft-PT-02-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((("u7.p0==0")||("u2.p7==1")))
Formula 8 simplified : !("u2.p7==1" | "u7.p0==0")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.071564,25208,1,0,2113,195,603,2326,206,820,5387
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Raft-PT-02-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X(("u1.p3==0")||("u3.p13==1")))U(F(G("u2.p6>=2")))))
Formula 9 simplified : !(X("u1.p3==0" | "u3.p13==1") U FG"u2.p6>=2")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.076312,25416,1,0,2266,195,628,2529,206,823,5991
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Raft-PT-02-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(G(X(("u6.p26==0")||("u4.p16==1"))))))
Formula 10 simplified : !GX("u4.p16==1" | "u6.p26==0")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.083495,25732,1,0,2730,197,662,2998,208,875,7085
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Raft-PT-02-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(X(X(F(("u4.p17==0")||("u7.p0==1")))))))
Formula 11 simplified : !XXXF("u4.p17==0" | "u7.p0==1")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.084979,25764,1,0,2766,197,685,3054,208,881,7255
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Raft-PT-02-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((((("u2.p7==0")||("u1.p4==1"))U("u2.p6>=2"))U(F(F("u4.p16>=3")))))
Formula 12 simplified : !((("u1.p4==1" | "u2.p7==0") U "u2.p6>=2") U F"u4.p16>=3")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.090163,26032,1,0,3068,197,703,3451,210,894,8094
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Raft-PT-02-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(("u3.p12==0")||("u4.p18==1"))))
Formula 13 simplified : !X("u3.p12==0" | "u4.p18==1")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.090693,26032,1,0,3068,197,708,3451,210,894,8101
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Raft-PT-02-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F((G(("u6.p27==0")||("u3.p11==1")))U(G(("u5.p21==0")||("u2.p10==1"))))))
Formula 14 simplified : !F(G("u3.p11==1" | "u6.p27==0") U G("u2.p10==1" | "u5.p21==0"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.101862,26488,1,0,4042,199,757,4491,212,964,10240
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Raft-PT-02-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X((G(("u5.p21==0")||("u7.p0==1")))U(X(("u1.p2==0")||("u6.p26==1"))))))
Formula 15 simplified : !X(G("u5.p21==0" | "u7.p0==1") U X("u1.p2==0" | "u6.p26==1"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.106869,28080,1,0,4137,199,769,4579,212,967,10532
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Raft-PT-02-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 52 rows 28 cols
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + 1'u3:p11 + 1'u3:p12 + 1'u3:p13 + 1'u3:p14 + 1'u3:p15= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + 1'u4:p16 + 1'u4:p17 + 1'u4:p18 + 1'u4:p19 + 1'u4:p20= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + 1'u2:p6 + 1'u2:p7 + 1'u2:p8 + 1'u2:p9 + 1'u2:p10= 0
invariant : 1'u1:p1 + 1'u1:p2 + 1'u1:p3 + 1'u1:p4 + 1'u1:p5 + 1'u7:p0= 1
Exit code :0

BK_STOP 1496650759150

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLCardinality -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 05, 2017 8:19:17 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 05, 2017 8:19:17 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 66 ms
Jun 05, 2017 8:19:17 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 28 places.
Jun 05, 2017 8:19:18 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 52 transitions.
Jun 05, 2017 8:19:18 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 05, 2017 8:19:18 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 05, 2017 8:19:18 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 05, 2017 8:19:18 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 33 ms
Jun 05, 2017 8:19:18 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 05, 2017 8:19:18 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 18 redundant transitions.
Jun 05, 2017 8:19:18 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 8 ms
Jun 05, 2017 8:19:18 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 05, 2017 8:19:18 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 4 place invariants in 13 ms
Jun 05, 2017 8:19:18 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
built 10 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t51, u3.t11, u3.t12, u3.t13, u3.t14, u3.t16, u4.t5, u4.t6, u4.t7, u4.t8, u4.t10, u6.t49, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :10/32/10/52

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_Raft-PT-02"
export BK_EXAMINATION="LTLCardinality"
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/S_Raft-PT-02.tgz
mv S_Raft-PT-02 execution

# this is for BenchKit: explicit launching of the test

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