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.r197-smll-167840343800109.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 itstools
Input is GPUForwardProgress-PT-28b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840343800109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.3K Feb 25 14:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 14:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 14:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 14:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 14:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 14:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 14:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:12 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 141K 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-28b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678480832036

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-28b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-10 20:40:35] [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]
[2023-03-10 20:40:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 20:40:35] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-10 20:40:35] [INFO ] Transformed 568 places.
[2023-03-10 20:40:35] [INFO ] Transformed 597 transitions.
[2023-03-10 20:40:35] [INFO ] Found NUPN structural information;
[2023-03-10 20:40:35] [INFO ] Parsed PT model containing 568 places and 597 transitions and 1477 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 597 rows 568 cols
[2023-03-10 20:40:36] [INFO ] Computed 30 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 40 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :11
FORMULA GPUForwardProgress-PT-28b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :1
FORMULA GPUForwardProgress-PT-28b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
[2023-03-10 20:40:36] [INFO ] Invariant cache hit.
[2023-03-10 20:40:36] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 56 ms returned sat
[2023-03-10 20:40:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:40:37] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2023-03-10 20:40:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:40:37] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 45 ms returned sat
[2023-03-10 20:40:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:40:38] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2023-03-10 20:40:38] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 78 ms.
[2023-03-10 20:40:39] [INFO ] Added : 154 causal constraints over 31 iterations in 1844 ms. Result :sat
Minimization took 162 ms.
[2023-03-10 20:40:40] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 39 ms returned sat
[2023-03-10 20:40:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:40:40] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2023-03-10 20:40:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:40:41] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 42 ms returned sat
[2023-03-10 20:40:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:40:41] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2023-03-10 20:40:41] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 75 ms.
[2023-03-10 20:40:44] [INFO ] Added : 188 causal constraints over 38 iterations in 2659 ms. Result :sat
Minimization took 193 ms.
[2023-03-10 20:40:44] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 43 ms returned sat
[2023-03-10 20:40:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:40:45] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2023-03-10 20:40:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:40:45] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 43 ms returned sat
[2023-03-10 20:40:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:40:45] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2023-03-10 20:40:45] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 74 ms.
[2023-03-10 20:40:48] [INFO ] Added : 181 causal constraints over 37 iterations in 2336 ms. Result :sat
Minimization took 193 ms.
[2023-03-10 20:40:48] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 44 ms returned sat
[2023-03-10 20:40:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:40:49] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2023-03-10 20:40:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:40:49] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 43 ms returned sat
[2023-03-10 20:40:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:40:49] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2023-03-10 20:40:49] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 75 ms.
[2023-03-10 20:40:52] [INFO ] Added : 196 causal constraints over 40 iterations in 2343 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA GPUForwardProgress-PT-28b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 568 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 596/596 transitions.
Graph (trivial) has 510 edges and 568 vertex of which 7 / 568 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 852 edges and 562 vertex of which 530 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 325 rules applied. Total rules applied 327 place count 530 transition count 261
Reduce places removed 323 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 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 353 rules applied. Total rules applied 680 place count 207 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 681 place count 206 transition count 231
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 681 place count 206 transition count 175
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 793 place count 150 transition count 175
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 823 place count 120 transition count 145
Iterating global reduction 3 with 30 rules applied. Total rules applied 853 place count 120 transition count 145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 853 place count 120 transition count 143
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 857 place count 118 transition count 143
Graph (complete) has 229 edges and 118 vertex of which 25 are kept as prefixes of interest. Removing 93 places using SCC suffix rule.1 ms
Discarding 93 places :
Also discarding 92 output transitions
Drop transitions removed 92 transitions
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 17 rules applied. Total rules applied 874 place count 25 transition count 35
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 44 rules applied. Total rules applied 918 place count 9 transition count 7
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 7 rules applied. Total rules applied 925 place count 5 transition count 4
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 926 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 927 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 928 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 928 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 930 place count 2 transition count 1
Applied a total of 930 rules in 88 ms. Remains 2 /568 variables (removed 566) and now considering 1/596 (removed 595) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 2/568 places, 1/596 transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-10 20:40:52] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 456 ms. (steps per millisecond=2192 ) properties (out of 1) seen :1
FORMULA GPUForwardProgress-PT-28b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 17539 ms.

BK_STOP 1678480854972

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="GPUForwardProgress-PT-28b"
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-5348"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-28b, 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-smll-167840343800109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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