Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r201-smll-167840347300077.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is GPUForwardProgress-PT-20b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347300077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.4K Feb 25 14:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 14:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 14:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 14:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 14:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 14:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 14:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 103K Mar 5 18:22 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 GPUForwardProgress-PT-20b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-20b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678528111625

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-20b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 09:48:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 09:48:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:48:34] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2023-03-11 09:48:34] [INFO ] Transformed 416 places.
[2023-03-11 09:48:34] [INFO ] Transformed 437 transitions.
[2023-03-11 09:48:34] [INFO ] Found NUPN structural information;
[2023-03-11 09:48:34] [INFO ] Parsed PT model containing 416 places and 437 transitions and 1077 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 437 rows 416 cols
[2023-03-11 09:48:34] [INFO ] Computed 22 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 57 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :11
FORMULA GPUForwardProgress-PT-20b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
[2023-03-11 09:48:34] [INFO ] Invariant cache hit.
[2023-03-11 09:48:35] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 28 ms returned sat
[2023-03-11 09:48:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:48:35] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2023-03-11 09:48:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:48:35] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 25 ms returned sat
[2023-03-11 09:48:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:48:35] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2023-03-11 09:48:36] [INFO ] Computed and/alt/rep : 431/777/431 causal constraints (skipped 5 transitions) in 63 ms.
[2023-03-11 09:48:37] [INFO ] Added : 139 causal constraints over 28 iterations in 1510 ms. Result :sat
Minimization took 91 ms.
[2023-03-11 09:48:37] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 16 ms returned sat
[2023-03-11 09:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:48:37] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2023-03-11 09:48:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:48:38] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 21 ms returned sat
[2023-03-11 09:48:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:48:38] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2023-03-11 09:48:38] [INFO ] Computed and/alt/rep : 431/777/431 causal constraints (skipped 5 transitions) in 41 ms.
[2023-03-11 09:48:39] [INFO ] Added : 149 causal constraints over 31 iterations in 1048 ms. Result :sat
Minimization took 96 ms.
[2023-03-11 09:48:39] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 20 ms returned sat
[2023-03-11 09:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:48:39] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2023-03-11 09:48:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:48:40] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 20 ms returned sat
[2023-03-11 09:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:48:40] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2023-03-11 09:48:40] [INFO ] Computed and/alt/rep : 431/777/431 causal constraints (skipped 5 transitions) in 39 ms.
[2023-03-11 09:48:41] [INFO ] Added : 167 causal constraints over 34 iterations in 1096 ms. Result :sat
Minimization took 97 ms.
[2023-03-11 09:48:41] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 19 ms returned sat
[2023-03-11 09:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:48:41] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2023-03-11 09:48:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:48:41] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 21 ms returned sat
[2023-03-11 09:48:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:48:42] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2023-03-11 09:48:42] [INFO ] Computed and/alt/rep : 431/777/431 causal constraints (skipped 5 transitions) in 38 ms.
[2023-03-11 09:48:42] [INFO ] Added : 124 causal constraints over 25 iterations in 763 ms. Result :sat
Minimization took 78 ms.
[2023-03-11 09:48:43] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 20 ms returned sat
[2023-03-11 09:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:48:43] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-03-11 09:48:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:48:43] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 20 ms returned sat
[2023-03-11 09:48:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:48:43] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2023-03-11 09:48:43] [INFO ] Computed and/alt/rep : 431/777/431 causal constraints (skipped 5 transitions) in 36 ms.
[2023-03-11 09:48:44] [INFO ] Added : 133 causal constraints over 27 iterations in 842 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA GPUForwardProgress-PT-20b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-20b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-20b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-20b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 416 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 435/435 transitions.
Graph (trivial) has 370 edges and 416 vertex of which 7 / 416 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 618 edges and 410 vertex of which 385 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 2 places and 2 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 236 rules applied. Total rules applied 238 place count 383 transition count 188
Reduce places removed 233 places and 1 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 254 rules applied. Total rules applied 492 place count 150 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 493 place count 149 transition count 166
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 493 place count 149 transition count 127
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 571 place count 110 transition count 127
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 594 place count 87 transition count 104
Iterating global reduction 3 with 23 rules applied. Total rules applied 617 place count 87 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 618 place count 87 transition count 103
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 618 place count 87 transition count 100
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 624 place count 84 transition count 100
Graph (complete) has 160 edges and 84 vertex of which 25 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.1 ms
Discarding 59 places :
Also discarding 58 output transitions
Drop transitions removed 58 transitions
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 18 rules applied. Total rules applied 642 place count 25 transition count 25
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 37 rules applied. Total rules applied 679 place count 8 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 679 place count 8 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 681 place count 7 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 684 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 685 place count 4 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 686 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 686 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 688 place count 2 transition count 1
Applied a total of 688 rules in 75 ms. Remains 2 /416 variables (removed 414) and now considering 1/435 (removed 434) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 2/416 places, 1/435 transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-11 09:48:44] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 363 ms. (steps per millisecond=2754 ) properties (out of 1) seen :1
FORMULA GPUForwardProgress-PT-20b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 11131 ms.
ITS solved all properties within timeout

BK_STOP 1678528126371

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="GPUForwardProgress-PT-20b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is GPUForwardProgress-PT-20b, 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 r201-smll-167840347300077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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