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.r168-tall-165277017000701.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 PolyORBLF-PT-S06J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017000701
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 27K Apr 29 14:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 29 14:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 673K Apr 29 14:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.6M Apr 29 14:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBLF-PT-S06J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652920494016

Running Version 202205111006
[2022-05-19 00:34:55] [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-19 00:34:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 00:34:55] [INFO ] Load time of PNML (sax parser for PT used): 688 ms
[2022-05-19 00:34:55] [INFO ] Transformed 810 places.
[2022-05-19 00:34:56] [INFO ] Transformed 14014 transitions.
[2022-05-19 00:34:56] [INFO ] Parsed PT model containing 810 places and 14014 transitions in 879 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Normalized transition count is 3206 out of 3254 initially.
// Phase 1: matrix 3206 rows 810 cols
[2022-05-19 00:34:56] [INFO ] Computed 58 place invariants in 208 ms
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 59 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 15) seen :36
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :30
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :34
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :31
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :34
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :27
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :32
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :32
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :34
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :32
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :30
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :34
[2022-05-19 00:34:57] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
// Phase 1: matrix 3206 rows 810 cols
[2022-05-19 00:34:57] [INFO ] Computed 58 place invariants in 121 ms
[2022-05-19 00:34:57] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2022-05-19 00:34:57] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 38 ms returned unsat
[2022-05-19 00:34:57] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2022-05-19 00:34:57] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 36 ms returned unsat
[2022-05-19 00:34:57] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-19 00:34:57] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 54 ms returned unsat
[2022-05-19 00:34:58] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-19 00:34:58] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 96 ms returned unsat
[2022-05-19 00:34:58] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-19 00:34:58] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 45 ms returned unsat
[2022-05-19 00:34:58] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-19 00:34:58] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 43 ms returned unsat
[2022-05-19 00:34:58] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-19 00:34:58] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 40 ms returned unsat
[2022-05-19 00:34:58] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-19 00:34:58] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 24 ms returned unsat
[2022-05-19 00:34:58] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-05-19 00:34:58] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 43 ms returned sat
[2022-05-19 00:34:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 00:35:03] [INFO ] [Real]Absence check using state equation in 4853 ms returned unknown
[2022-05-19 00:35:03] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-19 00:35:03] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 25 ms returned unsat
[2022-05-19 00:35:03] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-05-19 00:35:03] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 19 ms returned unsat
[2022-05-19 00:35:04] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2022-05-19 00:35:04] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 42 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 5, 1, 8, 3, -1, 3, 10, 1] Max seen :[1, 1, 1, 1, 5, 1, 8, 3, 3, 3, 10, 1]
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 810 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 810/810 places, 3254/3254 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 804 transition count 3183
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 149 place count 733 transition count 3182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 732 transition count 3182
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 150 place count 732 transition count 3086
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 342 place count 636 transition count 3086
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 534 place count 540 transition count 2990
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 549 place count 540 transition count 2975
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 564 place count 525 transition count 2975
Applied a total of 564 rules in 591 ms. Remains 525 /810 variables (removed 285) and now considering 2975/3254 (removed 279) transitions.
[2022-05-19 00:35:04] [INFO ] Flow matrix only has 2927 transitions (discarded 48 similar events)
// Phase 1: matrix 2927 rows 525 cols
[2022-05-19 00:35:04] [INFO ] Computed 52 place invariants in 61 ms
[2022-05-19 00:35:06] [INFO ] Dead Transitions using invariants and state equation in 1515 ms found 1224 transitions.
Found 1224 dead transitions using SMT.
Drop transitions removed 1224 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1224 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 525/810 places, 1751/3254 transitions.
Applied a total of 0 rules in 45 ms. Remains 525 /525 variables (removed 0) and now considering 1751/1751 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 525/810 places, 1751/3254 transitions.
Normalized transition count is 1703 out of 1751 initially.
// Phase 1: matrix 1703 rows 525 cols
[2022-05-19 00:35:06] [INFO ] Computed 52 place invariants in 36 ms
Incomplete random walk after 1000000 steps, including 11561 resets, run finished after 8436 ms. (steps per millisecond=118 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 3450 resets, run finished after 2831 ms. (steps per millisecond=353 ) properties (out of 1) seen :4
[2022-05-19 00:35:17] [INFO ] Flow matrix only has 1703 transitions (discarded 48 similar events)
// Phase 1: matrix 1703 rows 525 cols
[2022-05-19 00:35:17] [INFO ] Computed 52 place invariants in 26 ms
[2022-05-19 00:35:17] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2022-05-19 00:35:17] [INFO ] [Real]Absence check using 16 positive and 36 generalized place invariants in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 22500 ms.

BK_STOP 1652920517718

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ 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="PolyORBLF-PT-S06J04T08"
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 PolyORBLF-PT-S06J04T08, 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 r168-tall-165277017000701"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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