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.r245-tall-171654349100045.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 greatspnxred
Input is MultiCrashLeafsetExtension-PT-S16C07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349100045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 12 06:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 06:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.7M 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 MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716574994144

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 18:23:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-24 18:23:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 18:23:15] [INFO ] Load time of PNML (sax parser for PT used): 402 ms
[2024-05-24 18:23:15] [INFO ] Transformed 6222 places.
[2024-05-24 18:23:15] [INFO ] Transformed 8685 transitions.
[2024-05-24 18:23:15] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 557 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-24 18:23:15] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2024-05-24 18:23:16] [INFO ] Computed 611 invariants in 496 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 17, 17, 1, 17, 51, 3, 17, 17, 17, 17, 17, 17, 17, 17, 17]
RANDOM walk for 10000 steps (138 resets) in 147 ms. (67 steps per ms)
BEST_FIRST walk for 160015 steps (608 resets) in 648 ms. (246 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1] Max Struct:[51, 17, 17, 1, 17, 51, 3, 17, 17, 17, 17, 17, 17, 17, 17, 17]
[2024-05-24 18:23:17] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
[2024-05-24 18:23:17] [INFO ] Invariant cache hit.
[2024-05-24 18:23:18] [INFO ] [Real]Absence check using 52 positive place invariants in 104 ms returned sat
[2024-05-24 18:23:18] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 122 ms returned unsat
[2024-05-24 18:23:19] [INFO ] [Real]Absence check using 52 positive place invariants in 95 ms returned sat
[2024-05-24 18:23:19] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 106 ms returned unsat
[2024-05-24 18:23:19] [INFO ] [Real]Absence check using 52 positive place invariants in 93 ms returned sat
[2024-05-24 18:23:20] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 215 ms returned sat
[2024-05-24 18:23:24] [INFO ] [Real]Absence check using state equation in 4090 ms returned unknown
[2024-05-24 18:23:24] [INFO ] [Real]Absence check using 52 positive place invariants in 92 ms returned sat
[2024-05-24 18:23:25] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 203 ms returned sat
[2024-05-24 18:23:29] [INFO ] [Real]Absence check using state equation in 4137 ms returned unknown
[2024-05-24 18:23:29] [INFO ] [Real]Absence check using 52 positive place invariants in 88 ms returned sat
[2024-05-24 18:23:30] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 108 ms returned unsat
[2024-05-24 18:23:30] [INFO ] [Real]Absence check using 52 positive place invariants in 86 ms returned sat
[2024-05-24 18:23:30] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 207 ms returned sat
[2024-05-24 18:23:35] [INFO ] [Real]Absence check using state equation in 4167 ms returned unknown
[2024-05-24 18:23:35] [INFO ] [Real]Absence check using 52 positive place invariants in 87 ms returned sat
[2024-05-24 18:23:35] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 108 ms returned unsat
[2024-05-24 18:23:36] [INFO ] [Real]Absence check using 52 positive place invariants in 91 ms returned sat
[2024-05-24 18:23:36] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 118 ms returned unsat
[2024-05-24 18:23:37] [INFO ] [Real]Absence check using 52 positive place invariants in 85 ms returned sat
[2024-05-24 18:23:37] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 117 ms returned unsat
[2024-05-24 18:23:38] [INFO ] [Real]Absence check using 52 positive place invariants in 89 ms returned sat
[2024-05-24 18:23:38] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 105 ms returned unsat
[2024-05-24 18:23:38] [INFO ] [Real]Absence check using 52 positive place invariants in 85 ms returned sat
[2024-05-24 18:23:38] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 113 ms returned unsat
[2024-05-24 18:23:39] [INFO ] [Real]Absence check using 52 positive place invariants in 83 ms returned sat
[2024-05-24 18:23:39] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 195 ms returned sat
[2024-05-24 18:23:43] [INFO ] [Real]Absence check using state equation in 4179 ms returned unknown
[2024-05-24 18:23:44] [INFO ] [Real]Absence check using 52 positive place invariants in 84 ms returned sat
[2024-05-24 18:23:44] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 106 ms returned unsat
[2024-05-24 18:23:45] [INFO ] [Real]Absence check using 52 positive place invariants in 84 ms returned sat
[2024-05-24 18:23:45] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 207 ms returned sat
[2024-05-24 18:23:49] [INFO ] [Real]Absence check using state equation in 4188 ms returned unknown
[2024-05-24 18:23:50] [INFO ] [Real]Absence check using 52 positive place invariants in 86 ms returned sat
[2024-05-24 18:23:50] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 108 ms returned unsat
[2024-05-24 18:23:51] [INFO ] [Real]Absence check using 52 positive place invariants in 87 ms returned sat
[2024-05-24 18:23:51] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 113 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1] Max Struct:[1, 1, 17, 1, 1, 51, 1, 1, 1, 1, 1, 17, 1, 17, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[17, 1, 51, 17, 17]
Support contains 5 out of 6222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Graph (complete) has 19247 edges and 6222 vertex of which 6188 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.22 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1901 transitions
Trivial Post-agglo rules discarded 1901 transitions
Performed 1901 trivial Post agglomeration. Transition count delta: 1901
Iterating post reduction 0 with 1901 rules applied. Total rules applied 1902 place count 6188 transition count 6784
Reduce places removed 1901 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1902 rules applied. Total rules applied 3804 place count 4287 transition count 6783
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3805 place count 4286 transition count 6783
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 3805 place count 4286 transition count 6545
Deduced a syphon composed of 238 places in 5 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 4281 place count 4048 transition count 6545
Discarding 1663 places :
Symmetric choice reduction at 3 with 1663 rule applications. Total rules 5944 place count 2385 transition count 4882
Iterating global reduction 3 with 1663 rules applied. Total rules applied 7607 place count 2385 transition count 4882
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 7607 place count 2385 transition count 4870
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 7631 place count 2373 transition count 4870
Discarding 235 places :
Symmetric choice reduction at 3 with 235 rule applications. Total rules 7866 place count 2138 transition count 3225
Iterating global reduction 3 with 235 rules applied. Total rules applied 8101 place count 2138 transition count 3225
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 8135 place count 2121 transition count 3208
Free-agglomeration rule (complex) applied 163 times.
Iterating global reduction 3 with 163 rules applied. Total rules applied 8298 place count 2121 transition count 4455
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 3 with 163 rules applied. Total rules applied 8461 place count 1958 transition count 4455
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 8495 place count 1958 transition count 4455
Applied a total of 8495 rules in 2272 ms. Remains 1958 /6222 variables (removed 4264) and now considering 4455/8685 (removed 4230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2291 ms. Remains : 1958/6222 places, 4455/8685 transitions.
[2024-05-24 18:23:53] [INFO ] Flow matrix only has 4057 transitions (discarded 398 similar events)
// Phase 1: matrix 4057 rows 1958 cols
[2024-05-24 18:23:53] [INFO ] Computed 577 invariants in 69 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 2, 1, 1]
RANDOM walk for 1000000 steps (22915 resets) in 18532 ms. (53 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (4298 resets) in 4274 ms. (233 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[2]
[2024-05-24 18:24:16] [INFO ] Flow matrix only has 4057 transitions (discarded 398 similar events)
[2024-05-24 18:24:16] [INFO ] Invariant cache hit.
[2024-05-24 18:24:16] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-24 18:24:16] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[1]
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 61614 ms.
ITS solved all properties within timeout

BK_STOP 1716575056925

--------------------
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.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="MultiCrashLeafsetExtension-PT-S16C07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C07, 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 r245-tall-171654349100045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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