Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r240-smll-165303241500237.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SmartHome-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241500237
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 7.8K Apr 29 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 09:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 56K May 10 09:34 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 SmartHome-PT-06-UpperBounds-00
FORMULA_NAME SmartHome-PT-06-UpperBounds-01
FORMULA_NAME SmartHome-PT-06-UpperBounds-02
FORMULA_NAME SmartHome-PT-06-UpperBounds-03
FORMULA_NAME SmartHome-PT-06-UpperBounds-04
FORMULA_NAME SmartHome-PT-06-UpperBounds-05
FORMULA_NAME SmartHome-PT-06-UpperBounds-06
FORMULA_NAME SmartHome-PT-06-UpperBounds-07
FORMULA_NAME SmartHome-PT-06-UpperBounds-08
FORMULA_NAME SmartHome-PT-06-UpperBounds-09
FORMULA_NAME SmartHome-PT-06-UpperBounds-10
FORMULA_NAME SmartHome-PT-06-UpperBounds-11
FORMULA_NAME SmartHome-PT-06-UpperBounds-12
FORMULA_NAME SmartHome-PT-06-UpperBounds-13
FORMULA_NAME SmartHome-PT-06-UpperBounds-14
FORMULA_NAME SmartHome-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653106933649

Running Version 202205111006
[2022-05-21 04:22:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 04:22:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:22:16] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2022-05-21 04:22:16] [INFO ] Transformed 219 places.
[2022-05-21 04:22:16] [INFO ] Transformed 254 transitions.
[2022-05-21 04:22:16] [INFO ] Found NUPN structural information;
[2022-05-21 04:22:16] [INFO ] Parsed PT model containing 219 places and 254 transitions in 453 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 18 transitions.
FORMULA SmartHome-PT-06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 236 rows 202 cols
[2022-05-21 04:22:16] [INFO ] Computed 9 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 72 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 15) seen :12
FORMULA SmartHome-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
// Phase 1: matrix 236 rows 202 cols
[2022-05-21 04:22:16] [INFO ] Computed 9 place invariants in 16 ms
[2022-05-21 04:22:17] [INFO ] [Real]Absence check using 9 positive place invariants in 21 ms returned sat
[2022-05-21 04:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 04:22:17] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-05-21 04:22:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 04:22:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 16 ms returned sat
[2022-05-21 04:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 04:22:18] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2022-05-21 04:22:18] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 9 ms to minimize.
[2022-05-21 04:22:18] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2022-05-21 04:22:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2022-05-21 04:22:18] [INFO ] Computed and/alt/rep : 210/358/210 causal constraints (skipped 25 transitions) in 48 ms.
[2022-05-21 04:22:19] [INFO ] Added : 182 causal constraints over 37 iterations in 1275 ms. Result :sat
Minimization took 116 ms.
[2022-05-21 04:22:20] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2022-05-21 04:22:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 04:22:20] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2022-05-21 04:22:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 04:22:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2022-05-21 04:22:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 04:22:20] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2022-05-21 04:22:20] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2022-05-21 04:22:20] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 3 ms to minimize.
[2022-05-21 04:22:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2022-05-21 04:22:20] [INFO ] Computed and/alt/rep : 210/358/210 causal constraints (skipped 25 transitions) in 34 ms.
[2022-05-21 04:22:21] [INFO ] Added : 181 causal constraints over 37 iterations in 1126 ms. Result :sat
Minimization took 100 ms.
[2022-05-21 04:22:22] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2022-05-21 04:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 04:22:22] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-05-21 04:22:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 04:22:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2022-05-21 04:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 04:22:22] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2022-05-21 04:22:22] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 2 ms to minimize.
[2022-05-21 04:22:22] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 0 ms to minimize.
[2022-05-21 04:22:22] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2022-05-21 04:22:22] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2022-05-21 04:22:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 403 ms
[2022-05-21 04:22:22] [INFO ] Computed and/alt/rep : 210/358/210 causal constraints (skipped 25 transitions) in 32 ms.
[2022-05-21 04:22:24] [INFO ] Added : 182 causal constraints over 37 iterations in 1152 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA SmartHome-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 202/202 places, 236/236 transitions.
Graph (trivial) has 197 edges and 202 vertex of which 77 / 202 are part of one of the 5 SCC in 8 ms
Free SCC test removed 72 places
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 130 transition count 93
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 58 rules applied. Total rules applied 108 place count 81 transition count 84
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 112 place count 77 transition count 84
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 112 place count 77 transition count 80
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 120 place count 73 transition count 80
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 148 place count 45 transition count 52
Iterating global reduction 3 with 28 rules applied. Total rules applied 176 place count 45 transition count 52
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 181 place count 45 transition count 47
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 181 place count 45 transition count 43
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 189 place count 41 transition count 43
Graph (complete) has 107 edges and 41 vertex of which 39 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 39 transition count 41
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 196 place count 38 transition count 37
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 214 place count 29 transition count 28
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 81 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 6 rules applied. Total rules applied 220 place count 28 transition count 23
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 225 place count 28 transition count 18
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 230 place count 23 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 231 place count 22 transition count 17
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 7 rules applied. Total rules applied 238 place count 18 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 241 place count 15 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 241 place count 15 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 9 rules applied. Total rules applied 250 place count 10 transition count 10
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 251 place count 10 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 252 place count 9 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 253 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 254 place count 8 transition count 8
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 255 place count 8 transition count 8
Applied a total of 255 rules in 127 ms. Remains 8 /202 variables (removed 194) and now considering 8/236 (removed 228) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/202 places, 8/236 transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-21 04:22:24] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties (out of 2) seen :2
FORMULA SmartHome-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9075 ms.

BK_STOP 1653106945255

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-06"
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-4028"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-06, 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 r240-smll-165303241500237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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