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.r199-smll-167840345700253.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 lolaxred
Input is HealthRecord-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345700253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.5K Feb 26 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 17:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 49K Mar 5 18:22 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 HealthRecord-PT-03-UpperBounds-00
FORMULA_NAME HealthRecord-PT-03-UpperBounds-01
FORMULA_NAME HealthRecord-PT-03-UpperBounds-02
FORMULA_NAME HealthRecord-PT-03-UpperBounds-03
FORMULA_NAME HealthRecord-PT-03-UpperBounds-04
FORMULA_NAME HealthRecord-PT-03-UpperBounds-05
FORMULA_NAME HealthRecord-PT-03-UpperBounds-06
FORMULA_NAME HealthRecord-PT-03-UpperBounds-07
FORMULA_NAME HealthRecord-PT-03-UpperBounds-08
FORMULA_NAME HealthRecord-PT-03-UpperBounds-09
FORMULA_NAME HealthRecord-PT-03-UpperBounds-10
FORMULA_NAME HealthRecord-PT-03-UpperBounds-11
FORMULA_NAME HealthRecord-PT-03-UpperBounds-12
FORMULA_NAME HealthRecord-PT-03-UpperBounds-13
FORMULA_NAME HealthRecord-PT-03-UpperBounds-14
FORMULA_NAME HealthRecord-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678502958010

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-03
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:49:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 02:49:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:49:21] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-11 02:49:22] [INFO ] Transformed 121 places.
[2023-03-11 02:49:22] [INFO ] Transformed 232 transitions.
[2023-03-11 02:49:22] [INFO ] Found NUPN structural information;
[2023-03-11 02:49:22] [INFO ] Parsed PT model containing 121 places and 232 transitions and 597 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Normalized transition count is 217 out of 225 initially.
// Phase 1: matrix 217 rows 121 cols
[2023-03-11 02:49:22] [INFO ] Computed 14 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 660 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 16) seen :10
FORMULA HealthRecord-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :1
FORMULA HealthRecord-PT-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :1
FORMULA HealthRecord-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 02:49:22] [INFO ] Flow matrix only has 217 transitions (discarded 8 similar events)
// Phase 1: matrix 217 rows 121 cols
[2023-03-11 02:49:22] [INFO ] Computed 14 place invariants in 14 ms
[2023-03-11 02:49:22] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2023-03-11 02:49:22] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-11 02:49:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:49:22] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2023-03-11 02:49:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:49:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-11 02:49:23] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-11 02:49:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:49:23] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-11 02:49:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 02:49:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-11 02:49:23] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 59 ms.
[2023-03-11 02:49:23] [INFO ] Added : 8 causal constraints over 2 iterations in 181 ms. Result :sat
Minimization took 39 ms.
[2023-03-11 02:49:23] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-11 02:49:23] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2023-03-11 02:49:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:49:23] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-11 02:49:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:49:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-11 02:49:23] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-11 02:49:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:49:23] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-11 02:49:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 02:49:23] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 25 ms.
[2023-03-11 02:49:24] [INFO ] Added : 9 causal constraints over 2 iterations in 78 ms. Result :sat
Minimization took 23 ms.
[2023-03-11 02:49:24] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-11 02:49:24] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-11 02:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:49:24] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-11 02:49:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:49:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-11 02:49:24] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-11 02:49:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:49:24] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-11 02:49:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 02:49:24] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 30 ms.
[2023-03-11 02:49:24] [INFO ] Added : 16 causal constraints over 4 iterations in 119 ms. Result :sat
Minimization took 41 ms.
[2023-03-11 02:49:24] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-11 02:49:24] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-11 02:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:49:24] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-11 02:49:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:49:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-11 02:49:24] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-11 02:49:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:49:24] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-11 02:49:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 02:49:24] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 32 ms.
[2023-03-11 02:49:25] [INFO ] Added : 7 causal constraints over 2 iterations in 103 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA HealthRecord-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 225/225 transitions.
Graph (trivial) has 175 edges and 121 vertex of which 10 / 121 are part of one of the 5 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 429 edges and 116 vertex of which 108 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 108 transition count 202
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 104 transition count 196
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 102 transition count 194
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 101 transition count 193
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 22 place count 101 transition count 191
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 27 place count 98 transition count 191
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 78 place count 47 transition count 89
Iterating global reduction 4 with 51 rules applied. Total rules applied 129 place count 47 transition count 89
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 139 place count 37 transition count 69
Iterating global reduction 4 with 10 rules applied. Total rules applied 149 place count 37 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 153 place count 37 transition count 65
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 155 place count 35 transition count 59
Iterating global reduction 5 with 2 rules applied. Total rules applied 157 place count 35 transition count 59
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 159 place count 33 transition count 55
Iterating global reduction 5 with 2 rules applied. Total rules applied 161 place count 33 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 163 place count 33 transition count 53
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 173 place count 28 transition count 79
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 174 place count 28 transition count 153
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 177 place count 27 transition count 151
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 178 place count 26 transition count 124
Iterating global reduction 7 with 1 rules applied. Total rules applied 179 place count 26 transition count 124
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 180 place count 25 transition count 121
Iterating global reduction 7 with 1 rules applied. Total rules applied 181 place count 25 transition count 121
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 187 place count 25 transition count 115
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 189 place count 25 transition count 113
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 199 place count 25 transition count 113
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 208 place count 25 transition count 113
Applied a total of 208 rules in 138 ms. Remains 25 /121 variables (removed 96) and now considering 113/225 (removed 112) transitions.
[2023-03-11 02:49:25] [INFO ] Flow matrix only has 93 transitions (discarded 20 similar events)
// Phase 1: matrix 93 rows 25 cols
[2023-03-11 02:49:25] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-11 02:49:25] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 25/121 places, 113/225 transitions.
Normalized transition count is 93 out of 113 initially.
// Phase 1: matrix 93 rows 25 cols
[2023-03-11 02:49:25] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 250333 resets, run finished after 2783 ms. (steps per millisecond=359 ) properties (out of 2) seen :2
FORMULA HealthRecord-PT-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6547 ms.
ITS solved all properties within timeout

BK_STOP 1678502969354

--------------------
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="HealthRecord-PT-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is HealthRecord-PT-03, 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 r199-smll-167840345700253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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