fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r144-tall-171631143300054
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Dekker-PT-010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
450.420 12934.00 25517.00 60.20 T normal

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.r144-tall-171631143300054.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 Dekker-PT-010, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r144-tall-171631143300054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 11 20:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 65K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716404075100

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Dekker-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 18:54:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-22 18:54:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:54:36] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-22 18:54:36] [INFO ] Transformed 50 places.
[2024-05-22 18:54:36] [INFO ] Transformed 120 transitions.
[2024-05-22 18:54:36] [INFO ] Found NUPN structural information;
[2024-05-22 18:54:36] [INFO ] Parsed PT model containing 50 places and 120 transitions and 820 arcs in 171 ms.
Built sparse matrix representations for Structural reductions in 6 ms.16722KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 50/50 places, 120/120 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 22 ms. Remains 50 /50 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 36 ms. Remains : 50/50 places, 120/120 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 50/50 places, 120/120 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 10 ms. Remains 50 /50 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-22 18:54:36] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
// Phase 1: matrix 40 rows 50 cols
[2024-05-22 18:54:36] [INFO ] Computed 30 invariants in 8 ms
[2024-05-22 18:54:36] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 18:54:36] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-22 18:54:36] [INFO ] Invariant cache hit.
[2024-05-22 18:54:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 18:54:36] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-05-22 18:54:36] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-22 18:54:36] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-22 18:54:36] [INFO ] Invariant cache hit.
[2024-05-22 18:54:36] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 7 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 18:54:37] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 18:54:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:54:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-22 18:54:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-22 18:54:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 10/50 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 10/104 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 40/90 variables, 50/154 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 10/164 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/90 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 164 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2933 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 10/50 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 10/104 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 40/90 variables, 50/154 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 10/164 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 110/274 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/90 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 274 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1718 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 4756ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 4766ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 5067 ms. Remains : 50/50 places, 120/120 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2560 ms (no deadlock found). (steps per millisecond=488 )
Random directed walk for 1250003 steps, including 0 resets, run took 2058 ms (no deadlock found). (steps per millisecond=607 )
[2024-05-22 18:54:46] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-22 18:54:46] [INFO ] Invariant cache hit.
[2024-05-22 18:54:46] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-05-22 18:54:46] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 1 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 50/50 places, 120/120 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-22 18:54:46] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-22 18:54:46] [INFO ] Invariant cache hit.
[2024-05-22 18:54:46] [INFO ] Implicit Places using invariants in 71 ms returned [20, 23, 26, 29, 32, 35, 38, 41, 44, 47]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 74 ms to find 10 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 40/50 places, 120/120 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 76 ms. Remains : 40/50 places, 120/120 transitions.
Discarding 10 transitions out of 120. Remains 110
RANDOM walk for 40000 steps (8 resets) in 1121 ms. (35 steps per ms) remains 0/110 properties
Able to resolve query QuasiLiveness after proving 110 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 50/50 places, 120/120 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-22 18:54:46] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
[2024-05-22 18:54:46] [INFO ] Invariant cache hit.
[2024-05-22 18:54:46] [INFO ] Implicit Places using invariants in 78 ms returned [20, 23, 26, 29, 32, 35, 38, 41, 44, 47]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 80 ms to find 10 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 40/50 places, 120/120 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 82 ms. Remains : 40/50 places, 120/120 transitions.
Discarding 10 transitions out of 120. Remains 110
Net is quasi-live, checking if it is reversible to establish liveness.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :110 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 110 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 10614 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Dekker-PT-010

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 50
TRANSITIONS: 120
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 820
NUPN UNITS: 23
LOADING TIME: 0.214

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.024
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.415
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 622
MODEL NAME: /home/mcc/execution/model
50 places, 120 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716404088034

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -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="Dekker-PT-010"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 Dekker-PT-010, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r144-tall-171631143300054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-010.tgz
mv Dekker-PT-010 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;