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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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 90K 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 1748928130181

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 05:22:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-03 05:22:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:22:12] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2025-06-03 05:22:12] [INFO ] Transformed 147 places.
[2025-06-03 05:22:12] [INFO ] Transformed 312 transitions.
[2025-06-03 05:22:12] [INFO ] Found NUPN structural information;
[2025-06-03 05:22:12] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 319 ms.
Structural test allowed to assert that 34 places are NOT stable. Took 11 ms.
RANDOM walk for 40000 steps (1965 resets) in 2585 ms. (15 steps per ms) remains 72/113 properties
BEST_FIRST walk for 4004 steps (48 resets) in 125 ms. (31 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (51 resets) in 142 ms. (27 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (49 resets) in 121 ms. (32 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (56 resets) in 199 ms. (20 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (50 resets) in 176 ms. (22 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (50 resets) in 170 ms. (23 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (53 resets) in 53 ms. (74 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (53 resets) in 53 ms. (74 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (49 resets) in 77 ms. (51 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (48 resets) in 56 ms. (70 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (48 resets) in 53 ms. (74 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (53 resets) in 92 ms. (43 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (50 resets) in 59 ms. (66 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (57 resets) in 31 ms. (125 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (51 resets) in 23 ms. (166 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (46 resets) in 28 ms. (138 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (53 resets) in 53 ms. (74 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (54 resets) in 43 ms. (90 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (55 resets) in 37 ms. (105 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (56 resets) in 43 ms. (90 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (49 resets) in 50 ms. (78 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (47 resets) in 37 ms. (105 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (45 resets) in 21 ms. (181 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (49 resets) in 32 ms. (121 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (51 resets) in 14 ms. (266 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (54 resets) in 14 ms. (266 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (54 resets) in 13 ms. (285 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (50 resets) in 14 ms. (266 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (52 resets) in 21 ms. (181 steps per ms) remains 69/72 properties
BEST_FIRST walk for 4002 steps (51 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (53 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (55 resets) in 43 ms. (90 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (53 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (52 resets) in 15 ms. (250 steps per ms) remains 64/69 properties
BEST_FIRST walk for 4002 steps (50 resets) in 13 ms. (285 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (50 resets) in 13 ms. (285 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (50 resets) in 16 ms. (235 steps per ms) remains 59/64 properties
BEST_FIRST walk for 4002 steps (48 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (49 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (58 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (53 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (56 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (50 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (51 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (51 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (48 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (52 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (53 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (56 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (52 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (52 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (55 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (50 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (52 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (51 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (54 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (52 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (53 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (48 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (53 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (46 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (55 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (54 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (54 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (52 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (54 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (49 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
// Phase 1: matrix 312 rows 147 cols
[2025-06-03 05:22:14] [INFO ] Computed 11 invariants in 34 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 61/120 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 61/126 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 27/147 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 27/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 312/459 variables, 147/305 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/459 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 305 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2972 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: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 61/120 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 61/126 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 27/147 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 27/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2025-06-03 05:22:18] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 27 ms to minimize.
[2025-06-03 05:22:19] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 2 ms to minimize.
[2025-06-03 05:22:19] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 2 ms to minimize.
[2025-06-03 05:22:19] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 3 ms to minimize.
[2025-06-03 05:22:19] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2025-06-03 05:22:19] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 3 ms to minimize.
[2025-06-03 05:22:19] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 2 ms to minimize.
[2025-06-03 05:22:19] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2025-06-03 05:22:20] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2025-06-03 05:22:20] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2025-06-03 05:22:20] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2025-06-03 05:22:20] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2025-06-03 05:22:20] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2025-06-03 05:22:20] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2025-06-03 05:22:20] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2025-06-03 05:22:20] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2025-06-03 05:22:20] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2025-06-03 05:22:21] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2025-06-03 05:22:21] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2025-06-03 05:22:21] [INFO ] Deduced a trap composed of 22 places in 79 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, 59 unsolved
[2025-06-03 05:22:21] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2025-06-03 05:22:21] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 3 ms to minimize.
[2025-06-03 05:22:21] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 1 ms to minimize.
[2025-06-03 05:22:21] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2025-06-03 05:22:21] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
[2025-06-03 05:22:22] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 2 ms to minimize.
[2025-06-03 05:22:22] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 3 ms to minimize.
[2025-06-03 05:22:22] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 1 ms to minimize.
[2025-06-03 05:22:22] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2025-06-03 05:22:22] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2025-06-03 05:22:22] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
[2025-06-03 05:22:23] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
SMT process timed out in 8244ms, After SMT, problems are : Problem set: 0 solved, 59 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 140 transition count 284
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 43 place count 125 transition count 282
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 43 place count 125 transition count 280
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 47 place count 123 transition count 280
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 54 place count 116 transition count 271
Iterating global reduction 2 with 7 rules applied. Total rules applied 61 place count 116 transition count 271
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 85 place count 104 transition count 259
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 102 transition count 257
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 102 transition count 257
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 101 place count 96 transition count 300
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 125 place count 96 transition count 276
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 131 place count 96 transition count 270
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 96 transition count 268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 135 place count 94 transition count 268
Applied a total of 135 rules in 137 ms. Remains 94 /147 variables (removed 53) and now considering 268/312 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 94/147 places, 268/312 transitions.
RANDOM walk for 4000000 steps (605248 resets) in 18898 ms. (211 steps per ms) remains 0/59 properties
Able to resolve query StableMarking after proving 114 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 16318 ms.
ITS solved all properties within timeout

BK_STOP 1748928148599

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