fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r114-smll-165264477300158
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for HealthRecord-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
283.155 49735.00 102468.00 328.00 FTTTTTFTTFTTTTFT normal

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-165264477300158.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-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477300158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.4K Apr 30 11:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 11:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 11:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 11:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 30 11:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 30 11:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 30 11:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 11:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:59 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 70K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654187066143

Running Version 202205111006
[2022-06-02 16:24:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-06-02 16:24:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:24:28] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2022-06-02 16:24:28] [INFO ] Transformed 159 places.
[2022-06-02 16:24:28] [INFO ] Transformed 334 transitions.
[2022-06-02 16:24:28] [INFO ] Found NUPN structural information;
[2022-06-02 16:24:28] [INFO ] Parsed PT model containing 159 places and 334 transitions in 320 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-11-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 677 resets, run finished after 825 ms. (steps per millisecond=12 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 404636 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{2=1, 3=1, 7=1}
Probabilistic random walk after 404636 steps, saw 58204 distinct states, run finished after 3008 ms. (steps per millisecond=134 ) properties seen :3
FORMULA HealthRecord-PT-11-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
[2022-06-02 16:24:33] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2022-06-02 16:24:33] [INFO ] Computed 18 place invariants in 17 ms
[2022-06-02 16:24:33] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-02 16:24:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-06-02 16:24:33] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2022-06-02 16:24:34] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2022-06-02 16:24:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 16:24:34] [INFO ] After 122ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :5 sat :5
[2022-06-02 16:24:34] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 6 ms to minimize.
[2022-06-02 16:24:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-06-02 16:24:34] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2022-06-02 16:24:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-06-02 16:24:34] [INFO ] After 510ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :5
Attempting to minimize the solution found.
Minimization took 98 ms.
[2022-06-02 16:24:34] [INFO ] After 1080ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :5
FORMULA HealthRecord-PT-11-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-11-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-11-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-11-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-11-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 664 ms.
Support contains 35 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 155 edges and 159 vertex of which 6 / 159 are part of one of the 3 SCC in 16 ms
Free SCC test removed 3 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 671 edges and 156 vertex of which 147 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 0 output 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 0 with 2 rules applied. Total rules applied 4 place count 147 transition count 286
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 145 transition count 283
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 144 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 144 transition count 281
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 143 transition count 281
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 73 place count 83 transition count 161
Iterating global reduction 3 with 60 rules applied. Total rules applied 133 place count 83 transition count 161
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 138 place count 78 transition count 151
Iterating global reduction 3 with 5 rules applied. Total rules applied 143 place count 78 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 146 place count 78 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 76 transition count 146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 158 place count 72 transition count 170
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 161 place count 72 transition count 167
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 72 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 71 transition count 166
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 176 place count 71 transition count 166
Applied a total of 176 rules in 94 ms. Remains 71 /159 variables (removed 88) and now considering 166/307 (removed 141) transitions.
Finished structural reductions, in 1 iterations. Remains : 71/159 places, 166/307 transitions.
Incomplete random walk after 1000000 steps, including 133064 resets, run finished after 23841 ms. (steps per millisecond=41 ) properties (out of 5) seen :1
FORMULA HealthRecord-PT-11-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 23130 resets, run finished after 4204 ms. (steps per millisecond=237 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 24660 resets, run finished after 3448 ms. (steps per millisecond=290 ) properties (out of 4) seen :1
FORMULA HealthRecord-PT-11-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 24722 resets, run finished after 3176 ms. (steps per millisecond=314 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 25259 resets, run finished after 4338 ms. (steps per millisecond=230 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 166 rows 71 cols
[2022-06-02 16:25:14] [INFO ] Computed 9 place invariants in 5 ms
[2022-06-02 16:25:14] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 16:25:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-06-02 16:25:14] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-02 16:25:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-02 16:25:15] [INFO ] After 60ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-02 16:25:15] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2022-06-02 16:25:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2022-06-02 16:25:15] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2022-06-02 16:25:15] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2022-06-02 16:25:15] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2022-06-02 16:25:15] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2022-06-02 16:25:15] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2022-06-02 16:25:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 398 ms
[2022-06-02 16:25:15] [INFO ] After 610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-06-02 16:25:15] [INFO ] After 871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA HealthRecord-PT-11-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 576 steps, including 47 resets, run visited all 1 properties in 5 ms. (steps per millisecond=115 )
FORMULA HealthRecord-PT-11-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 139 ms.
All properties solved without resorting to model-checking.
Total runtime 47855 ms.

BK_STOP 1654187115878

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-11"
export BK_EXAMINATION="ReachabilityCardinality"
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-11, examination is ReachabilityCardinality"
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-165264477300158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-11.tgz
mv HealthRecord-PT-11 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;