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.r550-tall-171734898500072.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 CO4-PT-09, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898500072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 152K 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 1717351676199

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 18:07:57] [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 18:07:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:07:57] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-06-02 18:07:57] [INFO ] Transformed 467 places.
[2024-06-02 18:07:57] [INFO ] Transformed 634 transitions.
[2024-06-02 18:07:57] [INFO ] Found NUPN structural information;
[2024-06-02 18:07:57] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 189 ms.
Deduced a syphon composed of 108 places in 8 ms
Reduce places removed 108 places and 163 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 359/359 places, 471/471 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
[2024-06-02 18:07:57] [INFO ] Redundant transitions in 32 ms returned []
Running 467 sub problems to find dead transitions.
// Phase 1: matrix 468 rows 359 cols
[2024-06-02 18:07:57] [INFO ] Computed 9 invariants in 31 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 345/345 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 14/359 variables, 7/352 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 14/366 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-06-02 18:08:06] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 23 ms to minimize.
[2024-06-02 18:08:06] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 5 ms to minimize.
[2024-06-02 18:08:06] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 3 ms to minimize.
[2024-06-02 18:08:06] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 12 ms to minimize.
[2024-06-02 18:08:07] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 3 ms to minimize.
[2024-06-02 18:08:07] [INFO ] Deduced a trap composed of 14 places in 376 ms of which 3 ms to minimize.
[2024-06-02 18:08:07] [INFO ] Deduced a trap composed of 143 places in 138 ms of which 2 ms to minimize.
[2024-06-02 18:08:07] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 3 ms to minimize.
[2024-06-02 18:08:07] [INFO ] Deduced a trap composed of 128 places in 94 ms of which 2 ms to minimize.
[2024-06-02 18:08:08] [INFO ] Deduced a trap composed of 127 places in 96 ms of which 2 ms to minimize.
[2024-06-02 18:08:08] [INFO ] Deduced a trap composed of 253 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:08:08] [INFO ] Deduced a trap composed of 130 places in 96 ms of which 2 ms to minimize.
[2024-06-02 18:08:08] [INFO ] Deduced a trap composed of 130 places in 92 ms of which 3 ms to minimize.
[2024-06-02 18:08:09] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:08:09] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 3 ms to minimize.
[2024-06-02 18:08:09] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-06-02 18:08:09] [INFO ] Deduced a trap composed of 164 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:08:09] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 3 ms to minimize.
[2024-06-02 18:08:10] [INFO ] Deduced a trap composed of 162 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:08:10] [INFO ] Deduced a trap composed of 162 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 20/388 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-06-02 18:08:10] [INFO ] Deduced a trap composed of 128 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:08:10] [INFO ] Deduced a trap composed of 128 places in 101 ms of which 2 ms to minimize.
[2024-06-02 18:08:11] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-02 18:08:11] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:08:11] [INFO ] Deduced a trap composed of 146 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:08:12] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:08:12] [INFO ] Deduced a trap composed of 210 places in 106 ms of which 3 ms to minimize.
[2024-06-02 18:08:12] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 3 ms to minimize.
[2024-06-02 18:08:12] [INFO ] Deduced a trap composed of 203 places in 80 ms of which 2 ms to minimize.
[2024-06-02 18:08:12] [INFO ] Deduced a trap composed of 227 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
Problem TDEAD364 is UNSAT
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 5 ms to minimize.
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
[2024-06-02 18:08:15] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 16/404 constraints. Problems are: Problem set: 20 solved, 447 unsolved
[2024-06-02 18:08:18] [INFO ] Deduced a trap composed of 126 places in 77 ms of which 2 ms to minimize.
[2024-06-02 18:08:18] [INFO ] Deduced a trap composed of 131 places in 97 ms of which 3 ms to minimize.
[2024-06-02 18:08:19] [INFO ] Deduced a trap composed of 130 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:08:19] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 3 ms to minimize.
[2024-06-02 18:08:19] [INFO ] Deduced a trap composed of 123 places in 101 ms of which 3 ms to minimize.
[2024-06-02 18:08:19] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 6/410 constraints. Problems are: Problem set: 20 solved, 447 unsolved
[2024-06-02 18:08:23] [INFO ] Deduced a trap composed of 153 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 1/411 constraints. Problems are: Problem set: 20 solved, 447 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 359/827 variables, and 411 constraints, problems are : Problem set: 20 solved, 447 unsolved in 30030 ms.
Refiners :[Domain max(s): 359/359 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/359 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 20 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 345/345 constraints. Problems are: Problem set: 20 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/345 constraints. Problems are: Problem set: 20 solved, 447 unsolved
At refinement iteration 2 (OVERLAPS) 14/359 variables, 7/352 constraints. Problems are: Problem set: 20 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 14/366 constraints. Problems are: Problem set: 20 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 2/368 constraints. Problems are: Problem set: 20 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 43/411 constraints. Problems are: Problem set: 20 solved, 447 unsolved
[2024-06-02 18:08:31] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:08:31] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:08:32] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
[2024-06-02 18:08:32] [INFO ] Deduced a trap composed of 146 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:08:33] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:08:34] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:08:34] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 7/418 constraints. Problems are: Problem set: 20 solved, 447 unsolved
[2024-06-02 18:08:35] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 2 ms to minimize.
[2024-06-02 18:08:36] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 2/420 constraints. Problems are: Problem set: 20 solved, 447 unsolved
[2024-06-02 18:08:38] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-06-02 18:08:38] [INFO ] Deduced a trap composed of 125 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:08:39] [INFO ] Deduced a trap composed of 122 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:08:39] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 5 ms to minimize.
[2024-06-02 18:08:41] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:08:41] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 6/426 constraints. Problems are: Problem set: 20 solved, 447 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/426 constraints. Problems are: Problem set: 20 solved, 447 unsolved
At refinement iteration 10 (OVERLAPS) 468/827 variables, 359/785 constraints. Problems are: Problem set: 20 solved, 447 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/827 variables, 447/1232 constraints. Problems are: Problem set: 20 solved, 447 unsolved
[2024-06-02 18:08:51] [INFO ] Deduced a trap composed of 130 places in 111 ms of which 2 ms to minimize.
[2024-06-02 18:08:51] [INFO ] Deduced a trap composed of 133 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:08:51] [INFO ] Deduced a trap composed of 132 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:08:53] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 827/827 variables, and 1236 constraints, problems are : Problem set: 20 solved, 447 unsolved in 30018 ms.
Refiners :[Domain max(s): 359/359 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 447/467 constraints, Known Traps: 62/62 constraints]
After SMT, in 60388ms problems are : Problem set: 20 solved, 447 unsolved
Search for dead transitions found 20 dead transitions in 60419ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 359/359 places, 448/471 transitions.
[2024-06-02 18:08:58] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 60563 ms. Remains : 359/359 places, 448/471 transitions.
Final net has 359 places and 448 transitions.
[2024-06-02 18:08:58] [INFO ] Flatten gal took : 86 ms
[2024-06-02 18:08:58] [INFO ] Applying decomposition
[2024-06-02 18:08:58] [INFO ] Flatten gal took : 24 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/graph13803159697196659530.txt' '-o' '/tmp/graph13803159697196659530.bin' '-w' '/tmp/graph13803159697196659530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13803159697196659530.bin' '-l' '-1' '-v' '-w' '/tmp/graph13803159697196659530.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:08:58] [INFO ] Decomposing Gal with order
[2024-06-02 18:08:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:08:58] [INFO ] Removed a total of 263 redundant transitions.
[2024-06-02 18:08:58] [INFO ] Flatten gal took : 91 ms
[2024-06-02 18:08:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 24 ms.
[2024-06-02 18:08:59] [INFO ] Time to serialize gal into /tmp/StateSpace10513532349017846571.gal : 32 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/StateSpace10513532349017846571.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,2.66567e+08,24.8181,816188,12175,683,1.40625e+06,13301,805,5.17773e+06,150,89181,0
Total reachable state count : 266566719

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 : 266566719
STATE_SPACE STATES 266566719 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 86809 ms.

BK_STOP 1717351764153

--------------------
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="CO4-PT-09"
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 CO4-PT-09, 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 r550-tall-171734898500072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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