Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r257-smll-167863533000613.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is Peterson-PT-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r257-smll-167863533000613
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 29K Feb 25 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 25 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 22:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 194K Feb 25 22:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 93K Feb 25 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 439K Feb 25 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 283K Feb 25 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 143K Mar 5 18:23 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

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

=== Now, execution of the tool begins

BK_START 1678931421189

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
Not applying reductions.
Model is PT
UpperBounds PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Peterson_PT_3
(NrP: 244 NrTr: 332 NrArc: 1016)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.008sec

net check time: 0m 0.000sec

init dd package: 0m 3.549sec


RS generation: 0m53.169sec


-> reachability set: #nodes 170194 (1.7e+05) #states 3,407,946 (6)



starting MCC model checker
--------------------------

checking: place_bound(BeginLoop_2_2_3)
normalized: place_bound(BeginLoop_2_2_3)

-> the formula is 1

FORMULA Peterson-PT-3-UpperBounds-08 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: place_bound(TestIdentity_3_0_2)
normalized: place_bound(TestIdentity_3_0_2)

-> the formula is 1

FORMULA Peterson-PT-3-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(TestTurn_1_0)
normalized: place_bound(TestTurn_1_0)

-> the formula is 1

FORMULA Peterson-PT-3-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(AskForSection_3_0)
normalized: place_bound(AskForSection_3_0)

-> the formula is 1

FORMULA Peterson-PT-3-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Turn_1_2)
normalized: place_bound(Turn_1_2)

-> the formula is 1

FORMULA Peterson-PT-3-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(WantSection_1_F)
normalized: place_bound(WantSection_1_F)

-> the formula is 1

FORMULA Peterson-PT-3-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(EndTurn_0_1)
normalized: place_bound(EndTurn_0_1)

-> the formula is 1

FORMULA Peterson-PT-3-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(IsEndLoop_3_0_2)
normalized: place_bound(IsEndLoop_3_0_2)

-> the formula is 1

FORMULA Peterson-PT-3-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(CS_3,CS_1,CS_2,CS_0)
normalized: place_bound(CS_3,CS_1,CS_2,CS_0)

-> the formula is 1

FORMULA Peterson-PT-3-UpperBounds-05 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Turn_2_1,Turn_0_2,Turn_1_2,Turn_2_2,Turn_1_0,Turn_2_0,Turn_0_1,Turn_1_1,Turn_0_0,Turn_2_3,Turn_1_3,Turn_0_3)
normalized: place_bound(Turn_2_1,Turn_0_2,Turn_1_2,Turn_2_2,Turn_1_0,Turn_2_0,Turn_0_1,Turn_1_1,Turn_0_0,Turn_2_3,Turn_1_3,Turn_0_3)

-> the formula is 3

FORMULA Peterson-PT-3-UpperBounds-00 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Turn_2_1,Turn_0_2,Turn_1_2,Turn_2_2,Turn_1_0,Turn_2_0,Turn_0_1,Turn_1_1,Turn_0_0,Turn_2_3,Turn_1_3,Turn_0_3)
normalized: place_bound(Turn_2_1,Turn_0_2,Turn_1_2,Turn_2_2,Turn_1_0,Turn_2_0,Turn_0_1,Turn_1_1,Turn_0_0,Turn_2_3,Turn_1_3,Turn_0_3)

-> the formula is 3

FORMULA Peterson-PT-3-UpperBounds-03 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(TestTurn_0_0,TestTurn_1_0,TestTurn_2_0,TestTurn_3_0,TestTurn_0_1,TestTurn_0_2,TestTurn_3_1,TestTurn_2_1,TestTurn_1_1,TestTurn_3_2,TestTurn_2_2,TestTurn_1_2)
normalized: place_bound(TestTurn_0_0,TestTurn_1_0,TestTurn_2_0,TestTurn_3_0,TestTurn_0_1,TestTurn_0_2,TestTurn_3_1,TestTurn_2_1,TestTurn_1_1,TestTurn_3_2,TestTurn_2_2,TestTurn_1_2)

-> the formula is 4

FORMULA Peterson-PT-3-UpperBounds-04 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(EndTurn_0_0,EndTurn_0_1,EndTurn_3_0,EndTurn_2_0,EndTurn_1_0,EndTurn_0_2,EndTurn_3_1,EndTurn_2_1,EndTurn_1_1,EndTurn_3_2,EndTurn_2_2,EndTurn_1_2)
normalized: place_bound(EndTurn_0_0,EndTurn_0_1,EndTurn_3_0,EndTurn_2_0,EndTurn_1_0,EndTurn_0_2,EndTurn_3_1,EndTurn_2_1,EndTurn_1_1,EndTurn_3_2,EndTurn_2_2,EndTurn_1_2)

-> the formula is 3

