Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339900421.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 itstools
Input is ErlangenMainframeV0-PT-1400, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339900421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 75M
-rw-r--r-- 1 mcc users 5.9K Jun 6 09:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 6 09:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 6 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 12:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 12:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jun 6 12:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 12:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 8.2K Jun 6 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 6 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Jun 6 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 6 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 12:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 12:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 75M Jun 5 20:08 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 ErlangenMainframeV0-PT-1400-UpperBounds-00
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-01
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-02
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-03
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-04
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-05
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-06
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-07
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-08
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-09
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-10
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-11
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-12
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-13
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-14
FORMULA_NAME ErlangenMainframeV0-PT-1400-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749384151416

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1400
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-08 12:02:32] [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-06-08 12:02:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 12:02:35] [INFO ] Load time of PNML (sax parser for PT used): 2602 ms
[2025-06-08 12:02:35] [INFO ] Transformed 299 places.
[2025-06-08 12:02:35] [INFO ] Transformed 49450 transitions.
[2025-06-08 12:02:35] [INFO ] Found NUPN structural information;
[2025-06-08 12:02:35] [INFO ] Parsed PT model containing 299 places and 49450 transitions and 1540891 arcs in 3152 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 4 places in 161 ms
Reduce places removed 4 places and 4 transitions.
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 49446 rows 295 cols
[2025-06-08 12:02:37] [INFO ] Computed 34 invariants in 1439 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 (2 resets) in 5322 ms. (1 steps per ms)
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 752 ms. (26 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-08 12:02:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 12:02:44] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-06-08 12:02:44] [INFO ] [Real]Absence check using 20 positive and 14 generalized place invariants in 8 ms returned sat
[2025-06-08 12:02:49] [INFO ] [Real]Absence check using state equation in 4816 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 12:02:49] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2025-06-08 12:02:49] [INFO ] [Real]Absence check using 20 positive and 14 generalized place invariants in 5 ms returned sat
[2025-06-08 12:02:54] [INFO ] [Real]Absence check using state equation in 4936 ms returned unknown
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 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 49446/49446 transitions.
Graph (trivial) has 227 edges and 295 vertex of which 6 / 295 are part of one of the 3 SCC in 11 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 2171 edges and 292 vertex of which 290 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.346 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 95 rules applied. Total rules applied 97 place count 290 transition count 49345
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 191 place count 197 transition count 49344
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 192 place count 196 transition count 49344
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 192 place count 196 transition count 49340
Deduced a syphon composed of 4 places in 58 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 200 place count 192 transition count 49340
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 243 place count 149 transition count 49297
Iterating global reduction 3 with 43 rules applied. Total rules applied 286 place count 149 transition count 49297
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 286 place count 149 transition count 49291
Deduced a syphon composed of 6 places in 93 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 298 place count 143 transition count 49291
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 311 place count 130 transition count 32909
Ensure Unique test removed 13 places
Iterating global reduction 3 with 26 rules applied. Total rules applied 337 place count 117 transition count 32909
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 350 place count 104 transition count 145
Iterating global reduction 3 with 13 rules applied. Total rules applied 363 place count 104 transition count 145
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 465 place count 53 transition count 94
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 223 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 3 rules applied. Total rules applied 468 place count 52 transition count 92
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 472 place count 48 transition count 66
Iterating global reduction 4 with 4 rules applied. Total rules applied 476 place count 48 transition count 66
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 480 place count 48 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 480 place count 48 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 482 place count 47 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
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 486 place count 45 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 490 place count 45 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 511 place count 45 transition count 47
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 526 place count 45 transition count 32
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 555 place count 30 transition count 18
Ensure Unique test removed 11 places
Iterating post reduction 7 with 11 rules applied. Total rules applied 566 place count 19 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 567 place count 19 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 568 place count 18 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 569 place count 17 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 571 place count 15 transition count 17
Applied a total of 571 rules in 16852 ms. Remains 15 /295 variables (removed 280) and now considering 17/49446 (removed 49429) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16863 ms. Remains : 15/295 places, 17/49446 transitions.
// Phase 1: matrix 17 rows 15 cols
[2025-06-08 12:03:11] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 920 ms. (1085 steps per ms)
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 307 ms. (3246 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-06-08 12:03:12] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:03:12] [INFO ] Flatten gal took : 4 ms
[2025-06-08 12:03:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4987757384447736760.gal : 4 ms
[2025-06-08 12:03:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1783880460463248605.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4987757384447736760.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1783880460463248605.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 39953 ms.

BK_STOP 1749384192666

--------------------
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="ErlangenMainframeV0-PT-1400"
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-5832"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV0-PT-1400, 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 r254-tall-174931339900421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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