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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 160K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1748928287102

Invoking MCC driver with
BK_TOOL=gold2024
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 greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 05:24:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-03 05:24:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:24:49] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2025-06-03 05:24:49] [INFO ] Transformed 150 places.
[2025-06-03 05:24:49] [INFO ] Transformed 478 transitions.
[2025-06-03 05:24:49] [INFO ] Found NUPN structural information;
[2025-06-03 05:24:49] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 331 ms.
Structural test allowed to assert that 24 places are NOT stable. Took 11 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
RANDOM walk for 40000 steps (3141 resets) in 2609 ms. (15 steps per ms) remains 62/126 properties
BEST_FIRST walk for 4004 steps (51 resets) in 54 ms. (72 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (51 resets) in 65 ms. (60 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (55 resets) in 47 ms. (83 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (53 resets) in 78 ms. (50 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (55 resets) in 47 ms. (83 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4004 steps (52 resets) in 43 ms. (91 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4002 steps (54 resets) in 59 ms. (66 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (54 resets) in 73 ms. (54 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (54 resets) in 59 ms. (66 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (54 resets) in 51 ms. (77 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (54 resets) in 35 ms. (111 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (53 resets) in 38 ms. (102 steps per ms) remains 57/60 properties
BEST_FIRST walk for 4003 steps (49 resets) in 50 ms. (78 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4003 steps (53 resets) in 44 ms. (88 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (53 resets) in 45 ms. (87 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (53 resets) in 47 ms. (83 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (53 resets) in 45 ms. (87 steps per ms) remains 52/56 properties
BEST_FIRST walk for 4003 steps (55 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (52 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (53 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (54 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (56 resets) in 17 ms. (222 steps per ms) remains 49/52 properties
BEST_FIRST walk for 4004 steps (51 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (56 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (53 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (52 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (53 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (49 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (50 resets) in 16 ms. (235 steps per ms) remains 47/49 properties
BEST_FIRST walk for 4004 steps (54 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (52 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (51 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (53 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (51 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (54 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (52 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (50 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (53 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (52 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (55 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (55 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (55 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (55 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (50 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (53 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (53 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (50 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (56 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (55 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (54 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
[2025-06-03 05:24:51] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
// Phase 1: matrix 397 rows 150 cols
[2025-06-03 05:24:51] [INFO ] Computed 23 invariants in 30 ms
[2025-06-03 05:24:51] [INFO ] State equation strengthened by 171 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 40/87 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 40/93 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 9/96 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 9/105 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 41/137 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 41/157 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 9/146 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 14 (OVERLAPS) 394/540 variables, 146/315 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 171/486 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 17 (OVERLAPS) 7/547 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/547 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 20 (OVERLAPS) 0/547 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 494 constraints, problems are : Problem set: 0 solved, 47 unsolved in 4144 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: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 40/87 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 40/93 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 9/96 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 9/105 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 41/137 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 41/157 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2025-06-03 05:24:56] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 28 ms to minimize.
[2025-06-03 05:24:56] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 3 ms to minimize.
[2025-06-03 05:24:56] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 2 ms to minimize.
[2025-06-03 05:24:56] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 2 ms to minimize.
[2025-06-03 05:24:57] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2025-06-03 05:24:57] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2025-06-03 05:24:57] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2025-06-03 05:24:57] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2025-06-03 05:24:57] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 3 ms to minimize.
[2025-06-03 05:24:57] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2025-06-03 05:24:57] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2025-06-03 05:24:57] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2025-06-03 05:24:58] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2025-06-03 05:24:58] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2025-06-03 05:24:58] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 3 ms to minimize.
[2025-06-03 05:24:58] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2025-06-03 05:24:58] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2025-06-03 05:24:58] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2025-06-03 05:24:58] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 2 ms to minimize.
[2025-06-03 05:24:59] [INFO ] Deduced a trap composed of 27 places in 119 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, 47 unsolved
[2025-06-03 05:24:59] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
[2025-06-03 05:24:59] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2025-06-03 05:24:59] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 2 ms to minimize.
[2025-06-03 05:24:59] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2025-06-03 05:24:59] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2025-06-03 05:25:00] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2025-06-03 05:25:00] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 2 ms to minimize.
[2025-06-03 05:25:00] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2025-06-03 05:25:00] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 3 ms to minimize.
SMT process timed out in 9424ms, After SMT, problems are : Problem set: 0 solved, 47 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 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.8 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 129 transition count 443
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 129 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 38 place count 128 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 39 place count 128 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 40 place count 127 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 127 transition count 434
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 43 place count 126 transition count 433
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 123 transition count 450
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 52 place count 123 transition count 447
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 61 place count 123 transition count 446
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 70 place count 114 transition count 446
Applied a total of 70 rules in 192 ms. Remains 114 /150 variables (removed 36) and now considering 446/469 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 114/150 places, 446/469 transitions.
RANDOM walk for 4000000 steps (755099 resets) in 35189 ms. (113 steps per ms) remains 0/47 properties
Able to resolve query StableMarking after proving 127 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 20939 ms.
ITS solved all properties within timeout

BK_STOP 1748928310206

--------------------
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="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 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 r140-smll-174876533500113"
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.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 ;