fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r168-tall-174881266800322
Last Updated
June 24, 2025

About the Execution of 2024-gold for PolyORBLF-PT-S06J04T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15685.100 135144.00 193080.00 471.30 F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r168-tall-174881266800322.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is PolyORBLF-PT-S06J04T06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266800322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 17K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 372K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 638K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 37K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 248K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 423K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 11M May 29 14:32 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 1748900364147

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:39:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-02 21:39:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:39:26] [INFO ] Load time of PNML (sax parser for PT used): 539 ms
[2025-06-02 21:39:26] [INFO ] Transformed 632 places.
[2025-06-02 21:39:26] [INFO ] Transformed 10500 transitions.
[2025-06-02 21:39:26] [INFO ] Parsed PT model containing 632 places and 10500 transitions and 88770 arcs in 739 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 632/632 places, 10500/10500 transitions.
Ensure Unique test removed 6 places
Ensure Unique test removed 8070 transitions
Reduce isomorphic transitions removed 8070 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 8130 rules applied. Total rules applied 8130 place count 626 transition count 2376
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 8184 place count 572 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 8184 place count 572 transition count 2304
Deduced a syphon composed of 72 places in 12 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 8328 place count 500 transition count 2304
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 8472 place count 428 transition count 2232
Applied a total of 8472 rules in 220 ms. Remains 428 /632 variables (removed 204) and now considering 2232/10500 (removed 8268) transitions.
Running 2226 sub problems to find dead transitions.
[2025-06-02 21:39:26] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
// Phase 1: matrix 2196 rows 428 cols
[2025-06-02 21:39:26] [INFO ] Computed 48 invariants in 125 ms
[2025-06-02 21:39:26] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2025-06-02 21:39:59] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 12 ms to minimize.
[2025-06-02 21:40:00] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/2624 variables, and 39 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20103 ms.
Refiners :[Positive P Invariants (semi-flows): 15/18 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/428 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/2624 variables, and 39 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/18 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/428 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 2/2 constraints]
After SMT, in 56722ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 56791ms
[2025-06-02 21:40:23] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2025-06-02 21:40:23] [INFO ] Invariant cache hit.
[2025-06-02 21:40:24] [INFO ] Implicit Places using invariants in 777 ms returned [58, 152, 237, 291, 350, 405]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 786 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 422/632 places, 2232/10500 transitions.
Applied a total of 0 rules in 13 ms. Remains 422 /422 variables (removed 0) and now considering 2232/2232 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 57975 ms. Remains : 422/632 places, 2232/10500 transitions.
Initial state reduction rules removed 6 formulas.
RANDOM walk for 40000 steps (467 resets) in 12484 ms. (3 steps per ms) remains 1116/2226 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 19 ms. (6 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 22 ms. (5 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 21 ms. (5 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1116/1116 properties
[2025-06-02 21:40:28] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
// Phase 1: matrix 2196 rows 422 cols
[2025-06-02 21:40:28] [INFO ] Computed 42 invariants in 66 ms
[2025-06-02 21:40:28] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Problem qltransition_2 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 15792ms, After SMT, problems are : Problem set: 0 solved, 1116 unsolved
Fused 1116 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 2232/2232 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 418 transition count 2228
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 418 transition count 2228
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 418 transition count 2226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 416 transition count 2226
Applied a total of 12 rules in 368 ms. Remains 416 /422 variables (removed 6) and now considering 2226/2232 (removed 6) transitions.
Running 2220 sub problems to find dead transitions.
[2025-06-02 21:40:44] [INFO ] Flow matrix only has 2190 transitions (discarded 36 similar events)
// Phase 1: matrix 2190 rows 416 cols
[2025-06-02 21:40:44] [INFO ] Computed 42 invariants in 40 ms
[2025-06-02 21:40:44] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2025-06-02 21:41:13] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 4 ms to minimize.
[2025-06-02 21:41:15] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/2606 variables, and 33 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 15/23 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2220/966 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2025-06-02 21:41:22] [INFO ] Deduced a trap composed of 35 places in 480 ms of which 3 ms to minimize.
[2025-06-02 21:41:23] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 2 ms to minimize.
[2025-06-02 21:41:23] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 2 ms to minimize.
[2025-06-02 21:41:23] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:41:23] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2025-06-02 21:41:23] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 0 ms to minimize.
[2025-06-02 21:41:23] [INFO ] Deduced a trap composed of 29 places in 344 ms of which 2 ms to minimize.
[2025-06-02 21:41:34] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/2606 variables, and 41 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 15/23 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/966 constraints, Known Traps: 10/10 constraints]
After SMT, in 54803ms problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 54820ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55204 ms. Remains : 416/422 places, 2226/2232 transitions.
Total runtime 133786 ms.
ITS solved all properties within timeout

BK_STOP 1748900499291

--------------------
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="PolyORBLF-PT-S06J04T06"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBLF-PT-S06J04T06, 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 r168-tall-174881266800322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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