Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r013-tall-174853743100095.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is AutonomousCar-PT-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743100095
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748541220215

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:53:41] [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]
[2025-05-29 17:53:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:53:41] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2025-05-29 17:53:41] [INFO ] Transformed 425 places.
[2025-05-29 17:53:41] [INFO ] Transformed 2252 transitions.
[2025-05-29 17:53:41] [INFO ] Found NUPN structural information;
[2025-05-29 17:53:41] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 353 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2252 rows 425 cols
[2025-05-29 17:53:41] [INFO ] Computed 15 invariants in 68 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (77 resets) in 104 ms. (95 steps per ms)
FORMULA AutonomousCar-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (22 resets) in 42 ms. (465 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-29 17:53:42] [INFO ] Invariant cache hit.
[2025-05-29 17:53:42] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2025-05-29 17:53:43] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2025-05-29 17:53:44] [INFO ] Deduced a trap composed of 7 places in 1006 ms of which 25 ms to minimize.
[2025-05-29 17:53:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:53:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2025-05-29 17:53:45] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2025-05-29 17:53:45] [INFO ] Deduced a trap composed of 7 places in 810 ms of which 3 ms to minimize.
[2025-05-29 17:53:46] [INFO ] Deduced a trap composed of 35 places in 539 ms of which 2 ms to minimize.
[2025-05-29 17:53:47] [INFO ] Deduced a trap composed of 56 places in 491 ms of which 2 ms to minimize.
[2025-05-29 17:53:47] [INFO ] Deduced a trap composed of 50 places in 472 ms of which 2 ms to minimize.
[2025-05-29 17:53:48] [INFO ] Deduced a trap composed of 51 places in 450 ms of which 13 ms to minimize.
[2025-05-29 17:53:48] [INFO ] Deduced a trap composed of 49 places in 425 ms of which 3 ms to minimize.
[2025-05-29 17:53:48] [INFO ] Deduced a trap composed of 56 places in 385 ms of which 2 ms to minimize.
[2025-05-29 17:53:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3984 ms
[2025-05-29 17:53:49] [INFO ] Computed and/alt/rep : 341/390/341 causal constraints (skipped 1910 transitions) in 789 ms.
[2025-05-29 17:53:49] [INFO ] Added : 0 causal constraints over 0 iterations in 796 ms. Result :unknown
[2025-05-29 17:53:49] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-05-29 17:53:50] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2025-05-29 17:53:51] [INFO ] Deduced a trap composed of 15 places in 827 ms of which 2 ms to minimize.
[2025-05-29 17:53:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:53:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-05-29 17:53:51] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2025-05-29 17:53:52] [INFO ] Deduced a trap composed of 15 places in 819 ms of which 2 ms to minimize.
[2025-05-29 17:53:53] [INFO ] Deduced a trap composed of 15 places in 772 ms of which 2 ms to minimize.
[2025-05-29 17:53:54] [INFO ] Deduced a trap composed of 35 places in 745 ms of which 2 ms to minimize.
[2025-05-29 17:53:55] [INFO ] Deduced a trap composed of 35 places in 685 ms of which 2 ms to minimize.
[2025-05-29 17:53:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3280 ms
[2025-05-29 17:53:55] [INFO ] Computed and/alt/rep : 341/390/341 causal constraints (skipped 1910 transitions) in 714 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Graph (trivial) has 407 edges and 425 vertex of which 4 / 425 are part of one of the 2 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1994 edges and 423 vertex of which 416 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.24 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 189 rules applied. Total rules applied 191 place count 416 transition count 2054
Reduce places removed 187 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 245 rules applied. Total rules applied 436 place count 229 transition count 1996
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 36 rules applied. Total rules applied 472 place count 195 transition count 1994
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 475 place count 193 transition count 1993
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 475 place count 193 transition count 1989
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 483 place count 189 transition count 1989
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 520 place count 152 transition count 1952
Iterating global reduction 4 with 37 rules applied. Total rules applied 557 place count 152 transition count 1952
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 4 with 400 rules applied. Total rules applied 957 place count 152 transition count 1552
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 957 place count 152 transition count 1550
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 961 place count 150 transition count 1550
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 972 place count 139 transition count 1449
Iterating global reduction 5 with 11 rules applied. Total rules applied 983 place count 139 transition count 1449
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 5 with 20 rules applied. Total rules applied 1003 place count 139 transition count 1429
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1013 place count 129 transition count 1429
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 94 rules applied. Total rules applied 1107 place count 82 transition count 1382
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1117 place count 72 transition count 1272
Iterating global reduction 7 with 10 rules applied. Total rules applied 1127 place count 72 transition count 1272
Free-agglomeration rule applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1137 place count 72 transition count 1262
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1147 place count 62 transition count 1262
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1148 place count 62 transition count 1262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1149 place count 61 transition count 1261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1150 place count 60 transition count 1261
Applied a total of 1150 rules in 738 ms. Remains 60 /425 variables (removed 365) and now considering 1261/2252 (removed 991) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 752 ms. Remains : 60/425 places, 1261/2252 transitions.
// Phase 1: matrix 1261 rows 60 cols
[2025-05-29 17:53:57] [INFO ] Computed 14 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2660 resets) in 15186 ms. (65 steps per ms)
FORMULA AutonomousCar-PT-10b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (935 resets) in 1846 ms. (541 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-29 17:54:15] [INFO ] Flatten gal took : 512 ms
[2025-05-29 17:54:15] [INFO ] Flatten gal took : 256 ms
[2025-05-29 17:54:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality727580777357849387.gal : 75 ms
[2025-05-29 17:54:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4132526078423908025.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality727580777357849387.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4132526078423908025.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 34378 ms.

BK_STOP 1748541255821

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="AutonomousCar-PT-10b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is AutonomousCar-PT-10b, 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 r013-tall-174853743100095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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