fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r114-smll-165264477300157
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
215.500 10386.00 19642.00 204.80 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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-165264477300157.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 UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477300157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-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 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652694619531

Running Version 202205111006
[2022-05-16 09:50:21] [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:50:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:50:22] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2022-05-16 09:50:22] [INFO ] Transformed 159 places.
[2022-05-16 09:50:22] [INFO ] Transformed 334 transitions.
[2022-05-16 09:50:22] [INFO ] Found NUPN structural information;
[2022-05-16 09:50:22] [INFO ] Parsed PT model containing 159 places and 334 transitions in 470 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Normalized transition count is 295 out of 307 initially.
// Phase 1: matrix 295 rows 159 cols
[2022-05-16 09:50:22] [INFO ] Computed 18 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 663 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 16) seen :9
FORMULA HealthRecord-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :1
FORMULA HealthRecord-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
[2022-05-16 09:50:22] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2022-05-16 09:50:23] [INFO ] Computed 18 place invariants in 10 ms
[2022-05-16 09:50:23] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2022-05-16 09:50:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2022-05-16 09:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:50:23] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2022-05-16 09:50:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:50:23] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 09:50:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:50:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2022-05-16 09:50:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 09:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:50:24] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2022-05-16 09:50:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 09:50:24] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 86 ms.
[2022-05-16 09:50:24] [INFO ] Added : 14 causal constraints over 3 iterations in 259 ms. Result :sat
Minimization took 69 ms.
[2022-05-16 09:50:24] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2022-05-16 09:50:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 09:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:50:24] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2022-05-16 09:50:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:50:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2022-05-16 09:50:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:50:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:50:24] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2022-05-16 09:50:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2022-05-16 09:50:25] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 11 ms to minimize.
[2022-05-16 09:50:25] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 3 ms to minimize.
[2022-05-16 09:50:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2022-05-16 09:50:25] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 67 ms.
[2022-05-16 09:50:25] [INFO ] Added : 16 causal constraints over 4 iterations in 224 ms. Result :sat
Minimization took 53 ms.
[2022-05-16 09:50:25] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2022-05-16 09:50:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:50:25] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2022-05-16 09:50:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:50:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2022-05-16 09:50:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:50:26] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2022-05-16 09:50:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 09:50:26] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2022-05-16 09:50:26] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 3 ms to minimize.
[2022-05-16 09:50:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 254 ms
[2022-05-16 09:50:26] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 62 ms.
[2022-05-16 09:50:26] [INFO ] Added : 13 causal constraints over 3 iterations in 193 ms. Result :sat
Minimization took 49 ms.
[2022-05-16 09:50:26] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-05-16 09:50:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:50:26] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2022-05-16 09:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:50:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2022-05-16 09:50:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-16 09:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:50:27] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2022-05-16 09:50:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 09:50:27] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2022-05-16 09:50:27] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2022-05-16 09:50:27] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2022-05-16 09:50:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 309 ms
[2022-05-16 09:50:27] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 50 ms.
[2022-05-16 09:50:27] [INFO ] Added : 15 causal constraints over 3 iterations in 177 ms. Result :sat
Minimization took 51 ms.
[2022-05-16 09:50:27] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-05-16 09:50:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:50:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:50:28] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-05-16 09:50:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:50:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 19 ms returned sat
[2022-05-16 09:50:28] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:50:28] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2022-05-16 09:50:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 09:50:28] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2022-05-16 09:50:28] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 0 ms to minimize.
[2022-05-16 09:50:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2022-05-16 09:50:28] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 41 ms.
[2022-05-16 09:50:28] [INFO ] Added : 16 causal constraints over 4 iterations in 197 ms. Result :sat
Minimization took 49 ms.
[2022-05-16 09:50:28] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-05-16 09:50:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-16 09:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:50:29] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2022-05-16 09:50:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:50:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-05-16 09:50:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-16 09:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:50:29] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-05-16 09:50:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 09:50:29] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2022-05-16 09:50:29] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2022-05-16 09:50:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2022-05-16 09:50:29] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 39 ms.
[2022-05-16 09:50:29] [INFO ] Added : 12 causal constraints over 3 iterations in 167 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 7900 ms.

BK_STOP 1652694629917

--------------------
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-11"
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-11, 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-165264477300157"
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 [ "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 ;