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.r091-tall-171624187900510.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 DBSingleClientW-PT-d1m06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187900510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716291005094

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:30:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 11:30:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:30:06] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-21 11:30:06] [INFO ] Transformed 1440 places.
[2024-05-21 11:30:06] [INFO ] Transformed 672 transitions.
[2024-05-21 11:30:06] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9176 resets) in 1616 ms. (24 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (3969 resets) in 239 ms. (166 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3797 resets) in 203 ms. (196 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3893 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3961 resets) in 225 ms. (176 steps per ms) remains 4/5 properties
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (3796 resets) in 320 ms. (124 steps per ms) remains 4/4 properties
// Phase 1: matrix 672 rows 347 cols
[2024-05-21 11:30:07] [INFO ] Computed 6 invariants in 50 ms
[2024-05-21 11:30:07] [INFO ] State equation strengthened by 418 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 197/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/204 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-13 is UNSAT
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 143/347 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 672/1019 variables, 347/353 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1019 variables, 418/771 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1019 variables, 0/771 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1019 variables, 0/771 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1019/1019 variables, and 771 constraints, problems are : Problem set: 1 solved, 3 unsolved in 782 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 347/347 constraints, ReadFeed: 418/418 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 198/201 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/204 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 143/347 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 11:30:08] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 29 ms to minimize.
[2024-05-21 11:30:09] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 3 ms to minimize.
[2024-05-21 11:30:09] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-05-21 11:30:09] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 3 ms to minimize.
[2024-05-21 11:30:09] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 3 ms to minimize.
[2024-05-21 11:30:09] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2024-05-21 11:30:09] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 2 ms to minimize.
[2024-05-21 11:30:10] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 3 ms to minimize.
[2024-05-21 11:30:10] [INFO ] Deduced a trap composed of 119 places in 131 ms of which 3 ms to minimize.
[2024-05-21 11:30:10] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 10/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 672/1019 variables, 347/363 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1019 variables, 418/781 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1019 variables, 3/784 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1019 variables, 0/784 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1019 variables, 0/784 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1019/1019 variables, and 784 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2941 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 347/347 constraints, ReadFeed: 418/418 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 3882ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 308 ms.
Support contains 3 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 183 place count 231 transition count 329
Iterating global reduction 1 with 94 rules applied. Total rules applied 277 place count 231 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 281 place count 231 transition count 325
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 353 place count 159 transition count 253
Iterating global reduction 2 with 72 rules applied. Total rules applied 425 place count 159 transition count 253
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 431 place count 159 transition count 247
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 471 place count 119 transition count 183
Iterating global reduction 3 with 40 rules applied. Total rules applied 511 place count 119 transition count 183
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 532 place count 119 transition count 162
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 544 place count 107 transition count 143
Iterating global reduction 4 with 12 rules applied. Total rules applied 556 place count 107 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 558 place count 107 transition count 141
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 566 place count 99 transition count 133
Iterating global reduction 5 with 8 rules applied. Total rules applied 574 place count 99 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 577 place count 99 transition count 130
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 583 place count 93 transition count 124
Iterating global reduction 6 with 6 rules applied. Total rules applied 589 place count 93 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 590 place count 93 transition count 123
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 591 place count 92 transition count 121
Iterating global reduction 7 with 1 rules applied. Total rules applied 592 place count 92 transition count 121
Applied a total of 592 rules in 129 ms. Remains 92 /347 variables (removed 255) and now considering 121/672 (removed 551) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 92/347 places, 121/672 transitions.
RANDOM walk for 40000 steps (9185 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3931 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4012 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3903 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 20126 steps, run visited all 3 properties in 135 ms. (steps per millisecond=149 )
Probabilistic random walk after 20126 steps, saw 9597 distinct states, run finished after 139 ms. (steps per millisecond=144 ) properties seen :3
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m06-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 6087 ms.
ITS solved all properties within timeout

BK_STOP 1716291012382

--------------------
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="DBSingleClientW-PT-d1m06"
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 DBSingleClientW-PT-d1m06, 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 r091-tall-171624187900510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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