Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r246-tall-171654351700496.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is NeoElection-COL-8, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351700496
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.0K Apr 11 20:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 11 20:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 19:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 11 19:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 22:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 22:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 21:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 21:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 120K May 18 16:43 model.pnml

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

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

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1716684681258

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-8
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
StateSpace COL
Running Version 202405141337
[2024-05-26 00:51:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 00:51:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:51:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 00:51:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 00:51:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 625 ms
[2024-05-26 00:51:23] [INFO ] Detected 6 constant HL places corresponding to 5058 PT places.
[2024-05-26 00:51:23] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 10062 PT places and 34578.0 transition bindings in 33 ms.
[2024-05-26 00:51:23] [INFO ] Unfolded HLPN to a Petri net with 10062 places and 19858 transitions 113083 arcs in 217 ms.
[2024-05-26 00:51:23] [INFO ] Unfolded 0 HLPN properties in 0 ms.
Deduced a syphon composed of 9487 places in 51 ms
Reduce places removed 9551 places and 18965 transitions.
Reduce places removed 9 places and 0 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 502/502 places, 893/893 transitions.
[2024-05-26 00:51:23] [INFO ] Redundant transitions in 45 ms returned []
Running 885 sub problems to find dead transitions.
[2024-05-26 00:51:23] [INFO ] Flow matrix only has 844 transitions (discarded 49 similar events)
// Phase 1: matrix 844 rows 502 cols
[2024-05-26 00:51:23] [INFO ] Computed 135 invariants in 28 ms
[2024-05-26 00:51:23] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 2 (OVERLAPS) 64/502 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 56/135 constraints. Problems are: Problem set: 0 solved, 885 unsolved
[2024-05-26 00:51:43] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 29 ms to minimize.
[2024-05-26 00:51:44] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 3 ms to minimize.
[2024-05-26 00:51:44] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 4 ms to minimize.
[2024-05-26 00:51:44] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 3 ms to minimize.
[2024-05-26 00:51:44] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 3 ms to minimize.
[2024-05-26 00:51:45] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 3 ms to minimize.
[2024-05-26 00:51:45] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 2 ms to minimize.
[2024-05-26 00:51:45] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 3 ms to minimize.
[2024-05-26 00:51:45] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 3 ms to minimize.
[2024-05-26 00:51:45] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 3 ms to minimize.
[2024-05-26 00:51:46] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 3 ms to minimize.
[2024-05-26 00:51:46] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 4 ms to minimize.
[2024-05-26 00:51:46] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 3 ms to minimize.
[2024-05-26 00:51:46] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 3 ms to minimize.
[2024-05-26 00:51:46] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 3 ms to minimize.
[2024-05-26 00:51:47] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 2 ms to minimize.
[2024-05-26 00:51:47] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 2 ms to minimize.
[2024-05-26 00:51:47] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 3 ms to minimize.
[2024-05-26 00:51:47] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 3 ms to minimize.
[2024-05-26 00:51:47] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 885 unsolved
[2024-05-26 00:51:48] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 2 ms to minimize.
[2024-05-26 00:51:48] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 3 ms to minimize.
[2024-05-26 00:51:48] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 3 ms to minimize.
[2024-05-26 00:51:48] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 3 ms to minimize.
[2024-05-26 00:51:49] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 5 ms to minimize.
[2024-05-26 00:51:49] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 3 ms to minimize.
[2024-05-26 00:51:49] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 2 ms to minimize.
[2024-05-26 00:51:49] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 3 ms to minimize.
[2024-05-26 00:51:49] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 2 ms to minimize.
[2024-05-26 00:51:50] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 3 ms to minimize.
[2024-05-26 00:51:50] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 3 ms to minimize.
[2024-05-26 00:51:50] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 3 ms to minimize.
[2024-05-26 00:51:50] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 3 ms to minimize.
[2024-05-26 00:51:50] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 3 ms to minimize.
[2024-05-26 00:51:51] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 4 ms to minimize.
[2024-05-26 00:51:51] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 2 ms to minimize.
[2024-05-26 00:51:51] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 2 ms to minimize.
[2024-05-26 00:51:51] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 3 ms to minimize.
[2024-05-26 00:51:51] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 3 ms to minimize.
[2024-05-26 00:51:52] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 885 unsolved
[2024-05-26 00:51:52] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 3 ms to minimize.
[2024-05-26 00:51:52] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 3 ms to minimize.
[2024-05-26 00:51:52] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 3 ms to minimize.
[2024-05-26 00:51:53] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 2 ms to minimize.
[2024-05-26 00:51:53] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 3 ms to minimize.
[2024-05-26 00:51:53] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 2 ms to minimize.
[2024-05-26 00:51:53] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 2 ms to minimize.
[2024-05-26 00:51:53] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 3 ms to minimize.
[2024-05-26 00:51:53] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 3 ms to minimize.
[2024-05-26 00:51:54] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 2 ms to minimize.
[2024-05-26 00:51:54] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 2 ms to minimize.
[2024-05-26 00:51:54] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 2 ms to minimize.
[2024-05-26 00:51:54] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 3 ms to minimize.
[2024-05-26 00:51:54] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 3 ms to minimize.
[2024-05-26 00:51:55] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 2 ms to minimize.
[2024-05-26 00:51:55] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 2 ms to minimize.
[2024-05-26 00:51:55] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 3 ms to minimize.
SMT process timed out in 31680ms, After SMT, problems are : Problem set: 0 solved, 885 unsolved
Search for dead transitions found 0 dead transitions in 31739ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 31894 ms. Remains : 502/502 places, 893/893 transitions.
Final net has 502 places and 893 transitions.
[2024-05-26 00:51:55] [INFO ] Flatten gal took : 146 ms
[2024-05-26 00:51:55] [INFO ] Applying decomposition
[2024-05-26 00:51:55] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6486269338928834969.txt' '-o' '/tmp/graph6486269338928834969.bin' '-w' '/tmp/graph6486269338928834969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6486269338928834969.bin' '-l' '-1' '-v' '-w' '/tmp/graph6486269338928834969.weights' '-q' '0' '-e' '0.001'
[2024-05-26 00:51:56] [INFO ] Decomposing Gal with order
[2024-05-26 00:51:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 00:51:56] [INFO ] Removed a total of 54 redundant transitions.
[2024-05-26 00:51:56] [INFO ] Flatten gal took : 122 ms
[2024-05-26 00:51:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 12 ms.
[2024-05-26 00:51:56] [INFO ] Time to serialize gal into /tmp/StateSpace8001664889423390077.gal : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace8001664889423390077.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...219
ITS-tools command line returned an error code 137
[2024-05-26 01:03:06] [INFO ] Applying decomposition
[2024-05-26 01:03:06] [INFO ] Flatten gal took : 55 ms
[2024-05-26 01:03:06] [INFO ] Decomposing Gal with order
[2024-05-26 01:03:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 01:03:06] [INFO ] Removed a total of 3149 redundant transitions.
[2024-05-26 01:03:06] [INFO ] Flatten gal took : 108 ms
[2024-05-26 01:03:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-26 01:03:06] [INFO ] Time to serialize gal into /tmp/StateSpace6625787561075606362.gal : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace6625787561075606362.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...219
ITS-tools command line returned an error code 137
[2024-05-26 01:09:46] [INFO ] Flatten gal took : 55 ms
[2024-05-26 01:09:46] [INFO ] Input system was already deterministic with 893 transitions.
[2024-05-26 01:09:46] [INFO ] Transformed 502 places.
[2024-05-26 01:09:46] [INFO ] Transformed 893 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 01:09:46] [INFO ] Time to serialize gal into /tmp/StateSpace13592496933153480599.gal : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace13592496933153480599.gal' '-t' 'CGAL' '--stats' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...286
Successfully loaded order from file /home/mcc/execution/model.ord
ITS-tools command line returned an error code 137
Total runtime 1625125 ms.

BK_STOP 1716686307676

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="NeoElection-COL-8"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
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-5568"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-8, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654351700496"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-8.tgz
mv NeoElection-COL-8 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StateSpace.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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;