About the Execution of 2022-gold for GPPP-PT-C0001N0000010000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r191-tall-167838876300101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is GPPP-PT-C0001N0000010000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-tall-167838876300101
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.7K Feb 26 10:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 10:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 10:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-00
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-01
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-02
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-03
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-04
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-05
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-06
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-07
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-08
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-09
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-10
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-11
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-12
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-13
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-14
FORMULA_NAME GPPP-PT-C0001N0000010000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678575243266
Running Version 202205111006
[2023-03-11 22:54:04] [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]
[2023-03-11 22:54:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 22:54:04] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-11 22:54:04] [INFO ] Transformed 33 places.
[2023-03-11 22:54:04] [INFO ] Transformed 22 transitions.
[2023-03-11 22:54:04] [INFO ] Parsed PT model containing 33 places and 22 transitions in 159 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 22:54:04] [INFO ] Computed 13 place invariants in 8 ms
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-14 20000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-12 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10003 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :40071
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :40042
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :40052
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :40096
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :40037
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :40022
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :40031
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :40030
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :40016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :40055
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :40036
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 22:54:04] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-11 22:54:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:54:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:05] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-11 22:54:05] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-11 22:54:05] [INFO ] Added : 19 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 25 ms.
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-11 22:54:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:54:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-11 22:54:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:54:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-11 22:54:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:54:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:54:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [7, 7, 20000, 3, 7, 7, 40007, 4, 7, 7] Max seen :[7, 7, 48, 3, 7, 7, 40007, 4, 7, 7]
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-09 40007 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 15
Applied a total of 12 rules in 20 ms. Remains 26 /33 variables (removed 7) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 26 cols
[2023-03-11 22:54:21] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-11 22:54:21] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/33 places, 15/22 transitions.
// Phase 1: matrix 15 rows 26 cols
[2023-03-11 22:54:21] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=2178 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=2604 ) properties (out of 1) seen :10044
// Phase 1: matrix 15 rows 26 cols
[2023-03-11 22:54:22] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-11 22:54:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-11 22:54:22] [INFO ] [Real]Absence check using 5 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-11 22:54:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-11 22:54:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:54:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-11 22:54:22] [INFO ] [Nat]Absence check using 5 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-11 22:54:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:54:22] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-11 22:54:22] [INFO ] Computed and/alt/rep : 14/27/14 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 22:54:22] [INFO ] Added : 14 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [20000] Max seen :[19998]
FORMULA GPPP-PT-C0001N0000010000-UpperBounds-02 20000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 27716 ms.
BK_STOP 1678575272490
--------------------
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="GPPP-PT-C0001N0000010000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is GPPP-PT-C0001N0000010000, 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 r191-tall-167838876300101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000010000.tgz
mv GPPP-PT-C0001N0000010000 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 '
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 ;