Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r351-smll-178021502100007.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is ErlangenMainframeV1-PT-bP01C01, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-smll-178021502100007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.9K May 27 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 27 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 27 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 27 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 14K May 27 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K May 27 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 27 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 27 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 52K May 26 18:17 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-00
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-01
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-02
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-03
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-04
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-05
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-06
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-07
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-08
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-09
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-10
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-11
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-12
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-13
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-14
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1780319835069

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP01C01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-01 13:17:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-01 13:17:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 13:17:17] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2026-06-01 13:17:17] [INFO ] Transformed 173 places.
[2026-06-01 13:17:17] [INFO ] Transformed 219 transitions.
[2026-06-01 13:17:17] [INFO ] Found NUPN structural information;
[2026-06-01 13:17:17] [INFO ] Parsed PT model containing 173 places and 219 transitions and 608 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 219 rows 173 cols
[2026-06-01 13:17:17] [INFO ] Computed 8 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 51 ms. (192 steps per ms)
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-06-01 13:17:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:17:18] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2026-06-01 13:17:18] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2026-06-01 13:17:18] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2026-06-01 13:17:18] [INFO ] Computed and/alt/rep : 216/595/216 causal constraints (skipped 2 transitions) in 38 ms.
[2026-06-01 13:17:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:17:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2026-06-01 13:17:18] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2026-06-01 13:17:18] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2026-06-01 13:17:18] [INFO ] Computed and/alt/rep : 216/595/216 causal constraints (skipped 2 transitions) in 27 ms.
[2026-06-01 13:17:19] [INFO ] Added : 180 causal constraints over 38 iterations in 1004 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 173 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p45) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 218/218 transitions.
Graph (trivial) has 169 edges and 173 vertex of which 12 / 173 are part of one of the 5 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 166 transition count 128
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 89 rules applied. Total rules applied 167 place count 89 transition count 116
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 170 place count 86 transition count 116
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 170 place count 86 transition count 112
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 178 place count 82 transition count 112
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 197 place count 63 transition count 93
Iterating global reduction 3 with 19 rules applied. Total rules applied 216 place count 63 transition count 93
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 216 place count 63 transition count 88
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 226 place count 58 transition count 88
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 234 place count 50 transition count 60
Ensure Unique test removed 1 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 243 place count 49 transition count 60
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 245 place count 47 transition count 56
Iterating global reduction 3 with 2 rules applied. Total rules applied 247 place count 47 transition count 56
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 248 place count 46 transition count 54
Iterating global reduction 3 with 1 rules applied. Total rules applied 249 place count 46 transition count 54
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 277 place count 32 transition count 40
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 297 place count 22 transition count 83
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 320 place count 22 transition count 60
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 323 place count 19 transition count 50
Iterating global reduction 4 with 3 rules applied. Total rules applied 326 place count 19 transition count 50
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 335 place count 19 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 337 place count 18 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 5 with 28 rules applied. Total rules applied 365 place count 18 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 367 place count 17 transition count 31
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 368 place count 17 transition count 30
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 369 place count 17 transition count 29
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 371 place count 16 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 375 place count 16 transition count 24
Applied a total of 375 rules in 102 ms. Remains 16 /173 variables (removed 157) and now considering 24/218 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 16/173 places, 24/218 transitions.
// Phase 1: matrix 24 rows 16 cols
[2026-06-01 13:17:20] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA ErlangenMainframeV1-PT-bP01C01-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (113775 resets) in 1071 ms. (932 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-06-01 13:17:21] [INFO ] Flatten gal took : 33 ms
[2026-06-01 13:17:21] [INFO ] Flatten gal took : 9 ms
[2026-06-01 13:17:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1268243646214315799.gal : 8 ms
[2026-06-01 13:17:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8892226210419530231.prop : 1 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1268243646214315799.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8892226210419530231.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 4594 ms.

BK_STOP 1780319841779

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="ErlangenMainframeV1-PT-bP01C01"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is ErlangenMainframeV1-PT-bP01C01, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r351-smll-178021502100007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV1-PT-bP01C01.tgz
mv ErlangenMainframeV1-PT-bP01C01 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;