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.r014-tall-174853743400118.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 Anderson-PT-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743400118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K 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.7K 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 927K 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 1748542437140

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:13:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 18:13:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:13:58] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2025-05-29 18:13:58] [INFO ] Transformed 505 places.
[2025-05-29 18:13:58] [INFO ] Transformed 1845 transitions.
[2025-05-29 18:13:58] [INFO ] Found NUPN structural information;
[2025-05-29 18:13:58] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 262 ms.
RANDOM walk for 40000 steps (8 resets) in 2641 ms. (15 steps per ms) remains 57/505 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 55/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
// Phase 1: matrix 1845 rows 505 cols
[2025-05-29 18:14:00] [INFO ] Computed 21 invariants in 49 ms
[2025-05-29 18:14:00] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 427/481 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 427/490 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 9/490 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 9/500 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 15/505 variables, 11/511 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 15/526 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 1845/2350 variables, 505/1031 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2350 variables, 72/1103 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2350 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2350/2350 variables, and 1103 constraints, problems are : Problem set: 0 solved, 54 unsolved in 5048 ms.
Refiners :[Domain max(s): 505/505 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 505/505 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 427/481 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 427/490 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 9/490 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 9/500 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 15/505 variables, 11/511 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 15/526 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2025-05-29 18:14:07] [INFO ] Deduced a trap composed of 141 places in 367 ms of which 39 ms to minimize.
[2025-05-29 18:14:07] [INFO ] Deduced a trap composed of 254 places in 312 ms of which 3 ms to minimize.
[2025-05-29 18:14:08] [INFO ] Deduced a trap composed of 254 places in 317 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2350/2350 variables, and 1034 constraints, problems are : Problem set: 0 solved, 54 unsolved in 5011 ms.
Refiners :[Domain max(s): 505/505 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 505/505 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/54 constraints, Known Traps: 3/3 constraints]
After SMT, in 10226ms problems are : Problem set: 0 solved, 54 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 505 transition count 1823
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 483 transition count 1823
Discarding 94 places :
Symmetric choice reduction at 0 with 94 rule applications. Total rules 138 place count 389 transition count 577
Iterating global reduction 0 with 94 rules applied. Total rules applied 232 place count 389 transition count 577
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 332 place count 339 transition count 527
Applied a total of 332 rules in 142 ms. Remains 339 /505 variables (removed 166) and now considering 527/1845 (removed 1318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 339/505 places, 527/1845 transitions.
RANDOM walk for 4000000 steps (8 resets) in 22560 ms. (177 steps per ms) remains 33/54 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1018 ms. (392 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1043 ms. (383 steps per ms) remains 29/33 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1007 ms. (396 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1239 ms. (322 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 976 ms. (409 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 957 ms. (417 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 963 ms. (414 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 944 ms. (423 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (8 resets) in 955 ms. (418 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 937 ms. (426 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 936 ms. (426 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (8 resets) in 951 ms. (420 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 969 ms. (412 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400001 steps (8 resets) in 946 ms. (422 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400000 steps (8 resets) in 949 ms. (421 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 958 ms. (417 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (8 resets) in 941 ms. (424 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 935 ms. (427 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 938 ms. (425 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1274 ms. (313 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 963 ms. (414 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 909 ms. (439 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 912 ms. (438 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400000 steps (8 resets) in 909 ms. (439 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400000 steps (8 resets) in 893 ms. (447 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 979 ms. (408 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1045 ms. (382 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 995 ms. (401 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 931 ms. (429 steps per ms) remains 28/28 properties
// Phase 1: matrix 527 rows 339 cols
[2025-05-29 18:14:25] [INFO ] Computed 21 invariants in 5 ms
[2025-05-29 18:14:25] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 292/320 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 9/329 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 10/339 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 527/866 variables, 339/360 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/866 variables, 72/432 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/866 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/866 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 866/866 variables, and 432 constraints, problems are : Problem set: 0 solved, 28 unsolved in 1366 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 339/339 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 292/320 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-05-29 18:14:27] [INFO ] Deduced a trap composed of 266 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 9/329 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-05-29 18:14:27] [INFO ] Deduced a trap composed of 262 places in 135 ms of which 3 ms to minimize.
[2025-05-29 18:14:27] [INFO ] Deduced a trap composed of 296 places in 128 ms of which 3 ms to minimize.
[2025-05-29 18:14:27] [INFO ] Deduced a trap composed of 289 places in 130 ms of which 3 ms to minimize.
[2025-05-29 18:14:28] [INFO ] Deduced a trap composed of 292 places in 121 ms of which 3 ms to minimize.
[2025-05-29 18:14:28] [INFO ] Deduced a trap composed of 287 places in 118 ms of which 3 ms to minimize.
[2025-05-29 18:14:28] [INFO ] Deduced a trap composed of 290 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:14:28] [INFO ] Deduced a trap composed of 288 places in 124 ms of which 2 ms to minimize.
[2025-05-29 18:14:28] [INFO ] Deduced a trap composed of 286 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:14:28] [INFO ] Deduced a trap composed of 281 places in 124 ms of which 3 ms to minimize.
[2025-05-29 18:14:28] [INFO ] Deduced a trap composed of 276 places in 121 ms of which 2 ms to minimize.
[2025-05-29 18:14:29] [INFO ] Deduced a trap composed of 277 places in 124 ms of which 3 ms to minimize.
[2025-05-29 18:14:29] [INFO ] Deduced a trap composed of 263 places in 126 ms of which 5 ms to minimize.
[2025-05-29 18:14:29] [INFO ] Deduced a trap composed of 282 places in 127 ms of which 2 ms to minimize.
[2025-05-29 18:14:29] [INFO ] Deduced a trap composed of 284 places in 125 ms of which 2 ms to minimize.
[2025-05-29 18:14:29] [INFO ] Deduced a trap composed of 288 places in 120 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 10/339 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 527/866 variables, 339/376 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/866 variables, 72/448 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/866 variables, 28/476 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/866 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 0/866 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 866/866 variables, and 476 constraints, problems are : Problem set: 0 solved, 28 unsolved in 6851 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 339/339 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 16/16 constraints]
After SMT, in 8242ms problems are : Problem set: 0 solved, 28 unsolved
Parikh walk visited 0 properties in 622 ms.
Support contains 28 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 527/527 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 316 transition count 504
Applied a total of 46 rules in 26 ms. Remains 316 /339 variables (removed 23) and now considering 504/527 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 316/339 places, 504/527 transitions.
RANDOM walk for 4000000 steps (8 resets) in 19699 ms. (203 steps per ms) remains 26/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1246 ms. (320 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 971 ms. (411 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 920 ms. (434 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (8 resets) in 922 ms. (433 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 914 ms. (437 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (8 resets) in 903 ms. (442 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 945 ms. (422 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400000 steps (8 resets) in 923 ms. (432 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400000 steps (8 resets) in 910 ms. (439 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (8 resets) in 914 ms. (437 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 911 ms. (438 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (8 resets) in 941 ms. (424 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 940 ms. (425 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (8 resets) in 934 ms. (427 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 944 ms. (423 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400000 steps (8 resets) in 932 ms. (428 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 929 ms. (430 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (8 resets) in 927 ms. (431 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 919 ms. (434 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 911 ms. (438 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 943 ms. (423 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 935 ms. (427 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (8 resets) in 934 ms. (427 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 930 ms. (429 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 935 ms. (427 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 929 ms. (430 steps per ms) remains 26/26 properties
Finished probabilistic random walk after 525887 steps, run visited all 26 properties in 4090 ms. (steps per millisecond=128 )
Probabilistic random walk after 525887 steps, saw 319635 distinct states, run finished after 4095 ms. (steps per millisecond=128 ) properties seen :26
Able to resolve query StableMarking after proving 505 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 53969 ms.
ITS solved all properties within timeout

BK_STOP 1748542492445

--------------------
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="Anderson-PT-09"
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 Anderson-PT-09, 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 r014-tall-174853743400118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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