Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r031-smll-177946790600010.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is AutonomousCar-PT-05b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-smll-177946790600010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.7K Mar 5 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 5 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 5 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 5 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 5 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 5 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 159K Mar 3 18:30 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-05b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779472327475

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-22 17:52:09] [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]
[2026-05-22 17:52:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:52:10] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2026-05-22 17:52:10] [INFO ] Transformed 255 places.
[2026-05-22 17:52:10] [INFO ] Transformed 490 transitions.
[2026-05-22 17:52:10] [INFO ] Found NUPN structural information;
[2026-05-22 17:52:10] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 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 490 rows 255 cols
[2026-05-22 17:52:10] [INFO ] Computed 10 invariants in 37 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 (11 resets) in 83 ms. (119 steps per ms)
FORMULA AutonomousCar-PT-05b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30000 steps (45 resets) in 78 ms. (379 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-22 17:52:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 17:52:11] [INFO ] [Real]Absence check using 10 positive place invariants in 38 ms returned sat
[2026-05-22 17:52:12] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 17:52:12] [INFO ] Deduced a trap composed of 7 places in 770 ms of which 146 ms to minimize.
[2026-05-22 17:52:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 17:52:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2026-05-22 17:52:13] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 17:52:13] [INFO ] Deduced a trap composed of 7 places in 353 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 17:52:14] [INFO ] Deduced a trap composed of 35 places in 262 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 17:52:14] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 17:52:14] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 17:52:14] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 17:52:15] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 6 ms to minimize.
[2026-05-22 17:52:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1470 ms
[2026-05-22 17:52:15] [INFO ] Computed and/alt/rep : 211/245/211 causal constraints (skipped 278 transitions) in 144 ms.
[2026-05-22 17:52:16] [INFO ] Added : 87 causal constraints over 18 iterations in 1130 ms. Result :sat
Minimization took 319 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 17:52:16] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2026-05-22 17:52:17] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 17:52:17] [INFO ] Deduced a trap composed of 12 places in 351 ms of which 26 ms to minimize.
[2026-05-22 17:52:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 17:52:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2026-05-22 17:52:18] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 17:52:18] [INFO ] Deduced a trap composed of 12 places in 369 ms of which 25 ms to minimize.
[2026-05-22 17:52:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 427 ms
[2026-05-22 17:52:18] [INFO ] Computed and/alt/rep : 211/245/211 causal constraints (skipped 278 transitions) in 100 ms.
[2026-05-22 17:52:19] [INFO ] Added : 95 causal constraints over 19 iterations in 992 ms. Result :sat
Minimization took 291 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 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 490/490 transitions.
Graph (trivial) has 240 edges and 255 vertex of which 4 / 255 are part of one of the 2 SCC in 4 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 759 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 248 transition count 372
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 139 rules applied. Total rules applied 252 place count 138 transition count 343
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 269 place count 122 transition count 342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 270 place count 121 transition count 342
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 270 place count 121 transition count 335
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 284 place count 114 transition count 335
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 306 place count 92 transition count 313
Iterating global reduction 4 with 22 rules applied. Total rules applied 328 place count 92 transition count 313
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 428 place count 92 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 428 place count 92 transition count 211
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 432 place count 90 transition count 211
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 438 place count 84 transition count 185
Iterating global reduction 5 with 6 rules applied. Total rules applied 444 place count 84 transition count 185
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 5 with 10 rules applied. Total rules applied 454 place count 84 transition count 175
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 459 place count 79 transition count 175
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 7 with 58 rules applied. Total rules applied 517 place count 50 transition count 145
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 522 place count 45 transition count 115
Iterating global reduction 7 with 5 rules applied. Total rules applied 527 place count 45 transition count 115
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 532 place count 45 transition count 110
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 537 place count 40 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 538 place count 39 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 539 place count 38 transition count 109
Applied a total of 539 rules in 141 ms. Remains 38 /255 variables (removed 217) and now considering 109/490 (removed 381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 38/255 places, 109/490 transitions.
// Phase 1: matrix 109 rows 38 cols
[2026-05-22 17:52:20] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (11628 resets) in 2441 ms. (409 steps per ms)
FORMULA AutonomousCar-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2187 resets) in 684 ms. (1459 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 )
[2026-05-22 17:52:23] [INFO ] Flatten gal took : 113 ms
[2026-05-22 17:52:23] [INFO ] Flatten gal took : 41 ms
[2026-05-22 17:52:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1028649995316793371.gal : 30 ms
[2026-05-22 17:52:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4327105094750111171.prop : 1 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1028649995316793371.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4327105094750111171.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 14045 ms.

BK_STOP 1779472344045

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-05b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is AutonomousCar-PT-05b, 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 r031-smll-177946790600010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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