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.r168-tall-174881266700263.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 PolyORBLF-PT-S02J04T08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266700263
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 17K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 717K 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 1748899361231

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:22:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 21:22:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:22:42] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2025-06-02 21:22:42] [INFO ] Transformed 614 places.
[2025-06-02 21:22:42] [INFO ] Transformed 1242 transitions.
[2025-06-02 21:22:42] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 236 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
RANDOM walk for 40000 steps (10 resets) in 2085 ms. (19 steps per ms) remains 18/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (9 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
[2025-06-02 21:22:43] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2025-06-02 21:22:43] [INFO ] Computed 50 invariants in 62 ms
[2025-06-02 21:22:44] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 46/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 473/537 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 25/562 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 49/611 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/611 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1/612 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/612 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 1098/1710 variables, 612/661 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1710 variables, 96/757 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1710 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 2/1712 variables, 2/759 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1712 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1712 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/1712 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1712/1712 variables, and 760 constraints, problems are : Problem set: 0 solved, 18 unsolved in 3206 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 614/614 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 46/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 473/537 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 25/562 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 21:22:49] [INFO ] Deduced a trap composed of 270 places in 323 ms of which 39 ms to minimize.
[2025-06-02 21:22:49] [INFO ] Deduced a trap composed of 394 places in 370 ms of which 5 ms to minimize.
[2025-06-02 21:22:49] [INFO ] Deduced a trap composed of 212 places in 272 ms of which 9 ms to minimize.
[2025-06-02 21:22:50] [INFO ] Deduced a trap composed of 273 places in 342 ms of which 7 ms to minimize.
[2025-06-02 21:22:50] [INFO ] Deduced a trap composed of 246 places in 240 ms of which 4 ms to minimize.
[2025-06-02 21:22:50] [INFO ] Deduced a trap composed of 392 places in 247 ms of which 4 ms to minimize.
[2025-06-02 21:22:51] [INFO ] Deduced a trap composed of 227 places in 247 ms of which 4 ms to minimize.
[2025-06-02 21:22:51] [INFO ] Deduced a trap composed of 382 places in 247 ms of which 4 ms to minimize.
[2025-06-02 21:22:51] [INFO ] Deduced a trap composed of 374 places in 242 ms of which 3 ms to minimize.
[2025-06-02 21:22:52] [INFO ] Deduced a trap composed of 375 places in 233 ms of which 3 ms to minimize.
[2025-06-02 21:22:52] [INFO ] Deduced a trap composed of 404 places in 211 ms of which 3 ms to minimize.
[2025-06-02 21:22:52] [INFO ] Deduced a trap composed of 239 places in 227 ms of which 3 ms to minimize.
SMT process timed out in 8568ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 612 transition count 1042
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 540 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 146 place count 540 transition count 978
Deduced a syphon composed of 64 places in 7 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 274 place count 476 transition count 978
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 402 place count 412 transition count 914
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 418 place count 412 transition count 898
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 434 place count 396 transition count 898
Applied a total of 434 rules in 218 ms. Remains 396 /614 variables (removed 218) and now considering 898/1114 (removed 216) transitions.
Running 896 sub problems to find dead transitions.
[2025-06-02 21:22:52] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
// Phase 1: matrix 882 rows 396 cols
[2025-06-02 21:22:52] [INFO ] Computed 48 invariants in 19 ms
[2025-06-02 21:22:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 896 unsolved
[2025-06-02 21:23:00] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:23:01] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2025-06-02 21:23:01] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2025-06-02 21:23:01] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2025-06-02 21:23:01] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2025-06-02 21:23:01] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2025-06-02 21:23:01] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2025-06-02 21:23:01] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2025-06-02 21:23:01] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2025-06-02 21:23:01] [INFO ] Deduced a trap composed of 66 places in 208 ms of which 3 ms to minimize.
[2025-06-02 21:23:02] [INFO ] Deduced a trap composed of 142 places in 194 ms of which 2 ms to minimize.
[2025-06-02 21:23:02] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 3 ms to minimize.
[2025-06-02 21:23:03] [INFO ] Deduced a trap composed of 218 places in 189 ms of which 2 ms to minimize.
[2025-06-02 21:23:05] [INFO ] Deduced a trap composed of 134 places in 178 ms of which 3 ms to minimize.
[2025-06-02 21:23:07] [INFO ] Deduced a trap composed of 143 places in 213 ms of which 3 ms to minimize.
[2025-06-02 21:23:08] [INFO ] Deduced a trap composed of 154 places in 206 ms of which 2 ms to minimize.
[2025-06-02 21:23:09] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 2 ms to minimize.
[2025-06-02 21:23:09] [INFO ] Deduced a trap composed of 177 places in 218 ms of which 3 ms to minimize.
[2025-06-02 21:23:09] [INFO ] Deduced a trap composed of 155 places in 102 ms of which 1 ms to minimize.
[2025-06-02 21:23:10] [INFO ] Deduced a trap composed of 205 places in 180 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 896 unsolved
[2025-06-02 21:23:11] [INFO ] Deduced a trap composed of 145 places in 184 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1278 variables, and 67 constraints, problems are : Problem set: 0 solved, 896 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 896 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 896 unsolved
[2025-06-02 21:23:22] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 3 ms to minimize.
[2025-06-02 21:23:25] [INFO ] Deduced a trap composed of 161 places in 204 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1278 variables, and 69 constraints, problems are : Problem set: 0 solved, 896 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/896 constraints, Known Traps: 23/23 constraints]
After SMT, in 41862ms problems are : Problem set: 0 solved, 896 unsolved
Search for dead transitions found 0 dead transitions in 41878ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42117 ms. Remains : 396/614 places, 898/1114 transitions.
RANDOM walk for 4000000 steps (1721 resets) in 32815 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (67 resets) in 1352 ms. (295 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (68 resets) in 1361 ms. (293 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (67 resets) in 1331 ms. (300 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (76 resets) in 1331 ms. (300 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (69 resets) in 1303 ms. (306 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (71 resets) in 1342 ms. (297 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (76 resets) in 1320 ms. (302 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (58 resets) in 1352 ms. (295 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (69 resets) in 1331 ms. (300 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (79 resets) in 1338 ms. (298 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (71 resets) in 1355 ms. (294 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (57 resets) in 1325 ms. (301 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (61 resets) in 1342 ms. (297 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (79 resets) in 1316 ms. (303 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (71 resets) in 1312 ms. (304 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (67 resets) in 1312 ms. (304 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (58 resets) in 1321 ms. (302 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (81 resets) in 1320 ms. (302 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 1843963 steps, run timeout after 45001 ms. (steps per millisecond=40 ) properties seen :0 out of 18
Probabilistic random walk after 1843963 steps, saw 1079893 distinct states, run finished after 45006 ms. (steps per millisecond=40 ) properties seen :0
[2025-06-02 21:24:34] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2025-06-02 21:24:34] [INFO ] Invariant cache hit.
[2025-06-02 21:24:34] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 238/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 57/313 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 16/329 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 64/393 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 1/394 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 882/1276 variables, 394/441 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1276 variables, 96/537 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1276 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 2/1278 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1278 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1278 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (OVERLAPS) 0/1278 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1278/1278 variables, and 540 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1987 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 396/396 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 238/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 57/313 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 21:24:46] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 16/329 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 21:24:48] [INFO ] Deduced a trap composed of 152 places in 140 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 64/393 variables, 31/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 21:24:49] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2025-06-02 21:24:49] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:24:49] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2025-06-02 21:24:49] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2025-06-02 21:24:50] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2025-06-02 21:24:50] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2025-06-02 21:24:50] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 1/394 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 882/1276 variables, 394/450 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 96/546 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1276/1278 variables, and 564 constraints, problems are : Problem set: 0 solved, 18 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 394/396 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 9/9 constraints]
After SMT, in 47026ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 898/898 transitions.
Applied a total of 0 rules in 34 ms. Remains 396 /396 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 396/396 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 898/898 transitions.
Applied a total of 0 rules in 25 ms. Remains 396 /396 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2025-06-02 21:25:22] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2025-06-02 21:25:22] [INFO ] Invariant cache hit.
[2025-06-02 21:25:22] [INFO ] Implicit Places using invariants in 606 ms returned [71, 117, 189, 197, 268, 311, 334, 341]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 616 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 388/396 places, 898/898 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 382 transition count 892
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 382 transition count 892
Applied a total of 12 rules in 34 ms. Remains 382 /388 variables (removed 6) and now considering 892/898 (removed 6) transitions.
[2025-06-02 21:25:22] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
// Phase 1: matrix 876 rows 382 cols
[2025-06-02 21:25:22] [INFO ] Computed 40 invariants in 19 ms
[2025-06-02 21:25:23] [INFO ] Implicit Places using invariants in 457 ms returned []
[2025-06-02 21:25:23] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2025-06-02 21:25:23] [INFO ] Invariant cache hit.
[2025-06-02 21:25:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 21:25:28] [INFO ] Implicit Places using invariants and state equation in 5695 ms returned []
Implicit Place search using SMT with State Equation took 6157 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 382/396 places, 892/898 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6833 ms. Remains : 382/396 places, 892/898 transitions.
RANDOM walk for 4000000 steps (1710 resets) in 28869 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (64 resets) in 1255 ms. (318 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (71 resets) in 1293 ms. (309 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (73 resets) in 1278 ms. (312 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (81 resets) in 1274 ms. (313 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (70 resets) in 1269 ms. (314 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (67 resets) in 1260 ms. (317 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (76 resets) in 1268 ms. (315 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (68 resets) in 1263 ms. (316 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (80 resets) in 1279 ms. (312 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (77 resets) in 1255 ms. (318 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (80 resets) in 1258 ms. (317 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (85 resets) in 1298 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (68 resets) in 1270 ms. (314 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (64 resets) in 1280 ms. (312 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (83 resets) in 1292 ms. (309 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (65 resets) in 1312 ms. (304 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (74 resets) in 1275 ms. (313 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (69 resets) in 1262 ms. (316 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 1639851 steps, run timeout after 39001 ms. (steps per millisecond=42 ) properties seen :0 out of 18
Probabilistic random walk after 1639851 steps, saw 864587 distinct states, run finished after 39001 ms. (steps per millisecond=42 ) properties seen :0
[2025-06-02 21:26:21] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2025-06-02 21:26:21] [INFO ] Invariant cache hit.
[2025-06-02 21:26:21] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 261/279 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 21/300 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 8/308 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 68/376 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 3/379 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 1/380 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 876/1256 variables, 380/419 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1256 variables, 96/515 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1256 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 2/1258 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1258 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1258 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 0/1258 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1258/1258 variables, and 518 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2199 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 382/382 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 261/279 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 21/300 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 8/308 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 68/376 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 21:26:24] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 3 ms to minimize.
[2025-06-02 21:26:25] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 3 ms to minimize.
[2025-06-02 21:26:25] [INFO ] Deduced a trap composed of 194 places in 187 ms of which 3 ms to minimize.
[2025-06-02 21:26:25] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 2 ms to minimize.
[2025-06-02 21:26:25] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 3 ms to minimize.
[2025-06-02 21:26:25] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 2 ms to minimize.
[2025-06-02 21:26:26] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 3 ms to minimize.
[2025-06-02 21:26:26] [INFO ] Deduced a trap composed of 151 places in 181 ms of which 2 ms to minimize.
[2025-06-02 21:26:26] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2025-06-02 21:26:26] [INFO ] Deduced a trap composed of 181 places in 190 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 21:26:26] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 3/379 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 1/380 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/380 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 876/1256 variables, 380/430 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1256 variables, 96/526 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem smplace_528 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 58182ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 2430 ms.
Support contains 18 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 32 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 382/382 places, 892/892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 18 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
[2025-06-02 21:27:22] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2025-06-02 21:27:22] [INFO ] Invariant cache hit.
[2025-06-02 21:27:22] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-06-02 21:27:22] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2025-06-02 21:27:22] [INFO ] Invariant cache hit.
[2025-06-02 21:27:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 21:27:28] [INFO ] Implicit Places using invariants and state equation in 5673 ms returned []
Implicit Place search using SMT with State Equation took 6065 ms to find 0 implicit places.
[2025-06-02 21:27:28] [INFO ] Redundant transitions in 60 ms returned []
Running 890 sub problems to find dead transitions.
[2025-06-02 21:27:28] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2025-06-02 21:27:28] [INFO ] Invariant cache hit.
[2025-06-02 21:27:28] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2025-06-02 21:27:35] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2025-06-02 21:27:35] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2025-06-02 21:27:35] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2025-06-02 21:27:35] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2025-06-02 21:27:35] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2025-06-02 21:27:35] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2025-06-02 21:27:35] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2025-06-02 21:27:35] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2025-06-02 21:27:35] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2025-06-02 21:27:36] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 2 ms to minimize.
[2025-06-02 21:27:36] [INFO ] Deduced a trap composed of 66 places in 176 ms of which 2 ms to minimize.
[2025-06-02 21:27:37] [INFO ] Deduced a trap composed of 139 places in 180 ms of which 3 ms to minimize.
[2025-06-02 21:27:37] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2025-06-02 21:27:37] [INFO ] Deduced a trap composed of 228 places in 172 ms of which 2 ms to minimize.
[2025-06-02 21:27:37] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 2 ms to minimize.
[2025-06-02 21:27:37] [INFO ] Deduced a trap composed of 218 places in 175 ms of which 2 ms to minimize.
[2025-06-02 21:27:38] [INFO ] Deduced a trap composed of 144 places in 191 ms of which 2 ms to minimize.
[2025-06-02 21:27:42] [INFO ] Deduced a trap composed of 142 places in 208 ms of which 2 ms to minimize.
[2025-06-02 21:27:43] [INFO ] Deduced a trap composed of 177 places in 207 ms of which 2 ms to minimize.
[2025-06-02 21:27:43] [INFO ] Deduced a trap composed of 167 places in 190 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2025-06-02 21:27:49] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:27:51] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 2 ms to minimize.
[2025-06-02 21:27:51] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 2 ms to minimize.
[2025-06-02 21:27:51] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 2 ms to minimize.
[2025-06-02 21:27:51] [INFO ] Deduced a trap composed of 181 places in 168 ms of which 2 ms to minimize.
[2025-06-02 21:27:52] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 2 ms to minimize.
[2025-06-02 21:27:52] [INFO ] Deduced a trap composed of 161 places in 172 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/1258 variables, and 65 constraints, problems are : Problem set: 0 solved, 890 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 890/890 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 890 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 27/65 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2025-06-02 21:28:28] [INFO ] Deduced a trap composed of 194 places in 182 ms of which 2 ms to minimize.
[2025-06-02 21:28:29] [INFO ] Deduced a trap composed of 161 places in 178 ms of which 2 ms to minimize.
[2025-06-02 21:28:29] [INFO ] Deduced a trap composed of 181 places in 173 ms of which 2 ms to minimize.
[2025-06-02 21:28:29] [INFO ] Deduced a trap composed of 175 places in 186 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/1258 variables, and 69 constraints, problems are : Problem set: 0 solved, 890 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/890 constraints, Known Traps: 31/31 constraints]
After SMT, in 61243ms problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 61251ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67405 ms. Remains : 382/382 places, 892/892 transitions.
RANDOM walk for 400001 steps (168 resets) in 3645 ms. (109 steps per ms) remains 18/18 properties
Running SMT prover for 18 properties.
[2025-06-02 21:28:30] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2025-06-02 21:28:30] [INFO ] Invariant cache hit.
[2025-06-02 21:28:30] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 21:28:30] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 24 ms returned sat
[2025-06-02 21:28:31] [INFO ] After 637ms SMT Verify possible using state equation in real domain returned unsat :2 sat :16
[2025-06-02 21:28:31] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 21:28:31] [INFO ] After 257ms SMT Verify possible using 96 Read/Feed constraints in real domain returned unsat :2 sat :16
TRAPS : Iteration 0
[2025-06-02 21:28:32] [INFO ] After 1084ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:16
[2025-06-02 21:28:32] [INFO ] After 1827ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:16
[2025-06-02 21:28:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 21:28:32] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 22 ms returned sat
[2025-06-02 21:28:35] [INFO ] After 3154ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2025-06-02 21:28:38] [INFO ] After 2354ms SMT Verify possible using 96 Read/Feed constraints in natural domain returned unsat :2 sat :16
TRAPS : Iteration 0
[2025-06-02 21:28:38] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 3 ms to minimize.
[2025-06-02 21:28:38] [INFO ] Deduced a trap composed of 147 places in 185 ms of which 3 ms to minimize.
[2025-06-02 21:28:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 574 ms
TRAPS : Iteration 1
[2025-06-02 21:29:06] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2025-06-02 21:29:26] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 20069 ms
TRAPS : Iteration 2
[2025-06-02 21:29:28] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2025-06-02 21:29:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
TRAPS : Iteration 3
[2025-06-02 21:29:50] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:29:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
TRAPS : Iteration 4
[2025-06-02 21:29:59] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2025-06-02 21:29:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2025-06-02 21:29:59] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2025-06-02 21:29:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2025-06-02 21:30:00] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2025-06-02 21:30:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
TRAPS : Iteration 5
[2025-06-02 21:30:01] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2025-06-02 21:30:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
TRAPS : Iteration 6
[2025-06-02 21:30:03] [INFO ] After 88130ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :13
[2025-06-02 21:30:09] [INFO ] After 97129ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :13
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 447088 ms.
ITS solved all properties within timeout

BK_STOP 1748899809651

--------------------
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="PolyORBLF-PT-S02J04T08"
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 PolyORBLF-PT-S02J04T08, 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 r168-tall-174881266700263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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