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.r520-tall-171662337700070.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 QuasiCertifProtocol-PT-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337700070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 14K Apr 13 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 78K 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

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

=== Now, execution of the tool begins

BK_START 1717219821054

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:30:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:30:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:30:22] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-06-01 05:30:22] [INFO ] Transformed 270 places.
[2024-06-01 05:30:22] [INFO ] Transformed 116 transitions.
[2024-06-01 05:30:22] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (3937 resets) in 2247 ms. (17 steps per ms) remains 15/16 properties
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (88 resets) in 82 ms. (48 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (55 resets) in 269 ms. (14 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (52 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (68 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (70 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (68 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (88 resets) in 197 ms. (20 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (69 resets) in 57 ms. (69 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (70 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (75 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (70 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (66 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (66 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (70 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (67 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 527710 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :2 out of 15
Probabilistic random walk after 527710 steps, saw 88220 distinct states, run finished after 3016 ms. (steps per millisecond=174 ) properties seen :2
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 116 rows 270 cols
[2024-06-01 05:30:26] [INFO ] Computed 155 invariants in 24 ms
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-01 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-03 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-06 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-04 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-05 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 152/154 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/154 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/270 variables, 1/155 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/155 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-02 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-08 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-11 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-12 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-13 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-14 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 116/386 variables, 270/425 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/425 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/425 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 425 constraints, problems are : Problem set: 11 solved, 2 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-06-01 05:30:27] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 11 ms to minimize.
[2024-06-01 05:30:27] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 3 ms to minimize.
[2024-06-01 05:30:27] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
[2024-06-01 05:30:27] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 05:30:27] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:30:27] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 6/7 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/62 variables, 1/8 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 79/141 variables, 60/68 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-06-01 05:30:27] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:30:27] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 2/70 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/70 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 93/234 variables, 80/150 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-06-01 05:30:27] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 05:30:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:30:28] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:30:28] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 4/154 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/154 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 107/341 variables, 234/388 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 1/389 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 0/389 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 38/379 variables, 31/420 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/379 variables, 12/432 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/379 variables, 1/433 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/379 variables, 0/433 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 5/384 variables, 1/434 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/384 variables, 2/436 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/384 variables, 0/436 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/386 variables, 3/439 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/386 variables, 0/439 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/386 variables, 0/439 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 439 constraints, problems are : Problem set: 11 solved, 2 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 2/13 constraints, Known Traps: 12/12 constraints]
After SMT, in 1825ms problems are : Problem set: 11 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 37 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=18 )
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 12 ms.
All properties solved without resorting to model-checking.
Total runtime 6158 ms.
ITS solved all properties within timeout

BK_STOP 1717219828429

--------------------
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 ReachabilityCardinality -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="QuasiCertifProtocol-PT-06"
export BK_EXAMINATION="ReachabilityCardinality"
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 QuasiCertifProtocol-PT-06, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662337700070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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