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.r268-smll-171654407100168.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 PermAdmissibility-PT-02, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407100168
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 11K Apr 12 09:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 09:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 12 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 268K Apr 12 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 12 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 12 09:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 575K Apr 12 09:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 336K 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 1716696449274

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-26 04:07:31] [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 04:07:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 04:07:31] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2024-05-26 04:07:31] [INFO ] Transformed 168 places.
[2024-05-26 04:07:31] [INFO ] Transformed 592 transitions.
[2024-05-26 04:07:31] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 432 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 168/168 places, 592/592 transitions.
[2024-05-26 04:07:31] [INFO ] Redundant transitions in 36 ms returned []
Running 588 sub problems to find dead transitions.
// Phase 1: matrix 592 rows 168 cols
[2024-05-26 04:07:32] [INFO ] Computed 32 invariants in 78 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 61/164 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-26 04:07:39] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 20 ms to minimize.
[2024-05-26 04:07:40] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-26 04:07:40] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-26 04:07:40] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-26 04:07:41] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2024-05-26 04:07:41] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 3 ms to minimize.
[2024-05-26 04:07:41] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 2 ms to minimize.
[2024-05-26 04:07:42] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 3 ms to minimize.
[2024-05-26 04:07:42] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 2 ms to minimize.
[2024-05-26 04:07:42] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 2 ms to minimize.
[2024-05-26 04:07:42] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 2 ms to minimize.
[2024-05-26 04:07:43] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 2 ms to minimize.
[2024-05-26 04:07:43] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 3 ms to minimize.
[2024-05-26 04:07:43] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-05-26 04:07:43] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 2 ms to minimize.
[2024-05-26 04:07:43] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 2 ms to minimize.
[2024-05-26 04:07:44] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 2 ms to minimize.
[2024-05-26 04:07:44] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 2 ms to minimize.
[2024-05-26 04:07:44] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 2 ms to minimize.
[2024-05-26 04:07:44] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-26 04:07:48] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-26 04:07:49] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 2 ms to minimize.
[2024-05-26 04:07:49] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 2 ms to minimize.
[2024-05-26 04:07:49] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 2 ms to minimize.
[2024-05-26 04:07:50] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 2 ms to minimize.
[2024-05-26 04:07:50] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 2 ms to minimize.
[2024-05-26 04:07:50] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 2 ms to minimize.
[2024-05-26 04:07:50] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 2 ms to minimize.
[2024-05-26 04:07:51] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 2 ms to minimize.
[2024-05-26 04:07:51] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 2 ms to minimize.
[2024-05-26 04:07:51] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2024-05-26 04:07:51] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2024-05-26 04:07:51] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 2 ms to minimize.
[2024-05-26 04:07:52] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 2 ms to minimize.
[2024-05-26 04:07:52] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 5 ms to minimize.
[2024-05-26 04:07:52] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 2 ms to minimize.
[2024-05-26 04:07:52] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2024-05-26 04:07:52] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 2 ms to minimize.
[2024-05-26 04:07:53] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 2 ms to minimize.
[2024-05-26 04:07:53] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-26 04:07:54] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-26 04:07:55] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 2 ms to minimize.
[2024-05-26 04:07:55] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 2 ms to minimize.
[2024-05-26 04:07:56] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 2 ms to minimize.
[2024-05-26 04:07:56] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 2 ms to minimize.
[2024-05-26 04:07:56] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 2 ms to minimize.
[2024-05-26 04:07:57] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 2 ms to minimize.
[2024-05-26 04:07:57] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 2 ms to minimize.
[2024-05-26 04:07:57] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 2 ms to minimize.
[2024-05-26 04:07:57] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 3 ms to minimize.
[2024-05-26 04:07:57] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 3 ms to minimize.
[2024-05-26 04:07:58] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 2 ms to minimize.
[2024-05-26 04:07:58] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 3 ms to minimize.
[2024-05-26 04:07:58] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 2 ms to minimize.
[2024-05-26 04:07:58] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 2 ms to minimize.
[2024-05-26 04:07:59] [INFO ] Deduced a trap composed of 35 places in 218 ms of which 2 ms to minimize.
[2024-05-26 04:07:59] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 3 ms to minimize.
[2024-05-26 04:07:59] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 3 ms to minimize.
[2024-05-26 04:07:59] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 2 ms to minimize.
[2024-05-26 04:08:00] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-26 04:08:00] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-26 04:08:01] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-26 04:08:02] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 2 ms to minimize.
[2024-05-26 04:08:02] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
[2024-05-26 04:08:02] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 1 ms to minimize.
[2024-05-26 04:08:03] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 2 ms to minimize.
[2024-05-26 04:08:03] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 2 ms to minimize.
[2024-05-26 04:08:03] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 2 ms to minimize.
[2024-05-26 04:08:04] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 1 ms to minimize.
SMT process timed out in 32182ms, After SMT, problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 32233ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 32480 ms. Remains : 168/168 places, 592/592 transitions.
Final net has 168 places and 592 transitions.
[2024-05-26 04:08:04] [INFO ] Flatten gal took : 165 ms
[2024-05-26 04:08:04] [INFO ] Applying decomposition
[2024-05-26 04:08:04] [INFO ] Flatten gal took : 84 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/graph13302542592357788546.txt' '-o' '/tmp/graph13302542592357788546.bin' '-w' '/tmp/graph13302542592357788546.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13302542592357788546.bin' '-l' '-1' '-v' '-w' '/tmp/graph13302542592357788546.weights' '-q' '0' '-e' '0.001'
[2024-05-26 04:08:05] [INFO ] Decomposing Gal with order
[2024-05-26 04:08:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 04:08:05] [INFO ] Removed a total of 745 redundant transitions.
[2024-05-26 04:08:05] [INFO ] Flatten gal took : 308 ms
[2024-05-26 04:08:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 490 labels/synchronizations in 60 ms.
[2024-05-26 04:08:05] [INFO ] Time to serialize gal into /tmp/StateSpace16025477102255172360.gal : 24 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/StateSpace16025477102255172360.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 ...220
Detected timeout of ITS tools.
[2024-05-26 04:28:17] [INFO ] Flatten gal took : 141 ms
[2024-05-26 04:28:17] [INFO ] Time to serialize gal into /tmp/StateSpace10425171856414643568.gal : 40 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/StateSpace10425171856414643568.gal' '-t' 'CGAL' '--stats' '--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 ...241
ITS-tools command line returned an error code 137
[2024-05-26 04:41:10] [INFO ] Flatten gal took : 76 ms
[2024-05-26 04:41:10] [INFO ] Input system was already deterministic with 592 transitions.
[2024-05-26 04:41:10] [INFO ] Transformed 168 places.
[2024-05-26 04:41:10] [INFO ] Transformed 592 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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 04:41:40] [INFO ] Time to serialize gal into /tmp/StateSpace17446675900846890578.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/StateSpace17446675900846890578.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 2734617 ms.

BK_STOP 1716699185800

--------------------
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="PermAdmissibility-PT-02"
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 PermAdmissibility-PT-02, 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 r268-smll-171654407100168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-02.tgz
mv PermAdmissibility-PT-02 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 ;