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.r162-smll-177961107700125.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 IOTPpurchase-PT-C05M04P03D02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700125
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.4K Mar 7 17:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 7 17:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7K Mar 15 11:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 17:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 7 17:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Mar 7 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 121K Mar 7 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 11:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 11:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rwxr-xr-x 1 mcc users 60K 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 IOTPpurchase-PT-C05M04P03D02-UpperBounds-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779728981782

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C05M04P03D02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 17:09:43] [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-25 17:09:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 17:09:44] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2026-05-25 17:09:44] [INFO ] Transformed 111 places.
[2026-05-25 17:09:44] [INFO ] Transformed 45 transitions.
[2026-05-25 17:09:44] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10330973967770594358.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9054991944689899648.kers'
[2026-05-25 17:09:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10330973967770594358.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9054991944689899648.kers]
Culling duplicate invariants (modulo rational): removing 49 columns.
Culled 49 columns in 0 ms.
// Phase 1: matrix 45 rows 62 cols 124 entries
Finished phase 1 with 33 SingleSign rule and 11 generalized
[2026-05-25 17:09:44] [INFO ] Computed 67 invariants in 0 ms
Computed 67 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9054991944689899648.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 0, 0, 0, 0] Max Struct:[1, 7, 4, 4, 4, 7, 1, 7, 3, 1, 3, 1, 1, 1, 1, 4]
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 97 ms. (102 steps per ms)
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60003 steps (12 resets) in 222 ms. (269 steps per ms)
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[4, 3, 4, 2] Max Struct:[7, 4, 7, 7]
[2026-05-25 17:09:44] [INFO ] Invariant cache hit.
[2026-05-25 17:09:45] [INFO ] [Real]Absence check using 17 positive place invariants in 21 ms returned sat
[2026-05-25 17:09:45] [INFO ] [Real]Absence check using 17 positive and 50 generalized place invariants in 12 ms returned unsat
[2026-05-25 17:09:45] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2026-05-25 17:09:45] [INFO ] [Real]Absence check using 17 positive and 50 generalized place invariants in 25 ms returned sat
[2026-05-25 17:09:45] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2026-05-25 17:09:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:09:45] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2026-05-25 17:09:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:09:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2026-05-25 17:09:45] [INFO ] [Nat]Absence check using 17 positive and 50 generalized place invariants in 31 ms returned sat
[2026-05-25 17:09:45] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2026-05-25 17:09:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 17:09:45] [INFO ] Computed and/alt/rep : 44/95/44 causal constraints (skipped 0 transitions) in 13 ms.
[2026-05-25 17:09:45] [INFO ] Added : 37 causal constraints over 8 iterations in 172 ms. Result :sat
Minimization took 35 ms.
[2026-05-25 17:09:46] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2026-05-25 17:09:46] [INFO ] [Real]Absence check using 17 positive and 50 generalized place invariants in 4 ms returned unsat
[2026-05-25 17:09:46] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2026-05-25 17:09:46] [INFO ] [Real]Absence check using 17 positive and 50 generalized place invariants in 26 ms returned sat
[2026-05-25 17:09:46] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2026-05-25 17:09:46] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2026-05-25 17:09:46] [INFO ] Computed and/alt/rep : 44/95/44 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-25 17:09:46] [INFO ] Added : 42 causal constraints over 9 iterations in 184 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 3, 4, 2] Max Struct:[4, 4, 4, 7]
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 5] Max Struct:[4, 7]
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 36 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 67 transition count 39
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 18 rules applied. Total rules applied 68 place count 57 transition count 31
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 77 place count 49 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 48 transition count 30
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 78 place count 48 transition count 19
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 107 place count 30 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 107 place count 30 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 113 place count 27 transition count 16
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 128 place count 18 transition count 10
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 130 place count 16 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 130 place count 16 transition count 8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 135 place count 13 transition count 8
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 136 place count 13 transition count 7
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 139 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 141 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 141 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 143 place count 8 transition count 5
Applied a total of 143 rules in 92 ms. Remains 8 /111 variables (removed 103) and now considering 5/45 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 8/111 places, 5/45 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9136661997267474797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8509661093789485063.kers'
[2026-05-25 17:09:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9136661997267474797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8509661093789485063.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 5 rows 6 cols 12 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 17:09:46] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8509661093789485063.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[5]
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1035 ms. (965 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:[]
All properties solved without resorting to model-checking.
Total runtime 3958 ms.

BK_STOP 1779728987861

--------------------
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="IOTPpurchase-PT-C05M04P03D02"
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 IOTPpurchase-PT-C05M04P03D02, 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 r162-smll-177961107700125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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