fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r075-tall-162039097200096
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for DLCflexbar-PT-3b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
606.271 3600000.00 60026.00 157.60 TTTFFFFTFFTTTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097200096.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is DLCflexbar-PT-3b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097200096
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 13:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.5M May 5 16:51 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 DLCflexbar-PT-3b-ReachabilityFireability-00
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-01
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-02
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-03
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-04
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-05
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-06
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-07
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-08
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-09
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-10
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-11
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-12
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-13
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-14
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620521237080

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 00:47:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-09 00:47:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 00:47:19] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2021-05-09 00:47:19] [INFO ] Transformed 7245 places.
[2021-05-09 00:47:19] [INFO ] Transformed 10555 transitions.
[2021-05-09 00:47:19] [INFO ] Found NUPN structural information;
[2021-05-09 00:47:19] [INFO ] Parsed PT model containing 7245 places and 10555 transitions in 645 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 353 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 173 ms. (steps per millisecond=57 ) properties seen :[1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1]
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 10555 rows 7245 cols
[2021-05-09 00:47:20] [INFO ] Computed 355 place invariants in 231 ms
[2021-05-09 00:47:23] [INFO ] [Real]Absence check using 355 positive place invariants in 1637 ms returned sat
[2021-05-09 00:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:47:25] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 00:47:25] [INFO ] [Real]Absence check using state equation in 2242 ms returned (error "Failed to check-sat")
[2021-05-09 00:47:28] [INFO ] [Real]Absence check using 355 positive place invariants in 1618 ms returned sat
[2021-05-09 00:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:47:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 00:47:30] [INFO ] [Real]Absence check using state equation in 2489 ms returned (error "Failed to check-sat")
[2021-05-09 00:47:33] [INFO ] [Real]Absence check using 355 positive place invariants in 1576 ms returned sat
[2021-05-09 00:47:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:47:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 00:47:35] [INFO ] [Real]Absence check using state equation in 2573 ms returned (error "Failed to check-sat")
[2021-05-09 00:47:38] [INFO ] [Real]Absence check using 355 positive place invariants in 1505 ms returned sat
[2021-05-09 00:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:47:40] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 00:47:40] [INFO ] [Real]Absence check using state equation in 2619 ms returned (error "Failed to check-sat")
[2021-05-09 00:47:43] [INFO ] [Real]Absence check using 355 positive place invariants in 1790 ms returned sat
[2021-05-09 00:47:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:47:45] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 00:47:45] [INFO ] [Real]Absence check using state equation in 2369 ms returned (error "Failed to check-sat")
[2021-05-09 00:47:48] [INFO ] [Real]Absence check using 355 positive place invariants in 1519 ms returned sat
[2021-05-09 00:47:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 00:47:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 00:47:50] [INFO ] [Real]Absence check using state equation in 2638 ms returned (error "Failed to check-sat")
Support contains 38 out of 7245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7245/7245 places, 10555/10555 transitions.
Graph (trivial) has 6711 edges and 7245 vertex of which 728 / 7245 are part of one of the 48 SCC in 47 ms
Free SCC test removed 680 places
Drop transitions removed 766 transitions
Reduce isomorphic transitions removed 766 transitions.
Performed 3313 Post agglomeration using F-continuation condition.Transition count delta: 3313
Iterating post reduction 0 with 4079 rules applied. Total rules applied 4080 place count 6565 transition count 6476
Reduce places removed 3313 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Iterating post reduction 1 with 3506 rules applied. Total rules applied 7586 place count 3252 transition count 6283
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 2 with 145 rules applied. Total rules applied 7731 place count 3158 transition count 6232
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 7756 place count 3133 transition count 6232
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 52 Pre rules applied. Total rules applied 7756 place count 3133 transition count 6180
Deduced a syphon composed of 52 places in 176 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 7860 place count 3081 transition count 6180
Symmetric choice reduction at 4 with 862 rule applications. Total rules 8722 place count 3081 transition count 6180
Deduced a syphon composed of 862 places in 49 ms
Reduce places removed 862 places and 862 transitions.
Iterating global reduction 4 with 1724 rules applied. Total rules applied 10446 place count 2219 transition count 5318
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 10451 place count 2219 transition count 5313
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 10454 place count 2217 transition count 5312
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 350 Pre rules applied. Total rules applied 10454 place count 2217 transition count 4962
Deduced a syphon composed of 350 places in 42 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 6 with 700 rules applied. Total rules applied 11154 place count 1867 transition count 4962
Symmetric choice reduction at 6 with 83 rule applications. Total rules 11237 place count 1867 transition count 4962
Deduced a syphon composed of 83 places in 70 ms
Reduce places removed 83 places and 1227 transitions.
Iterating global reduction 6 with 166 rules applied. Total rules applied 11403 place count 1784 transition count 3735
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 6 with 64 rules applied. Total rules applied 11467 place count 1784 transition count 3671
Performed 446 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 446 places in 2 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 7 with 892 rules applied. Total rules applied 12359 place count 1338 transition count 3221
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 12364 place count 1338 transition count 3216
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition with reduction of 135 identical transitions.
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 12566 place count 1237 transition count 3721
Drop transitions removed 18 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 12587 place count 1237 transition count 3700
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 12603 place count 1229 transition count 3780
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 12625 place count 1229 transition count 3758
Free-agglomeration rule applied 704 times with reduction of 423 identical transitions.
Iterating global reduction 10 with 704 rules applied. Total rules applied 13329 place count 1229 transition count 2631
Reduce places removed 704 places and 0 transitions.
Drop transitions removed 959 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 987 transitions.
Discarding 106 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Graph (complete) has 1925 edges and 525 vertex of which 419 are kept as prefixes of interest. Removing 106 places using SCC suffix rule.6 ms
Iterating post reduction 10 with 1692 rules applied. Total rules applied 15021 place count 419 transition count 1516
Drop transitions removed 184 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 11 with 200 rules applied. Total rules applied 15221 place count 419 transition count 1316
Symmetric choice reduction at 12 with 8 rule applications. Total rules 15229 place count 419 transition count 1316
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 40 transitions.
Iterating global reduction 12 with 16 rules applied. Total rules applied 15245 place count 411 transition count 1276
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 12 with 32 rules applied. Total rules applied 15277 place count 411 transition count 1244
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 15278 place count 411 transition count 1243
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 13 with 33 rules applied. Total rules applied 15311 place count 410 transition count 1211
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 14 with 11 rules applied. Total rules applied 15322 place count 410 transition count 1573
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 357 transitions
Reduce isomorphic transitions removed 357 transitions.
Iterating post reduction 14 with 368 rules applied. Total rules applied 15690 place count 399 transition count 1216
Drop transitions removed 65 transitions
Redundant transition composition rules discarded 65 transitions
Iterating global reduction 15 with 65 rules applied. Total rules applied 15755 place count 399 transition count 1151
Applied a total of 15755 rules in 2613 ms. Remains 399 /7245 variables (removed 6846) and now considering 1151/10555 (removed 9404) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/7245 places, 1151/10555 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 7485 ms. (steps per millisecond=133 ) properties seen :[1, 0, 1, 1, 1, 1]
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 447 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=149 )
FORMULA DLCflexbar-PT-3b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

--------------------
content from stderr:

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="DLCflexbar-PT-3b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is DLCflexbar-PT-3b, 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 r075-tall-162039097200096"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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