Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654421800051.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is Parking-PT-432, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654421800051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 192K May 18 16:43 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 Parking-PT-432-UpperBounds-00
FORMULA_NAME Parking-PT-432-UpperBounds-01
FORMULA_NAME Parking-PT-432-UpperBounds-02
FORMULA_NAME Parking-PT-432-UpperBounds-03
FORMULA_NAME Parking-PT-432-UpperBounds-04
FORMULA_NAME Parking-PT-432-UpperBounds-05
FORMULA_NAME Parking-PT-432-UpperBounds-06
FORMULA_NAME Parking-PT-432-UpperBounds-07
FORMULA_NAME Parking-PT-432-UpperBounds-08
FORMULA_NAME Parking-PT-432-UpperBounds-09
FORMULA_NAME Parking-PT-432-UpperBounds-10
FORMULA_NAME Parking-PT-432-UpperBounds-11
FORMULA_NAME Parking-PT-432-UpperBounds-12
FORMULA_NAME Parking-PT-432-UpperBounds-13
FORMULA_NAME Parking-PT-432-UpperBounds-14
FORMULA_NAME Parking-PT-432-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716842012297

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-432
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-27 20:33:34] [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]
[2024-05-27 20:33:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:33:34] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-05-27 20:33:34] [INFO ] Transformed 529 places.
[2024-05-27 20:33:34] [INFO ] Transformed 785 transitions.
[2024-05-27 20:33:34] [INFO ] Found NUPN structural information;
[2024-05-27 20:33:35] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
// Phase 1: matrix 457 rows 529 cols
[2024-05-27 20:33:35] [INFO ] Computed 124 invariants in 36 ms
Incomplete random walk after 10000 steps, including 89 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 16) seen :12
FORMULA Parking-PT-432-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
[2024-05-27 20:33:35] [INFO ] Invariant cache hit.
[2024-05-27 20:33:35] [INFO ] [Real]Absence check using 120 positive place invariants in 52 ms returned sat
[2024-05-27 20:33:35] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 20:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:33:36] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2024-05-27 20:33:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:33:36] [INFO ] [Nat]Absence check using 120 positive place invariants in 45 ms returned sat
[2024-05-27 20:33:36] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-27 20:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:33:36] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2024-05-27 20:33:36] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:33:36] [INFO ] [Nat]Added 108 Read/Feed constraints in 107 ms returned sat
[2024-05-27 20:33:37] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 55 ms.
[2024-05-27 20:33:38] [INFO ] Added : 190 causal constraints over 38 iterations in 1832 ms. Result :sat
Minimization took 170 ms.
[2024-05-27 20:33:39] [INFO ] [Real]Absence check using 120 positive place invariants in 44 ms returned sat
[2024-05-27 20:33:39] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 20:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:33:39] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2024-05-27 20:33:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:33:39] [INFO ] [Nat]Absence check using 120 positive place invariants in 43 ms returned sat
[2024-05-27 20:33:39] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 20:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:33:39] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2024-05-27 20:33:39] [INFO ] [Nat]Added 108 Read/Feed constraints in 87 ms returned sat
[2024-05-27 20:33:40] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 46 ms.
[2024-05-27 20:33:41] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 27 ms to minimize.
[2024-05-27 20:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2024-05-27 20:33:41] [INFO ] Added : 194 causal constraints over 39 iterations in 1864 ms. Result :sat
Minimization took 173 ms.
[2024-05-27 20:33:42] [INFO ] [Real]Absence check using 120 positive place invariants in 39 ms returned sat
[2024-05-27 20:33:42] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-27 20:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:33:42] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-05-27 20:33:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:33:42] [INFO ] [Nat]Absence check using 120 positive place invariants in 40 ms returned sat
[2024-05-27 20:33:42] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-27 20:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:33:42] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2024-05-27 20:33:43] [INFO ] [Nat]Added 108 Read/Feed constraints in 104 ms returned sat
[2024-05-27 20:33:43] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 33 ms.
[2024-05-27 20:33:44] [INFO ] Added : 204 causal constraints over 41 iterations in 1550 ms. Result :sat
Minimization took 176 ms.
[2024-05-27 20:33:44] [INFO ] [Real]Absence check using 120 positive place invariants in 33 ms returned sat
[2024-05-27 20:33:44] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-27 20:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:33:45] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2024-05-27 20:33:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:33:45] [INFO ] [Nat]Absence check using 120 positive place invariants in 41 ms returned sat
[2024-05-27 20:33:45] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 20:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:33:45] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2024-05-27 20:33:45] [INFO ] [Nat]Added 108 Read/Feed constraints in 79 ms returned sat
[2024-05-27 20:33:45] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 37 ms.
[2024-05-27 20:33:47] [INFO ] Added : 242 causal constraints over 49 iterations in 2023 ms. Result :sat
Minimization took 191 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA Parking-PT-432-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 457/457 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 529 transition count 442
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 514 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 513 transition count 441
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 32 place count 513 transition count 426
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 62 place count 498 transition count 426
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 66 place count 494 transition count 422
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 494 transition count 422
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 110 place count 474 transition count 402
Free-agglomeration rule applied 80 times.
Iterating global reduction 3 with 80 rules applied. Total rules applied 190 place count 474 transition count 322
Reduce places removed 80 places and 0 transitions.
Graph (complete) has 841 edges and 394 vertex of which 299 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.2 ms
Discarding 95 places :
Also discarding 74 output transitions
Drop transitions removed 74 transitions
Iterating post reduction 3 with 81 rules applied. Total rules applied 271 place count 299 transition count 248
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 277 place count 299 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 278 place count 298 transition count 241
Reduce places removed 63 places and 0 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 5 with 180 rules applied. Total rules applied 458 place count 235 transition count 124
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 153 rules applied. Total rules applied 611 place count 118 transition count 88
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 26 rules applied. Total rules applied 637 place count 94 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 639 place count 92 transition count 86
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 27 Pre rules applied. Total rules applied 639 place count 92 transition count 59
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 9 with 54 rules applied. Total rules applied 693 place count 65 transition count 59
Applied a total of 693 rules in 255 ms. Remains 65 /529 variables (removed 464) and now considering 59/457 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 65/529 places, 59/457 transitions.
// Phase 1: matrix 59 rows 65 cols
[2024-05-27 20:33:48] [INFO ] Computed 33 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2910 ms. (steps per millisecond=343 ) properties (out of 3) seen :3
FORMULA Parking-PT-432-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 16970 ms.

BK_STOP 1716842032722

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="Parking-PT-432"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Parking-PT-432, 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 r285-smll-171654421800051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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