Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r224-tall-171649612400261.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is LamportFastMutEx-PT-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612400261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 16K Apr 13 07:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 13 07:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 07:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 13 07:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 07:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 13 07:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 48K May 18 16:42 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 LamportFastMutEx-PT-2-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716569602115

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 16:53:23] [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]
[2024-05-24 16:53:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 16:53:23] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-24 16:53:23] [INFO ] Transformed 69 places.
[2024-05-24 16:53:23] [INFO ] Transformed 96 transitions.
[2024-05-24 16:53:23] [INFO ] Found NUPN structural information;
[2024-05-24 16:53:23] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_await_13_0, P_await_13_1, P_await_13_2, P_done_0_0, P_done_0_1, P_done_0_2, P_done_1_0, P_done_1_1, P_done_1_2, P_done_2_0, P_done_2_1, P_done_2_2, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_awaity_0, P_awaity_1, P_awaity_2, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2]
[2024-05-24 16:53:23] [INFO ] Parsed PT model containing 69 places and 96 transitions and 402 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
FORMULA LamportFastMutEx-PT-2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[2, 2, 2, 4, 2, 2, 4, 1, 1, 1, 1, 1]
FORMULA LamportFastMutEx-PT-2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 2, 4, 2, 2, 4, 1, 1, 1, 1]
[2024-05-24 16:53:23] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2024-05-24 16:53:23] [INFO ] Computed 10 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 2, 4, 2, 2, 4, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 39 ms. (250 steps per ms)
FORMULA LamportFastMutEx-PT-2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50002 steps (10 resets) in 57 ms. (862 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 2, 1, 2] Max Struct:[2, 2, 4, 2, 4]
[2024-05-24 16:53:23] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-05-24 16:53:23] [INFO ] Invariant cache hit.
[2024-05-24 16:53:23] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 16:53:23] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-24 16:53:23] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 16:53:23] [INFO ] [Real]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:53:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:53:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-24 16:53:23] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-24 16:53:23] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:53:24] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 7 ms to minimize.
[2024-05-24 16:53:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
[2024-05-24 16:53:24] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-24 16:53:24] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:53:24] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:53:24] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-24 16:53:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 269 ms
[2024-05-24 16:53:24] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-24 16:53:24] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 16:53:24] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 16:53:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:53:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-24 16:53:24] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-24 16:53:24] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2024-05-24 16:53:24] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-24 16:53:24] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:53:24] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-24 16:53:24] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-24 16:53:24] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-24 16:53:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 251 ms
[2024-05-24 16:53:24] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-24 16:53:24] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 16:53:24] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 16:53:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:53:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-24 16:53:24] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 16:53:24] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:53:24] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-24 16:53:24] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:53:24] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-24 16:53:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 106 ms
[2024-05-24 16:53:24] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-24 16:53:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-24 16:53:24] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 16:53:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:53:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 16:53:24] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 16:53:24] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2024-05-24 16:53:25] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-24 16:53:25] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-24 16:53:25] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-24 16:53:25] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
[2024-05-24 16:53:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 117 ms
[2024-05-24 16:53:25] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 16:53:25] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 16:53:25] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 16:53:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:53:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 16:53:25] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-24 16:53:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:53:25] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-24 16:53:25] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:53:25] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:53:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 115 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 2, 1, 2] Max Struct:[1, 1, 2, 1, 2]
FORMULA LamportFastMutEx-PT-2-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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 )
[2024-05-24 16:53:25] [INFO ] Flatten gal took : 29 ms
[2024-05-24 16:53:25] [INFO ] Flatten gal took : 10 ms
[2024-05-24 16:53:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14898429209652266171.gal : 6 ms
[2024-05-24 16:53:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4298364047779764976.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14898429209652266171.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4298364047779764976.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
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 2311 ms.

BK_STOP 1716569605645

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="LamportFastMutEx-PT-2"
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-5568"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-2, 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 r224-tall-171649612400261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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