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.r586-smll-171734923800078.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 greatspnxred
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 r586-smll-171734923800078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 89K 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 1717352395990

Invoking MCC driver with
BK_TOOL=greatspnxred
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
[2024-06-02 18:19:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:19:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:19:58] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-06-02 18:19:58] [INFO ] Transformed 196 places.
[2024-06-02 18:19:58] [INFO ] Transformed 392 transitions.
[2024-06-02 18:19:58] [INFO ] Found NUPN structural information;
[2024-06-02 18:19:58] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 300 ms.
Graph (trivial) has 229 edges and 196 vertex of which 13 / 196 are part of one of the 3 SCC in 7 ms
Free SCC test removed 10 places
Structural test allowed to assert that 40 places are NOT stable. Took 45 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
RANDOM walk for 40000 steps (8 resets) in 4055 ms. (9 steps per ms) remains 144/156 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 144/144 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 144/144 properties
BEST_FIRST walk for 402 steps (8 resets) in 23 ms. (16 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 144/144 properties
BEST_FIRST walk for 402 steps (8 resets) in 18 ms. (21 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 144/144 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 144/144 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 144/144 properties
BEST_FIRST walk for 401 steps (8 resets) in 15 ms. (25 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 144/144 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 144/144 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 144/144 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 144/144 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 144/144 properties
Probabilistic random walk after 100001 steps, saw 17603 distinct states, run finished after 938 ms. (steps per millisecond=106 ) properties seen :99
[2024-06-02 18:20:01] [INFO ] Flow matrix only has 378 transitions (discarded 2 similar events)
// Phase 1: matrix 378 rows 186 cols
[2024-06-02 18:20:01] [INFO ] Computed 7 invariants in 42 ms
[2024-06-02 18:20:01] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 123/168 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 123/172 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 18/186 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 18/193 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 377/563 variables, 186/379 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 1/564 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 0/564 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 380 constraints, problems are : Problem set: 0 solved, 45 unsolved in 3108 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: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 123/168 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 123/172 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 18:20:05] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 30 ms to minimize.
[2024-06-02 18:20:05] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 3 ms to minimize.
[2024-06-02 18:20:05] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-06-02 18:20:05] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 2 ms to minimize.
[2024-06-02 18:20:05] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 3 ms to minimize.
[2024-06-02 18:20:05] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 18/186 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 18/199 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 18:20:06] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 3 ms to minimize.
[2024-06-02 18:20:06] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:20:06] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2024-06-02 18:20:06] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2024-06-02 18:20:07] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-06-02 18:20:07] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 18:20:07] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-06-02 18:20:07] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-06-02 18:20:07] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 3 ms to minimize.
[2024-06-02 18:20:08] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 18:20:08] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-02 18:20:08] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-06-02 18:20:08] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2024-06-02 18:20:08] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 18:20:09] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 18:20:09] [INFO ] Deduced a trap composed of 109 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:20:09] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
SMT process timed out in 8353ms, After SMT, problems are : Problem set: 0 solved, 45 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 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 3 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 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 91 place count 131 transition count 305
Iterating global reduction 3 with 23 rules applied. Total rules applied 114 place count 131 transition count 305
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 130 place count 131 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 131 place count 130 transition count 289
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 131 place count 130 transition count 284
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 141 place count 125 transition count 284
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 142 place count 125 transition count 283
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 143 place count 124 transition count 281
Iterating global reduction 6 with 1 rules applied. Total rules applied 144 place count 124 transition count 281
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 176 place count 108 transition count 265
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 181 place count 108 transition count 260
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 183 place count 106 transition count 256
Iterating global reduction 7 with 2 rules applied. Total rules applied 185 place count 106 transition count 256
Performed 17 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 219 place count 89 transition count 380
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 224 place count 89 transition count 375
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 8 with 49 rules applied. Total rules applied 273 place count 89 transition count 326
Free-agglomeration rule applied 9 times with reduction of 2 identical transitions.
Iterating global reduction 8 with 9 rules applied. Total rules applied 282 place count 89 transition count 315
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 301 place count 80 transition count 305
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 307 place count 80 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 308 place count 79 transition count 298
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 17 edges and 77 vertex of which 2 / 77 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 311 place count 76 transition count 298
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 323 place count 76 transition count 286
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 324 place count 75 transition count 276
Iterating global reduction 11 with 1 rules applied. Total rules applied 325 place count 75 transition count 276
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 378 place count 75 transition count 223
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 379 place count 74 transition count 216
Iterating global reduction 11 with 1 rules applied. Total rules applied 380 place count 74 transition count 216
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 384 place count 72 transition count 214
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 385 place count 72 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 386 place count 71 transition count 213
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 392 place count 71 transition count 207
Applied a total of 392 rules in 196 ms. Remains 71 /186 variables (removed 115) and now considering 207/380 (removed 173) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 71/186 places, 207/380 transitions.
RANDOM walk for 4000000 steps (324 resets) in 19770 ms. (202 steps per ms) remains 4/45 properties
BEST_FIRST walk for 4000000 steps (87 resets) in 8732 ms. (458 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000000 steps (220 resets) in 9880 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000000 steps (220 resets) in 8934 ms. (447 steps per ms) remains 0/4 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 26951 ms.
ITS solved all properties within timeout

BK_STOP 1717352425380

--------------------
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="greatspnxred"
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 greatspnxred"
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 r586-smll-171734923800078"
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.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 ;