Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625700481.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is HealthRecord-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625700481
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 69K May 18 16:42 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-10-UpperBounds-00
FORMULA_NAME HealthRecord-PT-10-UpperBounds-01
FORMULA_NAME HealthRecord-PT-10-UpperBounds-02
FORMULA_NAME HealthRecord-PT-10-UpperBounds-03
FORMULA_NAME HealthRecord-PT-10-UpperBounds-04
FORMULA_NAME HealthRecord-PT-10-UpperBounds-05
FORMULA_NAME HealthRecord-PT-10-UpperBounds-06
FORMULA_NAME HealthRecord-PT-10-UpperBounds-07
FORMULA_NAME HealthRecord-PT-10-UpperBounds-08
FORMULA_NAME HealthRecord-PT-10-UpperBounds-09
FORMULA_NAME HealthRecord-PT-10-UpperBounds-10
FORMULA_NAME HealthRecord-PT-10-UpperBounds-11
FORMULA_NAME HealthRecord-PT-10-UpperBounds-12
FORMULA_NAME HealthRecord-PT-10-UpperBounds-13
FORMULA_NAME HealthRecord-PT-10-UpperBounds-14
FORMULA_NAME HealthRecord-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716557692172

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 13:34:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 13:34:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:34:53] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2024-05-24 13:34:54] [INFO ] Transformed 158 places.
[2024-05-24 13:34:54] [INFO ] Transformed 333 transitions.
[2024-05-24 13:34:54] [INFO ] Found NUPN structural information;
[2024-05-24 13:34:54] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Normalized transition count is 294 out of 306 initially.
// Phase 1: matrix 294 rows 158 cols
[2024-05-24 13:34:54] [INFO ] Computed 18 invariants in 11 ms
Incomplete random walk after 10000 steps, including 622 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :13
FORMULA HealthRecord-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
[2024-05-24 13:34:54] [INFO ] Flow matrix only has 294 transitions (discarded 12 similar events)
// Phase 1: matrix 294 rows 158 cols
[2024-05-24 13:34:54] [INFO ] Computed 18 invariants in 10 ms
[2024-05-24 13:34:54] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-24 13:34:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2024-05-24 13:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:34:54] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-24 13:34:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:34:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:34:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:34:54] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-24 13:34:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:34:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:34:54] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-24 13:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-05-24 13:34:54] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 38 ms.
[2024-05-24 13:34:54] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 0 ms to minimize.
[2024-05-24 13:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-24 13:34:54] [INFO ] Added : 16 causal constraints over 5 iterations in 256 ms. Result :sat
Minimization took 25 ms.
[2024-05-24 13:34:55] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:34:55] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:34:55] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-24 13:34:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:34:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:34:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 13:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:34:55] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-24 13:34:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:34:55] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-24 13:34:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-24 13:34:55] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 20 ms.
[2024-05-24 13:34:55] [INFO ] Added : 20 causal constraints over 4 iterations in 95 ms. Result :sat
Minimization took 25 ms.
[2024-05-24 13:34:55] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 13:34:55] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:34:55] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-24 13:34:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:34:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-24 13:34:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 13:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:34:55] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-24 13:34:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 13:34:55] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-24 13:34:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-24 13:34:55] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 23 ms.
[2024-05-24 13:34:55] [INFO ] Added : 17 causal constraints over 4 iterations in 89 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Graph (trivial) has 237 edges and 158 vertex of which 10 / 158 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 664 edges and 153 vertex of which 123 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Drop transitions removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 123 transition count 156
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 192 place count 45 transition count 78
Iterating global reduction 1 with 78 rules applied. Total rules applied 270 place count 45 transition count 78
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 270 place count 45 transition count 74
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 278 place count 41 transition count 74
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 290 place count 29 transition count 58
Iterating global reduction 1 with 12 rules applied. Total rules applied 302 place count 29 transition count 58
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 311 place count 29 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 312 place count 28 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 313 place count 28 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 314 place count 28 transition count 47
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 322 place count 24 transition count 43
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 323 place count 24 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 324 place count 23 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 325 place count 22 transition count 41
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 329 place count 22 transition count 37
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 331 place count 21 transition count 36
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 332 place count 20 transition count 35
Iterating global reduction 4 with 1 rules applied. Total rules applied 333 place count 20 transition count 35
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 336 place count 20 transition count 32
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 337 place count 20 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 338 place count 19 transition count 31
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 339 place count 19 transition count 31
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 340 place count 19 transition count 30
Applied a total of 340 rules in 37 ms. Remains 19 /158 variables (removed 139) and now considering 30/306 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 19/158 places, 30/306 transitions.
Normalized transition count is 24 out of 30 initially.
// Phase 1: matrix 24 rows 19 cols
[2024-05-24 13:34:55] [INFO ] Computed 2 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 54742 resets, run finished after 686 ms. (steps per millisecond=1457 ) properties (out of 3) seen :3
FORMULA HealthRecord-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2877 ms.

BK_STOP 1716557697406

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is HealthRecord-PT-10, 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 r197-tall-171640625700481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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