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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.1K 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.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 18K 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 135K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 138K 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 1717351609203

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 18:06:50] [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:06:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:06:50] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-02 18:06:50] [INFO ] Transformed 467 places.
[2024-06-02 18:06:50] [INFO ] Transformed 600 transitions.
[2024-06-02 18:06:50] [INFO ] Found NUPN structural information;
[2024-06-02 18:06:50] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 193 ms.
Deduced a syphon composed of 108 places in 12 ms
Reduce places removed 108 places and 155 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 359/359 places, 445/445 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
[2024-06-02 18:06:50] [INFO ] Redundant transitions in 26 ms returned []
Running 441 sub problems to find dead transitions.
// Phase 1: matrix 442 rows 359 cols
[2024-06-02 18:06:50] [INFO ] Computed 9 invariants in 27 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 345/345 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 14/359 variables, 7/352 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 14/366 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-06-02 18:06:58] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 23 ms to minimize.
[2024-06-02 18:06:58] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 3 ms to minimize.
[2024-06-02 18:06:58] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:06:58] [INFO ] Deduced a trap composed of 145 places in 105 ms of which 3 ms to minimize.
[2024-06-02 18:06:59] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:06:59] [INFO ] Deduced a trap composed of 139 places in 96 ms of which 2 ms to minimize.
[2024-06-02 18:06:59] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-06-02 18:06:59] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 3 ms to minimize.
[2024-06-02 18:06:59] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:06:59] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:06:59] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:06:59] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:07:00] [INFO ] Deduced a trap composed of 161 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:07:00] [INFO ] Deduced a trap composed of 159 places in 90 ms of which 2 ms to minimize.
[2024-06-02 18:07:01] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:07:02] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
Problem TDEAD338 is UNSAT
[2024-06-02 18:07:02] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
[2024-06-02 18:07:02] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
[2024-06-02 18:07:02] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 19/387 constraints. Problems are: Problem set: 20 solved, 421 unsolved
[2024-06-02 18:07:03] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:07:03] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:07:03] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-02 18:07:03] [INFO ] Deduced a trap composed of 131 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:07:03] [INFO ] Deduced a trap composed of 131 places in 90 ms of which 2 ms to minimize.
[2024-06-02 18:07:03] [INFO ] Deduced a trap composed of 127 places in 91 ms of which 2 ms to minimize.
[2024-06-02 18:07:04] [INFO ] Deduced a trap composed of 132 places in 89 ms of which 2 ms to minimize.
[2024-06-02 18:07:04] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:07:04] [INFO ] Deduced a trap composed of 126 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:07:04] [INFO ] Deduced a trap composed of 123 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:07:04] [INFO ] Deduced a trap composed of 127 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:07:04] [INFO ] Deduced a trap composed of 129 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:07:04] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:07:05] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:07:05] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:07:05] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
[2024-06-02 18:07:05] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:07:05] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:07:05] [INFO ] Deduced a trap composed of 99 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:07:05] [INFO ] Deduced a trap composed of 187 places in 95 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 20/407 constraints. Problems are: Problem set: 20 solved, 421 unsolved
[2024-06-02 18:07:09] [INFO ] Deduced a trap composed of 143 places in 80 ms of which 2 ms to minimize.
[2024-06-02 18:07:09] [INFO ] Deduced a trap composed of 143 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:07:09] [INFO ] Deduced a trap composed of 203 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:07:09] [INFO ] Deduced a trap composed of 148 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:07:09] [INFO ] Deduced a trap composed of 147 places in 78 ms of which 2 ms to minimize.
[2024-06-02 18:07:09] [INFO ] Deduced a trap composed of 256 places in 85 ms of which 2 ms to minimize.
[2024-06-02 18:07:11] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 7/414 constraints. Problems are: Problem set: 20 solved, 421 unsolved
[2024-06-02 18:07:13] [INFO ] Deduced a trap composed of 256 places in 85 ms of which 2 ms to minimize.
[2024-06-02 18:07:14] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:07:14] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 3/417 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/417 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 10 (OVERLAPS) 442/801 variables, 359/776 constraints. Problems are: Problem set: 20 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 801/801 variables, and 776 constraints, problems are : Problem set: 20 solved, 421 unsolved in 30025 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: 441/441 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 20 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 345/345 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/345 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 14/359 variables, 7/352 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 14/366 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 2/368 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 49/417 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/417 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 7 (OVERLAPS) 442/801 variables, 359/776 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/801 variables, 421/1197 constraints. Problems are: Problem set: 20 solved, 421 unsolved
[2024-06-02 18:07:28] [INFO ] Deduced a trap composed of 159 places in 89 ms of which 2 ms to minimize.
[2024-06-02 18:07:30] [INFO ] Deduced a trap composed of 137 places in 103 ms of which 4 ms to minimize.
[2024-06-02 18:07:30] [INFO ] Deduced a trap composed of 118 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:07:32] [INFO ] Deduced a trap composed of 120 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:07:32] [INFO ] Deduced a trap composed of 139 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/801 variables, 5/1202 constraints. Problems are: Problem set: 20 solved, 421 unsolved
[2024-06-02 18:07:42] [INFO ] Deduced a trap composed of 200 places in 91 ms of which 2 ms to minimize.
[2024-06-02 18:07:45] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 4 ms to minimize.
[2024-06-02 18:07:47] [INFO ] Deduced a trap composed of 149 places in 103 ms of which 2 ms to minimize.
[2024-06-02 18:07:47] [INFO ] Deduced a trap composed of 147 places in 96 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 801/801 variables, and 1206 constraints, problems are : Problem set: 20 solved, 421 unsolved in 30014 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: 421/441 constraints, Known Traps: 58/58 constraints]
After SMT, in 60251ms problems are : Problem set: 20 solved, 421 unsolved
Search for dead transitions found 20 dead transitions in 60279ms
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, 422/445 transitions.
[2024-06-02 18:07:51] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 60426 ms. Remains : 359/359 places, 422/445 transitions.
Final net has 359 places and 422 transitions.
[2024-06-02 18:07:51] [INFO ] Flatten gal took : 57 ms
[2024-06-02 18:07:51] [INFO ] Applying decomposition
[2024-06-02 18:07:51] [INFO ] Flatten gal took : 20 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/graph17525986434717752657.txt' '-o' '/tmp/graph17525986434717752657.bin' '-w' '/tmp/graph17525986434717752657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17525986434717752657.bin' '-l' '-1' '-v' '-w' '/tmp/graph17525986434717752657.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:07:51] [INFO ] Decomposing Gal with order
[2024-06-02 18:07:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:07:51] [INFO ] Removed a total of 134 redundant transitions.
[2024-06-02 18:07:51] [INFO ] Flatten gal took : 58 ms
[2024-06-02 18:07:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 14 ms.
[2024-06-02 18:07:51] [INFO ] Time to serialize gal into /tmp/StateSpace13007859639235636483.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/StateSpace13007859639235636483.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.67576e+08,1.08285,43396,1274,701,62683,5768,883,209212,153,29872,0
Total reachable state count : 267576027

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

BK_STOP 1717351672762

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

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