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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
349.199 52895.00 74897.00 308.20 1.3711E+0009 ? 1 13 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-171734920000096.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-12, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920000096
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 43K 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 1717368436899

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 22:47:18] [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 22:47:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:47:19] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-06-02 22:47:19] [INFO ] Transformed 172 places.
[2024-06-02 22:47:19] [INFO ] Transformed 166 transitions.
[2024-06-02 22:47:19] [INFO ] Found NUPN structural information;
[2024-06-02 22:47:19] [INFO ] Parsed PT model containing 172 places and 166 transitions and 466 arcs in 279 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 172/172 places, 166/166 transitions.
[2024-06-02 22:47:19] [INFO ] Redundant transitions in 10 ms returned []
Running 165 sub problems to find dead transitions.
// Phase 1: matrix 166 rows 172 cols
[2024-06-02 22:47:19] [INFO ] Computed 24 invariants in 20 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 1/172 variables, 11/190 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-02 22:47:23] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 23 ms to minimize.
[2024-06-02 22:47:23] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 6 ms to minimize.
[2024-06-02 22:47:23] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 4 ms to minimize.
[2024-06-02 22:47:24] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 3 ms to minimize.
[2024-06-02 22:47:24] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 3 ms to minimize.
[2024-06-02 22:47:24] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-06-02 22:47:24] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-06-02 22:47:24] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-06-02 22:47:24] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-06-02 22:47:24] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:47:24] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:47:24] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:47:24] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:47:25] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:47:25] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:47:25] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-06-02 22:47:25] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-06-02 22:47:25] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-06-02 22:47:25] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
[2024-06-02 22:47:25] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 20/216 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-02 22:47:26] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 3 ms to minimize.
[2024-06-02 22:47:26] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 3 ms to minimize.
[2024-06-02 22:47:27] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-06-02 22:47:27] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:47:27] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:47:27] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
[2024-06-02 22:47:27] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:47:28] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 3 ms to minimize.
[2024-06-02 22:47:28] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:47:28] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-06-02 22:47:28] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:47:28] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 12/228 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-02 22:47:29] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-06-02 22:47:29] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
[2024-06-02 22:47:29] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 4 ms to minimize.
[2024-06-02 22:47:30] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2024-06-02 22:47:30] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 5/233 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-02 22:47:31] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:47:31] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 3 ms to minimize.
[2024-06-02 22:47:31] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
[2024-06-02 22:47:31] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:47:32] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:47:32] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 6/239 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-02 22:47:33] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-02 22:47:34] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-06-02 22:47:35] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-06-02 22:47:35] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:47:35] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 3 ms to minimize.
[2024-06-02 22:47:36] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 3 ms to minimize.
[2024-06-02 22:47:36] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-02 22:47:37] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 6 ms to minimize.
[2024-06-02 22:47:38] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 14 (OVERLAPS) 166/338 variables, 172/420 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/338 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 16 (OVERLAPS) 0/338 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 420 constraints, problems are : Problem set: 0 solved, 165 unsolved in 26903 ms.
Refiners :[Domain max(s): 172/172 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 1/172 variables, 11/190 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 52/248 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-02 22:47:48] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-02 22:47:50] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (OVERLAPS) 166/338 variables, 172/422 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 165/587 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-02 22:47:57] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 14 (OVERLAPS) 0/338 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 588 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22080 ms.
Refiners :[Domain max(s): 172/172 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 55/55 constraints]
After SMT, in 49168ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 49197ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 49386 ms. Remains : 172/172 places, 166/166 transitions.
Final net has 172 places and 166 transitions.
[2024-06-02 22:48:08] [INFO ] Flatten gal took : 73 ms
[2024-06-02 22:48:08] [INFO ] Applying decomposition
[2024-06-02 22:48:08] [INFO ] Flatten gal took : 23 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/graph17786699955582883423.txt' '-o' '/tmp/graph17786699955582883423.bin' '-w' '/tmp/graph17786699955582883423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17786699955582883423.bin' '-l' '-1' '-v' '-w' '/tmp/graph17786699955582883423.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:48:09] [INFO ] Decomposing Gal with order
[2024-06-02 22:48:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:48:09] [INFO ] Removed a total of 15 redundant transitions.
[2024-06-02 22:48:09] [INFO ] Flatten gal took : 72 ms
[2024-06-02 22:48:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-06-02 22:48:09] [INFO ] Time to serialize gal into /tmp/StateSpace11520675163015346624.gal : 13 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/StateSpace11520675163015346624.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,1.37111e+09,0.525845,13924,1946,589,17498,3152,469,43106,108,18540,0
Total reachable state count : 1371108987

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

BK_STOP 1717368489794

--------------------
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-12"
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-12, 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-171734920000096"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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