Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266100063.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is PolyORBLF-PT-S04J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266100063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 16K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 267K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 121K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 395K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 214K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 942K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.3M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748892888152

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 19:34:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 19:34:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:34:49] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2025-06-02 19:34:49] [INFO ] Transformed 966 places.
[2025-06-02 19:34:49] [INFO ] Transformed 5354 transitions.
[2025-06-02 19:34:49] [INFO ] Parsed PT model containing 966 places and 5354 transitions and 36134 arcs in 435 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 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, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 19:34:49] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 966 cols
[2025-06-02 19:34:50] [INFO ] Computed 62 invariants in 185 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, +inf, +inf, +inf, +inf, 1, 535, 32, +inf, +inf, 10, +inf]
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (3 resets) in 123 ms. (80 steps per ms)
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130010 steps (28 resets) in 626 ms. (207 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 8, 1, 1, 3, 4, 1, 1, 1, 1, 2, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 535, 32, +inf, +inf, +inf]
[2025-06-02 19:34:50] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
[2025-06-02 19:34:50] [INFO ] Invariant cache hit.
[2025-06-02 19:34:51] [INFO ] [Real]Absence check using 16 positive place invariants in 21 ms returned sat
[2025-06-02 19:34:51] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 50 ms returned unsat
[2025-06-02 19:34:51] [INFO ] [Real]Absence check using 16 positive place invariants in 17 ms returned sat
[2025-06-02 19:34:51] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 42 ms returned unsat
[2025-06-02 19:34:51] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-02 19:34:51] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 39 ms returned sat
[2025-06-02 19:34:54] [INFO ] [Real]Absence check using state equation in 3118 ms returned sat
[2025-06-02 19:34:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:34:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 16 ms returned sat
[2025-06-02 19:34:55] [INFO ] [Nat]Absence check using 16 positive and 46 generalized place invariants in 46 ms returned sat
[2025-06-02 19:34:57] [INFO ] [Nat]Absence check using state equation in 2846 ms returned sat
[2025-06-02 19:34:57] [INFO ] State equation strengthened by 200 read => feed constraints.
[2025-06-02 19:34:58] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:34:58] [INFO ] [Nat]Added 200 Read/Feed constraints in 1018 ms returned unknown
[2025-06-02 19:34:59] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-02 19:34:59] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 41 ms returned unsat
[2025-06-02 19:34:59] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-02 19:34:59] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 20 ms returned unsat
[2025-06-02 19:34:59] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-02 19:34:59] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 43 ms returned sat
[2025-06-02 19:35:03] [INFO ] [Real]Absence check using state equation in 4352 ms returned sat
[2025-06-02 19:35:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:35:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-02 19:35:04] [INFO ] [Nat]Absence check using 16 positive and 46 generalized place invariants in 41 ms returned sat
[2025-06-02 19:35:08] [INFO ] [Nat]Absence check using state equation in 4228 ms returned unknown
[2025-06-02 19:35:08] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2025-06-02 19:35:08] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 22 ms returned unsat
[2025-06-02 19:35:08] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-02 19:35:08] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 42 ms returned unsat
[2025-06-02 19:35:08] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-02 19:35:08] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 35 ms returned unsat
[2025-06-02 19:35:08] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-02 19:35:08] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 38 ms returned unsat
[2025-06-02 19:35:08] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-02 19:35:08] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 42 ms returned unsat
[2025-06-02 19:35:09] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2025-06-02 19:35:09] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 20 ms returned unsat
[2025-06-02 19:35:09] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-02 19:35:09] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 42 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 8, 1, 1, 3, 4, 1, 1, 1, 1, 2, 1] Max Struct:[1, 1, +inf, 1, 1, +inf, 4, 1, 1, 1, 1, 2, 1]
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8, 3] Max Struct:[+inf, +inf]
Support contains 50 out of 966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 2644/2644 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 962 transition count 2554
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 184 place count 872 transition count 2554
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 184 place count 872 transition count 2434
Deduced a syphon composed of 120 places in 3 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 424 place count 752 transition count 2434
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 624 place count 652 transition count 2334
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 644 place count 652 transition count 2314
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 664 place count 632 transition count 2314
Applied a total of 664 rules in 425 ms. Remains 632 /966 variables (removed 334) and now considering 2314/2644 (removed 330) transitions.
Running 2310 sub problems to find dead transitions.
[2025-06-02 19:35:09] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
// Phase 1: matrix 2274 rows 632 cols
[2025-06-02 19:35:09] [INFO ] Computed 58 invariants in 99 ms
[2025-06-02 19:35:09] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 2.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 4.0)
(s105 timeout
1.0)
(s106 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
SMT process timed out in 36789ms, After SMT, problems are : Problem set: 0 solved, 2310 unsolved
Search for dead transitions found 0 dead transitions in 36831ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37293 ms. Remains : 632/966 places, 2314/2644 transitions.
[2025-06-02 19:35:46] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="PolyORBLF-PT-S04J06T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBLF-PT-S04J06T10, 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 r167-tall-174881266100063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T10.tgz
mv PolyORBLF-PT-S04J06T10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;