Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901995100789.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 SmartHome-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901995100789
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 92K May 29 14:33 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 SmartHome-PT-13-UpperBounds-00
FORMULA_NAME SmartHome-PT-13-UpperBounds-01
FORMULA_NAME SmartHome-PT-13-UpperBounds-02
FORMULA_NAME SmartHome-PT-13-UpperBounds-03
FORMULA_NAME SmartHome-PT-13-UpperBounds-04
FORMULA_NAME SmartHome-PT-13-UpperBounds-05
FORMULA_NAME SmartHome-PT-13-UpperBounds-06
FORMULA_NAME SmartHome-PT-13-UpperBounds-07
FORMULA_NAME SmartHome-PT-13-UpperBounds-08
FORMULA_NAME SmartHome-PT-13-UpperBounds-09
FORMULA_NAME SmartHome-PT-13-UpperBounds-10
FORMULA_NAME SmartHome-PT-13-UpperBounds-11
FORMULA_NAME SmartHome-PT-13-UpperBounds-12
FORMULA_NAME SmartHome-PT-13-UpperBounds-13
FORMULA_NAME SmartHome-PT-13-UpperBounds-14
FORMULA_NAME SmartHome-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749249777934

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-06 22:42:59] [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-06 22:42:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 22:42:59] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2025-06-06 22:42:59] [INFO ] Transformed 385 places.
[2025-06-06 22:42:59] [INFO ] Transformed 407 transitions.
[2025-06-06 22:42:59] [INFO ] Found NUPN structural information;
[2025-06-06 22:42:59] [INFO ] Parsed PT model containing 385 places and 407 transitions and 935 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 113 places in 3 ms
Reduce places removed 113 places and 88 transitions.
FORMULA SmartHome-PT-13-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 319 rows 272 cols
[2025-06-06 22:42:59] [INFO ] Computed 13 invariants in 21 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (52 resets) in 40 ms. (243 steps per ms)
FORMULA SmartHome-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SmartHome-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SmartHome-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SmartHome-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SmartHome-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SmartHome-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SmartHome-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SmartHome-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SmartHome-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SmartHome-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SmartHome-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SmartHome-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SmartHome-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (14 resets) in 30 ms. (645 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-06 22:42:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 22:42:59] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2025-06-06 22:42:59] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:42:59] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 11 ms to minimize.
[2025-06-06 22:42:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 22:43:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-06 22:43:00] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:43:00] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:43:00] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:43:00] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:43:00] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:43:00] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:43:00] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 5 ms to minimize.
[2025-06-06 22:43:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 423 ms
[2025-06-06 22:43:00] [INFO ] Computed and/alt/rep : 290/476/290 causal constraints (skipped 28 transitions) in 15 ms.
[2025-06-06 22:43:01] [INFO ] Added : 170 causal constraints over 35 iterations in 735 ms. Result :sat
Minimization took 68 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 22:43:01] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-06-06 22:43:01] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:43:01] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 5 ms to minimize.
[2025-06-06 22:43:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 22:43:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-06 22:43:01] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-06-06 22:43:01] [INFO ] Computed and/alt/rep : 290/476/290 causal constraints (skipped 28 transitions) in 19 ms.
[2025-06-06 22:43:02] [INFO ] Added : 146 causal constraints over 30 iterations in 626 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA SmartHome-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 319/319 transitions.
Graph (trivial) has 274 edges and 272 vertex of which 115 / 272 are part of one of the 7 SCC in 2 ms
Free SCC test removed 108 places
Drop transitions (Empty/Sink Transition effects.) removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Graph (complete) has 263 edges and 164 vertex of which 155 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 155 transition count 102
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 84 rules applied. Total rules applied 163 place count 85 transition count 88
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 169 place count 79 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 169 place count 79 transition count 86
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 173 place count 77 transition count 86
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 206 place count 44 transition count 53
Iterating global reduction 3 with 33 rules applied. Total rules applied 239 place count 44 transition count 53
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 247 place count 44 transition count 45
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 247 place count 44 transition count 38
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 261 place count 37 transition count 38
Graph (complete) has 61 edges and 37 vertex of which 22 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 5 rules applied. Total rules applied 266 place count 22 transition count 23
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 280 place count 18 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 280 place count 18 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 284 place count 16 transition count 11
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 292 place count 12 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 293 place count 11 transition count 6
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 8 rules applied. Total rules applied 301 place count 7 transition count 2
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 305 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 305 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 8 with 2 rules applied. Total rules applied 307 place count 2 transition count 1
Applied a total of 307 rules in 34 ms. Remains 2 /272 variables (removed 270) and now considering 1/319 (removed 318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 2/272 places, 1/319 transitions.
// Phase 1: matrix 1 rows 2 cols
[2025-06-06 22:43:02] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA SmartHome-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (500000 resets) in 225 ms. (4424 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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-06 22:43:02] [INFO ] Flatten gal took : 111 ms
[2025-06-06 22:43:02] [INFO ] Flatten gal took : 0 ms
[2025-06-06 22:43:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3317640337311896734.gal : 2 ms
[2025-06-06 22:43:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15440236149599844990.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/ReachabilityCardinality3317640337311896734.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15440236149599844990.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 3949 ms.

BK_STOP 1749249783082

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="SmartHome-PT-13"
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 SmartHome-PT-13, 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 r212-tall-174901995100789"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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