About the Execution of 2023-gold for DNAwalker-PT-02track12Block2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
214.436 | 6686.00 | 10840.00 | 301.10 | 1 2 1 1 2 1 2 2 2 2 2 2 2 2 2 2 | normal |
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.r131-smll-171624288600236.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 DNAwalker-PT-02track12Block2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-171624288600236
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 13 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 13:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 13 13:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 16 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K 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 DNAwalker-PT-02track12Block2-UpperBounds-00
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-01
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-02
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-03
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-04
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-05
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-06
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-07
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-08
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-09
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-10
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-11
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-12
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-13
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-14
FORMULA_NAME DNAwalker-PT-02track12Block2-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716421919839
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=DNAwalker-PT-02track12Block2
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-22 23:52:02] [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-22 23:52:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:52:02] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-22 23:52:02] [INFO ] Transformed 14 places.
[2024-05-22 23:52:02] [INFO ] Transformed 84 transitions.
[2024-05-22 23:52:02] [INFO ] Parsed PT model containing 14 places and 84 transitions and 244 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 83 out of 84 initially.
// Phase 1: matrix 83 rows 14 cols
[2024-05-22 23:52:02] [INFO ] Computed 0 invariants in 11 ms
Incomplete random walk after 10000 steps, including 1106 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 182 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 182 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 169 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 172 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 172 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 180 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10000 steps, including 187 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 188 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 169 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 186 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 169 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 169 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :28
[2024-05-22 23:52:03] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
// Phase 1: matrix 83 rows 14 cols
[2024-05-22 23:52:03] [INFO ] Computed 0 invariants in 10 ms
[2024-05-22 23:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:03] [INFO ] [Real]Absence check using state equation in 73 ms returned unsat
[2024-05-22 23:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:03] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-22 23:52:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:52:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:03] [INFO ] [Nat]Absence check using state equation in 82 ms returned unsat
[2024-05-22 23:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:03] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
[2024-05-22 23:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:03] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2024-05-22 23:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:03] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-22 23:52:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:52:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Nat]Absence check using state equation in 52 ms returned unsat
[2024-05-22 23:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Real]Absence check using state equation in 26 ms returned unsat
[2024-05-22 23:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-22 23:52:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Nat]Absence check using state equation in 37 ms returned unsat
[2024-05-22 23:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-22 23:52:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Nat]Absence check using state equation in 37 ms returned unsat
[2024-05-22 23:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 23:52:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Nat]Absence check using state equation in 79 ms returned unsat
[2024-05-22 23:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-22 23:52:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Nat]Absence check using state equation in 81 ms returned unsat
[2024-05-22 23:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 23:52:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Nat]Absence check using state equation in 35 ms returned unsat
[2024-05-22 23:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-22 23:52:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Nat]Absence check using state equation in 54 ms returned unsat
[2024-05-22 23:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:04] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 23:52:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:05] [INFO ] [Nat]Absence check using state equation in 43 ms returned unsat
[2024-05-22 23:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:05] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-22 23:52:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:05] [INFO ] [Nat]Absence check using state equation in 44 ms returned unsat
[2024-05-22 23:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:05] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-22 23:52:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:05] [INFO ] [Nat]Absence check using state equation in 34 ms returned unsat
[2024-05-22 23:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:05] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 23:52:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:52:05] [INFO ] [Nat]Absence check using state equation in 37 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 2, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max seen :[1, 2, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-02track12Block2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2906 ms.
BK_STOP 1716421926525
--------------------
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="DNAwalker-PT-02track12Block2"
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 DNAwalker-PT-02track12Block2, 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 r131-smll-171624288600236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-02track12Block2.tgz
mv DNAwalker-PT-02track12Block2 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 '
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 ;