Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813597900413.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is AutoFlight-PT-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597900413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.7K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:22 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 AutoFlight-PT-03b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678627502732

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-03b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:25:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 13:25:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:25:05] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-12 13:25:05] [INFO ] Transformed 298 places.
[2023-03-12 13:25:05] [INFO ] Transformed 296 transitions.
[2023-03-12 13:25:05] [INFO ] Found NUPN structural information;
[2023-03-12 13:25:05] [INFO ] Parsed PT model containing 298 places and 296 transitions and 692 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 296 rows 298 cols
[2023-03-12 13:25:05] [INFO ] Computed 22 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 62 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :13
FORMULA AutoFlight-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
[2023-03-12 13:25:05] [INFO ] Invariant cache hit.
[2023-03-12 13:25:06] [INFO ] [Real]Absence check using 21 positive place invariants in 43 ms returned sat
[2023-03-12 13:25:06] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 13:25:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:25:06] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2023-03-12 13:25:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:25:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 57 ms returned sat
[2023-03-12 13:25:06] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 13:25:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:25:07] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2023-03-12 13:25:07] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 3 ms to minimize.
[2023-03-12 13:25:07] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 2 ms to minimize.
[2023-03-12 13:25:07] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 5 ms to minimize.
[2023-03-12 13:25:07] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 1 ms to minimize.
[2023-03-12 13:25:07] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 10 ms to minimize.
[2023-03-12 13:25:08] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 1 ms to minimize.
[2023-03-12 13:25:08] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 1 ms to minimize.
[2023-03-12 13:25:08] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 6 ms to minimize.
[2023-03-12 13:25:08] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2023-03-12 13:25:08] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2023-03-12 13:25:08] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 0 ms to minimize.
[2023-03-12 13:25:08] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 1 ms to minimize.
[2023-03-12 13:25:08] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1861 ms
[2023-03-12 13:25:08] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-12 13:25:10] [INFO ] Added : 277 causal constraints over 56 iterations in 1676 ms. Result :sat
Minimization took 70 ms.
[2023-03-12 13:25:10] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-03-12 13:25:10] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 13:25:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:25:10] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-12 13:25:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:25:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 29 ms returned sat
[2023-03-12 13:25:11] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 13:25:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:25:11] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2023-03-12 13:25:11] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2023-03-12 13:25:11] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2023-03-12 13:25:11] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 1 ms to minimize.
[2023-03-12 13:25:11] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 1 ms to minimize.
[2023-03-12 13:25:11] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 0 ms to minimize.
[2023-03-12 13:25:12] [INFO ] Deduced a trap composed of 58 places in 147 ms of which 1 ms to minimize.
[2023-03-12 13:25:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 863 ms
[2023-03-12 13:25:12] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 54 ms.
[2023-03-12 13:25:13] [INFO ] Added : 295 causal constraints over 59 iterations in 1577 ms. Result :sat
Minimization took 75 ms.
[2023-03-12 13:25:13] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-03-12 13:25:13] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:25:14] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2023-03-12 13:25:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:25:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 46 ms returned sat
[2023-03-12 13:25:14] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 20 ms returned sat
[2023-03-12 13:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:25:14] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-12 13:25:14] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 1 ms to minimize.
[2023-03-12 13:25:14] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2023-03-12 13:25:14] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2023-03-12 13:25:14] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2023-03-12 13:25:14] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2023-03-12 13:25:14] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 0 ms to minimize.
[2023-03-12 13:25:15] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 0 ms to minimize.
[2023-03-12 13:25:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 657 ms
[2023-03-12 13:25:15] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-12 13:25:16] [INFO ] Added : 278 causal constraints over 56 iterations in 1146 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA AutoFlight-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 296/296 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 298 transition count 182
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 135 rules applied. Total rules applied 249 place count 184 transition count 161
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 256 place count 178 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 257 place count 177 transition count 160
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 257 place count 177 transition count 118
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 341 place count 135 transition count 118
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 369 place count 107 transition count 90
Iterating global reduction 4 with 28 rules applied. Total rules applied 397 place count 107 transition count 90
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 397 place count 107 transition count 81
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 415 place count 98 transition count 81
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 463 place count 74 transition count 57
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 475 place count 74 transition count 45
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 487 place count 62 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 61 transition count 44
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 5 with 23 rules applied. Total rules applied 511 place count 50 transition count 32
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 523 place count 38 transition count 32
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 523 place count 38 transition count 23
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 541 place count 29 transition count 23
Applied a total of 541 rules in 122 ms. Remains 29 /298 variables (removed 269) and now considering 23/296 (removed 273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 29/298 places, 23/296 transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-12 13:25:16] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 2) seen :2
FORMULA AutoFlight-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 12149 ms.
ITS solved all properties within timeout

BK_STOP 1678627517802

--------------------
content from stderr:

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="AutoFlight-PT-03b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-03b, 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 r009-oct2-167813597900413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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