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.r518-tajo-171654455500069.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 ltsminxred
Input is PolyORBLF-COL-S02J06T08, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455500069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1717269349197

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-COL-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:15:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:15:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:15:50] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 19:15:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 19:15:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 791 ms
[2024-06-01 19:15:51] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 33 ms.
[2024-06-01 19:15:51] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-06-01 19:15:51] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-06-01 19:15:51] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 52 ms.
[2024-06-01 19:15:51] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-06-01 19:15:51] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 20 ms.
[2024-06-01 19:15:51] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2024-06-01 19:15:51] [INFO ] Reduced 8 identical enabling conditions.
[2024-06-01 19:15:51] [INFO ] Reduced 32 identical enabling conditions.
[2024-06-01 19:15:51] [INFO ] Reduced 88 identical enabling conditions.
[2024-06-01 19:15:51] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 1 ms.
[2024-06-01 19:15:51] [INFO ] Skeletonized 65 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 19:15:51] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 21 ms.
[2024-06-01 19:15:51] [INFO ] Unfolded 65 HLPN properties in 6 ms.
[2024-06-01 19:15:51] [INFO ] Reduced 8 identical enabling conditions.
[2024-06-01 19:15:51] [INFO ] Reduced 32 identical enabling conditions.
[2024-06-01 19:15:51] [INFO ] Reduced 88 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Built sparse matrix representations for Structural reductions in 3 ms.25856KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 81 ms. Remains 690 /690 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
Running 1304 sub problems to find dead transitions.
[2024-06-01 19:15:51] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-06-01 19:15:52] [INFO ] Computed 54 invariants in 72 ms
[2024-06-01 19:15:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 73 places in 241 ms of which 39 ms to minimize.
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 73 places in 207 ms of which 2 ms to minimize.
[2024-06-01 19:16:08] [INFO ] Deduced a trap composed of 74 places in 342 ms of which 2 ms to minimize.
[2024-06-01 19:16:08] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:16:08] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:16:08] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:16:08] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:16:09] [INFO ] Deduced a trap composed of 370 places in 311 ms of which 5 ms to minimize.
[2024-06-01 19:16:09] [INFO ] Deduced a trap composed of 210 places in 276 ms of which 5 ms to minimize.
[2024-06-01 19:16:09] [INFO ] Deduced a trap composed of 188 places in 251 ms of which 4 ms to minimize.
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 353 places in 306 ms of which 4 ms to minimize.
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 373 places in 360 ms of which 5 ms to minimize.
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 453 places in 336 ms of which 5 ms to minimize.
[2024-06-01 19:16:12] [INFO ] Deduced a trap composed of 361 places in 299 ms of which 4 ms to minimize.
[2024-06-01 19:16:12] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1980 variables, and 65 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20091 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 19:16:16] [INFO ] Deduced a trap composed of 356 places in 380 ms of which 5 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 4 ms to minimize.
[2024-06-01 19:16:32] [INFO ] Deduced a trap composed of 346 places in 332 ms of which 5 ms to minimize.
[2024-06-01 19:16:32] [INFO ] Deduced a trap composed of 354 places in 330 ms of which 5 ms to minimize.
[2024-06-01 19:16:32] [INFO ] Deduced a trap composed of 327 places in 292 ms of which 5 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 49 places in 328 ms of which 5 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 47 places in 375 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/1980 variables, and 72 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1304 constraints, Known Traps: 22/22 constraints]
After SMT, in 42283ms problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 42328ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 42455 ms. Remains : 690/690 places, 1306/1306 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 30 ms. Remains 690 /690 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
[2024-06-01 19:16:34] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-06-01 19:16:34] [INFO ] Invariant cache hit.
[2024-06-01 19:16:34] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 19:16:34] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-06-01 19:16:34] [INFO ] Invariant cache hit.
[2024-06-01 19:16:35] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 19:16:35] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
[2024-06-01 19:16:35] [INFO ] Redundant transitions in 96 ms returned []
Running 1304 sub problems to find dead transitions.
[2024-06-01 19:16:35] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-06-01 19:16:35] [INFO ] Invariant cache hit.
[2024-06-01 19:16:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 19:16:50] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:16:50] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:16:50] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 2 ms to minimize.
[2024-06-01 19:16:50] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:16:50] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:16:50] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:16:50] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:16:51] [INFO ] Deduced a trap composed of 361 places in 336 ms of which 5 ms to minimize.
[2024-06-01 19:16:51] [INFO ] Deduced a trap composed of 340 places in 293 ms of which 4 ms to minimize.
[2024-06-01 19:16:51] [INFO ] Deduced a trap composed of 206 places in 216 ms of which 4 ms to minimize.
[2024-06-01 19:16:52] [INFO ] Deduced a trap composed of 382 places in 318 ms of which 4 ms to minimize.
[2024-06-01 19:16:52] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:16:53] [INFO ] Deduced a trap composed of 378 places in 349 ms of which 4 ms to minimize.
[2024-06-01 19:16:53] [INFO ] Deduced a trap composed of 372 places in 348 ms of which 5 ms to minimize.
[2024-06-01 19:16:54] [INFO ] Deduced a trap composed of 387 places in 302 ms of which 4 ms to minimize.
[2024-06-01 19:16:54] [INFO ] Deduced a trap composed of 379 places in 301 ms of which 4 ms to minimize.
[2024-06-01 19:16:54] [INFO ] Deduced a trap composed of 379 places in 353 ms of which 5 ms to minimize.
[2024-06-01 19:17:02] [INFO ] Deduced a trap composed of 489 places in 291 ms of which 4 ms to minimize.
[2024-06-01 19:17:02] [INFO ] Deduced a trap composed of 462 places in 282 ms of which 4 ms to minimize.
[2024-06-01 19:17:03] [INFO ] Deduced a trap composed of 463 places in 278 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 19:17:04] [INFO ] Deduced a trap composed of 343 places in 258 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1980 variables, and 71 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 19:17:20] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 2 ms to minimize.
[2024-06-01 19:17:21] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:17:21] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 3 ms to minimize.
[2024-06-01 19:17:25] [INFO ] Deduced a trap composed of 351 places in 373 ms of which 5 ms to minimize.
[2024-06-01 19:17:26] [INFO ] Deduced a trap composed of 360 places in 254 ms of which 4 ms to minimize.
[2024-06-01 19:17:27] [INFO ] Deduced a trap composed of 355 places in 349 ms of which 6 ms to minimize.
[2024-06-01 19:17:27] [INFO ] Deduced a trap composed of 350 places in 352 ms of which 5 ms to minimize.
[2024-06-01 19:17:28] [INFO ] Deduced a trap composed of 195 places in 360 ms of which 6 ms to minimize.
[2024-06-01 19:17:28] [INFO ] Deduced a trap composed of 203 places in 274 ms of which 4 ms to minimize.
[2024-06-01 19:17:29] [INFO ] Deduced a trap composed of 3 places in 360 ms of which 5 ms to minimize.
[2024-06-01 19:17:31] [INFO ] Deduced a trap composed of 497 places in 332 ms of which 5 ms to minimize.
[2024-06-01 19:17:32] [INFO ] Deduced a trap composed of 425 places in 300 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/1980 variables, and 83 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1304 constraints, Known Traps: 33/33 constraints]
After SMT, in 62343ms problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 62363ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 63449 ms. Remains : 690/690 places, 1306/1306 transitions.
Finished random walk after 5016 steps, including 0 resets, run found a deadlock after 25 ms. (steps per millisecond=200 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 107187 ms.
ITS solved all properties within timeout

BK_STOP 1717269457799

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -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-COL-S02J06T08"
export BK_EXAMINATION="Liveness"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-COL-S02J06T08, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r518-tajo-171654455500069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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