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.r034-tall-177946842000501.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 itstools
Input is BusinessProcesses-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 9.1K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 100K Mar 3 18:30 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 BusinessProcesses-PT-07-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779612986753

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-24 08:56:27] [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-05-24 08:56:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:56:28] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2026-05-24 08:56:28] [INFO ] Transformed 386 places.
[2026-05-24 08:56:28] [INFO ] Transformed 360 transitions.
[2026-05-24 08:56:28] [INFO ] Found NUPN structural information;
[2026-05-24 08:56:28] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13622379060843969416.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16892888548782392591.kers'
[2026-05-24 08:56:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13622379060843969416.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16892888548782392591.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 360 rows 386 cols 1110 entries
Finished phase 1 with 273 SingleSign rule and 51 generalized
[2026-05-24 08:56:28] [INFO ] Computed 62 invariants in 2 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16892888548782392591.kers
Total runtime 3 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 (112 resets) in 42 ms. (232 steps per ms)
FORMULA BusinessProcesses-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (59 resets) in 34 ms. (857 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-24 08:56:28] [INFO ] Invariant cache hit.
[2026-05-24 08:56:28] [INFO ] [Real]Absence check using 44 positive place invariants in 21 ms returned sat
[2026-05-24 08:56:28] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 18 ms returned sat
[2026-05-24 08:56:28] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2026-05-24 08:56:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:56:29] [INFO ] [Nat]Absence check using 44 positive place invariants in 20 ms returned sat
[2026-05-24 08:56:29] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 12 ms returned sat
[2026-05-24 08:56:29] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2026-05-24 08:56:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 887 ms
[2026-05-24 08:56:30] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 24 ms.
[2026-05-24 08:56:31] [INFO ] Added : 218 causal constraints over 44 iterations in 1363 ms. Result :sat
Minimization took 206 ms.
[2026-05-24 08:56:31] [INFO ] [Real]Absence check using 44 positive place invariants in 13 ms returned sat
[2026-05-24 08:56:31] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 15 ms returned sat
[2026-05-24 08:56:31] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2026-05-24 08:56:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:56:32] [INFO ] [Nat]Absence check using 44 positive place invariants in 14 ms returned sat
[2026-05-24 08:56:32] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 10 ms returned sat
[2026-05-24 08:56:32] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2026-05-24 08:56:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2026-05-24 08:56:32] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 16 ms.
[2026-05-24 08:56:33] [INFO ] Added : 159 causal constraints over 32 iterations in 938 ms. Result :sat
Minimization took 125 ms.
[2026-05-24 08:56:33] [INFO ] [Real]Absence check using 44 positive place invariants in 12 ms returned sat
[2026-05-24 08:56:33] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 12 ms returned sat
[2026-05-24 08:56:33] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2026-05-24 08:56:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 08:56:33] [INFO ] [Nat]Absence check using 44 positive place invariants in 13 ms returned sat
[2026-05-24 08:56:33] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 12 ms returned sat
[2026-05-24 08:56:34] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2026-05-24 08:56:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 242 ms
[2026-05-24 08:56:34] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 24 ms.
[2026-05-24 08:56:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2026-05-24 08:56:36] [INFO ] Added : 185 causal constraints over 37 iterations in 2091 ms. Result :sat
Minimization took 129 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA BusinessProcesses-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 2 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 360/360 transitions.
Graph (trivial) has 215 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 11 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 805 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 378 transition count 269
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 166 place count 296 transition count 269
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 166 place count 296 transition count 212
Deduced a syphon composed of 57 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 288 place count 231 transition count 212
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 332 place count 187 transition count 168
Iterating global reduction 2 with 44 rules applied. Total rules applied 376 place count 187 transition count 168
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 376 place count 187 transition count 162
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 389 place count 180 transition count 162
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 509 place count 119 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 511 place count 118 transition count 106
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 513 place count 118 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 515 place count 116 transition count 104
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 516 place count 116 transition count 104
Applied a total of 516 rules in 158 ms. Remains 116 /386 variables (removed 270) and now considering 104/360 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 116/386 places, 104/360 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9572791614937011849.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10512663824512726962.kers'
[2026-05-24 08:56:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9572791614937011849.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10512663824512726962.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 104 rows 115 cols 608 entries
Finished phase 1 with 28 SingleSign rule and 38 generalized
[2026-05-24 08:56:36] [INFO ] Computed 50 invariants in 0 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10512663824512726962.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (72783 resets) in 1860 ms. (537 steps per ms)
FORMULA BusinessProcesses-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (30727 resets) in 1030 ms. (969 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 11779 ms.

BK_STOP 1779612999760

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="BusinessProcesses-PT-07"
export BK_EXAMINATION="UpperBounds"
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-5973"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-07, 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 r034-tall-177946842000501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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