fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r576-smll-171734919900056
Last Updated
July 7, 2024

About the Execution of ITS-Tools for MedleyA-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
663.172 66400.00 89730.00 409.00 6.3107E+0007 ? 1 8 normal

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.r576-smll-171734919900056.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 MedleyA-PT-07, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919900056
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 82K Jun 2 16:33 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 1717356763499

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 19:32:46] [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-06-02 19:32:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:32:46] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2024-06-02 19:32:46] [INFO ] Transformed 145 places.
[2024-06-02 19:32:46] [INFO ] Transformed 287 transitions.
[2024-06-02 19:32:46] [INFO ] Found NUPN structural information;
[2024-06-02 19:32:46] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 431 ms.
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 2 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 143/143 places, 285/285 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
[2024-06-02 19:32:47] [INFO ] Redundant transitions in 27 ms returned []
Running 273 sub problems to find dead transitions.
// Phase 1: matrix 274 rows 143 cols
[2024-06-02 19:32:47] [INFO ] Computed 11 invariants in 26 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 140/140 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 3 (OVERLAPS) 3/143 variables, 6/151 constraints. Problems are: Problem set: 48 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 3/154 constraints. Problems are: Problem set: 48 solved, 225 unsolved
[2024-06-02 19:32:54] [INFO ] Deduced a trap composed of 46 places in 288 ms of which 32 ms to minimize.
[2024-06-02 19:32:54] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 3 ms to minimize.
[2024-06-02 19:32:54] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 3 ms to minimize.
[2024-06-02 19:32:54] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 3 ms to minimize.
[2024-06-02 19:32:54] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:32:54] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:32:55] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:32:55] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 3 ms to minimize.
[2024-06-02 19:32:55] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:32:55] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:32:55] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:32:55] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:32:55] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:32:55] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:32:56] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:32:56] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:32:56] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:32:56] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:32:56] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:32:56] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 20/174 constraints. Problems are: Problem set: 48 solved, 225 unsolved
[2024-06-02 19:32:57] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
[2024-06-02 19:32:57] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:32:57] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:32:57] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 4/178 constraints. Problems are: Problem set: 48 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/178 constraints. Problems are: Problem set: 48 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 274/417 variables, 143/321 constraints. Problems are: Problem set: 48 solved, 225 unsolved
[2024-06-02 19:33:02] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 3 ms to minimize.
[2024-06-02 19:33:02] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:33:03] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:33:03] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 4/325 constraints. Problems are: Problem set: 48 solved, 225 unsolved
[2024-06-02 19:33:06] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-06-02 19:33:06] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-06-02 19:33:06] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 3/328 constraints. Problems are: Problem set: 48 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/328 constraints. Problems are: Problem set: 48 solved, 225 unsolved
[2024-06-02 19:33:09] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/417 variables, 1/329 constraints. Problems are: Problem set: 48 solved, 225 unsolved
[2024-06-02 19:33:12] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 1/330 constraints. Problems are: Problem set: 48 solved, 225 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 0/330 constraints. Problems are: Problem set: 48 solved, 225 unsolved
At refinement iteration 15 (OVERLAPS) 0/417 variables, 0/330 constraints. Problems are: Problem set: 48 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 330 constraints, problems are : Problem set: 48 solved, 225 unsolved in 30035 ms.
Refiners :[Domain max(s): 143/143 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 48 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 140/140 constraints. Problems are: Problem set: 48 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 5/145 constraints. Problems are: Problem set: 48 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/145 constraints. Problems are: Problem set: 48 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 3/143 variables, 6/151 constraints. Problems are: Problem set: 48 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 3/154 constraints. Problems are: Problem set: 48 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 33/187 constraints. Problems are: Problem set: 48 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/187 constraints. Problems are: Problem set: 48 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 274/417 variables, 143/330 constraints. Problems are: Problem set: 48 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 225/555 constraints. Problems are: Problem set: 48 solved, 225 unsolved
[2024-06-02 19:33:24] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:33:26] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 3 ms to minimize.
[2024-06-02 19:33:27] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:33:27] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 2 ms to minimize.
[2024-06-02 19:33:28] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-06-02 19:33:28] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 2 ms to minimize.
[2024-06-02 19:33:28] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-06-02 19:33:28] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 8/563 constraints. Problems are: Problem set: 48 solved, 225 unsolved
[2024-06-02 19:33:36] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 3 ms to minimize.
[2024-06-02 19:33:36] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 3 ms to minimize.
[2024-06-02 19:33:39] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
[2024-06-02 19:33:39] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 4/567 constraints. Problems are: Problem set: 48 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 567 constraints, problems are : Problem set: 48 solved, 225 unsolved in 30023 ms.
Refiners :[Domain max(s): 143/143 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 225/273 constraints, Known Traps: 45/45 constraints]
After SMT, in 61072ms problems are : Problem set: 48 solved, 225 unsolved
Search for dead transitions found 48 dead transitions in 61126ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 143/143 places, 226/285 transitions.
[2024-06-02 19:33:48] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 61571 ms. Remains : 143/143 places, 226/285 transitions.
Final net has 143 places and 226 transitions.
[2024-06-02 19:33:48] [INFO ] Flatten gal took : 107 ms
[2024-06-02 19:33:48] [INFO ] Applying decomposition
[2024-06-02 19:33:48] [INFO ] Flatten gal took : 38 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/graph4058694318754023956.txt' '-o' '/tmp/graph4058694318754023956.bin' '-w' '/tmp/graph4058694318754023956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4058694318754023956.bin' '-l' '-1' '-v' '-w' '/tmp/graph4058694318754023956.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:33:48] [INFO ] Decomposing Gal with order
[2024-06-02 19:33:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:33:49] [INFO ] Removed a total of 362 redundant transitions.
[2024-06-02 19:33:49] [INFO ] Flatten gal took : 97 ms
[2024-06-02 19:33:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 15 ms.
[2024-06-02 19:33:49] [INFO ] Time to serialize gal into /tmp/StateSpace12910748716910909763.gal : 11 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/StateSpace12910748716910909763.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
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.3107e+07,0.632125,20232,651,87,24811,762,487,81910,94,3236,0
Total reachable state count : 63107002

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 8
STATE_SPACE MAX_TOKEN_PER_MARKING 8 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 63107002
STATE_SPACE STATES 63107002 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 63687 ms.

BK_STOP 1717356829899

--------------------
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="MedleyA-PT-07"
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 MedleyA-PT-07, 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 r576-smll-171734919900056"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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