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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K 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 89K 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 1748928553903

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-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 05:29:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-03 05:29:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:29:16] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2025-06-03 05:29:16] [INFO ] Transformed 196 places.
[2025-06-03 05:29:16] [INFO ] Transformed 392 transitions.
[2025-06-03 05:29:16] [INFO ] Found NUPN structural information;
[2025-06-03 05:29:16] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 307 ms.
Graph (trivial) has 229 edges and 196 vertex of which 13 / 196 are part of one of the 3 SCC in 5 ms
Free SCC test removed 10 places
Structural test allowed to assert that 40 places are NOT stable. Took 33 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
RANDOM walk for 40000 steps (8 resets) in 3079 ms. (12 steps per ms) remains 147/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 147/147 properties
BEST_FIRST walk for 401 steps (8 resets) in 26 ms. (14 steps per ms) remains 147/147 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 147/147 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 147/147 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 147/147 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
Probabilistic random walk after 100001 steps, saw 17603 distinct states, run finished after 900 ms. (steps per millisecond=111 ) properties seen :100
[2025-06-03 05:29:18] [INFO ] Flow matrix only has 378 transitions (discarded 2 similar events)
// Phase 1: matrix 378 rows 186 cols
[2025-06-03 05:29:18] [INFO ] Computed 7 invariants in 33 ms
[2025-06-03 05:29:18] [INFO ] State equation strengthened by 1 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) 121/168 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 121/172 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 18/186 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 18/193 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 377/563 variables, 186/379 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 1/564 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/564 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 380 constraints, problems are : Problem set: 0 solved, 47 unsolved in 3273 ms.
Refiners :[Domain max(s): 186/186 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 186/186 constraints, ReadFeed: 1/1 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) 121/168 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 121/172 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2025-06-03 05:29:22] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 29 ms to minimize.
[2025-06-03 05:29:22] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 3 ms to minimize.
[2025-06-03 05:29:22] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2025-06-03 05:29:23] [INFO ] Deduced a trap composed of 130 places in 148 ms of which 3 ms to minimize.
[2025-06-03 05:29:23] [INFO ] Deduced a trap composed of 129 places in 150 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 18/186 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 18/198 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2025-06-03 05:29:23] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2025-06-03 05:29:23] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 3 ms to minimize.
[2025-06-03 05:29:24] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2025-06-03 05:29:24] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2025-06-03 05:29:24] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2025-06-03 05:29:24] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2025-06-03 05:29:24] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2025-06-03 05:29:24] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2025-06-03 05:29:24] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2025-06-03 05:29:25] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2025-06-03 05:29:25] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2025-06-03 05:29:26] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (OVERLAPS) 377/563 variables, 186/396 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 47/443 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 443 constraints, problems are : Problem set: 0 solved, 47 unsolved in 5013 ms.
Refiners :[Domain max(s): 186/186 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 186/186 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 17/17 constraints]
After SMT, in 8423ms problems are : Problem set: 0 solved, 47 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 380/380 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 186 transition count 350
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 159 transition count 348
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 158 transition count 348
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 60 place count 158 transition count 344
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 154 transition count 344
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 89 place count 133 transition count 309
Iterating global reduction 3 with 21 rules applied. Total rules applied 110 place count 133 transition count 309
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 16 rules applied. Total rules applied 126 place count 133 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 127 place count 132 transition count 293
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 127 place count 132 transition count 288
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 137 place count 127 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 138 place count 127 transition count 287
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 139 place count 126 transition count 285
Iterating global reduction 6 with 1 rules applied. Total rules applied 140 place count 126 transition count 285
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 172 place count 110 transition count 269
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 177 place count 110 transition count 264
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 179 place count 108 transition count 260
Iterating global reduction 7 with 2 rules applied. Total rules applied 181 place count 108 transition count 260
Performed 17 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 215 place count 91 transition count 371
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 220 place count 91 transition count 366
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 8 with 38 rules applied. Total rules applied 258 place count 91 transition count 328
Free-agglomeration rule applied 9 times with reduction of 2 identical transitions.
Iterating global reduction 8 with 9 rules applied. Total rules applied 267 place count 91 transition count 317
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 286 place count 82 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 292 place count 82 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 293 place count 81 transition count 300
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 17 edges and 79 vertex of which 2 / 79 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 296 place count 78 transition count 300
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 308 place count 78 transition count 288
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 309 place count 77 transition count 278
Iterating global reduction 11 with 1 rules applied. Total rules applied 310 place count 77 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 11 with 53 rules applied. Total rules applied 363 place count 77 transition count 225
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 364 place count 76 transition count 218
Iterating global reduction 11 with 1 rules applied. Total rules applied 365 place count 76 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 369 place count 74 transition count 216
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 370 place count 74 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 371 place count 73 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 377 place count 73 transition count 209
Applied a total of 377 rules in 190 ms. Remains 73 /186 variables (removed 113) and now considering 209/380 (removed 171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 73/186 places, 209/380 transitions.
RANDOM walk for 4000000 steps (609 resets) in 23041 ms. (173 steps per ms) remains 2/47 properties
BEST_FIRST walk for 3004601 steps (404 resets) in 6650 ms. (451 steps per ms) remains 0/2 properties
Able to resolve query StableMarking after proving 158 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 24780 ms.
ITS solved all properties within timeout

BK_STOP 1748928580760

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

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