FORMULA Peterson-PT-3-UpperBounds-07 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(TestAlone_1_0_0,TestAlone_3_2_0,TestAlone_2_2_0,TestAlone_1_2_0,TestAlone_3_1_0,TestAlone_2_1_0,TestAlone_1_1_0,TestAlone_3_0_0,TestAlone_2_0_0,TestAlone_0_0_2,TestAlone_3_2_1,TestAlone_3_0_2,TestAlone_1_0_2,TestAlone_1_1_2,TestAlone_0_1_2,TestAlone_0_2_2,TestAlone_3_1_2,TestAlone_2_0_1,TestAlone_0_0_1,TestAlone_0_1_1,TestAlone_3_0_1,TestAlone_3_1_1,TestAlone_2_1_1,TestAlone_2_2_1,TestAlone_0_2_1,TestAlone_0_2_3,TestAlone_1_2_3,TestAlone_2_2_3,TestAlone_1_2_2,TestAlone_3_2_2,TestAlone_0_0_3,TestAlone_1_0_3,TestAlone_2_0_3,TestAlone_0_1_3,TestAlone_1_1_3,TestAlone_2_1_3)
normalized: place_bound(TestAlone_1_0_0,TestAlone_3_2_0,TestAlone_2_2_0,TestAlone_1_2_0,TestAlone_3_1_0,TestAlone_2_1_0,TestAlone_1_1_0,TestAlone_3_0_0,TestAlone_2_0_0,TestAlone_0_0_2,TestAlone_3_2_1,TestAlone_3_0_2,TestAlone_1_0_2,TestAlone_1_1_2,TestAlone_0_1_2,TestAlone_0_2_2,TestAlone_3_1_2,TestAlone_2_0_1,TestAlone_0_0_1,TestAlone_0_1_1,TestAlone_3_0_1,TestAlone_3_1_1,TestAlone_2_1_1,TestAlone_2_2_1,TestAlone_0_2_1,TestAlone_0_2_3,TestAlone_1_2_3,TestAlone_2_2_3,TestAlone_1_2_2,TestAlone_3_2_2,TestAlone_0_0_3,TestAlone_1_0_3,TestAlone_2_0_3,TestAlone_0_1_3,TestAlone_1_1_3,TestAlone_2_1_3)

-> the formula is 4

FORMULA Peterson-PT-3-UpperBounds-06 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(BeginLoop_0_0_0,BeginLoop_1_1_0,BeginLoop_2_1_0,BeginLoop_3_1_0,BeginLoop_0_2_0,BeginLoop_1_0_0,BeginLoop_2_0_0,BeginLoop_3_0_0,BeginLoop_0_1_0,BeginLoop_1_0_1,BeginLoop_2_0_1,BeginLoop_3_0_1,BeginLoop_0_1_1,BeginLoop_1_2_0,BeginLoop_2_2_0,BeginLoop_3_2_0,BeginLoop_0_0_1,BeginLoop_2_2_1,BeginLoop_1_2_1,BeginLoop_0_0_2,BeginLoop_3_2_1,BeginLoop_2_1_1,BeginLoop_1_1_1,BeginLoop_0_2_1,BeginLoop_3_1_1,BeginLoop_2_1_2,BeginLoop_1_1_2,BeginLoop_0_2_2,BeginLoop_3_1_2,BeginLoop_2_0_2,BeginLoop_1_0_2,BeginLoop_0_1_2,BeginLoop_3_0_2,BeginLoop_3_0_3,BeginLoop_0_1_3,BeginLoop_1_0_3,BeginLoop_2_0_3,BeginLoop_3_2_2,BeginLoop_0_0_3,BeginLoop_1_2_2,BeginLoop_2_2_2,BeginLoop_3_2_3,BeginLoop_1_2_3,BeginLoop_2_2_3,BeginLoop_3_1_3,BeginLoop_0_2_3,BeginLoop_1_1_3,BeginLoop_2_1_3)
normalized: place_bound(BeginLoop_0_0_0,BeginLoop_1_1_0,BeginLoop_2_1_0,BeginLoop_3_1_0,BeginLoop_0_2_0,BeginLoop_1_0_0,BeginLoop_2_0_0,BeginLoop_3_0_0,BeginLoop_0_1_0,BeginLoop_1_0_1,BeginLoop_2_0_1,BeginLoop_3_0_1,BeginLoop_0_1_1,BeginLoop_1_2_0,BeginLoop_2_2_0,BeginLoop_3_2_0,BeginLoop_0_0_1,BeginLoop_2_2_1,BeginLoop_1_2_1,BeginLoop_0_0_2,BeginLoop_3_2_1,BeginLoop_2_1_1,BeginLoop_1_1_1,BeginLoop_0_2_1,BeginLoop_3_1_1,BeginLoop_2_1_2,BeginLoop_1_1_2,BeginLoop_0_2_2,BeginLoop_3_1_2,BeginLoop_2_0_2,BeginLoop_1_0_2,BeginLoop_0_1_2,BeginLoop_3_0_2,BeginLoop_3_0_3,BeginLoop_0_1_3,BeginLoop_1_0_3,BeginLoop_2_0_3,BeginLoop_3_2_2,BeginLoop_0_0_3,BeginLoop_1_2_2,BeginLoop_2_2_2,BeginLoop_3_2_3,BeginLoop_1_2_3,BeginLoop_2_2_3,BeginLoop_3_1_3,BeginLoop_0_2_3,BeginLoop_1_1_3,BeginLoop_2_1_3)

