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.r590-smll-171734924800053.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 ltsminxred
Input is MedleyA-PT-11, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r590-smll-171734924800053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 160K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1717352167112

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:16:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:16:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:16:10] [INFO ] Load time of PNML (sax parser for PT used): 326 ms
[2024-06-02 18:16:10] [INFO ] Transformed 150 places.
[2024-06-02 18:16:10] [INFO ] Transformed 478 transitions.
[2024-06-02 18:16:10] [INFO ] Found NUPN structural information;
[2024-06-02 18:16:10] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 608 ms.
Structural test allowed to assert that 24 places are NOT stable. Took 18 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
RANDOM walk for 40000 steps (3135 resets) in 4196 ms. (9 steps per ms) remains 51/126 properties
BEST_FIRST walk for 4003 steps (53 resets) in 55 ms. (71 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (52 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (54 resets) in 41 ms. (95 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (50 resets) in 28 ms. (138 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (52 resets) in 43 ms. (90 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (53 resets) in 46 ms. (85 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (52 resets) in 40 ms. (97 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (54 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (52 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (53 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (50 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (54 resets) in 37 ms. (105 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (53 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (56 resets) in 39 ms. (100 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (51 resets) in 30 ms. (129 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4003 steps (53 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (55 resets) in 25 ms. (154 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (49 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (55 resets) in 23 ms. (166 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4004 steps (52 resets) in 28 ms. (138 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (50 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (49 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (48 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (52 resets) in 27 ms. (143 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (54 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (52 resets) in 27 ms. (143 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (50 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (51 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (54 resets) in 36 ms. (108 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (55 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (54 resets) in 11 ms. (333 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (54 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (54 resets) in 27 ms. (143 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (53 resets) in 11 ms. (333 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (51 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (52 resets) in 13 ms. (286 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (56 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (54 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (55 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (53 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (51 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (54 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (50 resets) in 13 ms. (286 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (51 resets) in 12 ms. (308 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (50 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (52 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (51 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (51 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
[2024-06-02 18:16:12] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
// Phase 1: matrix 397 rows 150 cols
[2024-06-02 18:16:12] [INFO ] Computed 23 invariants in 23 ms
[2024-06-02 18:16:12] [INFO ] State equation strengthened by 171 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 37/86 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 37/92 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 9/95 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 42/137 variables, 11/115 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 42/157 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 9/146 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 14 (OVERLAPS) 394/540 variables, 146/315 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 171/486 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 17 (OVERLAPS) 7/547 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 547/547 variables, and 494 constraints, problems are : Problem set: 0 solved, 49 unsolved in 5106 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 37/86 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 37/92 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 9/95 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 42/137 variables, 11/115 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 42/157 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 18:16:19] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 27 ms to minimize.
[2024-06-02 18:16:19] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 3 ms to minimize.
[2024-06-02 18:16:19] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 3 ms to minimize.
[2024-06-02 18:16:19] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-06-02 18:16:19] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-06-02 18:16:19] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:16:20] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 2 ms to minimize.
[2024-06-02 18:16:20] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 2 ms to minimize.
[2024-06-02 18:16:20] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:16:20] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
[2024-06-02 18:16:20] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 3 ms to minimize.
[2024-06-02 18:16:20] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-06-02 18:16:21] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 16 ms to minimize.
[2024-06-02 18:16:21] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-06-02 18:16:21] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 2 ms to minimize.
[2024-06-02 18:16:21] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 2 ms to minimize.
[2024-06-02 18:16:21] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 2 ms to minimize.
[2024-06-02 18:16:21] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 1 ms to minimize.
[2024-06-02 18:16:22] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-06-02 18:16:22] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 18:16:22] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 2 ms to minimize.
[2024-06-02 18:16:22] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:16:22] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-06-02 18:16:22] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 1 ms to minimize.
SMT process timed out in 10403ms, After SMT, problems are : Problem set: 0 solved, 49 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 469/469 transitions.
Graph (complete) has 749 edges and 150 vertex of which 147 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 130 transition count 446
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 130 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 37 place count 129 transition count 445
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 43 place count 126 transition count 458
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 126 transition count 455
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 55 place count 126 transition count 453
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 64 place count 117 transition count 453
Applied a total of 64 rules in 161 ms. Remains 117 /150 variables (removed 33) and now considering 453/469 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 117/150 places, 453/469 transitions.
RANDOM walk for 4000000 steps (754616 resets) in 34119 ms. (117 steps per ms) remains 0/49 properties
Able to resolve query StableMarking after proving 127 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 22294 ms.
ITS solved all properties within timeout

BK_STOP 1717352192193

--------------------
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 StableMarking -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-11"
export BK_EXAMINATION="StableMarking"
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 MedleyA-PT-11, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r590-smll-171734924800053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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