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.r491-tall-167912711200949.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 smartxred
Input is UtahNoC-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r491-tall-167912711200949
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.9K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 04:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 04:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 205K 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 UtahNoC-PT-none-UpperBounds-00
FORMULA_NAME UtahNoC-PT-none-UpperBounds-01
FORMULA_NAME UtahNoC-PT-none-UpperBounds-02
FORMULA_NAME UtahNoC-PT-none-UpperBounds-03
FORMULA_NAME UtahNoC-PT-none-UpperBounds-04
FORMULA_NAME UtahNoC-PT-none-UpperBounds-05
FORMULA_NAME UtahNoC-PT-none-UpperBounds-06
FORMULA_NAME UtahNoC-PT-none-UpperBounds-07
FORMULA_NAME UtahNoC-PT-none-UpperBounds-08
FORMULA_NAME UtahNoC-PT-none-UpperBounds-09
FORMULA_NAME UtahNoC-PT-none-UpperBounds-10
FORMULA_NAME UtahNoC-PT-none-UpperBounds-11
FORMULA_NAME UtahNoC-PT-none-UpperBounds-12
FORMULA_NAME UtahNoC-PT-none-UpperBounds-13
FORMULA_NAME UtahNoC-PT-none-UpperBounds-14
FORMULA_NAME UtahNoC-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679306924178

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtahNoC-PT-none
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-20 10:08:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 10:08:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:08:46] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-20 10:08:46] [INFO ] Transformed 216 places.
[2023-03-20 10:08:46] [INFO ] Transformed 977 transitions.
[2023-03-20 10:08:46] [INFO ] Found NUPN structural information;
[2023-03-20 10:08:46] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
Normalized transition count is 427 out of 829 initially.
// Phase 1: matrix 427 rows 216 cols
[2023-03-20 10:08:46] [INFO ] Computed 8 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :9
FORMULA UtahNoC-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :1
FORMULA UtahNoC-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :1
FORMULA UtahNoC-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
[2023-03-20 10:08:46] [INFO ] Flow matrix only has 427 transitions (discarded 402 similar events)
// Phase 1: matrix 427 rows 216 cols
[2023-03-20 10:08:46] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-20 10:08:46] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-20 10:08:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:08:46] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2023-03-20 10:08:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:08:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 10:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:08:47] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2023-03-20 10:08:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-20 10:08:47] [INFO ] [Nat]Added 43 Read/Feed constraints in 19 ms returned sat
[2023-03-20 10:08:47] [INFO ] Computed and/alt/rep : 374/1166/374 causal constraints (skipped 52 transitions) in 64 ms.
[2023-03-20 10:08:47] [INFO ] Added : 63 causal constraints over 13 iterations in 446 ms. Result :sat
Minimization took 144 ms.
[2023-03-20 10:08:47] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-20 10:08:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:08:47] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-20 10:08:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:08:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 10:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:08:48] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-20 10:08:48] [INFO ] [Nat]Added 43 Read/Feed constraints in 12 ms returned sat
[2023-03-20 10:08:48] [INFO ] Computed and/alt/rep : 374/1166/374 causal constraints (skipped 52 transitions) in 78 ms.
[2023-03-20 10:08:49] [INFO ] Added : 169 causal constraints over 34 iterations in 962 ms. Result :sat
Minimization took 72 ms.
[2023-03-20 10:08:49] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 10:08:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:08:49] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-20 10:08:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:08:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 10:08:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:08:49] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-20 10:08:49] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2023-03-20 10:08:49] [INFO ] Computed and/alt/rep : 374/1166/374 causal constraints (skipped 52 transitions) in 40 ms.
[2023-03-20 10:08:50] [INFO ] Added : 221 causal constraints over 45 iterations in 1127 ms. Result :sat
Minimization took 99 ms.
[2023-03-20 10:08:50] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-20 10:08:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:08:50] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-20 10:08:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:08:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 10:08:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:08:51] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-20 10:08:51] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2023-03-20 10:08:51] [INFO ] Computed and/alt/rep : 374/1166/374 causal constraints (skipped 52 transitions) in 38 ms.
[2023-03-20 10:08:52] [INFO ] Added : 171 causal constraints over 35 iterations in 920 ms. Result :sat
Minimization took 95 ms.
[2023-03-20 10:08:52] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 10:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:08:52] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-20 10:08:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:08:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 10:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:08:52] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-20 10:08:52] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2023-03-20 10:08:52] [INFO ] Computed and/alt/rep : 374/1166/374 causal constraints (skipped 52 transitions) in 40 ms.
[2023-03-20 10:08:53] [INFO ] Added : 227 causal constraints over 49 iterations in 1241 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA UtahNoC-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA UtahNoC-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA UtahNoC-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 829/829 transitions.
Graph (trivial) has 356 edges and 216 vertex of which 93 / 216 are part of one of the 14 SCC in 4 ms
Free SCC test removed 79 places
Drop transitions removed 252 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 330 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 35 place count 103 transition count 369
Iterating global reduction 0 with 34 rules applied. Total rules applied 69 place count 103 transition count 369
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 111 place count 103 transition count 327
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 120 place count 94 transition count 304
Iterating global reduction 1 with 9 rules applied. Total rules applied 129 place count 94 transition count 304
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 141 place count 94 transition count 292
Performed 4 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 149 place count 90 transition count 285
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 164 place count 90 transition count 270
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 169 place count 87 transition count 268
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 183 place count 80 transition count 289
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 184 place count 80 transition count 288
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 185 place count 80 transition count 287
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 188 place count 80 transition count 284
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 193 place count 77 transition count 282
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 195 place count 77 transition count 280
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 199 place count 77 transition count 280
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 200 place count 77 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 201 place count 76 transition count 278
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 74 edges and 74 vertex of which 18 / 74 are part of one of the 4 SCC in 0 ms
Free SCC test removed 14 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 204 place count 60 transition count 278
Drop transitions removed 25 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 8 with 55 rules applied. Total rules applied 259 place count 60 transition count 223
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 262 place count 57 transition count 211
Iterating global reduction 9 with 3 rules applied. Total rules applied 265 place count 57 transition count 211
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 271 place count 54 transition count 223
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 272 place count 54 transition count 222
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 279 place count 54 transition count 215
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 280 place count 53 transition count 214
Applied a total of 280 rules in 109 ms. Remains 53 /216 variables (removed 163) and now considering 214/829 (removed 615) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 53/216 places, 214/829 transitions.
Normalized transition count is 127 out of 214 initially.
// Phase 1: matrix 127 rows 53 cols
[2023-03-20 10:08:54] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2434 ms. (steps per millisecond=410 ) properties (out of 2) seen :2
FORMULA UtahNoC-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10836 ms.
ITS solved all properties within timeout

BK_STOP 1679306937764

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="UtahNoC-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is UtahNoC-PT-none, 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 r491-tall-167912711200949"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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