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.r158-smll-171636266200112.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 Echo-PT-d03r03, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266200112
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 04:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 04:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 114K 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 1716469537472

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d03r03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-23 13:05:39] [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-23 13:05:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 13:05:40] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-05-23 13:05:40] [INFO ] Transformed 265 places.
[2024-05-23 13:05:40] [INFO ] Transformed 206 transitions.
[2024-05-23 13:05:40] [INFO ] Found NUPN structural information;
[2024-05-23 13:05:40] [INFO ] Parsed PT model containing 265 places and 206 transitions and 1252 arcs in 417 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 265/265 places, 206/206 transitions.
[2024-05-23 13:05:40] [INFO ] Redundant transitions in 10 ms returned []
Running 205 sub problems to find dead transitions.
// Phase 1: matrix 206 rows 265 cols
[2024-05-23 13:05:40] [INFO ] Computed 135 invariants in 42 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 20/257 variables, 24/299 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 20/319 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 65/384 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-23 13:05:46] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 37 ms to minimize.
[2024-05-23 13:05:46] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 3 ms to minimize.
[2024-05-23 13:05:47] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-23 13:05:47] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 3 ms to minimize.
[2024-05-23 13:05:47] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 3 ms to minimize.
[2024-05-23 13:05:47] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 3 ms to minimize.
[2024-05-23 13:05:47] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 3 ms to minimize.
[2024-05-23 13:05:47] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 3 ms to minimize.
[2024-05-23 13:05:47] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-05-23 13:05:47] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
[2024-05-23 13:05:48] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-23 13:05:48] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-23 13:05:48] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-05-23 13:05:48] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 3 ms to minimize.
[2024-05-23 13:05:48] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 2 ms to minimize.
[2024-05-23 13:05:48] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-23 13:05:48] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-05-23 13:05:49] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-05-23 13:05:49] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-05-23 13:05:49] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-23 13:05:51] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 3 ms to minimize.
[2024-05-23 13:05:51] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 3 ms to minimize.
[2024-05-23 13:05:51] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2024-05-23 13:05:51] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-23 13:05:51] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-05-23 13:05:51] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-23 13:05:52] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-23 13:05:52] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-23 13:05:52] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
[2024-05-23 13:05:52] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
[2024-05-23 13:05:52] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-05-23 13:05:52] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-23 13:05:52] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-23 13:05:53] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-23 13:05:53] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 2 ms to minimize.
[2024-05-23 13:05:53] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-23 13:05:53] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2024-05-23 13:05:53] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-23 13:05:53] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-23 13:05:53] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-23 13:05:54] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 1 ms to minimize.
[2024-05-23 13:05:54] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-23 13:05:54] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 3 ms to minimize.
[2024-05-23 13:05:55] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-05-23 13:05:55] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-23 13:05:55] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-05-23 13:05:55] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 3 ms to minimize.
[2024-05-23 13:05:56] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 2 ms to minimize.
[2024-05-23 13:05:56] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-23 13:05:56] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-23 13:05:56] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 3 ms to minimize.
[2024-05-23 13:05:56] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-23 13:05:56] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-23 13:05:57] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 3 ms to minimize.
[2024-05-23 13:05:57] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-23 13:05:57] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 16/440 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-23 13:05:59] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 3 ms to minimize.
[2024-05-23 13:05:59] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-05-23 13:05:59] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 3 ms to minimize.
[2024-05-23 13:05:59] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-05-23 13:05:59] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-23 13:05:59] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-23 13:06:00] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-23 13:06:01] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-23 13:06:04] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-23 13:06:04] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-23 13:06:04] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-23 13:06:05] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-23 13:06:05] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-23 13:06:05] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 6/454 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-23 13:06:06] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-23 13:06:06] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-05-23 13:06:06] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-23 13:06:07] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-23 13:06:07] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-05-23 13:06:08] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 6/460 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-23 13:06:09] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
[2024-05-23 13:06:09] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-23 13:06:09] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-23 13:06:10] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
SMT process timed out in 30496ms, After SMT, problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 30560ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 30766 ms. Remains : 265/265 places, 206/206 transitions.
Final net has 265 places and 206 transitions.
[2024-05-23 13:06:11] [INFO ] Flatten gal took : 190 ms
[2024-05-23 13:06:11] [INFO ] Applying decomposition
[2024-05-23 13:06:11] [INFO ] Flatten gal took : 58 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/graph7926879744231321501.txt' '-o' '/tmp/graph7926879744231321501.bin' '-w' '/tmp/graph7926879744231321501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7926879744231321501.bin' '-l' '-1' '-v' '-w' '/tmp/graph7926879744231321501.weights' '-q' '0' '-e' '0.001'
[2024-05-23 13:06:12] [INFO ] Decomposing Gal with order
[2024-05-23 13:06:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 13:06:12] [INFO ] Removed a total of 217 redundant transitions.
[2024-05-23 13:06:12] [INFO ] Flatten gal took : 147 ms
[2024-05-23 13:06:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 41 ms.
[2024-05-23 13:06:12] [INFO ] Time to serialize gal into /tmp/StateSpace7827809328675647970.gal : 38 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/StateSpace7827809328675647970.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-23 13:23:23] [INFO ] Applying decomposition
[2024-05-23 13:23:23] [INFO ] Flatten gal took : 71 ms
[2024-05-23 13:23:23] [INFO ] Decomposing Gal with order
[2024-05-23 13:23:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 13:23:24] [INFO ] Removed a total of 624 redundant transitions.
[2024-05-23 13:23:24] [INFO ] Flatten gal took : 73 ms
[2024-05-23 13:23:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-23 13:23:24] [INFO ] Time to serialize gal into /tmp/StateSpace11486474919946141132.gal : 26 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/StateSpace11486474919946141132.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
ITS-tools command line returned an error code 137
[2024-05-23 13:32:22] [INFO ] Flatten gal took : 25 ms
[2024-05-23 13:32:22] [INFO ] Input system was already deterministic with 206 transitions.
[2024-05-23 13:32:22] [INFO ] Transformed 265 places.
[2024-05-23 13:32:22] [INFO ] Transformed 206 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-23 13:32:52] [INFO ] Time to serialize gal into /tmp/StateSpace6592666010037167342.gal : 3 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/StateSpace6592666010037167342.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 ...285
Successfully loaded order from file /home/mcc/execution/model.ord
ITS-tools command line returned an error code 137
Total runtime 2409886 ms.

BK_STOP 1716471949787

--------------------
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="Echo-PT-d03r03"
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 Echo-PT-d03r03, 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 r158-smll-171636266200112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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