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.r468-smll-171620167300231.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 ltsminxred
Input is AutonomousCar-PT-01b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167300231
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 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 31K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717209791292

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:43:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 02:43:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:43:13] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2024-06-01 02:43:13] [INFO ] Transformed 119 places.
[2024-06-01 02:43:13] [INFO ] Transformed 132 transitions.
[2024-06-01 02:43:13] [INFO ] Found NUPN structural information;
[2024-06-01 02:43:13] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 125 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (12 resets) in 2401 ms. (16 steps per ms) remains 8/16 properties
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (11 resets) in 843 ms. (47 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (11 resets) in 277 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (14 resets) in 344 ms. (115 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (11 resets) in 215 ms. (185 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (11 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (12 resets) in 421 ms. (94 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (13 resets) in 263 ms. (151 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (24 resets) in 294 ms. (135 steps per ms) remains 8/8 properties
// Phase 1: matrix 132 rows 119 cols
[2024-06-01 02:43:15] [INFO ] Computed 6 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AutonomousCar-PT-01b-ReachabilityFireability-2024-04 is UNSAT
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-01b-ReachabilityFireability-2024-05 is UNSAT
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-01b-ReachabilityFireability-2024-15 is UNSAT
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 76/119 variables, 6/49 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 76/125 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/125 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AutonomousCar-PT-01b-ReachabilityFireability-2024-11 is UNSAT
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 132/251 variables, 119/244 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/244 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/244 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 244 constraints, problems are : Problem set: 4 solved, 4 unsolved in 554 ms.
Refiners :[Domain max(s): 119/119 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Problem AutonomousCar-PT-01b-ReachabilityFireability-2024-07 is UNSAT
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 85/108 variables, 5/28 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 85/113 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-06-01 02:43:16] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 14 ms to minimize.
[2024-06-01 02:43:16] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 11 ms to minimize.
Problem AutonomousCar-PT-01b-ReachabilityFireability-2024-01 is UNSAT
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 02:43:16] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 02:43:16] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 02:43:16] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
Problem AutonomousCar-PT-01b-ReachabilityFireability-2024-10 is UNSAT
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 5/118 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/118 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/119 variables, 1/119 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 11/130 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/130 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 132/251 variables, 119/249 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 1/250 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/250 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/251 variables, 0/250 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 250 constraints, problems are : Problem set: 7 solved, 1 unsolved in 711 ms.
Refiners :[Domain max(s): 119/119 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 1/8 constraints, Known Traps: 5/5 constraints]
After SMT, in 1382ms problems are : Problem set: 7 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 132/132 transitions.
Graph (trivial) has 107 edges and 119 vertex of which 4 / 119 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 203 edges and 117 vertex of which 110 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 110 transition count 70
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 61 rules applied. Total rules applied 116 place count 59 transition count 60
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 123 place count 55 transition count 57
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 128 place count 52 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 51 transition count 55
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 129 place count 51 transition count 50
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 139 place count 46 transition count 50
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 149 place count 36 transition count 40
Iterating global reduction 5 with 10 rules applied. Total rules applied 159 place count 36 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 163 place count 36 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 163 place count 36 transition count 34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 167 place count 34 transition count 34
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 169 place count 32 transition count 32
Iterating global reduction 6 with 2 rules applied. Total rules applied 171 place count 32 transition count 32
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 195 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 196 place count 19 transition count 18
Iterating global reduction 6 with 1 rules applied. Total rules applied 197 place count 19 transition count 18
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 199 place count 19 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 200 place count 18 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 201 place count 17 transition count 17
Applied a total of 201 rules in 83 ms. Remains 17 /119 variables (removed 102) and now considering 17/132 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 17/119 places, 17/132 transitions.
RANDOM walk for 725 steps (51 resets) in 15 ms. (45 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-01b-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4028 ms.
ITS solved all properties within timeout

BK_STOP 1717209797139

--------------------
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 ReachabilityFireability -timeout 360 -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="AutonomousCar-PT-01b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-01b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167300231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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