Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 26K Apr 11 14:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 14:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 219K Apr 11 14:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 14:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 208K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 814K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 86K Apr 11 15:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 422K Apr 11 15:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 847K Apr 11 15:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.4M Apr 11 15:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 PhilosophersDyn-PT-10-ReachabilityFireability-2024-00
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-01
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-02
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-03
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-04
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-05
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-06
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-07
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-08
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-09
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-10
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-11
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-12
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-13
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-14
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716843586208

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 20:59:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 20:59:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:59:48] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2024-05-27 20:59:48] [INFO ] Transformed 170 places.
[2024-05-27 20:59:48] [INFO ] Transformed 2310 transitions.
[2024-05-27 20:59:48] [INFO ] Parsed PT model containing 170 places and 2310 transitions and 18190 arcs in 388 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 175 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
[2024-05-27 20:59:48] [INFO ] Reduced 89 identical enabling conditions.
[2024-05-27 20:59:48] [INFO ] Reduced 89 identical enabling conditions.
[2024-05-27 20:59:48] [INFO ] Reduced 89 identical enabling conditions.
[2024-05-27 20:59:48] [INFO ] Reduced 89 identical enabling conditions.
[2024-05-27 20:59:48] [INFO ] Reduced 89 identical enabling conditions.
[2024-05-27 20:59:48] [INFO ] Reduced 89 identical enabling conditions.
[2024-05-27 20:59:48] [INFO ] Reduced 89 identical enabling conditions.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (4773 resets) in 4068 ms. (9 steps per ms) remains 11/13 properties
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (552 resets) in 14141 ms. (2 steps per ms) remains 11/11 properties
BEST_FIRST walk for 25725 steps (202 resets) in 20066 ms. (1 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (552 resets) in 10565 ms. (3 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (336 resets) in 1374 ms. (29 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (338 resets) in 185 ms. (215 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (352 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (302 resets) in 294 ms. (135 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (335 resets) in 281 ms. (141 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (332 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (299 resets) in 384 ms. (103 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (326 resets) in 189 ms. (210 steps per ms) remains 11/11 properties
[2024-05-27 21:00:03] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2024-05-27 21:00:03] [INFO ] Computed 39 invariants in 105 ms
[2024-05-27 21:00:03] [INFO ] State equation strengthened by 1030 read => feed constraints.
Problem PhilosophersDyn-PT-10-ReachabilityFireability-2024-01 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityFireability-2024-06 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityFireability-2024-09 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityFireability-2024-12 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 27/27 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Problem PhilosophersDyn-PT-10-ReachabilityFireability-2024-08 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityFireability-2024-13 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 12/39 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1905/2075 variables, 170/209 constraints. Problems are: Problem set: 6 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2075/2075 variables, and 1239 constraints, problems are : Problem set: 6 solved, 5 unsolved in 5101 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 170/170 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 7/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 27/27 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 12/39 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1905/2075 variables, 170/209 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2075 variables, 1030/1239 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2075 variables, 1/1240 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2075 variables, 0/1240 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/2075 variables, 0/1240 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2075/2075 variables, and 1240 constraints, problems are : Problem set: 6 solved, 5 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 170/170 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 36662ms problems are : Problem set: 6 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1941 ms.
Support contains 170 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 316 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
Running 2220 sub problems to find dead transitions.
[2024-05-27 21:00:42] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2024-05-27 21:00:42] [INFO ] Invariant cache hit.
[2024-05-27 21:00:42] [INFO ] State equation strengthened by 1030 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PhilosophersDyn-PT-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 170
TRANSITIONS: 2310
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.073s, Sys 0.011s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.012s, 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: 567
MODEL NAME: /home/mcc/execution/model
170 places, 2310 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.
Building monolithic NSF...
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-00 CANNOT_COMPUTE
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-01 CANNOT_COMPUTE
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-02 CANNOT_COMPUTE
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-03 CANNOT_COMPUTE
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-04 CANNOT_COMPUTE
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-05 CANNOT_COMPUTE
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-06 CANNOT_COMPUTE
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-07 CANNOT_COMPUTE
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-12 CANNOT_COMPUTE
FORMULA PhilosophersDyn-PT-10-ReachabilityFireability-2024-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716843908816

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="PhilosophersDyn-PT-10"
export BK_EXAMINATION="ReachabilityFireability"
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 PhilosophersDyn-PT-10, 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 r289-tajo-171654445100055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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