Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 8.4K Apr 30 11:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 30 11:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 11:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 11:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 50K May 10 09:34 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-04-UpperBounds-00
FORMULA_NAME HealthRecord-PT-04-UpperBounds-01
FORMULA_NAME HealthRecord-PT-04-UpperBounds-02
FORMULA_NAME HealthRecord-PT-04-UpperBounds-03
FORMULA_NAME HealthRecord-PT-04-UpperBounds-04
FORMULA_NAME HealthRecord-PT-04-UpperBounds-05
FORMULA_NAME HealthRecord-PT-04-UpperBounds-06
FORMULA_NAME HealthRecord-PT-04-UpperBounds-07
FORMULA_NAME HealthRecord-PT-04-UpperBounds-08
FORMULA_NAME HealthRecord-PT-04-UpperBounds-09
FORMULA_NAME HealthRecord-PT-04-UpperBounds-10
FORMULA_NAME HealthRecord-PT-04-UpperBounds-11
FORMULA_NAME HealthRecord-PT-04-UpperBounds-12
FORMULA_NAME HealthRecord-PT-04-UpperBounds-13
FORMULA_NAME HealthRecord-PT-04-UpperBounds-14
FORMULA_NAME HealthRecord-PT-04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652692881119

Running Version 202205111006
[2022-05-16 09:21:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 09:21:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:21:23] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2022-05-16 09:21:23] [INFO ] Transformed 123 places.
[2022-05-16 09:21:23] [INFO ] Transformed 239 transitions.
[2022-05-16 09:21:23] [INFO ] Found NUPN structural information;
[2022-05-16 09:21:23] [INFO ] Parsed PT model containing 123 places and 239 transitions in 443 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
Normalized transition count is 223 out of 231 initially.
// Phase 1: matrix 223 rows 123 cols
[2022-05-16 09:21:23] [INFO ] Computed 14 place invariants in 58 ms
Incomplete random walk after 10000 steps, including 789 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :10
FORMULA HealthRecord-PT-04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :1
FORMULA HealthRecord-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-16 09:21:24] [INFO ] Flow matrix only has 223 transitions (discarded 8 similar events)
// Phase 1: matrix 223 rows 123 cols
[2022-05-16 09:21:24] [INFO ] Computed 14 place invariants in 15 ms
[2022-05-16 09:21:24] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2022-05-16 09:21:24] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2022-05-16 09:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:21:24] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-05-16 09:21:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:21:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-05-16 09:21:24] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-16 09:21:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:21:24] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2022-05-16 09:21:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:21:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-16 09:21:25] [INFO ] Computed and/alt/rep : 173/188/173 causal constraints (skipped 49 transitions) in 44 ms.
[2022-05-16 09:21:25] [INFO ] Added : 5 causal constraints over 1 iterations in 111 ms. Result :sat
Minimization took 22 ms.
[2022-05-16 09:21:25] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-05-16 09:21:25] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 09:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:21:25] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2022-05-16 09:21:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:21:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-05-16 09:21:25] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 09:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:21:25] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2022-05-16 09:21:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 09:21:25] [INFO ] Computed and/alt/rep : 173/188/173 causal constraints (skipped 49 transitions) in 44 ms.
[2022-05-16 09:21:25] [INFO ] Added : 7 causal constraints over 2 iterations in 125 ms. Result :sat
Minimization took 21 ms.
[2022-05-16 09:21:25] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2022-05-16 09:21:25] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-16 09:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:21:25] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2022-05-16 09:21:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:21:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-05-16 09:21:25] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 09:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:21:26] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-16 09:21:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-16 09:21:26] [INFO ] Computed and/alt/rep : 173/188/173 causal constraints (skipped 49 transitions) in 26 ms.
[2022-05-16 09:21:26] [INFO ] Added : 9 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 21 ms.
[2022-05-16 09:21:26] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-05-16 09:21:26] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 09:21:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:21:26] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2022-05-16 09:21:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:21:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2022-05-16 09:21:26] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 09:21:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:21:26] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-16 09:21:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2022-05-16 09:21:26] [INFO ] Computed and/alt/rep : 173/188/173 causal constraints (skipped 49 transitions) in 34 ms.
[2022-05-16 09:21:26] [INFO ] Added : 7 causal constraints over 2 iterations in 97 ms. Result :sat
Minimization took 22 ms.
[2022-05-16 09:21:26] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-05-16 09:21:26] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 09:21:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:21:26] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2022-05-16 09:21:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:21:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-05-16 09:21:26] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 09:21:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:21:26] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-05-16 09:21:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 09:21:27] [INFO ] Computed and/alt/rep : 173/188/173 causal constraints (skipped 49 transitions) in 31 ms.
[2022-05-16 09:21:27] [INFO ] Added : 6 causal constraints over 2 iterations in 91 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 123 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 229/229 transitions.
Graph (trivial) has 180 edges and 123 vertex of which 8 / 123 are part of one of the 4 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 441 edges and 119 vertex of which 95 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 90 place count 95 transition count 112
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 145 place count 40 transition count 57
Iterating global reduction 1 with 55 rules applied. Total rules applied 200 place count 40 transition count 57
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 200 place count 40 transition count 51
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 212 place count 34 transition count 51
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 225 place count 21 transition count 32
Iterating global reduction 1 with 13 rules applied. Total rules applied 238 place count 21 transition count 32
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 241 place count 21 transition count 29
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 245 place count 17 transition count 22
Iterating global reduction 2 with 4 rules applied. Total rules applied 249 place count 17 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 250 place count 17 transition count 21
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 253 place count 14 transition count 18
Iterating global reduction 3 with 3 rules applied. Total rules applied 256 place count 14 transition count 18
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 259 place count 14 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 261 place count 13 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 262 place count 12 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 263 place count 11 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 265 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 267 place count 10 transition count 10
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 268 place count 9 transition count 9
Iterating global reduction 5 with 1 rules applied. Total rules applied 269 place count 9 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 270 place count 9 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 271 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 272 place count 8 transition count 7
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 273 place count 8 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 274 place count 8 transition count 6
Applied a total of 274 rules in 68 ms. Remains 8 /123 variables (removed 115) and now considering 6/229 (removed 223) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/123 places, 6/229 transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 09:21:27] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 200524 resets, run finished after 608 ms. (steps per millisecond=1644 ) properties (out of 1) seen :1
FORMULA HealthRecord-PT-04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4648 ms.

BK_STOP 1652692887940

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-04"
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-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-04, 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 r114-smll-165264477200101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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