-> the formula is 4

FORMULA Peterson-PT-3-UpperBounds-01 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(BeginLoop_0_0_0,BeginLoop_1_1_0,BeginLoop_2_1_0,BeginLoop_3_1_0,BeginLoop_0_2_0,BeginLoop_1_0_0,BeginLoop_2_0_0,BeginLoop_3_0_0,BeginLoop_0_1_0,BeginLoop_1_0_1,BeginLoop_2_0_1,BeginLoop_3_0_1,BeginLoop_0_1_1,BeginLoop_1_2_0,BeginLoop_2_2_0,BeginLoop_3_2_0,BeginLoop_0_0_1,BeginLoop_2_2_1,BeginLoop_1_2_1,BeginLoop_0_0_2,BeginLoop_3_2_1,BeginLoop_2_1_1,BeginLoop_1_1_1,BeginLoop_0_2_1,BeginLoop_3_1_1,BeginLoop_2_1_2,BeginLoop_1_1_2,BeginLoop_0_2_2,BeginLoop_3_1_2,BeginLoop_2_0_2,BeginLoop_1_0_2,BeginLoop_0_1_2,BeginLoop_3_0_2,BeginLoop_3_0_3,BeginLoop_0_1_3,BeginLoop_1_0_3,BeginLoop_2_0_3,BeginLoop_3_2_2,BeginLoop_0_0_3,BeginLoop_1_2_2,BeginLoop_2_2_2,BeginLoop_3_2_3,BeginLoop_1_2_3,BeginLoop_2_2_3,BeginLoop_3_1_3,BeginLoop_0_2_3,BeginLoop_1_1_3,BeginLoop_2_1_3)
normalized: place_bound(BeginLoop_0_0_0,BeginLoop_1_1_0,BeginLoop_2_1_0,BeginLoop_3_1_0,BeginLoop_0_2_0,BeginLoop_1_0_0,BeginLoop_2_0_0,BeginLoop_3_0_0,BeginLoop_0_1_0,BeginLoop_1_0_1,BeginLoop_2_0_1,BeginLoop_3_0_1,BeginLoop_0_1_1,BeginLoop_1_2_0,BeginLoop_2_2_0,BeginLoop_3_2_0,BeginLoop_0_0_1,BeginLoop_2_2_1,BeginLoop_1_2_1,BeginLoop_0_0_2,BeginLoop_3_2_1,BeginLoop_2_1_1,BeginLoop_1_1_1,BeginLoop_0_2_1,BeginLoop_3_1_1,BeginLoop_2_1_2,BeginLoop_1_1_2,BeginLoop_0_2_2,BeginLoop_3_1_2,BeginLoop_2_0_2,BeginLoop_1_0_2,BeginLoop_0_1_2,BeginLoop_3_0_2,BeginLoop_3_0_3,BeginLoop_0_1_3,BeginLoop_1_0_3,BeginLoop_2_0_3,BeginLoop_3_2_2,BeginLoop_0_0_3,BeginLoop_1_2_2,BeginLoop_2_2_2,BeginLoop_3_2_3,BeginLoop_1_2_3,BeginLoop_2_2_3,BeginLoop_3_1_3,BeginLoop_0_2_3,BeginLoop_1_1_3,BeginLoop_2_1_3)

-> the formula is 4

FORMULA Peterson-PT-3-UpperBounds-02 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 2220346 (2.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 36269928 137258012 173527940
used/not used/entry size/cache size: 58306189 8802675 16 1024MB
basic ops cache: hits/miss/sum: 61420 471393 532813
used/not used/entry size/cache size: 841379 15935837 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 31172 170264 201436
used/not used/entry size/cache size: 168592 8220016 32 256MB
max state cache: hits/miss/sum: 187032 1021584 1208616
used/not used/entry size/cache size: 168592 8220016 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 65255922
1 1554081
2 240800
3 48878
4 8019
5 1039
6 117
7 6
8 2
9 0
>= 10 0

Total processing time: 0m59.641sec


BK_STOP 1678931480902

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

67593 118683 152189 174918
iterations count:416217 (1253), effective:7444 (22)

initing FirstDep: 0m 0.005sec

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="Peterson-PT-3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
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-5348"
echo " Executing tool marcie"
echo " Input is Peterson-PT-3, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r257-smll-167863533000613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;