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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 677K 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 1748546559042

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 19:22:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 19:22:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:22:40] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2025-05-29 19:22:40] [INFO ] Transformed 1601 places.
[2025-05-29 19:22:40] [INFO ] Transformed 2373 transitions.
[2025-05-29 19:22:40] [INFO ] Found NUPN structural information;
[2025-05-29 19:22:40] [INFO ] Parsed PT model containing 1601 places and 2373 transitions and 8915 arcs in 493 ms.
Structural test allowed to assert that 183 places are NOT stable. Took 14 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
RANDOM walk for 40000 steps (196 resets) in 3197 ms. (12 steps per ms) remains 550/1418 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 550/550 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 550/550 properties
// Phase 1: matrix 2348 rows 1601 cols
[2025-05-29 19:22:42] [INFO ] Computed 308 invariants in 169 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 550/550 constraints. Problems are: Problem set: 0 solved, 550 unsolved
SMT process timed out in 5590ms, After SMT, problems are : Problem set: 0 solved, 550 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 550 out of 1601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1601/1601 places, 2348/2348 transitions.
Ensure Unique test removed 9 places
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 1579 transition count 2246
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 226 place count 1477 transition count 2246
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 226 place count 1477 transition count 2116
Deduced a syphon composed of 130 places in 2 ms
Ensure Unique test removed 47 places
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 307 rules applied. Total rules applied 533 place count 1300 transition count 2116
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 2 with 1 rules applied. Total rules applied 534 place count 1300 transition count 2115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 535 place count 1299 transition count 2115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 538 place count 1296 transition count 2099
Iterating global reduction 4 with 3 rules applied. Total rules applied 541 place count 1296 transition count 2099
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 545 place count 1295 transition count 2096
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 547 place count 1293 transition count 2096
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 548 place count 1292 transition count 2088
Iterating global reduction 6 with 1 rules applied. Total rules applied 549 place count 1292 transition count 2088
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 550 place count 1291 transition count 2080
Iterating global reduction 6 with 1 rules applied. Total rules applied 551 place count 1291 transition count 2080
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 552 place count 1290 transition count 2072
Iterating global reduction 6 with 1 rules applied. Total rules applied 553 place count 1290 transition count 2072
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 554 place count 1289 transition count 2064
Iterating global reduction 6 with 1 rules applied. Total rules applied 555 place count 1289 transition count 2064
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 556 place count 1288 transition count 2056
Iterating global reduction 6 with 1 rules applied. Total rules applied 557 place count 1288 transition count 2056
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 558 place count 1287 transition count 2048
Iterating global reduction 6 with 1 rules applied. Total rules applied 559 place count 1287 transition count 2048
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 560 place count 1286 transition count 2040
Iterating global reduction 6 with 1 rules applied. Total rules applied 561 place count 1286 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 562 place count 1285 transition count 2032
Iterating global reduction 6 with 1 rules applied. Total rules applied 563 place count 1285 transition count 2032
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 564 place count 1284 transition count 2024
Iterating global reduction 6 with 1 rules applied. Total rules applied 565 place count 1284 transition count 2024
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 566 place count 1283 transition count 2016
Iterating global reduction 6 with 1 rules applied. Total rules applied 567 place count 1283 transition count 2016
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 568 place count 1282 transition count 2008
Iterating global reduction 6 with 1 rules applied. Total rules applied 569 place count 1282 transition count 2008
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 570 place count 1281 transition count 2000
Iterating global reduction 6 with 1 rules applied. Total rules applied 571 place count 1281 transition count 2000
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 572 place count 1280 transition count 1992
Iterating global reduction 6 with 1 rules applied. Total rules applied 573 place count 1280 transition count 1992
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 574 place count 1279 transition count 1984
Iterating global reduction 6 with 1 rules applied. Total rules applied 575 place count 1279 transition count 1984
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 576 place count 1278 transition count 1976
Iterating global reduction 6 with 1 rules applied. Total rules applied 577 place count 1278 transition count 1976
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 578 place count 1277 transition count 1968
Iterating global reduction 6 with 1 rules applied. Total rules applied 579 place count 1277 transition count 1968
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 9 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 639 place count 1247 transition count 1938
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 644 place count 1247 transition count 1933
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 649 place count 1242 transition count 1933
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 650 place count 1241 transition count 1932
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 651 place count 1240 transition count 1932
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 651 place count 1240 transition count 1931
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 653 place count 1239 transition count 1931
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 654 place count 1238 transition count 1931
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 656 place count 1237 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 657 place count 1236 transition count 1929
Iterating global reduction 9 with 1 rules applied. Total rules applied 658 place count 1236 transition count 1929
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 659 place count 1236 transition count 1928
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 660 place count 1235 transition count 1928
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 661 place count 1235 transition count 1928
Applied a total of 661 rules in 1038 ms. Remains 1235 /1601 variables (removed 366) and now considering 1928/2348 (removed 420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1048 ms. Remains : 1235/1601 places, 1928/2348 transitions.
RANDOM walk for 3752679 steps (37041 resets) in 120004 ms. (31 steps per ms) remains 458/550 properties
BEST_FIRST walk for 40004 steps (54 resets) in 336 ms. (118 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (53 resets) in 422 ms. (94 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (53 resets) in 377 ms. (105 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40002 steps (50 resets) in 377 ms. (105 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (54 resets) in 267 ms. (149 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (54 resets) in 201 ms. (198 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (54 resets) in 202 ms. (197 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (53 resets) in 198 ms. (201 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (52 resets) in 199 ms. (200 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (54 resets) in 214 ms. (186 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (51 resets) in 212 ms. (187 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (54 resets) in 201 ms. (198 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (52 resets) in 222 ms. (179 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (53 resets) in 204 ms. (195 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (54 resets) in 206 ms. (193 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40002 steps (50 resets) in 244 ms. (163 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (53 resets) in 208 ms. (191 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (53 resets) in 219 ms. (181 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (54 resets) in 199 ms. (200 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (52 resets) in 196 ms. (203 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (54 resets) in 206 ms. (193 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40001 steps (52 resets) in 211 ms. (188 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (52 resets) in 223 ms. (178 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (53 resets) in 230 ms. (173 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (51 resets) in 214 ms. (186 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (54 resets) in 207 ms. (192 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (55 resets) in 212 ms. (187 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (51 resets) in 218 ms. (182 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (52 resets) in 206 ms. (193 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (50 resets) in 225 ms. (177 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (54 resets) in 213 ms. (186 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (51 resets) in 202 ms. (197 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (54 resets) in 202 ms. (197 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (54 resets) in 212 ms. (187 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (49 resets) in 224 ms. (177 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (52 resets) in 219 ms. (181 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (55 resets) in 201 ms. (198 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40001 steps (54 resets) in 218 ms. (182 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (48 resets) in 233 ms. (170 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40002 steps (55 resets) in 210 ms. (189 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (56 resets) in 204 ms. (195 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (54 resets) in 214 ms. (186 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (54 resets) in 216 ms. (184 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (54 resets) in 198 ms. (201 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (50 resets) in 231 ms. (172 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (51 resets) in 233 ms. (170 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (53 resets) in 214 ms. (186 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (50 resets) in 212 ms. (187 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (51 resets) in 220 ms. (181 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40003 steps (49 resets) in 223 ms. (178 steps per ms) remains 458/458 properties
// Phase 1: matrix 1928 rows 1235 cols
[2025-05-29 19:23:22] [INFO ] Computed 236 invariants in 100 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (OVERLAPS) 69/527 variables, 57/78 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (OVERLAPS) 1/528 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 7 (OVERLAPS) 310/838 variables, 58/143 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/838 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 9 (OVERLAPS) 5/843 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/843 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 11 (OVERLAPS) 177/1020 variables, 35/183 constraints. Problems are: Problem set: 0 solved, 458 unsolved
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 Real declared 1020/3163 variables, and 183 constraints, problems are : Problem set: 0 solved, 458 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 63/81 constraints, Generalized P Invariants (flows): 120/155 constraints, State Equation: 0/1235 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (OVERLAPS) 69/527 variables, 57/78 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (OVERLAPS) 1/528 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 7 (OVERLAPS) 310/838 variables, 58/143 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2025-05-29 19:24:21] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 21 ms to minimize.
[2025-05-29 19:24:23] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2025-05-29 19:24:25] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
[2025-05-29 19:24:25] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
[2025-05-29 19:24:29] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2025-05-29 19:24:30] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 2 ms to minimize.
[2025-05-29 19:24:30] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 3 ms to minimize.
[2025-05-29 19:24:31] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 2 ms to minimize.
[2025-05-29 19:24:33] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 3 ms to minimize.
[2025-05-29 19:24:34] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/838 variables, 10/153 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2025-05-29 19:24:41] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 2 ms to minimize.
[2025-05-29 19:24:46] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/838 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 838/3163 variables, and 155 constraints, problems are : Problem set: 0 solved, 458 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 58/81 constraints, Generalized P Invariants (flows): 85/155 constraints, State Equation: 0/1235 constraints, PredecessorRefiner: 0/458 constraints, Known Traps: 12/12 constraints]
After SMT, in 90329ms problems are : Problem set: 0 solved, 458 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 458 out of 1235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1235/1235 places, 1928/1928 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1234 transition count 1926
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1231 transition count 1926
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 1231 transition count 1922
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 1227 transition count 1922
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 1226 transition count 1922
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 47 place count 1210 transition count 1906
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 1209 transition count 1905
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 1209 transition count 1905
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 1209 transition count 1904
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 1208 transition count 1903
Applied a total of 52 rules in 127 ms. Remains 1208 /1235 variables (removed 27) and now considering 1903/1928 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 1208/1235 places, 1903/1928 transitions.
RANDOM walk for 4000000 steps (40697 resets) in 112710 ms. (35 steps per ms) remains 443/458 properties
BEST_FIRST walk for 40004 steps (57 resets) in 207 ms. (192 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (56 resets) in 316 ms. (126 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (53 resets) in 356 ms. (112 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (54 resets) in 263 ms. (151 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (55 resets) in 299 ms. (133 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (56 resets) in 392 ms. (101 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (57 resets) in 451 ms. (88 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (53 resets) in 428 ms. (93 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (51 resets) in 450 ms. (88 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (55 resets) in 310 ms. (128 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (55 resets) in 281 ms. (141 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (53 resets) in 269 ms. (148 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (51 resets) in 354 ms. (112 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (52 resets) in 297 ms. (134 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (58 resets) in 369 ms. (108 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (55 resets) in 384 ms. (103 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (56 resets) in 291 ms. (137 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (55 resets) in 367 ms. (108 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (55 resets) in 422 ms. (94 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (55 resets) in 311 ms. (128 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (56 resets) in 309 ms. (129 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (53 resets) in 382 ms. (104 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (56 resets) in 287 ms. (138 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (54 resets) in 304 ms. (131 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (57 resets) in 380 ms. (104 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (55 resets) in 340 ms. (117 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (56 resets) in 404 ms. (98 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (55 resets) in 324 ms. (123 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (58 resets) in 295 ms. (135 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (53 resets) in 443 ms. (90 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (55 resets) in 283 ms. (140 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (52 resets) in 308 ms. (129 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (57 resets) in 397 ms. (100 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (53 resets) in 301 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (57 resets) in 312 ms. (127 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (56 resets) in 474 ms. (84 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (55 resets) in 317 ms. (125 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (57 resets) in 279 ms. (142 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (56 resets) in 360 ms. (110 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (52 resets) in 344 ms. (115 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (54 resets) in 252 ms. (158 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (54 resets) in 532 ms. (75 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (54 resets) in 465 ms. (85 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (55 resets) in 300 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (55 resets) in 400 ms. (99 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (55 resets) in 305 ms. (130 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (56 resets) in 307 ms. (129 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40001 steps (53 resets) in 351 ms. (113 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (54 resets) in 270 ms. (147 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (53 resets) in 265 ms. (150 steps per ms) remains 443/443 properties
Interrupted probabilistic random walk after 3973213 steps, run timeout after 99001 ms. (steps per millisecond=40 ) properties seen :16 out of 443
Probabilistic random walk after 3973213 steps, saw 1037045 distinct states, run finished after 99008 ms. (steps per millisecond=40 ) properties seen :16
// Phase 1: matrix 1903 rows 1208 cols
[2025-05-29 19:27:05] [INFO ] Computed 233 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 44/471 variables, 49/69 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 247/718 variables, 51/126 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/718 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 18/736 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/736 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (OVERLAPS) 163/899 variables, 30/168 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/899 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 11 (OVERLAPS) 6/905 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/905 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 13 (OVERLAPS) 68/973 variables, 11/185 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/973 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 15 (OVERLAPS) 6/979 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/979 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 17 (OVERLAPS) 67/1046 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 427 unsolved
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 Real declared 1046/3111 variables, and 196 constraints, problems are : Problem set: 0 solved, 427 unsolved in 75022 ms.
Refiners :[Positive P Invariants (semi-flows): 70/79 constraints, Generalized P Invariants (flows): 126/154 constraints, State Equation: 0/1208 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 44/471 variables, 49/69 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 247/718 variables, 51/126 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-29 19:28:28] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 3 ms to minimize.
[2025-05-29 19:28:28] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 2 ms to minimize.
[2025-05-29 19:28:29] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2025-05-29 19:28:30] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2025-05-29 19:28:32] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 1 ms to minimize.
[2025-05-29 19:28:33] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 2 ms to minimize.
[2025-05-29 19:28:35] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 2 ms to minimize.
[2025-05-29 19:28:36] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 2 ms to minimize.
[2025-05-29 19:28:36] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2025-05-29 19:28:37] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 3 ms to minimize.
[2025-05-29 19:28:39] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/718 variables, 11/137 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/718 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 8 (OVERLAPS) 18/736 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 163/899 variables, 30/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-29 19:29:04] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/899 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/899 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 13 (OVERLAPS) 6/905 variables, 6/186 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 905/3111 variables, and 186 constraints, problems are : Problem set: 0 solved, 427 unsolved in 75025 ms.
Refiners :[Positive P Invariants (semi-flows): 67/79 constraints, Generalized P Invariants (flows): 107/154 constraints, State Equation: 0/1208 constraints, PredecessorRefiner: 0/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 150272ms problems are : Problem set: 0 solved, 427 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 427 out of 1208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1208/1208 places, 1903/1903 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1206 transition count 1898
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 1200 transition count 1898
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 13 place count 1200 transition count 1894
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1194 transition count 1894
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 1193 transition count 1888
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 1193 transition count 1888
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 1192 transition count 1888
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 1190 transition count 1886
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 1189 transition count 1885
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 1189 transition count 1885
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 1189 transition count 1884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 1188 transition count 1884
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 1188 transition count 1884
Applied a total of 35 rules in 143 ms. Remains 1188 /1208 variables (removed 20) and now considering 1884/1903 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 1188/1208 places, 1884/1903 transitions.
RANDOM walk for 4000000 steps (41090 resets) in 108243 ms. (36 steps per ms) remains 381/427 properties
BEST_FIRST walk for 40004 steps (55 resets) in 231 ms. (172 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (54 resets) in 268 ms. (148 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (60 resets) in 319 ms. (125 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (51 resets) in 225 ms. (177 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (57 resets) in 318 ms. (125 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (57 resets) in 343 ms. (116 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (55 resets) in 394 ms. (101 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (55 resets) in 234 ms. (170 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (58 resets) in 295 ms. (135 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (55 resets) in 237 ms. (168 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (54 resets) in 339 ms. (117 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (55 resets) in 335 ms. (119 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (52 resets) in 288 ms. (138 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (56 resets) in 261 ms. (152 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (55 resets) in 291 ms. (137 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (55 resets) in 267 ms. (149 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (52 resets) in 386 ms. (103 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (54 resets) in 335 ms. (119 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (55 resets) in 284 ms. (140 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (52 resets) in 294 ms. (135 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (52 resets) in 277 ms. (143 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (55 resets) in 272 ms. (146 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (57 resets) in 411 ms. (97 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (57 resets) in 243 ms. (163 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (59 resets) in 343 ms. (116 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (55 resets) in 318 ms. (125 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (56 resets) in 283 ms. (140 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (55 resets) in 319 ms. (125 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (52 resets) in 267 ms. (149 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (55 resets) in 284 ms. (140 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (54 resets) in 264 ms. (150 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (56 resets) in 476 ms. (83 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (55 resets) in 316 ms. (126 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40002 steps (55 resets) in 268 ms. (148 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (55 resets) in 332 ms. (120 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40002 steps (55 resets) in 259 ms. (153 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (55 resets) in 331 ms. (120 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40001 steps (54 resets) in 269 ms. (148 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (56 resets) in 311 ms. (128 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (58 resets) in 271 ms. (147 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (54 resets) in 458 ms. (87 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (52 resets) in 316 ms. (126 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (59 resets) in 247 ms. (161 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (57 resets) in 350 ms. (113 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (56 resets) in 355 ms. (112 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (54 resets) in 276 ms. (144 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (54 resets) in 261 ms. (152 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (57 resets) in 437 ms. (91 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (56 resets) in 315 ms. (126 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (56 resets) in 394 ms. (101 steps per ms) remains 381/381 properties
// Phase 1: matrix 1884 rows 1188 cols
[2025-05-29 19:30:09] [INFO ] Computed 227 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 41/422 variables, 45/63 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (OVERLAPS) 1/423 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 7 (OVERLAPS) 235/658 variables, 48/117 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 9 (OVERLAPS) 6/664 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 11 (OVERLAPS) 131/795 variables, 25/148 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/795 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 13 (OVERLAPS) 24/819 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/819 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 15 (OVERLAPS) 2/821 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/821 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 17 (OVERLAPS) 1/822 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/822 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 19 (OVERLAPS) 71/893 variables, 13/169 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/893 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 21 (OVERLAPS) 5/898 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/898 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 23 (OVERLAPS) 61/959 variables, 8/182 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/959 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 25 (OVERLAPS) 21/980 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/3072 variables, and 186 constraints, problems are : Problem set: 0 solved, 381 unsolved in 90018 ms.
Refiners :[Positive P Invariants (semi-flows): 69/76 constraints, Generalized P Invariants (flows): 117/151 constraints, State Equation: 0/1188 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 41/422 variables, 45/63 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (OVERLAPS) 1/423 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 7 (OVERLAPS) 235/658 variables, 48/117 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2025-05-29 19:31:49] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 3 ms to minimize.
[2025-05-29 19:31:49] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 3 ms to minimize.
[2025-05-29 19:31:49] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 3 ms to minimize.
[2025-05-29 19:31:49] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2025-05-29 19:31:50] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2025-05-29 19:31:51] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2025-05-29 19:31:53] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2025-05-29 19:31:55] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 2 ms to minimize.
[2025-05-29 19:31:57] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 9/126 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 10 (OVERLAPS) 6/664 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 12 (OVERLAPS) 131/795 variables, 25/157 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/795 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 14 (OVERLAPS) 24/819 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/819 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 16 (OVERLAPS) 2/821 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/821 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 18 (OVERLAPS) 1/822 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/822 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 20 (OVERLAPS) 71/893 variables, 13/178 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 893/3072 variables, and 178 constraints, problems are : Problem set: 0 solved, 381 unsolved in 90017 ms.
Refiners :[Positive P Invariants (semi-flows): 60/76 constraints, Generalized P Invariants (flows): 109/151 constraints, State Equation: 0/1188 constraints, PredecessorRefiner: 0/381 constraints, Known Traps: 9/9 constraints]
After SMT, in 180210ms problems are : Problem set: 0 solved, 381 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 381 out of 1188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1188/1188 places, 1884/1884 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1187 transition count 1882
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1184 transition count 1882
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1184 transition count 1879
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1181 transition count 1879
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 1180 transition count 1879
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 1179 transition count 1878
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 1178 transition count 1877
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 1178 transition count 1877
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 1178 transition count 1876
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 1177 transition count 1875
Applied a total of 20 rules in 128 ms. Remains 1177 /1188 variables (removed 11) and now considering 1875/1884 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 1177/1188 places, 1875/1884 transitions.
RANDOM walk for 2054368 steps (21484 resets) in 120004 ms. (17 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40002 steps (56 resets) in 428 ms. (93 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40002 steps (57 resets) in 370 ms. (107 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (56 resets) in 414 ms. (96 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (55 resets) in 407 ms. (98 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (57 resets) in 402 ms. (99 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (51 resets) in 458 ms. (87 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40002 steps (55 resets) in 336 ms. (118 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (56 resets) in 342 ms. (116 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40002 steps (54 resets) in 321 ms. (124 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (58 resets) in 342 ms. (116 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (55 resets) in 334 ms. (119 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (58 resets) in 404 ms. (98 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (56 resets) in 425 ms. (93 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (56 resets) in 389 ms. (102 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (58 resets) in 376 ms. (106 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (56 resets) in 408 ms. (97 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40002 steps (53 resets) in 344 ms. (115 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (57 resets) in 391 ms. (102 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (60 resets) in 308 ms. (129 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (57 resets) in 433 ms. (92 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (55 resets) in 394 ms. (101 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (53 resets) in 359 ms. (111 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (56 resets) in 424 ms. (94 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (56 resets) in 319 ms. (125 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (55 resets) in 472 ms. (84 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (58 resets) in 365 ms. (109 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (57 resets) in 440 ms. (90 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (54 resets) in 497 ms. (80 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (56 resets) in 297 ms. (134 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (55 resets) in 317 ms. (125 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (55 resets) in 439 ms. (90 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (58 resets) in 466 ms. (85 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40001 steps (51 resets) in 449 ms. (88 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40002 steps (54 resets) in 474 ms. (84 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (52 resets) in 533 ms. (74 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40001 steps (57 resets) in 323 ms. (123 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (56 resets) in 451 ms. (88 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (56 resets) in 300 ms. (132 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (58 resets) in 367 ms. (108 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (54 resets) in 408 ms. (97 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (53 resets) in 420 ms. (95 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40003 steps (56 resets) in 313 ms. (127 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (56 resets) in 413 ms. (96 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40002 steps (57 resets) in 459 ms. (86 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (60 resets) in 392 ms. (101 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (56 resets) in 309 ms. (129 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (57 resets) in 452 ms. (88 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (54 resets) in 395 ms. (101 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (53 resets) in 364 ms. (109 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (57 resets) in 393 ms. (101 steps per ms) remains 381/381 properties
Interrupted probabilistic random walk after 4099358 steps, run timeout after 108001 ms. (steps per millisecond=37 ) properties seen :0 out of 381
Probabilistic random walk after 4099358 steps, saw 1087343 distinct states, run finished after 108002 ms. (steps per millisecond=37 ) properties seen :0
// Phase 1: matrix 1875 rows 1177 cols
[2025-05-29 19:35:33] [INFO ] Computed 224 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 40/421 variables, 45/63 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (OVERLAPS) 1/422 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 7 (OVERLAPS) 235/657 variables, 47/116 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 9 (OVERLAPS) 7/664 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 11 (OVERLAPS) 150/814 variables, 27/150 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/814 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 13 (OVERLAPS) 9/823 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/823 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 15 (OVERLAPS) 60/883 variables, 11/167 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 17 (OVERLAPS) 3/886 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/886 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 19 (OVERLAPS) 62/948 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/948 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 21 (OVERLAPS) 21/969 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/969 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 23 (OVERLAPS) 93/1062 variables, 10/193 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1062 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 25 (OVERLAPS) 44/1106 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1106 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 27 (OVERLAPS) 68/1174 variables, 22/221 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1174 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 29 (OVERLAPS) 1/1175 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 3.0 92.0))
(s1 (/ 1.0 184.0))
(s2 0.0)
(s3 (/ 1.0 184.0))
(s4 0.0)
(s5 (/ 1.0 184.0))
(s6 0.0)
(s7 (/ 85.0 92.0))
(s8 0.0)
(s9 (/ 1.0 184.0))
(s10 0.0)
(s11 (/ 1.0 184.0))
(s12 0.0)
(s13 (/ 1.0 184.0))
(s14 0.0)
(s15 (/ 1.0 184.0))
(s16 (/ 1.0 184.0))
(s17 0.0)
(s18 (/ 1.0 92.0))
(s19 (/ 3.0 184.0))
(s20 (/ 179.0 184.0))
(s21 (/ 21.0 23.0))
(s22 (/ 1.0 184.0))
(s23 (/ 5.0 184.0))
(s24 (/ 1.0 184.0))
(s25 (/ 1.0 184.0))
(s26 (/ 1.0 184.0))
(s27 (/ 1.0 184.0))
(s28 (/ 1.0 184.0))
(s29 (/ 1.0 184.0))
(s30 (/ 1.0 184.0))
(s31 (/ 1.0 184.0))
(s32 (/ 1.0 184.0))
(s33 (/ 1.0 184.0))
(s34 (/ 1.0 184.0))
(s35 (/ 15.0 184.0))
(s36 (/ 1.0 184.0))
(s37 (/ 1.0 184.0))
(s38 (/ 1.0 184.0))
(s39 (/ 1.0 184.0))
(s40 (/ 1.0 184.0))
(s41 (/ 1.0 184.0))
(s42 (/ 1.0 184.0))
(s43 (/ 1.0 184.0))
(s44 (/ 153.0 184.0))
(s45 (/ 1.0 184.0))
(s46 (/ 1.0 184.0))
(s47 (/ 1.0 184.0))
(s48 (/ 1.0 184.0))
(s49 (/ 1.0 184.0))
(s50 (/ 1.0 184.0))
(s51 (/ 1.0 184.0))
(s52 0.0)
(s53 (/ 25.0 184.0))
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 (/ 159.0 184.0))
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 (/ 91.0 92.0))
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 (/ 1.0 184.0))
(s88 (/ 1.0 184.0))
(s89 (/ 1.0 184.0))
(s90 (/ 1.0 184.0))
(s91 (/ 1.0 184.0))
(s92 (/ 1.0 184.0))
(s93 (/ 1.0 184.0))
(s94 (/ 1.0 184.0))
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 (/ 3.0 46.0))
(s99 0.0)
(s100 (/ 1.0 184.0))
(s101 (/ 1.0 184.0))
(s102 (/ 1.0 184.0))
(s103 (/ 1.0 184.0))
(s104 (/ 1.0 184.0))
(s105 (/ 1.0 184.0))
(s106 (/ 1.0 184.0))
(s107 (/ 1.0 184.0))
(s108 (/ 1.0 184.0))
(s109 (/ 1.0 184.0))
(s110 (/ 1.0 184.0))
(s111 (/ 1.0 184.0))
(s112 (/ 1.0 184.0))
(s113 (/ 1.0 184.0))
(s114 (/ 1.0 184.0))
(s115 (/ 1.0 184.0))
(s116 (/ 1.0 184.0))
(s117 (/ 1.0 184.0))
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 (/ 159.0 184.0))
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 (/ 159.0 184.0))
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 (/ 1.0 46.0))
(s151 0.0)
(s152 0.0)
(s153 (/ 1.0 184.0))
(s154 (/ 1.0 184.0))
(s155 (/ 1.0 184.0))
(s156 (/ 1.0 184.0))
(s157 (/ 1.0 184.0))
(s158 (/ 1.0 184.0))
(s159 (/ 1.0 184.0))
(s160 (/ 1.0 184.0))
(s161 (/ 1.0 184.0))
(s162 (/ 1.0 184.0))
(s163 (/ 179.0 184.0))
(s164 (/ 1.0 184.0))
(s165 (/ 3.0 184.0))
(s166 (/ 1.0 184.0))
(s167 (/ 1.0 184.0))
(s168 (/ 3.0 184.0))
(s169 (/ 5.0 92.0))
(s170 (/ 1.0 184.0))
(s171 (/ 1.0 184.0))
(s172 (/ 1.0 184.0))
(s173 (/ 159.0 184.0))
(s174 0.0)
(s175 0.0)
(s176 (/ 3.0 46.0))
(s177 0.0)
(s178 0.0)
(s179 (/ 1.0 184.0))
(s180 (/ 183.0 184.0))
(s181 (/ 1.0 184.0))
(s182 (/ 1.0 184.0))
(s183 (/ 1.0 184.0))
(s184 (/ 181.0 184.0))
(s185 (/ 81.0 92.0))
(s186 (/ 21.0 184.0))
(s187 (/ 167.0 184.0))
(s188 (/ 1.0 184.0))
(s189 (/ 1.0 184.0))
(s190 (/ 1.0 184.0))
(s191 (/ 1.0 184.0))
(s192 (/ 1.0 184.0))
(s193 (/ 1.0 184.0))
(s194 (/ 1.0 184.0))
(s195 (/ 1.0 184.0))
(s196 (/ 1.0 184.0))
(s197 (/ 1.0 184.0))
(s198 (/ 1.0 184.0))
(s199 (/ 1.0 184.0))
(s200 (/ 1.0 184.0))
(s201 (/ 1.0 184.0))
(s202 (/ 1.0 184.0))
(s203 (/ 1.0 184.0))
(s204 (/ 1.0 184.0))
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 (/ 167.0 184.0))
(s225 (/ 1.0 184.0))
(s226 (/ 1.0 184.0))
(s227 (/ 1.0 184.0))
(s228 (/ 1.0 184.0))
(s229 (/ 1.0 184.0))
(s230 (/ 1.0 184.0))
(s231 (/ 1.0 184.0))
(s232 (/ 1.0 184.0))
(s233 (/ 1.0 184.0))
(s234 (/ 1.0 184.0))
(s235 (/ 1.0 184.0))
(s236 (/ 1.0 184.0))
(s237 (/ 1.0 184.0))
(s238 (/ 1.0 184.0))
(s239 (/ 1.0 184.0))
(s240 (/ 1.0 184.0))
(s241 (/ 1.0 184.0))
(s242 (/ 3.0 4.0))
(s243 (/ 1.0 184.0))
(s244 (/ 2.0 23.0))
(s245 (/ 1.0 184.0))
(s246 (/ 1.0 184.0))
(s247 (/ 1.0 184.0))
(s248 0.0)
(s249 (/ 3.0 46.0))
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 (/ 1.0 184.0))
(s254 (/ 1.0 184.0))
(s255 (/ 1.0 184.0))
(s256 (/ 1.0 184.0))
(s257 (/ 1.0 184.0))
(s258 (/ 1.0 184.0))
(s259 (/ 1.0 184.0))
(s260 (/ 1.0 184.0))
(s261 (/ 1.0 184.0))
(s262 (/ 1.0 184.0))
(s263 (/ 1.0 184.0))
(s264 (/ 1.0 184.0))
(s265 (/ 1.0 184.0))
(s266 (/ 1.0 184.0))
(s267 (/ 1.0 184.0))
(s268 (/ 1.0 184.0))
(s269 (/ 1.0 184.0))
(s270 (/ 1.0 184.0))
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 (/ 11.0 184.0))
(s304 0.0)
(s305 0.0)
(s306 (/ 1.0 23.0))
(s307 (/ 1.0 184.0))
(s308 (/ 1.0 184.0))
(s309 (/ 1.0 184.0))
(s310 (/ 1.0 184.0))
(s311 (/ 1.0 184.0))
(s312 (/ 1.0 184.0))
(s313 (/ 1.0 184.0))
(s314 (/ 1.0 184.0))
(s315 (/ 1.0 184.0))
(s316 (/ 183.0 184.0))
(s317 (/ 1.0 184.0))
(s318 0.0)
(s319 0.0)
(s320 (/ 1.0 184.0))
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 (/ 3.0 4.0))
(s330 (/ 1.0 4.0))
(s331 (/ 1.0 184.0))
(s332 (/ 1.0 184.0))
(s333 (/ 91.0 92.0))
(s334 (/ 3.0 184.0))
(s335 (/ 45.0 46.0))
(s336 (/ 1.0 184.0))
(s337 (/ 167.0 184.0))
(s338 (/ 1.0 184.0))
(s339 (/ 1.0 184.0))
(s340 (/ 1.0 184.0))
(s341 (/ 1.0 184.0))
(s342 (/ 1.0 184.0))
(s343 (/ 1.0 184.0))
(s344 (/ 1.0 184.0))
(s345 (/ 1.0 184.0))
(s346 (/ 1.0 184.0))
(s347 (/ 1.0 184.0))
(s348 (/ 1.0 184.0))
(s349 (/ 1.0 184.0))
(s350 (/ 1.0 184.0))
(s351 (/ 1.0 184.0))
(s352 (/ 1.0 184.0))
(s353 (/ 1.0 184.0))
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 (/ 167.0 184.0))
(s374 (/ 1.0 184.0))
(s375 (/ 1.0 184.0))
(s376 (/ 1.0 184.0))
(s377 (/ 1.0 184.0))
(s378 (/ 1.0 184.0))
(s379 (/ 1.0 184.0))
(s380 (/ 1.0 184.0))
(s381 (/ 1.0 184.0))
(s382 (/ 1.0 184.0))
(s383 (/ 1.0 184.0))
(s384 (/ 1.0 184.0))
(s385 (/ 1.0 184.0))
(s386 (/ 1.0 184.0))
(s387 (/ 1.0 184.0))
(s388 (/ 1.0 184.0))
(s389 (/ 1.0 184.0))
(s390 (/ 1.0 184.0))
(s391 (/ 3.0 4.0))
(s392 (/ 1.0 184.0))
(s393 (/ 2.0 23.0))
(s394 (/ 1.0 184.0))
(s395 (/ 1.0 184.0))
(s396 (/ 1.0 184.0))
(s397 0.0)
(s398 0.0)
(s399 (/ 3.0 46.0))
(s400 0.0)
(s401 0.0)
(s402 (/ 1.0 184.0))
(s403 (/ 1.0 184.0))
(s404 (/ 1.0 184.0))
(s405 (/ 1.0 184.0))
(s406 (/ 1.0 184.0))
(s407 (/ 1.0 184.0))
(s408 (/ 1.0 184.0))
(s409 (/ 1.0 184.0))
(s410 (/ 1.0 184.0))
(s411 (/ 1.0 184.0))
(s412 (/ 1.0 184.0))
(s413 (/ 1.0 184.0))
(s414 (/ 1.0 184.0))
(s415 (/ 1.0 184.0))
(s416 (/ 1.0 184.0))
(s417 (/ 1.0 184.0))
(s418 (/ 1.0 184.0))
(s419 (/ 1.0 184.0))
(s420 0.0)
(s421 0.0)
(s422 (/ 1.0 184.0))
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 (/ 1.0 184.0))
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 (/ 5.0 92.0))
(s455 0.0)
(s456 (/ 7.0 184.0))
(s457 (/ 1.0 184.0))
(s458 (/ 1.0 184.0))
(s459 (/ 1.0 184.0))
(s460 (/ 1.0 184.0))
(s461 (/ 1.0 184.0))
(s462 (/ 1.0 184.0))
(s463 (/ 1.0 184.0))
(s464 (/ 1.0 184.0))
(s465 (/ 1.0 184.0))
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 (/ 3.0 4.0))
(s480 (/ 1.0 4.0))
(s481 (/ 1.0 184.0))
(s482 (/ 1.0 184.0))
(s483 (/ 91.0 92.0))
(s484 (/ 3.0 184.0))
(s485 (/ 45.0 46.0))
(s486 (/ 15.0 92.0))
(s487 (/ 1.0 184.0))
(s488 (/ 1.0 184.0))
(s489 (/ 1.0 184.0))
(s490 (/ 1.0 184.0))
(s491 (/ 1.0 184.0))
(s492 (/ 1.0 184.0))
(s493 (/ 1.0 184.0))
(s494 (/ 1.0 184.0))
(s495 (/ 1.0 184.0))
(s496 (/ 1.0 184.0))
(s497 (/ 1.0 184.0))
(s498 (/ 1.0 184.0))
(s499 (/ 1.0 184.0))
(s500 (/ 3.0 4.0))
(s501 (/ 1.0 184.0))
(s502 (/ 1.0 184.0))
(s503 (/ 1.0 184.0))
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 (/ 167.0 184.0))
(s524 (/ 1.0 184.0))
(s525 (/ 1.0 184.0))
(s526 (/ 1.0 184.0))
(s527 (/ 1.0 184.0))
(s528 (/ 1.0 184.0))
(s529 (/ 1.0 184.0))
(s530 (/ 1.0 184.0))
(s531 (/ 1.0 184.0))
(s532 (/ 1.0 184.0))
(s533 (/ 1.0 184.0))
(s534 (/ 1.0 184.0))
(s535 (/ 1.0 184.0))
(s536 (/ 1.0 184.0))
(s537 (/ 1.0 184.0))
(s538 (/ 1.0 184.0))
(s539 (/ 1.0 184.0))
(s540 (/ 1.0 184.0))
(s541 (/ 1.0 184.0))
(s542 (/ 1.0 184.0))
(s543 (/ 2.0 23.0))
(s544 (/ 1.0 184.0))
(s545 (/ 1.0 184.0))
(s546 (/ 1.0 184.0))
(s547 0.0)
(s548 0.0)
(s549 (/ 39.0 46.0))
(s550 0.0)
(s551 0.0)
(s552 (/ 1.0 184.0))
(s553 (/ 1.0 184.0))
(s554 (/ 1.0 184.0))
(s555 (/ 1.0 184.0))
(s556 (/ 1.0 184.0))
(s557 (/ 1.0 184.0))
(s558 (/ 1.0 184.0))
(s559 (/ 1.0 184.0))
(s560 (/ 1.0 184.0))
(s561 (/ 1.0 184.0))
(s562 (/ 145.0 184.0))
(s563 (/ 1.0 184.0))
(s564 (/ 145.0 184.0))
(s565 (/ 1.0 184.0))
(s566 (/ 1.0 184.0))
(s567 (/ 145.0 184.0))
(s568 (/ 1.0 184.0))
(s569 (/ 1.0 184.0))
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 (/ 1.0 46.0))
(s604 0.0)
(s605 (/ 1.0 184.0))
(s606 (/ 1.0 184.0))
(s607 (/ 1.0 184.0))
(s608 (/ 1.0 184.0))
(s609 (/ 1.0 184.0))
(s610 (/ 1.0 184.0))
(s611 (/ 1.0 184.0))
(s612 (/ 1.0 184.0))
(s613 (/ 1.0 184.0))
(s614 (/ 1.0 184.0))
(s615 1.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 (/ 1.0 184.0))
(s629 (/ 183.0 184.0))
(s630 (/ 1.0 184.0))
(s631 (/ 1.0 184.0))
(s632 (/ 91.0 92.0))
(s633 (/ 147.0 184.0))
(s634 (/ 9.0 46.0))
(s635 (/ 7.0 46.0))
(s636 0.0)
(s637 (/ 39.0 46.0))
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 (/ 167.0 184.0))
(s673 (/ 1.0 184.0))
(s674 (/ 1.0 184.0))
(s675 (/ 1.0 184.0))
(s676 (/ 1.0 184.0))
(s677 (/ 1.0 184.0))
(s678 (/ 1.0 184.0))
(s679 (/ 1.0 184.0))
(s680 (/ 1.0 184.0))
(s681 (/ 1.0 184.0))
(s682 (/ 1.0 184.0))
(s683 (/ 1.0 184.0))
(s684 (/ 1.0 184.0))
(s685 (/ 1.0 184.0))
(s686 (/ 1.0 184.0))
(s687 (/ 1.0 184.0))
(s688 (/ 1.0 184.0))
(s689 (/ 1.0 184.0))
(s690 (/ 1.0 184.0))
(s691 (/ 1.0 184.0))
(s692 (/ 2.0 23.0))
(s693 (/ 1.0 184.0))
(s694 (/ 1.0 184.0))
(s695 (/ 1.0 184.0))
(s696 0.0)
(s697 0.0)
(s698 (/ 159.0 184.0))
(s699 0.0)
(s700 0.0)
(s701 (/ 1.0 184.0))
(s702 (/ 1.0 184.0))
(s703 (/ 1.0 184.0))
(s704 (/ 1.0 184.0))
(s705 (/ 1.0 184.0))
(s706 (/ 1.0 184.0))
(s707 (/ 1.0 184.0))
(s708 (/ 1.0 184.0))
(s709 (/ 1.0 184.0))
(s710 (/ 37.0 46.0))
(s711 (/ 1.0 184.0))
(s712 (/ 1.0 184.0))
(s713 (/ 37.0 46.0))
(s714 (/ 1.0 184.0))
(s715 (/ 1.0 184.0))
(s716 (/ 37.0 46.0))
(s717 (/ 1.0 184.0))
(s718 (/ 1.0 184.0))
(s719 0.0)
(s720 0.0)
(s721 (/ 1.0 184.0))
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 (/ 1.0 184.0))
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 (/ 1.0 184.0))
(s759 (/ 1.0 184.0))
(s760 (/ 1.0 184.0))
(s761 (/ 1.0 184.0))
(s762 (/ 1.0 184.0))
(s763 (/ 1.0 184.0))
(s764 1.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 1.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 (/ 1.0 184.0))
(s778 (/ 183.0 184.0))
(s779 (/ 1.0 184.0))
(s780 (/ 1.0 184.0))
(s781 (/ 91.0 92.0))
(s782 (/ 151.0 184.0))
(s783 (/ 33.0 184.0))
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 1.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 1.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 1.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 1.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 1.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 1.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 1.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 1.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 1.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 1.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 1.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 1.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 1.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 1.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 1.0)
(s1021 0.0)
(s1022 0.0)
(s1023 1.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 1.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 1.0)
(s1044 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1067 1.0)
(s1068 0.0)
(s1069 1.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
timeout
(s1141 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1175/3052 variables, and 222 constraints, problems are : Problem set: 0 solved, 381 unsolved in 105022 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 149/151 constraints, State Equation: 0/1177 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 40/421 variables, 45/63 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (OVERLAPS) 1/422 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 7 (OVERLAPS) 235/657 variables, 47/116 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2025-05-29 19:37:28] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 7 ms to minimize.
[2025-05-29 19:37:28] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 2 ms to minimize.
[2025-05-29 19:37:29] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2025-05-29 19:37:31] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 2 ms to minimize.
[2025-05-29 19:37:32] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 1 ms to minimize.
[2025-05-29 19:37:34] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2025-05-29 19:37:35] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 3 ms to minimize.
[2025-05-29 19:37:35] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2025-05-29 19:37:39] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 11 (OVERLAPS) 7/664 variables, 7/132 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/664 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 13 (OVERLAPS) 150/814 variables, 27/159 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2025-05-29 19:38:04] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/814 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/814 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 16 (OVERLAPS) 9/823 variables, 6/166 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/823 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 18 (OVERLAPS) 60/883 variables, 11/177 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 20 (OVERLAPS) 3/886 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/886 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 22 (OVERLAPS) 62/948 variables, 9/189 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/3052 variables, and 189 constraints, problems are : Problem set: 0 solved, 381 unsolved in 105013 ms.
Refiners :[Positive P Invariants (semi-flows): 62/73 constraints, Generalized P Invariants (flows): 117/151 constraints, State Equation: 0/1177 constraints, PredecessorRefiner: 0/381 constraints, Known Traps: 10/10 constraints]
After SMT, in 210174ms problems are : Problem set: 0 solved, 381 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 381 out of 1177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1177/1177 places, 1875/1875 transitions.
Applied a total of 0 rules in 23 ms. Remains 1177 /1177 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 1177/1177 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1177/1177 places, 1875/1875 transitions.
Applied a total of 0 rules in 22 ms. Remains 1177 /1177 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2025-05-29 19:39:03] [INFO ] Invariant cache hit.
[2025-05-29 19:39:04] [INFO ] Implicit Places using invariants in 618 ms returned [20, 53, 71, 163, 180, 185, 186, 206, 224, 316, 330, 334, 335, 355, 373, 466, 480, 484, 485, 505, 523, 615, 629, 633, 634, 654, 672, 764, 778, 782, 783, 784, 802, 820, 839, 889, 890, 901, 902, 903, 921, 939, 958, 1008, 1009, 1012, 1023, 1024, 1025, 1043, 1045, 1048, 1066, 1067, 1068, 1069, 1081, 1087, 1093, 1099, 1105, 1111, 1117, 1123, 1129, 1135, 1141]
Discarding 67 places :
Implicit Place search using SMT only with invariants took 628 ms to find 67 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1110/1177 places, 1875/1875 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 1110 transition count 1786
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 178 place count 1021 transition count 1786
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 178 place count 1021 transition count 1751
Deduced a syphon composed of 35 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 71 rules applied. Total rules applied 249 place count 985 transition count 1751
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 261 place count 981 transition count 1743
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 269 place count 973 transition count 1743
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 284 place count 958 transition count 1728
Iterating global reduction 4 with 15 rules applied. Total rules applied 299 place count 958 transition count 1728
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 302 place count 958 transition count 1725
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 302 place count 958 transition count 1724
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 304 place count 957 transition count 1724
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 307 place count 954 transition count 1721
Iterating global reduction 5 with 3 rules applied. Total rules applied 310 place count 954 transition count 1721
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 311 place count 953 transition count 1720
Iterating global reduction 5 with 1 rules applied. Total rules applied 312 place count 953 transition count 1720
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 313 place count 952 transition count 1719
Iterating global reduction 5 with 1 rules applied. Total rules applied 314 place count 952 transition count 1719
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 416 place count 901 transition count 1668
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 418 place count 901 transition count 1666
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 6 with 16 rules applied. Total rules applied 434 place count 901 transition count 1650
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 451 place count 884 transition count 1650
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 470 place count 884 transition count 1650
Applied a total of 470 rules in 145 ms. Remains 884 /1110 variables (removed 226) and now considering 1650/1875 (removed 225) transitions.
// Phase 1: matrix 1650 rows 884 cols
[2025-05-29 19:39:04] [INFO ] Computed 151 invariants in 13 ms
[2025-05-29 19:39:04] [INFO ] Implicit Places using invariants in 411 ms returned [122, 128, 131, 133, 134, 155, 156, 251, 257, 260, 262, 263, 281, 282, 377, 383, 386, 388, 389, 407, 408, 502, 508, 511, 513, 514, 532, 533, 628, 634, 637, 639, 640, 656, 657, 727, 733, 736, 738, 743, 744, 810, 816, 819, 821]
[2025-05-29 19:39:04] [INFO ] Actually due to overlaps returned [155, 281, 407, 532, 656, 743, 156, 282, 408, 533, 657, 744, 122, 128, 133, 251, 257, 262, 383, 388, 502, 508, 513, 634, 639, 727, 733, 738, 810, 816, 821, 134, 263, 377, 389, 514, 628, 640]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 414 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 846/1177 places, 1650/1875 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 819 transition count 1623
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 819 transition count 1623
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 814 transition count 1618
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 814 transition count 1618
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 78 place count 807 transition count 1611
Free-agglomeration rule applied 26 times.
Iterating global reduction 0 with 26 rules applied. Total rules applied 104 place count 807 transition count 1585
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 130 place count 781 transition count 1585
Applied a total of 130 rules in 76 ms. Remains 781 /846 variables (removed 65) and now considering 1585/1650 (removed 65) transitions.
// Phase 1: matrix 1585 rows 781 cols
[2025-05-29 19:39:04] [INFO ] Computed 113 invariants in 19 ms
[2025-05-29 19:39:05] [INFO ] Implicit Places using invariants in 309 ms returned []
[2025-05-29 19:39:05] [INFO ] Invariant cache hit.
[2025-05-29 19:39:06] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 781/1177 places, 1585/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2559 ms. Remains : 781/1177 places, 1585/1875 transitions.
RANDOM walk for 2059365 steps (32925 resets) in 120004 ms. (17 steps per ms) remains 379/381 properties
BEST_FIRST walk for 40003 steps (116 resets) in 497 ms. (80 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (114 resets) in 394 ms. (101 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (121 resets) in 369 ms. (108 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (115 resets) in 441 ms. (90 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (112 resets) in 421 ms. (94 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40001 steps (112 resets) in 348 ms. (114 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (113 resets) in 441 ms. (90 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (108 resets) in 399 ms. (100 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (111 resets) in 356 ms. (112 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (115 resets) in 446 ms. (89 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (117 resets) in 292 ms. (136 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (112 resets) in 373 ms. (106 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (123 resets) in 376 ms. (106 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (114 resets) in 408 ms. (97 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (117 resets) in 325 ms. (122 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (110 resets) in 363 ms. (109 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (115 resets) in 343 ms. (116 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (118 resets) in 478 ms. (83 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (112 resets) in 352 ms. (113 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (114 resets) in 404 ms. (98 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (107 resets) in 416 ms. (95 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (117 resets) in 360 ms. (110 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (118 resets) in 389 ms. (102 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (112 resets) in 358 ms. (111 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (111 resets) in 409 ms. (97 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (114 resets) in 324 ms. (123 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (115 resets) in 512 ms. (77 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (117 resets) in 475 ms. (84 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (115 resets) in 431 ms. (92 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (113 resets) in 446 ms. (89 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (112 resets) in 441 ms. (90 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (114 resets) in 490 ms. (81 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (118 resets) in 498 ms. (80 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (114 resets) in 366 ms. (109 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (118 resets) in 428 ms. (93 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (112 resets) in 431 ms. (92 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (115 resets) in 431 ms. (92 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (115 resets) in 433 ms. (92 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (120 resets) in 328 ms. (121 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (115 resets) in 485 ms. (82 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (112 resets) in 372 ms. (107 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (110 resets) in 395 ms. (101 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (120 resets) in 402 ms. (99 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (112 resets) in 457 ms. (87 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (114 resets) in 448 ms. (89 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (111 resets) in 493 ms. (80 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (116 resets) in 354 ms. (112 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (106 resets) in 457 ms. (87 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (116 resets) in 451 ms. (88 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (118 resets) in 413 ms. (96 steps per ms) remains 379/379 properties
Interrupted probabilistic random walk after 1950907 steps, run timeout after 108001 ms. (steps per millisecond=18 ) properties seen :69 out of 379
Probabilistic random walk after 1950907 steps, saw 1232235 distinct states, run finished after 108001 ms. (steps per millisecond=18 ) properties seen :69
[2025-05-29 19:41:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 27/337 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 112/449 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 3/452 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (OVERLAPS) 135/587 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 11 (OVERLAPS) 6/593 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 13 (OVERLAPS) 99/692 variables, 9/97 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/692 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 15 (OVERLAPS) 34/726 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/726 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 17 (OVERLAPS) 55/781 variables, 11/113 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/781 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 19 (OVERLAPS) 1585/2366 variables, 781/894 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2366 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 21 (OVERLAPS) 0/2366 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2366/2366 variables, and 894 constraints, problems are : Problem set: 0 solved, 310 unsolved in 70064 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 27/337 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 112/449 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2025-05-29 19:42:45] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2025-05-29 19:42:46] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2025-05-29 19:42:47] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2025-05-29 19:42:47] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2025-05-29 19:42:48] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 1 ms to minimize.
[2025-05-29 19:42:49] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2025-05-29 19:42:50] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 2 ms to minimize.
[2025-05-29 19:42:50] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 3 ms to minimize.
[2025-05-29 19:42:50] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 3/452 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 10 (OVERLAPS) 135/587 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 12 (OVERLAPS) 6/593 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/593 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 14 (OVERLAPS) 99/692 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/692 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 16 (OVERLAPS) 34/726 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2025-05-29 19:43:21] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/726 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/726 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 19 (OVERLAPS) 55/781 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/781 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 21 (OVERLAPS) 1585/2366 variables, 781/904 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2366 variables, 310/1214 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2366/2366 variables, and 1214 constraints, problems are : Problem set: 0 solved, 310 unsolved in 120023 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 10/10 constraints]
After SMT, in 190178ms problems are : Problem set: 0 solved, 310 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 310 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1585/1585 transitions.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 778 transition count 1578
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 770 transition count 1578
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 18 place count 770 transition count 1571
Deduced a syphon composed of 7 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 761 transition count 1571
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 760 transition count 1569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 758 transition count 1569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 39 place count 758 transition count 1568
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 41 place count 757 transition count 1568
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 45 place count 753 transition count 1559
Iterating global reduction 4 with 4 rules applied. Total rules applied 49 place count 753 transition count 1559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 753 transition count 1558
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 51 place count 752 transition count 1557
Iterating global reduction 5 with 1 rules applied. Total rules applied 52 place count 752 transition count 1557
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 54 place count 751 transition count 1556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 55 place count 751 transition count 1555
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 56 place count 751 transition count 1555
Applied a total of 56 rules in 121 ms. Remains 751 /781 variables (removed 30) and now considering 1555/1585 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 751/781 places, 1555/1585 transitions.
RANDOM walk for 4000000 steps (65896 resets) in 112455 ms. (35 steps per ms) remains 309/310 properties
BEST_FIRST walk for 40003 steps (122 resets) in 279 ms. (142 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (117 resets) in 356 ms. (112 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40002 steps (113 resets) in 375 ms. (106 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (123 resets) in 286 ms. (139 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (123 resets) in 293 ms. (136 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40002 steps (120 resets) in 460 ms. (86 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (122 resets) in 374 ms. (106 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40002 steps (116 resets) in 315 ms. (126 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (117 resets) in 299 ms. (133 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (123 resets) in 385 ms. (103 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (127 resets) in 365 ms. (109 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (118 resets) in 385 ms. (103 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (116 resets) in 301 ms. (132 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40002 steps (120 resets) in 335 ms. (119 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (121 resets) in 365 ms. (109 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (119 resets) in 376 ms. (106 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40002 steps (125 resets) in 366 ms. (108 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (115 resets) in 332 ms. (120 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40001 steps (120 resets) in 368 ms. (108 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (121 resets) in 377 ms. (105 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (118 resets) in 365 ms. (109 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (118 resets) in 396 ms. (100 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (117 resets) in 282 ms. (141 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (122 resets) in 322 ms. (123 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (120 resets) in 456 ms. (87 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (120 resets) in 358 ms. (111 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (116 resets) in 428 ms. (93 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40002 steps (117 resets) in 435 ms. (91 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (122 resets) in 303 ms. (131 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (121 resets) in 406 ms. (98 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (123 resets) in 361 ms. (110 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (122 resets) in 284 ms. (140 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (115 resets) in 428 ms. (93 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (119 resets) in 373 ms. (106 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (113 resets) in 397 ms. (100 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (116 resets) in 455 ms. (87 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (123 resets) in 319 ms. (125 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40002 steps (112 resets) in 399 ms. (100 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (126 resets) in 279 ms. (142 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (114 resets) in 415 ms. (96 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (120 resets) in 382 ms. (104 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (122 resets) in 415 ms. (96 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (121 resets) in 348 ms. (114 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (121 resets) in 298 ms. (133 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (122 resets) in 385 ms. (103 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (124 resets) in 363 ms. (109 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (109 resets) in 364 ms. (109 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (116 resets) in 440 ms. (90 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (120 resets) in 375 ms. (106 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (125 resets) in 383 ms. (104 steps per ms) remains 309/309 properties
Interrupted probabilistic random walk after 4784179 steps, run timeout after 105001 ms. (steps per millisecond=45 ) properties seen :6 out of 309
Probabilistic random walk after 4784179 steps, saw 1516799 distinct states, run finished after 105001 ms. (steps per millisecond=45 ) properties seen :6
// Phase 1: matrix 1555 rows 751 cols
[2025-05-29 19:47:02] [INFO ] Computed 106 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 9/312 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 101/413 variables, 29/63 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 3/416 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 105/521 variables, 13/79 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (OVERLAPS) 14/535 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 13 (OVERLAPS) 133/668 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/668 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 15 (OVERLAPS) 48/716 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/716 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 17 (OVERLAPS) 35/751 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/751 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2306 variables, 751/857 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2306 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 21 (OVERLAPS) 0/2306 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2306/2306 variables, and 857 constraints, problems are : Problem set: 0 solved, 303 unsolved in 66564 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 84/84 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 9/312 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 101/413 variables, 29/63 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2025-05-29 19:48:12] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 2 ms to minimize.
[2025-05-29 19:48:12] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2025-05-29 19:48:13] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 5 ms to minimize.
[2025-05-29 19:48:14] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2025-05-29 19:48:14] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 1 ms to minimize.
[2025-05-29 19:48:15] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 3/416 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 105/521 variables, 13/85 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2025-05-29 19:48:24] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 13 (OVERLAPS) 14/535 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 15 (OVERLAPS) 133/668 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/668 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 17 (OVERLAPS) 48/716 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/716 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 19 (OVERLAPS) 35/751 variables, 9/113 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 21 (OVERLAPS) 1555/2306 variables, 751/864 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2306 variables, 303/1167 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2306/2306 variables, and 1167 constraints, problems are : Problem set: 0 solved, 303 unsolved in 135016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 84/84 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints]
After SMT, in 201689ms problems are : Problem set: 0 solved, 303 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 303 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1555/1555 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 751 transition count 1553
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 749 transition count 1553
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 749 transition count 1552
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 748 transition count 1552
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 746 transition count 1545
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 746 transition count 1545
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 745 transition count 1544
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 745 transition count 1544
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 744 transition count 1543
Applied a total of 14 rules in 45 ms. Remains 744 /751 variables (removed 7) and now considering 1543/1555 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 744/751 places, 1543/1555 transitions.
RANDOM walk for 4000000 steps (65838 resets) in 88643 ms. (45 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (124 resets) in 240 ms. (165 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (121 resets) in 322 ms. (123 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (120 resets) in 401 ms. (99 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (126 resets) in 372 ms. (107 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (119 resets) in 366 ms. (109 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40002 steps (117 resets) in 359 ms. (111 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40001 steps (117 resets) in 455 ms. (87 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (123 resets) in 410 ms. (97 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (121 resets) in 425 ms. (93 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (121 resets) in 333 ms. (119 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40002 steps (112 resets) in 368 ms. (108 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (120 resets) in 346 ms. (115 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (121 resets) in 289 ms. (137 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (117 resets) in 372 ms. (107 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (124 resets) in 568 ms. (70 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40002 steps (123 resets) in 322 ms. (123 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (119 resets) in 391 ms. (102 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (111 resets) in 367 ms. (108 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (123 resets) in 538 ms. (74 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (120 resets) in 396 ms. (100 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (122 resets) in 343 ms. (116 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (120 resets) in 366 ms. (109 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (118 resets) in 390 ms. (102 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (116 resets) in 497 ms. (80 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (118 resets) in 346 ms. (115 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (114 resets) in 393 ms. (101 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (121 resets) in 312 ms. (127 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (126 resets) in 376 ms. (106 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (124 resets) in 339 ms. (117 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (119 resets) in 389 ms. (102 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (123 resets) in 333 ms. (119 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (120 resets) in 291 ms. (136 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (120 resets) in 535 ms. (74 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (117 resets) in 369 ms. (108 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (123 resets) in 314 ms. (126 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (118 resets) in 331 ms. (120 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (110 resets) in 431 ms. (92 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (125 resets) in 347 ms. (114 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (124 resets) in 427 ms. (93 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (114 resets) in 371 ms. (107 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (116 resets) in 457 ms. (87 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (119 resets) in 339 ms. (117 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (118 resets) in 319 ms. (125 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (121 resets) in 389 ms. (102 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (123 resets) in 263 ms. (151 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (111 resets) in 338 ms. (118 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (119 resets) in 313 ms. (127 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (121 resets) in 332 ms. (120 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (116 resets) in 301 ms. (132 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (124 resets) in 396 ms. (100 steps per ms) remains 303/303 properties
Interrupted probabilistic random walk after 3028850 steps, run timeout after 87001 ms. (steps per millisecond=34 ) properties seen :0 out of 303
Probabilistic random walk after 3028850 steps, saw 1141336 distinct states, run finished after 87001 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 1543 rows 744 cols
[2025-05-29 19:52:20] [INFO ] Computed 106 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 9/312 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 103/415 variables, 26/64 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 3/418 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 96/514 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (OVERLAPS) 14/528 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 303 unsolved

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ASLink-PT-07a"
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 ASLink-PT-07a, 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-174853743600238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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