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-171734924800038.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-08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r590-smll-171734924800038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 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 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K 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 90K 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 1717351981925

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:13:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:13:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:13:04] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-06-02 18:13:04] [INFO ] Transformed 147 places.
[2024-06-02 18:13:04] [INFO ] Transformed 312 transitions.
[2024-06-02 18:13:04] [INFO ] Found NUPN structural information;
[2024-06-02 18:13:04] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 432 ms.
Structural test allowed to assert that 34 places are NOT stable. Took 16 ms.
RANDOM walk for 40000 steps (1987 resets) in 2962 ms. (13 steps per ms) remains 63/113 properties
BEST_FIRST walk for 4003 steps (55 resets) in 87 ms. (45 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (53 resets) in 44 ms. (88 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (52 resets) in 41 ms. (95 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (50 resets) in 52 ms. (75 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (49 resets) in 60 ms. (65 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (52 resets) in 66 ms. (59 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (50 resets) in 33 ms. (117 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (49 resets) in 36 ms. (108 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (50 resets) in 32 ms. (121 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (55 resets) in 32 ms. (121 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (44 resets) in 28 ms. (138 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (53 resets) in 45 ms. (87 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (52 resets) in 26 ms. (148 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (47 resets) in 32 ms. (121 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (54 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (53 resets) in 40 ms. (97 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (52 resets) in 46 ms. (85 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (51 resets) in 14 ms. (266 steps per ms) remains 58/63 properties
BEST_FIRST walk for 4003 steps (54 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (54 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (53 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (53 resets) in 25 ms. (153 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (51 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (50 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (50 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (52 resets) in 27 ms. (142 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (53 resets) in 12 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (50 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (51 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (47 resets) in 12 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (54 resets) in 32 ms. (121 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (53 resets) in 12 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (53 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (53 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (57 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (49 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (53 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (55 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (56 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (52 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (52 resets) in 44 ms. (88 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (48 resets) in 35 ms. (111 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (49 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (48 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (55 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (52 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (53 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (51 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (53 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (50 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (52 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (52 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (52 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (51 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (50 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (45 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (52 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (51 resets) in 40 ms. (97 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4000 steps (54 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (49 resets) in 21 ms. (182 steps per ms) remains 58/58 properties
// Phase 1: matrix 312 rows 147 cols
[2024-06-02 18:13:06] [INFO ] Computed 11 invariants in 41 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 64/122 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 64/128 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 25/147 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 25/158 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 312/459 variables, 147/305 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/459 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 305 constraints, problems are : Problem set: 0 solved, 58 unsolved in 4236 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 64/122 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 64/128 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 25/147 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 25/158 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:13:12] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 32 ms to minimize.
[2024-06-02 18:13:12] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 3 ms to minimize.
[2024-06-02 18:13:12] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2024-06-02 18:13:13] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 3 ms to minimize.
[2024-06-02 18:13:13] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 3 ms to minimize.
[2024-06-02 18:13:13] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 3 ms to minimize.
[2024-06-02 18:13:13] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-06-02 18:13:13] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 3 ms to minimize.
[2024-06-02 18:13:13] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-06-02 18:13:13] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-06-02 18:13:14] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-06-02 18:13:14] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-06-02 18:13:14] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 3 ms to minimize.
[2024-06-02 18:13:14] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 3 ms to minimize.
[2024-06-02 18:13:14] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2024-06-02 18:13:14] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-06-02 18:13:14] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-06-02 18:13:14] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-06-02 18:13:15] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:13:15] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:13:15] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 3 ms to minimize.
[2024-06-02 18:13:15] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-06-02 18:13:15] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 3 ms to minimize.
[2024-06-02 18:13:15] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 3 ms to minimize.
[2024-06-02 18:13:16] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 2 ms to minimize.
[2024-06-02 18:13:16] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
SMT process timed out in 9557ms, After SMT, problems are : Problem set: 0 solved, 58 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 312/312 transitions.
Graph (complete) has 508 edges and 147 vertex of which 140 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 140 transition count 286
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 39 place count 127 transition count 284
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 39 place count 127 transition count 282
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 125 transition count 282
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 53 place count 115 transition count 270
Iterating global reduction 2 with 10 rules applied. Total rules applied 63 place count 115 transition count 270
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 114 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 114 transition count 269
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 91 place count 101 transition count 256
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 99 transition count 254
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 99 transition count 254
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 107 place count 93 transition count 297
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 131 place count 93 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 137 place count 93 transition count 267
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 93 transition count 270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 141 place count 91 transition count 270
Applied a total of 141 rules in 191 ms. Remains 91 /147 variables (removed 56) and now considering 270/312 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 91/147 places, 270/312 transitions.
RANDOM walk for 1963686 steps (415214 resets) in 24468 ms. (80 steps per ms) remains 0/58 properties
Able to resolve query StableMarking after proving 114 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 26797 ms.
ITS solved all properties within timeout

BK_STOP 1717352012346

--------------------
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-08"
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-08, 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-171734924800038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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