fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r298-tajo-171654455000177
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-PT-S04J04T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13259.775 101838.00 156753.00 77.30 F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r298-tajo-171654455000177.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S04J04T10, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654455000177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 27K Apr 11 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Apr 11 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 530K Apr 11 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 263K Apr 11 17:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717103989886

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:19:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:19:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:19:51] [INFO ] Load time of PNML (sax parser for PT used): 360 ms
[2024-05-30 21:19:51] [INFO ] Transformed 870 places.
[2024-05-30 21:19:51] [INFO ] Transformed 5034 transitions.
[2024-05-30 21:19:51] [INFO ] Parsed PT model containing 870 places and 5034 transitions and 34774 arcs in 527 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 870/870 places, 5034/5034 transitions.
Ensure Unique test removed 4 places
Ensure Unique test removed 2710 transitions
Reduce isomorphic transitions removed 2710 transitions.
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 2804 rules applied. Total rules applied 2804 place count 866 transition count 2234
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 2894 place count 776 transition count 2234
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 2894 place count 776 transition count 2134
Deduced a syphon composed of 100 places in 9 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 3094 place count 676 transition count 2134
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 3294 place count 576 transition count 2034
Applied a total of 3294 rules in 195 ms. Remains 576 /870 variables (removed 294) and now considering 2034/5034 (removed 3000) transitions.
Running 2030 sub problems to find dead transitions.
[2024-05-30 21:19:52] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
// Phase 1: matrix 1994 rows 576 cols
[2024-05-30 21:19:52] [INFO ] Computed 54 invariants in 111 ms
[2024-05-30 21:19:52] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
[2024-05-30 21:20:25] [INFO ] Deduced a trap composed of 197 places in 435 ms of which 39 ms to minimize.
SMT process timed out in 33016ms, After SMT, problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 33069ms
[2024-05-30 21:20:25] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
[2024-05-30 21:20:25] [INFO ] Invariant cache hit.
[2024-05-30 21:20:26] [INFO ] Implicit Places using invariants in 977 ms returned [108, 183, 232, 233, 257, 331, 348, 412, 476, 570]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 985 ms to find 10 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 566/870 places, 2034/5034 transitions.
Applied a total of 0 rules in 19 ms. Remains 566 /566 variables (removed 0) and now considering 2034/2034 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 34337 ms. Remains : 566/870 places, 2034/5034 transitions.
Initial state reduction rules removed 4 formulas.
RANDOM walk for 40000 steps (8 resets) in 5370 ms. (7 steps per ms) remains 581/2030 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 581/581 properties
[2024-05-30 21:20:28] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
// Phase 1: matrix 1994 rows 566 cols
[2024-05-30 21:20:28] [INFO ] Computed 44 invariants in 71 ms
[2024-05-30 21:20:28] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Problem qltransition_0 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 9531ms, After SMT, problems are : Problem set: 0 solved, 581 unsolved
Fused 581 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 37 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 2034/2034 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 560 transition count 2028
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 560 transition count 2028
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 21 place count 560 transition count 2019
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 30 place count 551 transition count 2019
Applied a total of 30 rules in 239 ms. Remains 551 /566 variables (removed 15) and now considering 2019/2034 (removed 15) transitions.
Running 2015 sub problems to find dead transitions.
[2024-05-30 21:20:37] [INFO ] Flow matrix only has 1979 transitions (discarded 40 similar events)
// Phase 1: matrix 1979 rows 551 cols
[2024-05-30 21:20:37] [INFO ] Computed 44 invariants in 36 ms
[2024-05-30 21:20:37] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/547 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2015 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/547 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2015 unsolved
[2024-05-30 21:21:06] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 2 ms to minimize.
[2024-05-30 21:21:06] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2024-05-30 21:21:06] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2024-05-30 21:21:06] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 1 ms to minimize.
[2024-05-30 21:21:06] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 0 ms to minimize.
[2024-05-30 21:21:06] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 0 ms to minimize.
[2024-05-30 21:21:06] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 4 ms to minimize.
[2024-05-30 21:21:06] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 4 ms to minimize.
[2024-05-30 21:21:06] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
[2024-05-30 21:21:07] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2024-05-30 21:21:08] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 9 ms to minimize.
[2024-05-30 21:21:09] [INFO ] Deduced a trap composed of 206 places in 387 ms of which 3 ms to minimize.
[2024-05-30 21:21:10] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 2 ms to minimize.
[2024-05-30 21:21:11] [INFO ] Deduced a trap composed of 329 places in 336 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 547/2530 variables, and 54 constraints, problems are : Problem set: 0 solved, 2015 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/551 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2015/2015 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2015 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/547 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2015 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/547 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2015 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 2015 unsolved
[2024-05-30 21:21:27] [INFO ] Deduced a trap composed of 281 places in 362 ms of which 6 ms to minimize.
[2024-05-30 21:21:30] [INFO ] Deduced a trap composed of 196 places in 438 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/2530 variables, and 56 constraints, problems are : Problem set: 0 solved, 2015 unsolved in 20074 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/551 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2015 constraints, Known Traps: 16/16 constraints]
After SMT, in 53640ms problems are : Problem set: 0 solved, 2015 unsolved
Search for dead transitions found 0 dead transitions in 53658ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53902 ms. Remains : 551/566 places, 2019/2034 transitions.
Total runtime 100241 ms.
ITS solved all properties within timeout

BK_STOP 1717104091724

--------------------
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 QuasiLiveness -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="PolyORBLF-PT-S04J04T10"
export BK_EXAMINATION="QuasiLiveness"
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 PolyORBLF-PT-S04J04T10, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tajo-171654455000177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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