About the Execution of 2024-gold for ASLink-PT-04b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15690.620 | 1800000.00 | 3862589.00 | 2739.30 | [undef] | Time out reached |
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-174853743600213.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-04b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743600213
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 669K 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 1748545342156
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-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 19:02:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 19:02:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:02:23] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2025-05-29 19:02:23] [INFO ] Transformed 2034 places.
[2025-05-29 19:02:23] [INFO ] Transformed 2567 transitions.
[2025-05-29 19:02:23] [INFO ] Found NUPN structural information;
[2025-05-29 19:02:23] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 302 ms.
Structural test allowed to assert that 246 places are NOT stable. Took 18 ms.
RANDOM walk for 40000 steps (104 resets) in 3867 ms. (10 steps per ms) remains 638/1788 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 25 ms. (4 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 30 ms. (4 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 26 ms. (4 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 30 ms. (3 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 638/638 properties
BEST_FIRST walk for 122 steps (8 resets) in 12 ms. (9 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 5 ms. (20 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 5 ms. (20 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 638/638 properties
BEST_FIRST walk for 121 steps (8 resets) in 6 ms. (17 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 638/638 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 638/638 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 638/638 properties
// Phase 1: matrix 2567 rows 2034 cols
[2025-05-29 19:02:25] [INFO ] Computed 199 invariants in 160 ms
Error getting values : (error "ParserException while parsing response: ((s8 (/ 1.0 2.0))
(s9 (/ 1.0 2.0))
(s10 (/ 1.0 2.0))
(s11 (/ 1.0 2.0))
(s12 (/ 1.0 2.0))
(s13 (/ 1.0 2.0))
(s14 (/ 1.0 2.0))
(s15 (/ 1.0 2.0))
(s16 (/ 1.0 2.0))
(s17 (/ 1.0 2.0))
(s18 (/ 1.0 2.0))
(s19 (/ 1.0 2.0))
(s20 (/ 1.0 2.0))
(s21 (/ 1.0 2.0))
(s22 (/ 1.0 2.0))
(s23 (/ 1.0 2.0))
(s24 (/ 1.0 2.0))
(s25 (/ 1.0 2.0))
(s26 (/ 1.0 2.0))
(s27 (/ 1.0 2.0))
(s28 (/ 1.0 2.0))
(s29 (/ 1.0 2.0))
(s30 (/ 1.0 2.0))
(s31 (/ 1.0 2.0))
(s32 (/ 1.0 2.0))
(s33 (/ 1.0 2.0))
(s34 (/ 1.0 2.0))
(s35 (/ 1.0 2.0))
(s36 (/ 1.0 2.0))
(s37 (/ 1.0 2.0))
(s38 (/ 1.0 2.0))
(s39 (/ 1.0 2.0))
(s40 (/ 1.0 2.0))
(s41 (/ 1.0 2.0))
(s42 (/ 1.0 2.0))
(s46 (/ 1.0 2.0))
(s47 (/ 1.0 2.0))
(s48 (/ 1.0 2.0))
(s49 (/ 1.0 2.0))
(s50 (/ 1.0 2.0))
(s51 (/ 1.0 2.0))
(s55 (/ 1.0 2.0))
(s56 (/ 1.0 2.0))
(s57 (/ 1.0 2.0))
(s58 (/ 1.0 2.0))
(s59 (/ 1.0 2.0))
(s60 (/ 1.0 2.0))
(s61 (/ 1.0 2.0))
(s62 (/ 1.0 2.0))
(s63 (/ 1.0 2.0))
(s64 (/ 1.0 2.0))
(s65 (/ 1.0 2.0))
(s66 (/ 1.0 2.0))
(s67 (/ 1.0 2.0))
(s68 (/ 1.0 2.0))
(s69 (/ 1.0 2.0))
(s70 (/ 1.0 2.0))
(s71 (/ 1.0 2.0))
(s72 (/ 1.0 2.0))
(s73 (/ 1.0 2.0))
(s74 (/ 1.0 2.0))
(s75 (/ 1.0 2.0))
(s76 (/ 1.0 2.0))
(s77 (/ 1.0 2.0))
(s78 (/ 1.0 2.0))
(s79 (/ 1.0 2.0))
(s89 (/ 1.0 2.0))
(s90 (/ 1.0 2.0))
(s91 (/ 1.0 2.0))
(s92 (/ 1.0 2.0))
(s93 (/ 1.0 2.0))
(s94 (/ 1.0 2.0))
(s95 (/ 1.0 2.0))
(s96 (/ 1.0 2.0))
(s97 (/ 1.0 2.0))
(s98 (/ 1.0 2.0))
(s99 (/ 1.0 2.0))
(s100 (/ 1.0 2.0))
(s101 (/ 1.0 2.0))
(s102 (/ 1.0 2.0))
(s103 (/ 1.0 2.0))
(s104 (/ 1.0 2.0))
(s105 (/ 1.0 2.0))
(s106 (/ 1.0 2.0))
(s107 (/ 1.0 2.0))
(s108 (/ 1.0 2.0))
(s109 (/ 1.0 2.0))
(s110 (/ 1.0 2.0))
(s111 (/ 1.0 2.0))
(s112 (/ 1.0 2.0))
(s113 (/ 1.0 2.0))
(s114 (/ 1.0 2.0))
(s115 (/ 1.0 2.0))
(s116 (/ 1.0 2.0))
(s117 (/ 1.0 2.0))
(s118 (/ 1.0 2.0))
(s119 (/ 1.0 2.0))
(s120 (/ 1.0 2.0))
(s121 (/ 1.0 2.0))
(s122 (/ 1.0 2.0))
(s123 (/ 1.0 2.0))
(s124 (/ 1.0 2.0))
(s125 (/ 1.0 2.0))
(s126 (/ 1.0 2.0))
(s130 (/ 1.0 2.0))
(s131 (/ 1.0 2.0))
(s132 (/ 1.0 2.0))
(s133 (/ 1.0 2.0))
(s134 (/ 1.0 2.0))
(s135 (/ 1.0 2.0))
(s158 (/ 1.0 2.0))
(s159 (/ 1.0 2.0))
(s160 (/ 1.0 2.0))
(s161 (/ 1.0 2.0))
(s162 (/ 1.0 2.0))
(s163 (/ 1.0 2.0))
(s164 (/ 1.0 2.0))
(s165 (/ 1.0 2.0))
(s166 (/ 1.0 2.0))
(s167 (/ 1.0 2.0))
(s168 (/ 1.0 2.0))
(s169 (/ 1.0 2.0))
(s170 (/ 1.0 2.0))
(s171 (/ 1.0 2.0))
(s172 (/ 1.0 2.0))
(s173 (/ 1.0 2.0))
(s174 (/ 1.0 2.0))
(s175 (/ 1.0 2.0))
(s176 (/ 1.0 2.0))
(s177 (/ 1.0 2.0))
(s178 (/ 1.0 2.0))
(s179 (/ 1.0 2.0))
(s180 (/ 1.0 2.0))
(s181 (/ 1.0 2.0))
(s182 (/ 1.0 2.0))
(s183 (/ 1.0 2.0))
(s184 (/ 1.0 2.0))
(s186 (/ 1.0 2.0))
(s187 (/ 1.0 2.0))
(s198 (/ 1.0 2.0))
(s200 (/ 1.0 2.0))
(s201 (/ 1.0 2.0))
(s202 (/ 1.0 2.0))
(s203 (/ 1.0 2.0))
(s204 (/ 1.0 2.0))
(s205 (/ 1.0 2.0))
(s206 (/ 1.0 2.0))
(s207 (/ 1.0 2.0))
(s208 (/ 1.0 2.0))
(s209 (/ 1.0 2.0))
(s210 (/ 1.0 2.0))
(s211 (/ 1.0 2.0))
(s212 (/ 1.0 2.0))
(s213 (/ 1.0 2.0))
(s214 (/ 1.0 2.0))
(s215 (/ 1.0 2.0))
(s216 (/ 1.0 2.0))
(s217 (/ 1.0 2.0))
(s218 (/ 1.0 2.0))
(s219 (/ 1.0 2.0))
(s220 (/ 1.0 2.0))
(s221 (/ 1.0 2.0))
(s235 (/ 1.0 2.0))
(s236 (/ 1.0 2.0))
(s237 (/ 1.0 2.0))
(s238 (/ 1.0 2.0))
(s239 (/ 1.0 2.0))
(s240 (/ 1.0 2.0))
(s241 (/ 1.0 2.0))
(s242 (/ 1.0 2.0))
(s243 (/ 1.0 2.0))
(s244 (/ 1.0 2.0))
(s245 (/ 1.0 2.0))
(s246 (/ 1.0 2.0))
(s247 (/ 1.0 2.0))
(s248 (/ 1.0 2.0))
(s249 (/ 1.0 2.0))
(s250 (/ 1.0 2.0))
(s251 (/ 1.0 2.0))
(s252 (/ 1.0 2.0))
(s253 (/ 1.0 2.0))
(s254 (/ 1.0 2.0))
(s255 (/ 1.0 2.0))
(s256 (/ 1.0 2.0))
(s257 (/ 1.0 2.0))
(s258 (/ 1.0 2.0))
(s259 (/ 1.0 2.0))
(s260 (/ 1.0 2.0))
(s261 (/ 1.0 2.0))
(s262 (/ 1.0 2.0))
(s263 (/ 1.0 2.0))
(s264 (/ 1.0 2.0))
(s265 (/ 1.0 2.0))
(s266 (/ 1.0 2.0))
(s267 (/ 1.0 2.0))
(s268 (/ 1.0 2.0))
(s269 (/ 1.0 2.0))
(s275 (/ 1.0 2.0))
(s276 (/ 1.0 2.0))
(s277 (/ 1.0 2.0))
(s278 (/ 1.0 2.0))
(s279 (/ 1.0 2.0))
(s280 (/ 1.0 2.0))
(s281 (/ 1.0 2.0))
(s282 (/ 1.0 2.0))
(s283 (/ 1.0 2.0))
(s284 (/ 1.0 2.0))
(s285 (/ 1.0 2.0))
(s286 (/ 1.0 2.0))
(s318 (/ 1.0 2.0))
(s319 (/ 1.0 2.0))
(s320 (/ 1.0 2.0))
(s321 (/ 1.0 2.0))
(s322 (/ 1.0 2.0))
(s323 (/ 1.0 2.0))
(s355 (/ 1.0 2.0))
(s356 (/ 1.0 2.0))
(s357 (/ 1.0 2.0))
(s398 (/ 1.0 2.0))
(s399 (/ 1.0 2.0))
(s400 (/ 1.0 2.0))
(s401 (/ 1.0 2.0))
(s402 (/ 1.0 2.0))
(s403 (/ 1.0 2.0))
(s404 (/ 1.0 2.0))
(s405 (/ 1.0 2.0))
(s406 (/ 1.0 2.0))
(s407 (/ 1.0 2.0))
(s408 (/ 1.0 2.0))
(s409 (/ 1.0 2.0))
(s410 (/ 1.0 2.0))
(s411 (/ 1.0 2.0))
(s412 (/ 1.0 2.0))
(s414 (/ 1.0 2.0))
(s415 (/ 1.0 2.0))
(s416 (/ 1.0 2.0))
(s417 (/ 1.0 2.0))
(s418 (/ 1.0 2.0))
(s419 (/ 1.0 2.0))
(s420 (/ 1.0 2.0))
(s421 (/ 1.0 2.0))
(s422 (/ 1.0 2.0))
(s423 (/ 1.0 2.0))
(s424 (/ 1.0 2.0))
(s425 (/ 1.0 2.0))
(s427 (/ 1.0 2.0))
(s428 (/ 1.0 2.0))
(s429 (/ 1.0 2.0))
(s430 (/ 1.0 2.0))
(s431 (/ 1.0 2.0))
(s432 (/ 1.0 2.0))
(s446 (/ 1.0 2.0))
(s447 (/ 1.0 2.0))
(s448 (/ 1.0 2.0))
(s455 (/ 1.0 2.0))
(s456 (/ 1.0 2.0))
(s457 (/ 1.0 2.0))
(s458 (/ 1.0 2.0))
(s459 (/ 1.0 2.0))
(s460 (/ 1.0 2.0))
(s461 (/ 1.0 2.0))
(s462 (/ 1.0 2.0))
(s463 (/ 1.0 2.0))
(s467 (/ 1.0 2.0))
(s468 (/ 1.0 2.0))
(s469 (/ 1.0 2.0))
(s484 (/ 1.0 2.0))
(s485 (/ 1.0 2.0))
(s486 (/ 1.0 2.0))
(s487 (/ 1.0 2.0))
(s488 (/ 1.0 2.0))
(s489 (/ 1.0 2.0))
(s490 (/ 1.0 2.0))
(s491 (/ 1.0 2.0))
(s492 (/ 1.0 2.0))
(s493 (/ 1.0 2.0))
(s494 (/ 1.0 2.0))
(s495 (/ 1.0 2.0))
(s496 (/ 1.0 2.0))
(s497 (/ 1.0 2.0))
(s498 (/ 1.0 2.0))
(s499 (/ 1.0 2.0))
(s500 (/ 1.0 2.0))
(s501 (/ 1.0 2.0))
(s502 (/ 1.0 2.0))
(s503 (/ 1.0 2.0))
(s504 (/ 1.0 2.0))
(s505 (/ 1.0 2.0))
(s506 (/ 1.0 2.0))
(s507 (/ 1.0 2.0))
(s508 (/ 1.0 2.0))
(s509 (/ 1.0 2.0))
(s510 (/ 1.0 2.0))
(s511 (/ 1.0 2.0))
(s512 (/ 1.0 2.0))
(s513 (/ 1.0 2.0))
(s514 (/ 1.0 2.0))
(s515 (/ 1.0 2.0))
(s516 (/ 1.0 2.0))
(s517 (/ 1.0 2.0))
(s518 (/ 1.0 2.0))
(s519 (/ 1.0 2.0))
(s520 (/ 1.0 2.0))
(s521 (/ 1.0 2.0))
(s525 (/ 1.0 2.0))
(s526 (/ 1.0 2.0))
(s527 (/ 1.0 2.0))
(s528 (/ 1.0 2.0))
(s529 (/ 1.0 2.0))
(s530 (/ 1.0 2.0))
(s553 (/ 1.0 2.0))
(s554 (/ 1.0 2.0))
(s555 (/ 1.0 2.0))
(s556 (/ 1.0 2.0))
(s557 (/ 1.0 2.0))
(s558 (/ 1.0 2.0))
(s559 (/ 1.0 2.0))
(s560 (/ 1.0 2.0))
(s561 (/ 1.0 2.0))
(s562 (/ 1.0 2.0))
(s563 (/ 1.0 2.0))
(s564 (/ 1.0 2.0))
(s565 (/ 1.0 2.0))
(s566 (/ 1.0 2.0))
(s567 (/ 1.0 2.0))
(s568 (/ 1.0 2.0))
(s569 (/ 1.0 2.0))
(s570 (/ 1.0 2.0))
(s571 (/ 1.0 2.0))
(s572 (/ 1.0 2.0))
(s573 (/ 1.0 2.0))
(s574 (/ 1.0 2.0))
(s575 (/ 1.0 2.0))
(s576 (/ 1.0 2.0))
(s577 (/ 1.0 2.0))
(s578 (/ 1.0 2.0))
(s579 (/ 1.0 2.0))
(s581 (/ 1.0 2.0))
(s582 (/ 1.0 2.0))
(s593 (/ 1.0 2.0))
(s595 (/ 1.0 2.0))
(s596 (/ 1.0 2.0))
(s597 (/ 1.0 2.0))
(s598 (/ 1.0 2.0))
(s599 (/ 1.0 2.0))
(s600 (/ 1.0 2.0))
(s601 (/ 1.0 2.0))
(s602 (/ 1.0 2.0))
(s603 (/ 1.0 2.0))
(s604 (/ 1.0 2.0))
(s605 (/ 1.0 2.0))
(s606 (/ 1.0 2.0))
(s607 (/ 1.0 2.0))
(s608 (/ 1.0 2.0))
(s609 (/ 1.0 2.0))
(s610 (/ 1.0 2.0))
(s611 (/ 1.0 2.0))
(s612 (/ 1.0 2.0))
(s613 (/ 1.0 2.0))
(s614 (/ 1.0 2.0))
(s615 (/ 1.0 2.0))
(s616 (/ 1.0 2.0))
(s630 (/ 1.0 2.0))
(s631 (/ 1.0 2.0))
(s632 (/ 1.0 2.0))
(s633 (/ 1.0 2.0))
(s634 (/ 1.0 2.0))
(s635 (/ 1.0 2.0))
(s636 (/ 1.0 2.0))
(s637 (/ 1.0 2.0))
(s638 (/ 1.0 2.0))
(s639 (/ 1.0 2.0))
(s640 (/ 1.0 2.0))
(s641 (/ 1.0 2.0))
(s642 (/ 1.0 2.0))
(s643 (/ 1.0 2.0))
(s644 (/ 1.0 2.0))
(s645 (/ 1.0 2.0))
(s646 (/ 1.0 2.0))
(s647 (/ 1.0 2.0))
(s648 (/ 1.0 2.0))
(s649 (/ 1.0 2.0))
(s650 (/ 1.0 2.0))
(s651 (/ 1.0 2.0))
(s652 (/ 1.0 2.0))
(s653 (/ 1.0 2.0))
(s654 (/ 1.0 2.0))
(s655 (/ 1.0 2.0))
(s656 (/ 1.0 2.0))
(s657 (/ 1.0 2.0))
(s658 (/ 1.0 2.0))
(s659 (/ 1.0 2.0))
(s660 (/ 1.0 2.0))
(s661 (/ 1.0 2.0))
(s662 (/ 1.0 2.0))
(s663 (/ 1.0 2.0))
(s664 (/ 1.0 2.0))
(s670 (/ 1.0 2.0))
(s671 (/ 1.0 2.0))
(s672 (/ 1.0 2.0))
(s673 (/ 1.0 2.0))
(s674 (/ 1.0 2.0))
(s675 (/ 1.0 2.0))
(s676 (/ 1.0 2.0))
(s677 (/ 1.0 2.0))
(s678 (/ 1.0 2.0))
(s679 (/ 1.0 2.0))
(s680 (/ 1.0 2.0))
(s681 (/ 1.0 2.0))
(s713 (/ 1.0 2.0))
(s714 (/ 1.0 2.0))
(s715 (/ 1.0 2.0))
(s716 (/ 1.0 2.0))
(s717 (/ 1.0 2.0))
(s718 (/ 1.0 2.0))
(s750 (/ 1.0 2.0))
(s751 (/ 1.0 2.0))
(s752 (/ 1.0 2.0))
(s793 (/ 1.0 2.0))
(s794 (/ 1.0 2.0))
(s795 (/ 1.0 2.0))
(s796 (/ 1.0 2.0))
(s797 (/ 1.0 2.0))
(s798 (/ 1.0 2.0))
(s799 (/ 1.0 2.0))
(s800 (/ 1.0 2.0))
(s801 (/ 1.0 2.0))
(s802 (/ 1.0 2.0))
(s803 (/ 1.0 2.0))
(s804 (/ 1.0 2.0))
(s805 (/ 1.0 2.0))
(s806 (/ 1.0 2.0))
(s807 (/ 1.0 2.0))
(s841 (/ 1.0 2.0))
(s842 (/ 1.0 2.0))
(s843 (/ 1.0 2.0))
(s850 (/ 1.0 2.0))
(s851 (/ 1.0 2.0))
(s852 (/ 1.0 2.0))
(s856 (/ 1.0 2.0))
(s857 (/ 1.0 2.0))
(s858 (/ 1.0 2.0))
(s862 (/ 1.0 2.0))
(s863 (/ 1.0 2.0))
(s864 (/ 1.0 2.0))
(s879 (/ 1.0 2.0))
(s880 (/ 1.0 2.0))
(s881 (/ 1.0 2.0))
(s948 (/ 1.0 2.0))
(s949 (/ 1.0 2.0))
(s950 (/ 1.0 2.0))
(s951 (/ 1.0 2.0))
(s952 (/ 1.0 2.0))
(s953 (/ 1.0 2.0))
(s954 (/ 1.0 2.0))
(s955 (/ 1.0 2.0))
(s956 (/ 1.0 2.0))
(s957 (/ 1.0 2.0))
(s958 (/ 1.0 2.0))
(s959 (/ 1.0 2.0))
(s960 (/ 1.0 2.0))
(s961 (/ 1.0 2.0))
(s962 (/ 1.0 2.0))
(s963 (/ 1.0 2.0))
(s964 (/ 1.0 2.0))
(s965 (/ 1.0 2.0))
(s966 (/ 1.0 2.0))
(s967 (/ 1.0 2.0))
(s968 (/ 1.0 2.0))
(s969 (/ 1.0 2.0))
(s970 (/ 1.0 2.0))
(s971 (/ 1.0 2.0))
(s972 (/ 1.0 2.0))
(s973 (/ 1.0 2.0))
(s974 (/ 1.0 2.0))
(s976 (/ 1.0 2.0))
(s977 (/ 1.0 2.0))
(s990 (/ 1.0 2.0))
(s991 (/ 1.0 2.0))
(s992 (/ 1.0 2.0))
(s993 (/ 1.0 2.0))
(s994 (/ 1.0 2.0))
(s995 (/ 1.0 2.0))
(s996 (/ 1.0 2.0))
(s997 (/ 1.0 2.0))
(s998 (/ 1.0 2.0))
(s999 (/ 1.0 2.0))
(s1000 (/ 1.0 2.0))
(s1001 (/ 1.0 2.0))
(s1002 (/ 1.0 2.0))
(s1003 (/ 1.0 2.0))
(s1004 (/ 1.0 2.0))
(s1005 (/ 1.0 2.0))
(s1006 (/ 1.0 2.0))
(s1007 (/ 1.0 2.0))
(s1008 (/ 1.0 2.0))
(s1009 (/ 1.0 2.0))
(s1010 (/ 1.0 2.0))
(s1011 (/ 1.0 2.0))
(s1025 (/ 1.0 2.0))
(s1026 (/ 1.0 2.0))
(s1027 (/ 1.0 2.0))
(s1028 (/ 1.0 2.0))
(s1029 (/ 1.0 2.0))
(s1030 (/ 1.0 2.0))
(s1031 (/ 1.0 2.0))
(s1032 (/ 1.0 2.0))
(s1033 (/ 1.0 2.0))
(s1034 (/ 1.0 2.0))
(s1035 (/ 1.0 2.0))
(s1036 (/ 1.0 2.0))
(s1037 (/ 1.0 2.0))
(s1038 (/ 1.0 2.0))
(s1039 (/ 1.0 2.0))
(s1040 (/ 1.0 2.0))
(s1041 (/ 1.0 2.0))
(s1042 (/ 1.0 2.0))
(s1043 (/ 1.0 2.0))
(s1044 (/ 1.0 2.0))
(s1045 (/ 1.0 2.0))
(s1046 (/ 1.0 2.0))
(s1047 (/ 1.0 2.0))
(s1048 (/ 1.0 2.0))
(s1049 (/ 1.0 2.0))
(s1050 (/ 1.0 2.0))
(s1051 (/ 1.0 2.0))
(s1052 (/ 1.0 2.0))
(s1053 (/ 1.0 2.0))
(s1054 (/ 1.0 2.0))
(s1055 (/ 1.0 2.0))
(s1056 (/ 1.0 2.0))
(s1057 (/ 1.0 2.0))
(s1058 (/ 1.0 2.0))
(s1059 (/ 1.0 2.0))
(s1065 (/ 1.0 2.0))
(s1066 (/ 1.0 2.0))
(s1067 (/ 1.0 2.0))
(s1068 (/ 1.0 2.0))
(s1069 (/ 1.0 2.0))
(s1070 (/ 1.0 2.0))
(s1071 (/ 1.0 2.0))
(s1072 (/ 1.0 2.0))
(s1073 (/ 1.0 2.0))
(s1108 (/ 1.0 2.0))
(s1109 (/ 1.0 2.0))
(s1110 (/ 1.0 2.0))
(s1111 (/ 1.0 2.0))
(s1112 (/ 1.0 2.0))
(s1113 (/ 1.0 2.0))
(s1145 (/ 1.0 2.0))
(s1146 (/ 1.0 2.0))
(s1147 (/ 1.0 2.0))
(s1194 (/ 1.0 2.0))
(s1195 (/ 1.0 2.0))
(s1196 (/ 1.0 2.0))
(s1197 (/ 1.0 2.0))
(s1198 (/ 1.0 2.0))
(s1199 (/ 1.0 2.0))
(s1200 (/ 1.0 2.0))
(s1201 (/ 1.0 2.0))
(s1202 (/ 1.0 2.0))
(s1236 (/ 1.0 2.0))
(s1237 (/ 1.0 2.0))
(s1238 (/ 1.0 2.0))
(s1245 (/ 1.0 2.0))
(s1246 (/ 1.0 2.0))
(s1247 (/ 1.0 2.0))
(s1251 (/ 1.0 2.0))
(s1252 (/ 1.0 2.0))
(s1253 (/ 1.0 2.0))
(s1385 (/ 1.0 2.0))
(s1386 (/ 1.0 2.0))
(s1387 (/ 1.0 2.0))
(s1460 (/ 1.0 2.0))
(s1461 (/ 1.0 2.0))
(s1462 (/ 1.0 2.0))
(s1463 (/ 1.0 2.0))
(s1464 (/ 1.0 2.0))
(s1465 (/ 1.0 2.0))
(s1466 (/ 1.0 2.0))
(s1467 (/ 1.0 2.0))
(s1468 (/ 1.0 2.0))
(s1503 (/ 1.0 2.0))
(s1504 (/ 1.0 2.0))
(s1505 (/ 1.0 2.0))
(s1506 (/ 1.0 2.0))
(s1507 (/ 1.0 2.0))
(s1508 (/ 1.0 2.0))
(s1540 (/ 1.0 2.0))
(s1541 (/ 1.0 2.0))
(s1542 (/ 1.0 2.0))
(s1589 (/ 1.0 2.0))
(s1590 (/ 1.0 2.0))
(s1591 (/ 1.0 2.0))
(s1592 (/ 1.0 2.0))
(s1593 (/ 1.0 2.0))
(s1594 (/ 1.0 2.0))
(s1595 (/ 1.0 2.0))
(s1596 (/ 1.0 2.0))
(s1597 (/ 1.0 2.0))
(s1640 (/ 1.0 2.0))
(s1641 (/ 1.0 2.0))timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 638/638 constraints. Problems are: Problem set: 0 solved, 638 unsolved
SMT process timed out in 5567ms, After SMT, problems are : Problem set: 0 solved, 638 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 638 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 345 transitions
Trivial Post-agglo rules discarded 345 transitions
Performed 345 trivial Post agglomeration. Transition count delta: 345
Iterating post reduction 0 with 345 rules applied. Total rules applied 345 place count 2034 transition count 2222
Reduce places removed 345 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 367 rules applied. Total rules applied 712 place count 1689 transition count 2200
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 718 place count 1683 transition count 2200
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 309 Pre rules applied. Total rules applied 718 place count 1683 transition count 1891
Deduced a syphon composed of 309 places in 13 ms
Ensure Unique test removed 27 places
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 645 rules applied. Total rules applied 1363 place count 1347 transition count 1891
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 18 rules applied. Total rules applied 1381 place count 1344 transition count 1876
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1396 place count 1329 transition count 1876
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1396 place count 1329 transition count 1863
Deduced a syphon composed of 13 places in 11 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1435 place count 1303 transition count 1863
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1435 place count 1303 transition count 1850
Deduced a syphon composed of 13 places in 12 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 1461 place count 1290 transition count 1850
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 1497 place count 1254 transition count 1814
Iterating global reduction 5 with 36 rules applied. Total rules applied 1533 place count 1254 transition count 1814
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1534 place count 1254 transition count 1813
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1534 place count 1254 transition count 1805
Deduced a syphon composed of 8 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 17 rules applied. Total rules applied 1551 place count 1245 transition count 1805
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1551 place count 1245 transition count 1804
Deduced a syphon composed of 1 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1554 place count 1243 transition count 1804
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1556 place count 1241 transition count 1789
Iterating global reduction 6 with 2 rules applied. Total rules applied 1558 place count 1241 transition count 1789
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1559 place count 1240 transition count 1781
Iterating global reduction 6 with 1 rules applied. Total rules applied 1560 place count 1240 transition count 1781
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1561 place count 1239 transition count 1773
Iterating global reduction 6 with 1 rules applied. Total rules applied 1562 place count 1239 transition count 1773
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1563 place count 1238 transition count 1765
Iterating global reduction 6 with 1 rules applied. Total rules applied 1564 place count 1238 transition count 1765
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1565 place count 1237 transition count 1757
Iterating global reduction 6 with 1 rules applied. Total rules applied 1566 place count 1237 transition count 1757
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1567 place count 1236 transition count 1749
Iterating global reduction 6 with 1 rules applied. Total rules applied 1568 place count 1236 transition count 1749
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1569 place count 1235 transition count 1741
Iterating global reduction 6 with 1 rules applied. Total rules applied 1570 place count 1235 transition count 1741
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1571 place count 1234 transition count 1733
Iterating global reduction 6 with 1 rules applied. Total rules applied 1572 place count 1234 transition count 1733
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1573 place count 1233 transition count 1725
Iterating global reduction 6 with 1 rules applied. Total rules applied 1574 place count 1233 transition count 1725
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1575 place count 1232 transition count 1717
Iterating global reduction 6 with 1 rules applied. Total rules applied 1576 place count 1232 transition count 1717
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1577 place count 1231 transition count 1709
Iterating global reduction 6 with 1 rules applied. Total rules applied 1578 place count 1231 transition count 1709
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1579 place count 1230 transition count 1701
Iterating global reduction 6 with 1 rules applied. Total rules applied 1580 place count 1230 transition count 1701
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1581 place count 1229 transition count 1693
Iterating global reduction 6 with 1 rules applied. Total rules applied 1582 place count 1229 transition count 1693
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1583 place count 1228 transition count 1685
Iterating global reduction 6 with 1 rules applied. Total rules applied 1584 place count 1228 transition count 1685
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1585 place count 1227 transition count 1677
Iterating global reduction 6 with 1 rules applied. Total rules applied 1586 place count 1227 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1587 place count 1226 transition count 1669
Iterating global reduction 6 with 1 rules applied. Total rules applied 1588 place count 1226 transition count 1669
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1589 place count 1225 transition count 1661
Iterating global reduction 6 with 1 rules applied. Total rules applied 1590 place count 1225 transition count 1661
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 3 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 6 with 196 rules applied. Total rules applied 1786 place count 1127 transition count 1563
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1788 place count 1126 transition count 1572
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1794 place count 1126 transition count 1566
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1800 place count 1120 transition count 1566
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1802 place count 1120 transition count 1564
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1804 place count 1118 transition count 1564
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1805 place count 1117 transition count 1563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1806 place count 1116 transition count 1563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1806 place count 1116 transition count 1562
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1808 place count 1115 transition count 1562
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 1809 place count 1114 transition count 1562
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1811 place count 1113 transition count 1561
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1812 place count 1112 transition count 1560
Iterating global reduction 10 with 1 rules applied. Total rules applied 1813 place count 1112 transition count 1560
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1814 place count 1112 transition count 1559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1815 place count 1111 transition count 1559
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1816 place count 1111 transition count 1559
Applied a total of 1816 rules in 1272 ms. Remains 1111 /2034 variables (removed 923) and now considering 1559/2567 (removed 1008) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1282 ms. Remains : 1111/2034 places, 1559/2567 transitions.
RANDOM walk for 3427604 steps (42368 resets) in 115894 ms. (29 steps per ms) remains 400/638 properties
BEST_FIRST walk for 40002 steps (110 resets) in 240 ms. (165 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (106 resets) in 274 ms. (145 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (100 resets) in 432 ms. (92 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (109 resets) in 319 ms. (125 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (109 resets) in 417 ms. (95 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (99 resets) in 406 ms. (98 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40001 steps (105 resets) in 239 ms. (166 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (104 resets) in 244 ms. (163 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (106 resets) in 230 ms. (173 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (103 resets) in 252 ms. (158 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (99 resets) in 237 ms. (168 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (107 resets) in 236 ms. (168 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40001 steps (101 resets) in 250 ms. (159 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (110 resets) in 233 ms. (170 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (107 resets) in 242 ms. (164 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (105 resets) in 241 ms. (165 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (107 resets) in 241 ms. (165 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (107 resets) in 227 ms. (175 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (104 resets) in 252 ms. (158 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (110 resets) in 230 ms. (173 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (104 resets) in 239 ms. (166 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (96 resets) in 340 ms. (117 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (106 resets) in 343 ms. (116 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (113 resets) in 323 ms. (123 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (113 resets) in 364 ms. (109 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (108 resets) in 327 ms. (121 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (103 resets) in 290 ms. (137 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (98 resets) in 276 ms. (144 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (105 resets) in 244 ms. (163 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (107 resets) in 226 ms. (176 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (109 resets) in 242 ms. (164 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (110 resets) in 235 ms. (169 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (110 resets) in 233 ms. (170 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (109 resets) in 229 ms. (173 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (111 resets) in 211 ms. (188 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (107 resets) in 230 ms. (173 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (101 resets) in 247 ms. (161 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (107 resets) in 384 ms. (103 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (101 resets) in 247 ms. (161 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (112 resets) in 234 ms. (170 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (109 resets) in 231 ms. (172 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (95 resets) in 255 ms. (156 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (110 resets) in 257 ms. (155 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (103 resets) in 476 ms. (83 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (109 resets) in 298 ms. (133 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (110 resets) in 337 ms. (118 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (108 resets) in 339 ms. (117 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (107 resets) in 351 ms. (113 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (106 resets) in 331 ms. (120 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (108 resets) in 315 ms. (126 steps per ms) remains 400/400 properties
// Phase 1: matrix 1559 rows 1111 cols
[2025-05-29 19:03:06] [INFO ] Computed 152 invariants in 72 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 25/425 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 272/697 variables, 35/72 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 45/742 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (OVERLAPS) 1/743 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/743 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 11 (OVERLAPS) 179/922 variables, 26/108 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/922 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 13 (OVERLAPS) 76/998 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 400 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 998/2670 variables, and 119 constraints, problems are : Problem set: 0 solved, 400 unsolved in 45041 ms.
Refiners :[Positive P Invariants (semi-flows): 43/45 constraints, Generalized P Invariants (flows): 76/107 constraints, State Equation: 0/1111 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 25/425 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 272/697 variables, 35/72 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:04:00] [INFO ] Deduced a trap composed of 70 places in 230 ms of which 33 ms to minimize.
[2025-05-29 19:04:00] [INFO ] Deduced a trap composed of 36 places in 313 ms of which 4 ms to minimize.
[2025-05-29 19:04:01] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2025-05-29 19:04:01] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 1 ms to minimize.
[2025-05-29 19:04:02] [INFO ] Deduced a trap composed of 100 places in 239 ms of which 2 ms to minimize.
[2025-05-29 19:04:03] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 15 ms to minimize.
[2025-05-29 19:04:03] [INFO ] Deduced a trap composed of 47 places in 344 ms of which 3 ms to minimize.
[2025-05-29 19:04:05] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 2 ms to minimize.
[2025-05-29 19:04:05] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2025-05-29 19:04:07] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 3 ms to minimize.
[2025-05-29 19:04:08] [INFO ] Deduced a trap composed of 79 places in 242 ms of which 3 ms to minimize.
[2025-05-29 19:04:09] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2025-05-29 19:04:09] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2025-05-29 19:04:10] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:04:16] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-05-29 19:04:25] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/697 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/2670 variables, and 88 constraints, problems are : Problem set: 0 solved, 400 unsolved in 45022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/45 constraints, Generalized P Invariants (flows): 50/107 constraints, State Equation: 0/1111 constraints, PredecessorRefiner: 0/400 constraints, Known Traps: 16/16 constraints]
After SMT, in 90332ms problems are : Problem set: 0 solved, 400 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 400 out of 1111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1111/1111 places, 1559/1559 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 1111 transition count 1512
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 1064 transition count 1512
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 94 place count 1064 transition count 1456
Deduced a syphon composed of 56 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 115 rules applied. Total rules applied 209 place count 1005 transition count 1456
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 212 place count 1005 transition count 1453
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 215 place count 1002 transition count 1453
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 216 place count 1001 transition count 1452
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 1001 transition count 1452
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 15 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 265 place count 976 transition count 1429
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 4 with 1 rules applied. Total rules applied 266 place count 976 transition count 1428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 267 place count 975 transition count 1428
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 267 place count 975 transition count 1425
Deduced a syphon composed of 3 places in 18 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 273 place count 972 transition count 1425
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 274 place count 971 transition count 1425
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 275 place count 970 transition count 1419
Iterating global reduction 7 with 1 rules applied. Total rules applied 276 place count 970 transition count 1419
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 277 place count 969 transition count 1419
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 283 place count 966 transition count 1416
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 285 place count 964 transition count 1414
Iterating global reduction 8 with 2 rules applied. Total rules applied 287 place count 964 transition count 1414
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 288 place count 963 transition count 1413
Iterating global reduction 8 with 1 rules applied. Total rules applied 289 place count 963 transition count 1413
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 290 place count 963 transition count 1412
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 292 place count 963 transition count 1410
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 294 place count 961 transition count 1410
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 295 place count 961 transition count 1410
Applied a total of 295 rules in 495 ms. Remains 961 /1111 variables (removed 150) and now considering 1410/1559 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 508 ms. Remains : 961/1111 places, 1410/1559 transitions.
RANDOM walk for 3420107 steps (43304 resets) in 120004 ms. (28 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (109 resets) in 299 ms. (133 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (118 resets) in 277 ms. (143 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (112 resets) in 366 ms. (109 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (109 resets) in 370 ms. (107 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (114 resets) in 405 ms. (98 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (114 resets) in 394 ms. (101 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (111 resets) in 424 ms. (94 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (107 resets) in 439 ms. (90 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (118 resets) in 350 ms. (113 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (110 resets) in 326 ms. (122 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (101 resets) in 372 ms. (107 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (107 resets) in 556 ms. (71 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (119 resets) in 338 ms. (118 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (120 resets) in 446 ms. (89 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (105 resets) in 401 ms. (99 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (107 resets) in 437 ms. (91 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (110 resets) in 430 ms. (92 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (106 resets) in 374 ms. (106 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (119 resets) in 376 ms. (106 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (114 resets) in 347 ms. (114 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (118 resets) in 422 ms. (94 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40001 steps (107 resets) in 587 ms. (68 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (115 resets) in 475 ms. (84 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (112 resets) in 386 ms. (103 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (115 resets) in 333 ms. (119 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (120 resets) in 508 ms. (78 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (107 resets) in 451 ms. (88 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (113 resets) in 504 ms. (79 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (109 resets) in 341 ms. (116 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (113 resets) in 499 ms. (80 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (109 resets) in 338 ms. (118 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (106 resets) in 497 ms. (80 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (110 resets) in 366 ms. (109 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (117 resets) in 470 ms. (84 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (114 resets) in 680 ms. (58 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (106 resets) in 423 ms. (94 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (118 resets) in 365 ms. (109 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (104 resets) in 386 ms. (103 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (109 resets) in 470 ms. (84 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (109 resets) in 352 ms. (113 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (108 resets) in 381 ms. (104 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (123 resets) in 326 ms. (122 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (112 resets) in 354 ms. (112 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (113 resets) in 371 ms. (107 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (114 resets) in 378 ms. (105 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (117 resets) in 331 ms. (120 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (107 resets) in 406 ms. (98 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40003 steps (118 resets) in 303 ms. (131 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40002 steps (105 resets) in 604 ms. (66 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (109 resets) in 328 ms. (121 steps per ms) remains 400/400 properties
Interrupted probabilistic random walk after 5880014 steps, run timeout after 108001 ms. (steps per millisecond=54 ) properties seen :179 out of 400
Probabilistic random walk after 5880014 steps, saw 1528985 distinct states, run finished after 108008 ms. (steps per millisecond=54 ) properties seen :179
// Phase 1: matrix 1410 rows 961 cols
[2025-05-29 19:07:02] [INFO ] Computed 145 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 35/256 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 225/481 variables, 27/54 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 64/545 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/546 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 125/671 variables, 22/85 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/671 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (OVERLAPS) 28/699 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/699 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 15 (OVERLAPS) 2/701 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/701 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 17 (OVERLAPS) 92/793 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/793 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 19 (OVERLAPS) 60/853 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/853 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 21 (OVERLAPS) 8/861 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/861 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 23 (OVERLAPS) 98/959 variables, 29/143 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/959 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 25 (OVERLAPS) 1/960 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/960 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 27 (OVERLAPS) 1/961 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/961 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 29 (OVERLAPS) 1410/2371 variables, 961/1106 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2371 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 31 (OVERLAPS) 0/2371 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2371/2371 variables, and 1106 constraints, problems are : Problem set: 0 solved, 221 unsolved in 67427 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 961/961 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 35/256 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 225/481 variables, 27/54 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2025-05-29 19:08:12] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 2 ms to minimize.
[2025-05-29 19:08:12] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2025-05-29 19:08:12] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 3 ms to minimize.
[2025-05-29 19:08:13] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2025-05-29 19:08:13] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2025-05-29 19:08:13] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 2 ms to minimize.
[2025-05-29 19:08:14] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 2 ms to minimize.
[2025-05-29 19:08:14] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2025-05-29 19:08:15] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2025-05-29 19:08:16] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2025-05-29 19:08:17] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2025-05-29 19:08:21] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 64/545 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 1/546 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2025-05-29 19:08:31] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/546 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2025-05-29 19:08:36] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/546 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/546 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 16 (OVERLAPS) 125/671 variables, 22/99 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/671 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 18 (OVERLAPS) 28/699 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/699 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 20 (OVERLAPS) 2/701 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/701 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 22 (OVERLAPS) 92/793 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/793 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 24 (OVERLAPS) 60/853 variables, 8/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/853 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 26 (OVERLAPS) 8/861 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/861 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 28 (OVERLAPS) 98/959 variables, 29/157 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/959 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 221 unsolved
SMT process timed out in 142533ms, After SMT, problems are : Problem set: 0 solved, 221 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 221 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 1410/1410 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 961 transition count 1366
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 917 transition count 1366
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 88 place count 917 transition count 1321
Deduced a syphon composed of 45 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 183 place count 867 transition count 1321
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 186 place count 867 transition count 1318
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 189 place count 864 transition count 1318
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 189 place count 864 transition count 1316
Deduced a syphon composed of 2 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 195 place count 860 transition count 1316
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 195 place count 860 transition count 1314
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 199 place count 858 transition count 1314
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 200 place count 857 transition count 1313
Iterating global reduction 4 with 1 rules applied. Total rules applied 201 place count 857 transition count 1313
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 219 place count 847 transition count 1305
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 219 place count 847 transition count 1301
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 227 place count 843 transition count 1301
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 229 place count 841 transition count 1301
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 230 place count 840 transition count 1295
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 840 transition count 1295
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 239 place count 836 transition count 1291
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 240 place count 835 transition count 1290
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 835 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 242 place count 834 transition count 1289
Iterating global reduction 5 with 1 rules applied. Total rules applied 243 place count 834 transition count 1289
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 244 place count 834 transition count 1288
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 245 place count 834 transition count 1287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 246 place count 833 transition count 1287
Applied a total of 246 rules in 187 ms. Remains 833 /961 variables (removed 128) and now considering 1287/1410 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 833/961 places, 1287/1410 transitions.
RANDOM walk for 4000000 steps (52919 resets) in 72656 ms. (55 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (122 resets) in 206 ms. (193 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (119 resets) in 340 ms. (117 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (119 resets) in 207 ms. (192 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (124 resets) in 252 ms. (158 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (122 resets) in 277 ms. (143 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (122 resets) in 206 ms. (193 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (124 resets) in 309 ms. (129 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40001 steps (120 resets) in 290 ms. (137 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (123 resets) in 212 ms. (187 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (119 resets) in 323 ms. (123 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40001 steps (123 resets) in 327 ms. (121 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (121 resets) in 223 ms. (178 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (120 resets) in 218 ms. (182 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (118 resets) in 202 ms. (197 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (117 resets) in 326 ms. (122 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (118 resets) in 205 ms. (194 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (115 resets) in 308 ms. (129 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (113 resets) in 204 ms. (195 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (119 resets) in 218 ms. (182 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (120 resets) in 213 ms. (186 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (111 resets) in 299 ms. (133 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (113 resets) in 192 ms. (207 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (121 resets) in 327 ms. (121 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (119 resets) in 219 ms. (181 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (118 resets) in 316 ms. (126 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (112 resets) in 254 ms. (156 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (120 resets) in 321 ms. (124 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (124 resets) in 326 ms. (122 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (121 resets) in 240 ms. (165 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (119 resets) in 303 ms. (131 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (125 resets) in 234 ms. (170 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (118 resets) in 359 ms. (111 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (121 resets) in 262 ms. (152 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (115 resets) in 204 ms. (195 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (116 resets) in 231 ms. (172 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (115 resets) in 266 ms. (149 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (122 resets) in 272 ms. (146 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (118 resets) in 261 ms. (152 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (115 resets) in 281 ms. (141 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (116 resets) in 248 ms. (160 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (122 resets) in 244 ms. (163 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (120 resets) in 239 ms. (166 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40001 steps (120 resets) in 288 ms. (138 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (116 resets) in 254 ms. (156 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40002 steps (113 resets) in 389 ms. (102 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (121 resets) in 252 ms. (158 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (119 resets) in 261 ms. (152 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (117 resets) in 268 ms. (148 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40004 steps (124 resets) in 350 ms. (113 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (115 resets) in 358 ms. (111 steps per ms) remains 221/221 properties
Interrupted probabilistic random walk after 7138468 steps, run timeout after 78001 ms. (steps per millisecond=91 ) properties seen :198 out of 221
Probabilistic random walk after 7138468 steps, saw 1238493 distinct states, run finished after 78001 ms. (steps per millisecond=91 ) properties seen :198
// Phase 1: matrix 1287 rows 833 cols
[2025-05-29 19:11:09] [INFO ] Computed 134 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 21/44 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 190/234 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 49/283 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 2/285 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 240/525 variables, 35/70 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 33/558 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 2/560 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/560 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (OVERLAPS) 100/660 variables, 16/97 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/660 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (OVERLAPS) 5/665 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (OVERLAPS) 70/735 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/735 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (OVERLAPS) 44/779 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/779 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (OVERLAPS) 52/831 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/831 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 26 (OVERLAPS) 1/832 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/832 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 28 (OVERLAPS) 1/833 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/833 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 30 (OVERLAPS) 1287/2120 variables, 833/967 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2120 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 32 (OVERLAPS) 0/2120 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2120/2120 variables, and 967 constraints, problems are : Problem set: 0 solved, 23 unsolved in 4758 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 833/833 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 21/44 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 190/234 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2025-05-29 19:11:14] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 49/283 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 2/285 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 240/525 variables, 35/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 33/558 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/558 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 2/560 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (OVERLAPS) 100/660 variables, 16/98 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/660 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (OVERLAPS) 5/665 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (OVERLAPS) 70/735 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/735 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 23 (OVERLAPS) 44/779 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/779 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 25 (OVERLAPS) 52/831 variables, 21/133 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/831 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 27 (OVERLAPS) 1/832 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/832 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 29 (OVERLAPS) 1/833 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/833 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 31 (OVERLAPS) 1287/2120 variables, 833/968 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2120 variables, 23/991 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2025-05-29 19:11:20] [INFO ] Deduced a trap composed of 56 places in 157 ms of which 3 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/2120 variables, 1/992 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2120 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 35 (OVERLAPS) 0/2120 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2120/2120 variables, and 992 constraints, problems are : Problem set: 0 solved, 23 unsolved in 9617 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 833/833 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 2/2 constraints]
After SMT, in 14406ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 4811 ms.
Support contains 23 out of 833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 833/833 places, 1287/1287 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 833 transition count 1256
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 802 transition count 1256
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 62 place count 802 transition count 1203
Deduced a syphon composed of 53 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 174 place count 743 transition count 1203
Discarding 1 places :
Implicit places reduction removed 1 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 2 with 6 rules applied. Total rules applied 180 place count 742 transition count 1198
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 185 place count 737 transition count 1198
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 185 place count 737 transition count 1197
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 188 place count 735 transition count 1197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 188 place count 735 transition count 1196
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 190 place count 734 transition count 1196
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 194 place count 730 transition count 1192
Iterating global reduction 4 with 4 rules applied. Total rules applied 198 place count 730 transition count 1192
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 238 place count 709 transition count 1173
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 4 with 1 rules applied. Total rules applied 239 place count 709 transition count 1172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 240 place count 708 transition count 1172
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 240 place count 708 transition count 1169
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 7 rules applied. Total rules applied 247 place count 704 transition count 1169
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 249 place count 702 transition count 1169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 249 place count 702 transition count 1168
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 251 place count 701 transition count 1168
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 253 place count 699 transition count 1161
Ensure Unique test removed 1 places
Iterating global reduction 7 with 3 rules applied. Total rules applied 256 place count 698 transition count 1161
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 257 place count 697 transition count 1161
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 258 place count 696 transition count 1160
Iterating global reduction 8 with 1 rules applied. Total rules applied 259 place count 696 transition count 1160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 261 place count 696 transition count 1158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 262 place count 695 transition count 1158
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 270 place count 691 transition count 1154
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 272 place count 689 transition count 1152
Iterating global reduction 10 with 2 rules applied. Total rules applied 274 place count 689 transition count 1152
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 275 place count 688 transition count 1151
Iterating global reduction 10 with 1 rules applied. Total rules applied 276 place count 688 transition count 1151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 277 place count 688 transition count 1150
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 278 place count 688 transition count 1149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 279 place count 687 transition count 1149
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 280 place count 687 transition count 1148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 281 place count 686 transition count 1148
Applied a total of 281 rules in 183 ms. Remains 686 /833 variables (removed 147) and now considering 1148/1287 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 686/833 places, 1148/1287 transitions.
RANDOM walk for 4000000 steps (51744 resets) in 44550 ms. (89 steps per ms) remains 13/23 properties
BEST_FIRST walk for 4000004 steps (11802 resets) in 11751 ms. (340 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (11802 resets) in 10503 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (11806 resets) in 11327 ms. (353 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (11874 resets) in 10244 ms. (390 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (11790 resets) in 11179 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (11807 resets) in 10273 ms. (389 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (11885 resets) in 11262 ms. (355 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (11769 resets) in 10828 ms. (369 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (11825 resets) in 11265 ms. (355 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (11830 resets) in 10845 ms. (368 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (11808 resets) in 11550 ms. (346 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (11808 resets) in 11025 ms. (362 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (11851 resets) in 11481 ms. (348 steps per ms) remains 13/13 properties
// Phase 1: matrix 1148 rows 686 cols
[2025-05-29 19:12:32] [INFO ] Computed 119 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 3/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 113/129 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 151/299 variables, 31/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 25/324 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 2/326 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 80/406 variables, 13/68 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 17/423 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 113/536 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/536 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 73/609 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/609 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 2/611 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/611 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 73/684 variables, 24/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/684 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (OVERLAPS) 1/685 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/685 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (OVERLAPS) 1/686 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/686 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (OVERLAPS) 1148/1834 variables, 686/805 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1834 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (OVERLAPS) 0/1834 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1834/1834 variables, and 805 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2344 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 686/686 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 3/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 113/129 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 151/299 variables, 31/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 25/324 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 2/326 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 80/406 variables, 13/68 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 17/423 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 113/536 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/536 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 73/609 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/609 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 2/611 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/611 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 73/684 variables, 24/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/684 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (OVERLAPS) 1/685 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/685 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (OVERLAPS) 1/686 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/686 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (OVERLAPS) 1148/1834 variables, 686/805 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1834 variables, 13/818 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1834 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (OVERLAPS) 0/1834 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1834/1834 variables, and 818 constraints, problems are : Problem set: 0 solved, 13 unsolved in 4217 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 686/686 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 6585ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 20269 ms.
Support contains 13 out of 686 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 686/686 places, 1148/1148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 686 transition count 1147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 685 transition count 1147
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 685 transition count 1144
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 9 place count 681 transition count 1144
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 10 place count 681 transition count 1143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 680 transition count 1143
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 4 with 2 rules applied. Total rules applied 13 place count 679 transition count 1142
Applied a total of 13 rules in 52 ms. Remains 679 /686 variables (removed 7) and now considering 1142/1148 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 679/686 places, 1142/1148 transitions.
RANDOM walk for 4000000 steps (51608 resets) in 32278 ms. (123 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (11808 resets) in 11077 ms. (361 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (11770 resets) in 10989 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (11813 resets) in 10889 ms. (367 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (11831 resets) in 10219 ms. (391 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (11768 resets) in 11006 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (11862 resets) in 11377 ms. (351 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (11823 resets) in 10830 ms. (369 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (11799 resets) in 11369 ms. (351 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (11803 resets) in 10770 ms. (371 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (11867 resets) in 10771 ms. (371 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (11770 resets) in 11341 ms. (352 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (11837 resets) in 12659 ms. (315 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (11765 resets) in 13304 ms. (300 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 14829839 steps, run timeout after 174001 ms. (steps per millisecond=85 ) properties seen :0 out of 13
Probabilistic random walk after 14829839 steps, saw 3516732 distinct states, run finished after 174002 ms. (steps per millisecond=85 ) properties seen :0
// Phase 1: matrix 1142 rows 679 cols
[2025-05-29 19:16:52] [INFO ] Computed 118 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 3/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 110/126 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 17/143 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 149/292 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 25/317 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 2/319 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 82/401 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 39/440 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 2/442 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/442 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 122/564 variables, 13/87 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 46/610 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/610 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 67/677 variables, 23/116 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/677 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (OVERLAPS) 1/678 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/678 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (OVERLAPS) 1/679 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/679 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (OVERLAPS) 1142/1821 variables, 679/797 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1821 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (OVERLAPS) 0/1821 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1821/1821 variables, and 797 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2078 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 679/679 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 3/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 110/126 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 17/143 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 149/292 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 25/317 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 2/319 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 82/401 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 39/440 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 2/442 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/442 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 122/564 variables, 13/87 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 46/610 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/610 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 67/677 variables, 23/116 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/677 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (OVERLAPS) 1/678 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/678 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (OVERLAPS) 1/679 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/679 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (OVERLAPS) 1142/1821 variables, 679/797 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1821 variables, 13/810 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1821 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (OVERLAPS) 0/1821 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1821/1821 variables, and 810 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3559 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 679/679 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 5672ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 13669 ms.
Support contains 13 out of 679 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 679/679 places, 1142/1142 transitions.
Applied a total of 0 rules in 17 ms. Remains 679 /679 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 679/679 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 679/679 places, 1142/1142 transitions.
Applied a total of 0 rules in 16 ms. Remains 679 /679 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2025-05-29 19:17:11] [INFO ] Invariant cache hit.
[2025-05-29 19:17:12] [INFO ] Implicit Places using invariants in 460 ms returned [0, 18, 19, 31, 49, 67, 86, 136, 145, 146, 147, 165, 183, 267, 268, 283, 284, 285, 303, 321, 341, 390, 391, 402, 403, 405, 422, 440, 460, 509, 510, 513, 524, 525, 526, 544, 546, 550, 568, 569, 570, 571, 583, 589, 595, 601, 607, 613, 619, 625, 631, 637, 643]
[2025-05-29 19:17:12] [INFO ] Actually due to overlaps returned [544, 526, 49, 165, 303, 422, 550, 147, 285, 405, 31, 146, 284, 402, 524, 568, 145, 283, 403, 525, 546, 569, 0, 19, 267, 268, 390, 391, 509, 510, 183, 570, 613, 631, 643, 18, 67, 86, 321, 341, 440, 460, 513, 571, 583, 589, 595, 601, 607, 619, 625, 637]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 470 ms to find 52 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 627/679 places, 1142/1142 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 627 transition count 1056
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 173 place count 541 transition count 1055
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 173 place count 541 transition count 1032
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 220 place count 517 transition count 1032
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 232 place count 513 transition count 1024
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 240 place count 505 transition count 1024
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 255 place count 490 transition count 1009
Iterating global reduction 4 with 15 rules applied. Total rules applied 270 place count 490 transition count 1009
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 273 place count 490 transition count 1006
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 273 place count 490 transition count 1005
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 275 place count 489 transition count 1005
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 278 place count 486 transition count 999
Iterating global reduction 5 with 3 rules applied. Total rules applied 281 place count 486 transition count 999
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 282 place count 485 transition count 998
Iterating global reduction 5 with 1 rules applied. Total rules applied 283 place count 485 transition count 998
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 284 place count 484 transition count 996
Iterating global reduction 5 with 1 rules applied. Total rules applied 285 place count 484 transition count 996
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 361 place count 446 transition count 958
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 363 place count 446 transition count 956
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 367 place count 444 transition count 957
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 380 place count 444 transition count 944
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 394 place count 430 transition count 944
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 406 place count 430 transition count 944
Applied a total of 406 rules in 140 ms. Remains 430 /627 variables (removed 197) and now considering 944/1142 (removed 198) transitions.
// Phase 1: matrix 944 rows 430 cols
[2025-05-29 19:17:12] [INFO ] Computed 60 invariants in 10 ms
[2025-05-29 19:17:12] [INFO ] Implicit Places using invariants in 280 ms returned [88, 94, 97, 99, 100, 103, 104, 180, 186, 189, 191, 201, 202, 272, 278, 281, 283, 288, 289, 355, 361, 364, 366]
[2025-05-29 19:17:12] [INFO ] Actually due to overlaps returned [103, 201, 288, 104, 202, 289, 88, 94, 99, 180, 186, 191, 272, 278, 283, 355, 361, 366, 100]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 284 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 411/679 places, 944/1142 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 395 transition count 928
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 395 transition count 928
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 391 transition count 924
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 391 transition count 924
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 387 transition count 920
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 387 transition count 908
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 72 place count 375 transition count 908
Applied a total of 72 rules in 47 ms. Remains 375 /411 variables (removed 36) and now considering 908/944 (removed 36) transitions.
// Phase 1: matrix 908 rows 375 cols
[2025-05-29 19:17:12] [INFO ] Computed 41 invariants in 6 ms
[2025-05-29 19:17:12] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-05-29 19:17:12] [INFO ] Invariant cache hit.
[2025-05-29 19:17:13] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 375/679 places, 908/1142 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1815 ms. Remains : 375/679 places, 908/1142 transitions.
RANDOM walk for 4000000 steps (78450 resets) in 25780 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (21191 resets) in 10187 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (21195 resets) in 9324 ms. (428 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (21118 resets) in 9263 ms. (431 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (21166 resets) in 9593 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (21253 resets) in 10163 ms. (393 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (21137 resets) in 8651 ms. (462 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (21301 resets) in 10098 ms. (396 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (21120 resets) in 8796 ms. (454 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000001 steps (21052 resets) in 9373 ms. (426 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000001 steps (21173 resets) in 9179 ms. (435 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (21235 resets) in 9910 ms. (403 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (21002 resets) in 8615 ms. (464 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (21090 resets) in 10730 ms. (372 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 21555934 steps, run timeout after 147008 ms. (steps per millisecond=146 ) properties seen :11 out of 13
Probabilistic random walk after 21555934 steps, saw 6144973 distinct states, run finished after 147008 ms. (steps per millisecond=146 ) properties seen :11
[2025-05-29 19:20:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 105/191 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/202 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 13/215 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 27/242 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 98/340 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/340 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 22/362 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/362 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 13/375 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/375 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 908/1283 variables, 375/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1283 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1283 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1283/1283 variables, and 416 constraints, problems are : Problem set: 0 solved, 2 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 105/191 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/202 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 13/215 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 27/242 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 98/340 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/340 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 22/362 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/362 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 13/375 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/375 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 908/1283 variables, 375/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1283 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1283 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1283 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1283/1283 variables, and 418 constraints, problems are : Problem set: 0 solved, 2 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 864ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1413 ms.
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 908/908 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 375 transition count 905
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 372 transition count 905
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 372 transition count 902
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 13 place count 368 transition count 902
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 14 place count 368 transition count 901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 367 transition count 901
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 16 place count 366 transition count 900
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 366 transition count 900
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 18 place count 366 transition count 899
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 23 place count 363 transition count 897
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 23 place count 363 transition count 896
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 25 place count 362 transition count 896
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 26 place count 361 transition count 896
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 28 place count 360 transition count 895
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 29 place count 360 transition count 894
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 31 place count 359 transition count 893
Applied a total of 31 rules in 51 ms. Remains 359 /375 variables (removed 16) and now considering 893/908 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 359/375 places, 893/908 transitions.
RANDOM walk for 4000000 steps (78601 resets) in 16881 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (21779 resets) in 6112 ms. (654 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (21643 resets) in 5860 ms. (682 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3210181 steps, run timeout after 27001 ms. (steps per millisecond=118 ) properties seen :0 out of 2
Probabilistic random walk after 3210181 steps, saw 1336983 distinct states, run finished after 27001 ms. (steps per millisecond=118 ) properties seen :0
// Phase 1: matrix 893 rows 359 cols
[2025-05-29 19:21:08] [INFO ] Computed 38 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 76/83 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 90/174 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/178 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 98/276 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 48/324 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 35/359 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 893/1252 variables, 359/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1252 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1252 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1252/1252 variables, and 397 constraints, problems are : Problem set: 0 solved, 2 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 76/83 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 90/174 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/178 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 98/276 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 48/324 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 35/359 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 893/1252 variables, 359/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1252 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1252 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1252 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1252/1252 variables, and 399 constraints, problems are : Problem set: 0 solved, 2 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 901ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 562 ms.
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 893/893 transitions.
Applied a total of 0 rules in 9 ms. Remains 359 /359 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 359/359 places, 893/893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 893/893 transitions.
Applied a total of 0 rules in 9 ms. Remains 359 /359 variables (removed 0) and now considering 893/893 (removed 0) transitions.
[2025-05-29 19:21:10] [INFO ] Invariant cache hit.
[2025-05-29 19:21:10] [INFO ] Implicit Places using invariants in 212 ms returned [141]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 216 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 358/359 places, 893/893 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 357 transition count 892
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 357 transition count 891
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 356 transition count 891
Applied a total of 4 rules in 24 ms. Remains 356 /358 variables (removed 2) and now considering 891/893 (removed 2) transitions.
// Phase 1: matrix 891 rows 356 cols
[2025-05-29 19:21:10] [INFO ] Computed 37 invariants in 8 ms
[2025-05-29 19:21:10] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-05-29 19:21:10] [INFO ] Invariant cache hit.
[2025-05-29 19:21:11] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 356/359 places, 891/893 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1072 ms. Remains : 356/359 places, 891/893 transitions.
RANDOM walk for 4000000 steps (78752 resets) in 16150 ms. (247 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (21712 resets) in 6043 ms. (661 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (21799 resets) in 5648 ms. (708 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3953146 steps, run timeout after 27001 ms. (steps per millisecond=146 ) properties seen :0 out of 2
Probabilistic random walk after 3953146 steps, saw 1332247 distinct states, run finished after 27001 ms. (steps per millisecond=146 ) properties seen :0
[2025-05-29 19:21:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/102 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/117 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 156/273 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 48/321 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 35/356 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 891/1247 variables, 356/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1247 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1247 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1247/1247 variables, and 393 constraints, problems are : Problem set: 0 solved, 2 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/102 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/117 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 156/273 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 48/321 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 35/356 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 891/1247 variables, 356/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1247 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1247 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1247 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1247/1247 variables, and 395 constraints, problems are : Problem set: 0 solved, 2 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 796ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 775 ms.
Support contains 2 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 891/891 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 356/356 places, 891/891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 891/891 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 891/891 (removed 0) transitions.
[2025-05-29 19:21:49] [INFO ] Invariant cache hit.
[2025-05-29 19:21:49] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-05-29 19:21:49] [INFO ] Invariant cache hit.
[2025-05-29 19:21:50] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
[2025-05-29 19:21:50] [INFO ] Redundant transitions in 52 ms returned []
Running 866 sub problems to find dead transitions.
[2025-05-29 19:21:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 866 unsolved
[2025-05-29 19:22:10] [INFO ] Deduced a trap composed of 83 places in 185 ms of which 2 ms to minimize.
[2025-05-29 19:22:14] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 3 ms to minimize.
[2025-05-29 19:22:16] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 3 ms to minimize.
[2025-05-29 19:22:19] [INFO ] Deduced a trap composed of 61 places in 177 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/1247 variables, and 41 constraints, problems are : Problem set: 0 solved, 866 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/356 constraints, PredecessorRefiner: 866/866 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 866 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 866 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 7 (OVERLAPS) 891/1247 variables, 356/397 constraints. Problems are: Problem set: 55 solved, 811 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1247/1247 variables, and 1208 constraints, problems are : Problem set: 55 solved, 811 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 811/866 constraints, Known Traps: 4/4 constraints]
After SMT, in 61040ms problems are : Problem set: 55 solved, 811 unsolved
Search for dead transitions found 55 dead transitions in 61055ms
Found 55 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 55 transitions
Dead transitions reduction (with SMT) removed 55 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 356/356 places, 836/891 transitions.
Applied a total of 0 rules in 7 ms. Remains 356 /356 variables (removed 0) and now considering 836/836 (removed 0) transitions.
[2025-05-29 19:22:51] [INFO ] Redundant transitions in 55 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62116 ms. Remains : 356/356 places, 836/891 transitions.
RANDOM walk for 4000000 steps (78965 resets) in 13383 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (21653 resets) in 5579 ms. (716 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (21718 resets) in 6050 ms. (661 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3775846 steps, run timeout after 24001 ms. (steps per millisecond=157 ) properties seen :0 out of 2
Probabilistic random walk after 3775846 steps, saw 1289934 distinct states, run finished after 24001 ms. (steps per millisecond=157 ) properties seen :0
// Phase 1: matrix 836 rows 356 cols
[2025-05-29 19:23:24] [INFO ] Computed 37 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 149/156 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/161 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 103/264 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 49/313 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 43/356 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 836/1192 variables, 356/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1192 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1192 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1192/1192 variables, and 393 constraints, problems are : Problem set: 0 solved, 2 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 149/156 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/161 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 103/264 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 49/313 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 43/356 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:23:24] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2025-05-29 19:23:25] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 1 ms to minimize.
[2025-05-29 19:23:25] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 836/1192 variables, 356/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1192 variables, 2/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1192 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1192 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1192/1192 variables, and 398 constraints, problems are : Problem set: 0 solved, 2 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1164ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 570 ms.
Support contains 2 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 836/836 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 836/836 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 356/356 places, 836/836 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 836/836 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 836/836 (removed 0) transitions.
[2025-05-29 19:23:26] [INFO ] Invariant cache hit.
[2025-05-29 19:23:26] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-05-29 19:23:26] [INFO ] Invariant cache hit.
[2025-05-29 19:23:26] [INFO ] Implicit Places using invariants and state equation in 691 ms returned [263, 265, 267, 269, 271, 273, 275]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 897 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 349/356 places, 836/836 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 343 transition count 788
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 343 transition count 788
Applied a total of 12 rules in 29 ms. Remains 343 /349 variables (removed 6) and now considering 788/836 (removed 48) transitions.
// Phase 1: matrix 788 rows 343 cols
[2025-05-29 19:23:26] [INFO ] Computed 36 invariants in 12 ms
[2025-05-29 19:23:27] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-05-29 19:23:27] [INFO ] Invariant cache hit.
[2025-05-29 19:23:27] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 343/356 places, 788/836 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1689 ms. Remains : 343/356 places, 788/836 transitions.
RANDOM walk for 4000000 steps (78532 resets) in 13735 ms. (291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (21760 resets) in 5345 ms. (748 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (21665 resets) in 5929 ms. (674 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3097615 steps, run timeout after 24001 ms. (steps per millisecond=129 ) properties seen :0 out of 2
Probabilistic random walk after 3097615 steps, saw 1493830 distinct states, run finished after 24001 ms. (steps per millisecond=129 ) properties seen :0
[2025-05-29 19:23:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 140/147 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/178 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 88/266 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 32/298 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/343 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 788/1131 variables, 343/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1131 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1131 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 140/147 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/178 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 88/266 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 32/298 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/343 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 788/1131 variables, 343/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1131 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1131 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1131 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 381 constraints, problems are : Problem set: 0 solved, 2 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 743ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 838 ms.
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 788/788 transitions.
Applied a total of 0 rules in 12 ms. Remains 343 /343 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 343/343 places, 788/788 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 788/788 transitions.
Applied a total of 0 rules in 10 ms. Remains 343 /343 variables (removed 0) and now considering 788/788 (removed 0) transitions.
[2025-05-29 19:24:01] [INFO ] Invariant cache hit.
[2025-05-29 19:24:01] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-05-29 19:24:01] [INFO ] Invariant cache hit.
[2025-05-29 19:24:02] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
[2025-05-29 19:24:02] [INFO ] Redundant transitions in 15 ms returned []
Running 763 sub problems to find dead transitions.
[2025-05-29 19:24:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 763 unsolved
[2025-05-29 19:24:06] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
[2025-05-29 19:24:12] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 1 ms to minimize.
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD635 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 2/34 constraints. Problems are: Problem set: 19 solved, 744 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/34 constraints. Problems are: Problem set: 19 solved, 744 unsolved
At refinement iteration 4 (OVERLAPS) 1/343 variables, 3/37 constraints. Problems are: Problem set: 19 solved, 744 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 1/38 constraints. Problems are: Problem set: 19 solved, 744 unsolved
[2025-05-29 19:24:27] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 343/1131 variables, and 39 constraints, problems are : Problem set: 19 solved, 744 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/343 constraints, PredecessorRefiner: 763/763 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 19 solved, 744 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 6/6 constraints. Problems are: Problem set: 19 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 26/32 constraints. Problems are: Problem set: 19 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 2/34 constraints. Problems are: Problem set: 19 solved, 744 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/34 constraints. Problems are: Problem set: 19 solved, 744 unsolved
At refinement iteration 4 (OVERLAPS) 1/343 variables, 3/37 constraints. Problems are: Problem set: 19 solved, 744 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 1/38 constraints. Problems are: Problem set: 19 solved, 744 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 1/39 constraints. Problems are: Problem set: 19 solved, 744 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 0/39 constraints. Problems are: Problem set: 19 solved, 744 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
At refinement iteration 8 (OVERLAPS) 788/1131 variables, 343/382 constraints. Problems are: Problem set: 154 solved, 609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 991 constraints, problems are : Problem set: 154 solved, 609 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 609/763 constraints, Known Traps: 3/3 constraints]
After SMT, in 60419ms problems are : Problem set: 154 solved, 609 unsolved
Search for dead transitions found 154 dead transitions in 60428ms
Found 154 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 154 transitions
Dead transitions reduction (with SMT) removed 154 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 343/343 places, 634/788 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 343 transition count 627
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 336 transition count 627
Applied a total of 14 rules in 17 ms. Remains 336 /343 variables (removed 7) and now considering 627/634 (removed 7) transitions.
// Phase 1: matrix 627 rows 336 cols
[2025-05-29 19:25:02] [INFO ] Computed 36 invariants in 3 ms
[2025-05-29 19:25:02] [INFO ] Implicit Places using invariants in 332 ms returned []
[2025-05-29 19:25:02] [INFO ] Invariant cache hit.
[2025-05-29 19:25:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-05-29 19:25:03] [INFO ] Implicit Places using invariants and state equation in 707 ms returned [58, 60, 62, 64, 66, 68, 70, 125, 127, 129, 131, 133, 135, 137, 187, 189, 191, 193, 195, 197, 199, 255]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 1041 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 314/343 places, 627/788 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 297 transition count 491
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 297 transition count 491
Applied a total of 34 rules in 14 ms. Remains 297 /314 variables (removed 17) and now considering 491/627 (removed 136) transitions.
// Phase 1: matrix 491 rows 297 cols
[2025-05-29 19:25:03] [INFO ] Computed 32 invariants in 4 ms
[2025-05-29 19:25:03] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-05-29 19:25:03] [INFO ] Invariant cache hit.
[2025-05-29 19:25:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-05-29 19:25:04] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 297/343 places, 491/788 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62840 ms. Remains : 297/343 places, 491/788 transitions.
RANDOM walk for 4000000 steps (78810 resets) in 7953 ms. (502 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (21734 resets) in 5226 ms. (765 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (21760 resets) in 5253 ms. (761 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2852948 steps, run timeout after 18001 ms. (steps per millisecond=158 ) properties seen :0 out of 2
Probabilistic random walk after 2852948 steps, saw 1288759 distinct states, run finished after 18001 ms. (steps per millisecond=158 ) properties seen :0
[2025-05-29 19:25:28] [INFO ] Invariant cache hit.
[2025-05-29 19:25:28] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/65 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 55/121 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/135 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/219 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 32/251 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 45/296 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/296 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 491/787 variables, 296/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/787 variables, 13/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/787 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/788 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/788 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/788 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 788/788 variables, and 342 constraints, problems are : Problem set: 0 solved, 2 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 297/297 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/65 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 55/121 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/135 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/219 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 32/251 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 45/296 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/296 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 491/787 variables, 296/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/787 variables, 13/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/787 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/787 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/788 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/788 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/788 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 788/788 variables, and 344 constraints, problems are : Problem set: 0 solved, 2 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 297/297 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 554ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 387 ms.
Support contains 2 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 491/491 transitions.
Applied a total of 0 rules in 5 ms. Remains 297 /297 variables (removed 0) and now considering 491/491 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 297/297 places, 491/491 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 491/491 transitions.
Applied a total of 0 rules in 5 ms. Remains 297 /297 variables (removed 0) and now considering 491/491 (removed 0) transitions.
[2025-05-29 19:25:29] [INFO ] Invariant cache hit.
[2025-05-29 19:25:29] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-29 19:25:29] [INFO ] Invariant cache hit.
[2025-05-29 19:25:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-05-29 19:25:30] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2025-05-29 19:25:30] [INFO ] Redundant transitions in 16 ms returned []
Running 466 sub problems to find dead transitions.
[2025-05-29 19:25:30] [INFO ] Invariant cache hit.
[2025-05-29 19:25:30] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2025-05-29 19:25:34] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 1/29 constraints. Problems are: Problem set: 7 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/29 constraints. Problems are: Problem set: 7 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 1/297 variables, 3/32 constraints. Problems are: Problem set: 7 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 1/33 constraints. Problems are: Problem set: 7 solved, 459 unsolved
[2025-05-29 19:25:40] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/34 constraints. Problems are: Problem set: 7 solved, 459 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/34 constraints. Problems are: Problem set: 7 solved, 459 unsolved
Problem TDEAD126 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD490 is UNSAT
At refinement iteration 8 (OVERLAPS) 491/788 variables, 297/331 constraints. Problems are: Problem set: 50 solved, 416 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/788 variables, 13/344 constraints. Problems are: Problem set: 50 solved, 416 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/788 variables, 0/344 constraints. Problems are: Problem set: 50 solved, 416 unsolved
At refinement iteration 11 (OVERLAPS) 0/788 variables, 0/344 constraints. Problems are: Problem set: 50 solved, 416 unsolved
No progress, stopping.
After SMT solving in domain Real declared 788/788 variables, and 344 constraints, problems are : Problem set: 50 solved, 416 unsolved in 29478 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 297/297 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 50 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 6/6 constraints. Problems are: Problem set: 50 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 22/28 constraints. Problems are: Problem set: 50 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 1/29 constraints. Problems are: Problem set: 50 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/29 constraints. Problems are: Problem set: 50 solved, 416 unsolved
At refinement iteration 4 (OVERLAPS) 1/297 variables, 3/32 constraints. Problems are: Problem set: 50 solved, 416 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 1/33 constraints. Problems are: Problem set: 50 solved, 416 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/34 constraints. Problems are: Problem set: 50 solved, 416 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/34 constraints. Problems are: Problem set: 50 solved, 416 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
At refinement iteration 8 (OVERLAPS) 491/788 variables, 297/331 constraints. Problems are: Problem set: 162 solved, 304 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/788 variables, 13/344 constraints. Problems are: Problem set: 162 solved, 304 unsolved
Problem TDEAD243 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/788 variables, 304/648 constraints. Problems are: Problem set: 167 solved, 299 unsolved
[2025-05-29 19:26:14] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/788 variables, 1/649 constraints. Problems are: Problem set: 167 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 788/788 variables, and 649 constraints, problems are : Problem set: 167 solved, 299 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 297/297 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 304/466 constraints, Known Traps: 3/3 constraints]
After SMT, in 59670ms problems are : Problem set: 167 solved, 299 unsolved
Search for dead transitions found 167 dead transitions in 59674ms
Found 167 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 167 transitions
Dead transitions reduction (with SMT) removed 167 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 297/297 places, 324/491 transitions.
Ensure Unique test removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 278 transition count 283
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 101 place count 237 transition count 283
Applied a total of 101 rules in 8 ms. Remains 237 /297 variables (removed 60) and now considering 283/324 (removed 41) transitions.
// Phase 1: matrix 283 rows 237 cols
[2025-05-29 19:26:29] [INFO ] Computed 36 invariants in 3 ms
[2025-05-29 19:26:30] [INFO ] Implicit Places using invariants in 205 ms returned [40, 85, 132, 172]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 206 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 233/297 places, 283/491 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 233 transition count 256
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 206 transition count 256
Applied a total of 54 rules in 4 ms. Remains 206 /233 variables (removed 27) and now considering 256/283 (removed 27) transitions.
// Phase 1: matrix 256 rows 206 cols
[2025-05-29 19:26:30] [INFO ] Computed 32 invariants in 1 ms
[2025-05-29 19:26:30] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-29 19:26:30] [INFO ] Invariant cache hit.
[2025-05-29 19:26:30] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 206/297 places, 256/491 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 60786 ms. Remains : 206/297 places, 256/491 transitions.
RANDOM walk for 4000000 steps (96777 resets) in 9205 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (22883 resets) in 5461 ms. (732 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (22947 resets) in 5539 ms. (722 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 4276441 steps, run timeout after 18001 ms. (steps per millisecond=237 ) properties seen :0 out of 2
Probabilistic random walk after 4276441 steps, saw 1444774 distinct states, run finished after 18002 ms. (steps per millisecond=237 ) properties seen :0
[2025-05-29 19:26:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/43 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 36/80 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 59/153 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 21/174 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 24/198 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 249/447 variables, 198/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/447 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 15/462 variables, 8/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/462 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/462 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/462 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 238 constraints, problems are : Problem set: 0 solved, 2 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/43 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 36/80 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 59/153 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 21/174 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 24/198 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 249/447 variables, 198/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/447 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/447 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 15/462 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/462 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/462 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/462 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 377ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 123 ms.
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 256/256 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 256/256 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 256/256 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2025-05-29 19:26:55] [INFO ] Invariant cache hit.
[2025-05-29 19:26:55] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-29 19:26:55] [INFO ] Invariant cache hit.
[2025-05-29 19:26:56] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2025-05-29 19:26:56] [INFO ] Redundant transitions in 2 ms returned []
Running 231 sub problems to find dead transitions.
[2025-05-29 19:26:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2025-05-29 19:26:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2025-05-29 19:26:59] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2025-05-29 19:26:59] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 256/462 variables, 206/241 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (OVERLAPS) 0/462 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 241 constraints, problems are : Problem set: 0 solved, 231 unsolved in 9705 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 256/462 variables, 206/241 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 231/472 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2025-05-29 19:27:14] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/462 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 0/462 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 473 constraints, problems are : Problem set: 0 solved, 231 unsolved in 21029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 4/4 constraints]
After SMT, in 30814ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 30816ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31130 ms. Remains : 206/206 places, 256/256 transitions.
RANDOM walk for 400000 steps (9670 resets) in 2864 ms. (139 steps per ms) remains 2/2 properties
Running SMT prover for 2 properties.
[2025-05-29 19:27:27] [INFO ] Invariant cache hit.
[2025-05-29 19:27:27] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-05-29 19:27:27] [INFO ] [Real]Absence check using 13 positive and 19 generalized place invariants in 8 ms returned sat
[2025-05-29 19:27:28] [INFO ] After 66ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-29 19:27:28] [INFO ] After 104ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-29 19:27:28] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-29 19:27:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-05-29 19:27:28] [INFO ] [Nat]Absence check using 13 positive and 19 generalized place invariants in 5 ms returned sat
[2025-05-29 19:27:28] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-29 19:27:28] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-29 19:27:28] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
RANDOM walk for 4000000 steps (96402 resets) in 15133 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (22738 resets) in 5681 ms. (703 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (22955 resets) in 5442 ms. (734 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 6772161 steps, run timeout after 27001 ms. (steps per millisecond=250 ) properties seen :0 out of 2
Probabilistic random walk after 6772161 steps, saw 2121075 distinct states, run finished after 27001 ms. (steps per millisecond=250 ) properties seen :0
[2025-05-29 19:28:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/43 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 36/80 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 59/153 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 21/174 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 24/198 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 249/447 variables, 198/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/447 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 15/462 variables, 8/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/462 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/462 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/462 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 238 constraints, problems are : Problem set: 0 solved, 2 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/43 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 36/80 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 59/153 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 21/174 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 24/198 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 249/447 variables, 198/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/447 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/447 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 15/462 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/462 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/462 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/462 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 354ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 256/256 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 256/256 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 256/256 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2025-05-29 19:28:05] [INFO ] Invariant cache hit.
[2025-05-29 19:28:05] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-05-29 19:28:05] [INFO ] Invariant cache hit.
[2025-05-29 19:28:05] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2025-05-29 19:28:05] [INFO ] Redundant transitions in 1 ms returned []
Running 231 sub problems to find dead transitions.
[2025-05-29 19:28:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2025-05-29 19:28:08] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2025-05-29 19:28:08] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2025-05-29 19:28:08] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 256/462 variables, 206/241 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (OVERLAPS) 0/462 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 241 constraints, problems are : Problem set: 0 solved, 231 unsolved in 9447 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 256/462 variables, 206/241 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 231/472 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2025-05-29 19:28:23] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/462 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 0/462 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 473 constraints, problems are : Problem set: 0 solved, 231 unsolved in 20164 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 4/4 constraints]
After SMT, in 29689ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 29691ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30017 ms. Remains : 206/206 places, 256/256 transitions.
RANDOM walk for 400000 steps (9651 resets) in 1794 ms. (222 steps per ms) remains 2/2 properties
Running SMT prover for 2 properties.
[2025-05-29 19:28:36] [INFO ] Invariant cache hit.
[2025-05-29 19:28:36] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-05-29 19:28:36] [INFO ] [Real]Absence check using 13 positive and 19 generalized place invariants in 5 ms returned sat
[2025-05-29 19:28:36] [INFO ] After 67ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-29 19:28:36] [INFO ] After 100ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-29 19:28:36] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-29 19:28:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-05-29 19:28:36] [INFO ] [Nat]Absence check using 13 positive and 19 generalized place invariants in 4 ms returned sat
[2025-05-29 19:28:36] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-29 19:28:36] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-29 19:28:36] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
RANDOM walk for 40000 steps (987 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (224 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1551272 steps, run timeout after 3001 ms. (steps per millisecond=516 ) properties seen :0 out of 1
Probabilistic random walk after 1551272 steps, saw 460682 distinct states, run finished after 3001 ms. (steps per millisecond=516 ) properties seen :0
[2025-05-29 19:28:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/43 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/80 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/153 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 21/174 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/198 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 249/447 variables, 198/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/447 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 15/462 variables, 8/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/462 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/462 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/462 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 238 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/43 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/80 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/153 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 21/174 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/198 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 249/447 variables, 198/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/447 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/447 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 15/462 variables, 8/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/462 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/462 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/462 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 239 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1906 steps, including 220 resets, run visited all 1 properties in 4 ms. (steps per millisecond=476 )
Parikh walk visited 1 properties in 9 ms.
RANDOM walk for 40000 steps (943 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (230 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1589027 steps, run timeout after 3001 ms. (steps per millisecond=529 ) properties seen :0 out of 1
Probabilistic random walk after 1589027 steps, saw 470175 distinct states, run finished after 3001 ms. (steps per millisecond=529 ) properties seen :0
[2025-05-29 19:28:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/43 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/80 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/153 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 21/174 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/198 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 249/447 variables, 198/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/447 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 15/462 variables, 8/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/462 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/462 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/462 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 238 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/43 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/80 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/153 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 21/174 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/198 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 249/447 variables, 198/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/447 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/447 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 15/462 variables, 8/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/462 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/462 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/462 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 239 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 273ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2326 steps, including 271 resets, run visited all 1 properties in 5 ms. (steps per millisecond=465 )
Parikh walk visited 1 properties in 5 ms.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Running SMT prover for 2 properties.
[2025-05-29 19:28:43] [INFO ] Invariant cache hit.
[2025-05-29 19:28:43] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-29 19:28:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-05-29 19:28:43] [INFO ] [Nat]Absence check using 13 positive and 19 generalized place invariants in 5 ms returned sat
[2025-05-29 19:28:43] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-29 19:28:43] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-29 19:28:43] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 231 ms.
Unable to solve all queries for examination StableMarking. Remains :2 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 2 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 1579886 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ASLink-PT-04b
IS_COLORED=
IS_NUPN=1
LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 2034
TRANSITIONS: 2567
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 7875
NUPN UNITS: 249
LOADING TIME: 1.335
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.083
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.729
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1033
MODEL NAME: /home/mcc/execution/model
2034 places, 2567 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-04b"
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-04b, 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-174853743600213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04b.tgz
mv ASLink-PT-04b 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 '
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 ;