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.r399-tall-171690531000718.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Sudoku-PT-BN09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690531000718
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 306K Apr 12 12:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 12 12:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 646K Apr 12 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 11:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 170K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 582K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 361K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 366K Apr 12 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 857K Apr 12 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 12 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 499K 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 Sudoku-PT-BN09-ReachabilityCardinality-2024-00
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-01
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-02
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-03
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-04
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-05
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-06
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-07
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-08
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-09
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-10
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-11
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-12
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-13
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-14
FORMULA_NAME Sudoku-PT-BN09-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717084596096

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-BN09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 15:56:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 15:56:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:56:37] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-05-30 15:56:37] [INFO ] Transformed 1053 places.
[2024-05-30 15:56:37] [INFO ] Transformed 729 transitions.
[2024-05-30 15:56:37] [INFO ] Found NUPN structural information;
[2024-05-30 15:56:37] [INFO ] Parsed PT model containing 1053 places and 729 transitions and 3645 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 85 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (602 resets) in 5228 ms. (7 steps per ms) remains 3/10 properties
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1246 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1219 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1085 ms. (36 steps per ms) remains 2/3 properties
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 729 rows 1053 cols
[2024-05-30 15:56:40] [INFO ] Computed 324 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 972/972 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem Sudoku-PT-BN09-ReachabilityCardinality-2024-04 is UNSAT
FORMULA Sudoku-PT-BN09-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/1053 variables, 81/1296 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1053 variables, 81/1377 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 2430 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1628 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/891 variables, 891/891 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/891 variables, 162/1053 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/891 variables, 0/1053 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 162/1053 variables, 162/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1053 variables, 162/1377 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 729/1782 variables, 1053/2430 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 2431 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2960 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 5445ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 60 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1053/1053 places, 729/729 transitions.
RANDOM walk for 40000 steps (601 resets) in 3052 ms. (13 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1377 ms. (29 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 321008 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 321008 steps, saw 80470 distinct states, run finished after 3007 ms. (steps per millisecond=106 ) properties seen :0
[2024-05-30 15:56:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/891 variables, 891/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/891 variables, 162/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/891 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 162/1053 variables, 162/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1053 variables, 162/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 729/1782 variables, 1053/2430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1782 variables, 0/2430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1782 variables, 0/2430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 2430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2254 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/891 variables, 891/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/891 variables, 162/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/891 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 162/1053 variables, 162/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1053 variables, 162/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 729/1782 variables, 1053/2430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1782 variables, 1/2431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 2431 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20035 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 22481ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 43 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1053/1053 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 15:57:12] [INFO ] Invariant cache hit.
[2024-05-30 15:57:13] [INFO ] Implicit Places using invariants in 955 ms returned []
[2024-05-30 15:57:13] [INFO ] Invariant cache hit.
[2024-05-30 15:57:14] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 2295 ms to find 0 implicit places.
[2024-05-30 15:57:14] [INFO ] Redundant transitions in 41 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2369 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-05-30 15:57:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 22 ms.
[2024-05-30 15:57:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1053 places, 729 transitions and 3645 arcs took 12 ms.
[2024-05-30 15:57:15] [INFO ] Flatten gal took : 124 ms
Total runtime 38126 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-PT-BN09

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1053
TRANSITIONS: 729
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.018s, Sys 0.005s]


SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 575
MODEL NAME: /home/mcc/execution/419/model
1053 places, 729 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="Sudoku-PT-BN09"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Sudoku-PT-BN09, 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 r399-tall-171690531000718"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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