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.r586-smll-171734923600012.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 MedleyA-PT-03, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r586-smll-171734923600012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 26K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717351608122

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:06:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:06:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:06:51] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-06-02 18:06:51] [INFO ] Transformed 108 places.
[2024-06-02 18:06:51] [INFO ] Transformed 100 transitions.
[2024-06-02 18:06:51] [INFO ] Found NUPN structural information;
[2024-06-02 18:06:51] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 359 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 107 transition count 76
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 83 transition count 76
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 49 place count 83 transition count 70
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 61 place count 77 transition count 70
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 95 place count 60 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 107 place count 54 transition count 53
Applied a total of 107 rules in 71 ms. Remains 54 /108 variables (removed 54) and now considering 53/100 (removed 47) transitions.
// Phase 1: matrix 53 rows 54 cols
[2024-06-02 18:06:51] [INFO ] Computed 8 invariants in 14 ms
[2024-06-02 18:06:51] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-06-02 18:06:51] [INFO ] Invariant cache hit.
[2024-06-02 18:06:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:06:51] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-06-02 18:06:51] [INFO ] Invariant cache hit.
[2024-06-02 18:06:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:06:52] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 10 ms to minimize.
[2024-06-02 18:06:52] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:06:52] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
[2024-06-02 18:06:52] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
[2024-06-02 18:06:52] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:06:53] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:06:53] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 53/107 variables, 54/123 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:06:53] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:06:53] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/107 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 0/107 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 126 constraints, problems are : Problem set: 0 solved, 52 unsolved in 3090 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 53/107 variables, 54/125 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:06:56] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:06:56] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:06:56] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 0/107 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 181 constraints, problems are : Problem set: 0 solved, 52 unsolved in 3804 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 12/12 constraints]
After SMT, in 7039ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 7060ms
Starting structural reductions in LIVENESS mode, iteration 1 : 54/108 places, 53/100 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 7726 ms. Remains : 54/108 places, 53/100 transitions.
Discarding 13 transitions out of 53. Remains 40
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2518 resets) in 3077 ms. (12 steps per ms) remains 11/39 properties
BEST_FIRST walk for 40003 steps (989 resets) in 615 ms. (64 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (959 resets) in 224 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (967 resets) in 249 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (958 resets) in 300 ms. (132 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1004 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (971 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (981 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (959 resets) in 123 ms. (322 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (989 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (992 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1002 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
[2024-06-02 18:07:00] [INFO ] Invariant cache hit.
[2024-06-02 18:07:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 4/15 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 30/45 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 30/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 53/98 variables, 45/98 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 9/107 variables, 9/108 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 9/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 117 constraints, problems are : Problem set: 0 solved, 10 unsolved in 492 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 4/15 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 30/45 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 30/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 53/98 variables, 45/98 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 9/107 variables, 9/108 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 9/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/107 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/107 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 127 constraints, problems are : Problem set: 0 solved, 10 unsolved in 663 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 1182ms problems are : Problem set: 0 solved, 10 unsolved
Finished Parikh walk after 2170 steps, including 70 resets, run visited all 1 properties in 4 ms. (steps per millisecond=542 )
Parikh walk visited 10 properties in 2510 ms.
Able to resolve query QuasiLiveness after proving 40 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 13731 ms.
ITS solved all properties within timeout

BK_STOP 1717351624421

--------------------
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 QuasiLiveness -timeout 180 -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="MedleyA-PT-03"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 MedleyA-PT-03, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r586-smll-171734923600012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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