fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r180-tall-171640602500048
Last Updated
July 7, 2024

About the Execution of ITS-Tools for FlexibleBarrier-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16206.560 1752783.00 1804992.00 4567.80 [undef] Cannot compute

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.r180-tall-171640602500048.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 FlexibleBarrier-PT-08b, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602500048
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 241K May 18 16:42 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 1716418265124

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-22 22:51:06] [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-22 22:51:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:51:06] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-22 22:51:06] [INFO ] Transformed 920 places.
[2024-05-22 22:51:06] [INFO ] Transformed 1057 transitions.
[2024-05-22 22:51:06] [INFO ] Found NUPN structural information;
[2024-05-22 22:51:06] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 200 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 920/920 places, 1057/1057 transitions.
[2024-05-22 22:51:06] [INFO ] Redundant transitions in 60 ms returned []
Running 1056 sub problems to find dead transitions.
// Phase 1: matrix 1057 rows 920 cols
[2024-05-22 22:51:06] [INFO ] Computed 10 invariants in 28 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/919 variables, 919/919 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/919 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 1/920 variables, 10/929 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/920 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 920/1977 variables, and 930 constraints, problems are : Problem set: 0 solved, 1056 unsolved in 30043 ms.
Refiners :[Domain max(s): 920/920 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/920 constraints, PredecessorRefiner: 1056/1056 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1056 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/919 variables, 919/919 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/919 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 1/920 variables, 10/929 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/920 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
[2024-05-22 22:51:51] [INFO ] Deduced a trap composed of 54 places in 374 ms of which 49 ms to minimize.
[2024-05-22 22:51:51] [INFO ] Deduced a trap composed of 356 places in 277 ms of which 6 ms to minimize.
[2024-05-22 22:51:51] [INFO ] Deduced a trap composed of 85 places in 230 ms of which 4 ms to minimize.
[2024-05-22 22:51:51] [INFO ] Deduced a trap composed of 86 places in 229 ms of which 4 ms to minimize.
[2024-05-22 22:51:52] [INFO ] Deduced a trap composed of 85 places in 226 ms of which 4 ms to minimize.
[2024-05-22 22:51:52] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 4 ms to minimize.
[2024-05-22 22:51:52] [INFO ] Deduced a trap composed of 89 places in 180 ms of which 3 ms to minimize.
[2024-05-22 22:51:52] [INFO ] Deduced a trap composed of 285 places in 196 ms of which 4 ms to minimize.
[2024-05-22 22:51:52] [INFO ] Deduced a trap composed of 303 places in 197 ms of which 4 ms to minimize.
[2024-05-22 22:51:53] [INFO ] Deduced a trap composed of 307 places in 203 ms of which 4 ms to minimize.
[2024-05-22 22:51:53] [INFO ] Deduced a trap composed of 286 places in 183 ms of which 3 ms to minimize.
[2024-05-22 22:51:53] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-22 22:51:53] [INFO ] Deduced a trap composed of 304 places in 268 ms of which 5 ms to minimize.
[2024-05-22 22:51:54] [INFO ] Deduced a trap composed of 290 places in 254 ms of which 4 ms to minimize.
[2024-05-22 22:51:54] [INFO ] Deduced a trap composed of 291 places in 266 ms of which 5 ms to minimize.
[2024-05-22 22:51:54] [INFO ] Deduced a trap composed of 295 places in 269 ms of which 5 ms to minimize.
[2024-05-22 22:51:55] [INFO ] Deduced a trap composed of 288 places in 252 ms of which 4 ms to minimize.
[2024-05-22 22:51:55] [INFO ] Deduced a trap composed of 286 places in 261 ms of which 4 ms to minimize.
[2024-05-22 22:51:55] [INFO ] Deduced a trap composed of 328 places in 267 ms of which 4 ms to minimize.
[2024-05-22 22:51:55] [INFO ] Deduced a trap composed of 304 places in 253 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/920 variables, 20/950 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
[2024-05-22 22:51:56] [INFO ] Deduced a trap composed of 121 places in 91 ms of which 2 ms to minimize.
[2024-05-22 22:51:56] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 3 ms to minimize.
[2024-05-22 22:51:56] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:51:56] [INFO ] Deduced a trap composed of 280 places in 213 ms of which 4 ms to minimize.
[2024-05-22 22:51:57] [INFO ] Deduced a trap composed of 83 places in 249 ms of which 4 ms to minimize.
[2024-05-22 22:51:57] [INFO ] Deduced a trap composed of 319 places in 243 ms of which 5 ms to minimize.
[2024-05-22 22:51:57] [INFO ] Deduced a trap composed of 320 places in 252 ms of which 5 ms to minimize.
[2024-05-22 22:51:57] [INFO ] Deduced a trap composed of 284 places in 246 ms of which 4 ms to minimize.
[2024-05-22 22:51:58] [INFO ] Deduced a trap composed of 308 places in 254 ms of which 5 ms to minimize.
[2024-05-22 22:51:58] [INFO ] Deduced a trap composed of 282 places in 257 ms of which 5 ms to minimize.
[2024-05-22 22:51:58] [INFO ] Deduced a trap composed of 286 places in 229 ms of which 5 ms to minimize.
[2024-05-22 22:51:58] [INFO ] Deduced a trap composed of 290 places in 241 ms of which 4 ms to minimize.
[2024-05-22 22:51:59] [INFO ] Deduced a trap composed of 290 places in 240 ms of which 5 ms to minimize.
[2024-05-22 22:51:59] [INFO ] Deduced a trap composed of 331 places in 257 ms of which 5 ms to minimize.
[2024-05-22 22:51:59] [INFO ] Deduced a trap composed of 292 places in 257 ms of which 5 ms to minimize.
[2024-05-22 22:52:00] [INFO ] Deduced a trap composed of 306 places in 292 ms of which 5 ms to minimize.
[2024-05-22 22:52:00] [INFO ] Deduced a trap composed of 287 places in 271 ms of which 5 ms to minimize.
[2024-05-22 22:52:00] [INFO ] Deduced a trap composed of 357 places in 272 ms of which 5 ms to minimize.
[2024-05-22 22:52:00] [INFO ] Deduced a trap composed of 282 places in 243 ms of which 5 ms to minimize.
[2024-05-22 22:52:01] [INFO ] Deduced a trap composed of 286 places in 246 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/920 variables, 20/970 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
[2024-05-22 22:52:02] [INFO ] Deduced a trap composed of 294 places in 184 ms of which 4 ms to minimize.
[2024-05-22 22:52:02] [INFO ] Deduced a trap composed of 281 places in 181 ms of which 3 ms to minimize.
[2024-05-22 22:52:02] [INFO ] Deduced a trap composed of 284 places in 167 ms of which 3 ms to minimize.
[2024-05-22 22:52:02] [INFO ] Deduced a trap composed of 289 places in 151 ms of which 3 ms to minimize.
[2024-05-22 22:52:02] [INFO ] Deduced a trap composed of 296 places in 142 ms of which 3 ms to minimize.
[2024-05-22 22:52:02] [INFO ] Deduced a trap composed of 291 places in 152 ms of which 2 ms to minimize.
[2024-05-22 22:52:03] [INFO ] Deduced a trap composed of 292 places in 144 ms of which 3 ms to minimize.
[2024-05-22 22:52:03] [INFO ] Deduced a trap composed of 281 places in 178 ms of which 4 ms to minimize.
[2024-05-22 22:52:03] [INFO ] Deduced a trap composed of 289 places in 175 ms of which 3 ms to minimize.
[2024-05-22 22:52:03] [INFO ] Deduced a trap composed of 324 places in 176 ms of which 3 ms to minimize.
[2024-05-22 22:52:04] [INFO ] Deduced a trap composed of 279 places in 163 ms of which 3 ms to minimize.
[2024-05-22 22:52:05] [INFO ] Deduced a trap composed of 283 places in 187 ms of which 4 ms to minimize.
[2024-05-22 22:52:05] [INFO ] Deduced a trap composed of 283 places in 176 ms of which 4 ms to minimize.
[2024-05-22 22:52:06] [INFO ] Deduced a trap composed of 311 places in 162 ms of which 4 ms to minimize.
[2024-05-22 22:52:06] [INFO ] Deduced a trap composed of 287 places in 151 ms of which 3 ms to minimize.
[2024-05-22 22:52:06] [INFO ] Deduced a trap composed of 284 places in 150 ms of which 3 ms to minimize.
[2024-05-22 22:52:06] [INFO ] Deduced a trap composed of 278 places in 170 ms of which 3 ms to minimize.
[2024-05-22 22:52:06] [INFO ] Deduced a trap composed of 312 places in 167 ms of which 4 ms to minimize.
[2024-05-22 22:52:07] [INFO ] Deduced a trap composed of 280 places in 146 ms of which 3 ms to minimize.
[2024-05-22 22:52:07] [INFO ] Deduced a trap composed of 290 places in 173 ms of which 3 ms to minimize.
SMT process timed out in 60637ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 60675ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 60852 ms. Remains : 920/920 places, 1057/1057 transitions.
Final net has 920 places and 1057 transitions.
[2024-05-22 22:52:07] [INFO ] Flatten gal took : 124 ms
[2024-05-22 22:52:07] [INFO ] Applying decomposition
[2024-05-22 22:52:07] [INFO ] Flatten gal took : 66 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/graph10271449769371558530.txt' '-o' '/tmp/graph10271449769371558530.bin' '-w' '/tmp/graph10271449769371558530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10271449769371558530.bin' '-l' '-1' '-v' '-w' '/tmp/graph10271449769371558530.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:52:08] [INFO ] Decomposing Gal with order
[2024-05-22 22:52:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:52:08] [INFO ] Removed a total of 339 redundant transitions.
[2024-05-22 22:52:08] [INFO ] Flatten gal took : 157 ms
[2024-05-22 22:52:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 38 ms.
[2024-05-22 22:52:08] [INFO ] Time to serialize gal into /tmp/StateSpace184356332622591423.gal : 33 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/StateSpace184356332622591423.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 ...218
ITS-tools command line returned an error code 137
[2024-05-22 23:02:00] [INFO ] Applying decomposition
[2024-05-22 23:02:00] [INFO ] Flatten gal took : 43 ms
[2024-05-22 23:02:00] [INFO ] Decomposing Gal with order
[2024-05-22 23:02:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:02:00] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-22 23:02:00] [INFO ] Flatten gal took : 63 ms
[2024-05-22 23:02:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 205 labels/synchronizations in 37 ms.
[2024-05-22 23:02:00] [INFO ] Time to serialize gal into /tmp/StateSpace9597385063044051217.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/StateSpace9597385063044051217.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-22 23:10:02] [INFO ] Flatten gal took : 71 ms
[2024-05-22 23:10:02] [INFO ] Input system was already deterministic with 1057 transitions.
[2024-05-22 23:10:03] [INFO ] Transformed 920 places.
[2024-05-22 23:10:03] [INFO ] Transformed 1057 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-22 23:10:03] [INFO ] Time to serialize gal into /tmp/StateSpace16366076660291358983.gal : 5 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/StateSpace16366076660291358983.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 1751443 ms.

BK_STOP 1716420017907

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="FlexibleBarrier-PT-08b"
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 FlexibleBarrier-PT-08b, 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 r180-tall-171640602500048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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