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.r056-tall-174854041500048.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 CloudDeployment-PT-6b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-tall-174854041500048
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.8M 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 1748644678205

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudDeployment-PT-6b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 22:37:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-30 22:37:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 22:37:59] [INFO ] Load time of PNML (sax parser for PT used): 428 ms
[2025-05-30 22:37:59] [INFO ] Transformed 1888 places.
[2025-05-30 22:38:00] [INFO ] Transformed 6804 transitions.
[2025-05-30 22:38:00] [INFO ] Found NUPN structural information;
[2025-05-30 22:38:00] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 587 ms.
Graph (trivial) has 1908 edges and 1888 vertex of which 504 / 1888 are part of one of the 48 SCC in 12 ms
Free SCC test removed 456 places
Structural test allowed to assert that 641 places are NOT stable. Took 78 ms.
Ensure Unique test removed 510 transitions
Reduce redundant transitions removed 510 transitions.
RANDOM walk for 40000 steps (247 resets) in 3436 ms. (11 steps per ms) remains 599/1247 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 599/599 properties
BEST_FIRST walk for 121 steps (8 resets) in 8 ms. (13 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 599/599 properties
BEST_FIRST walk for 121 steps (8 resets) in 8 ms. (13 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 21 ms. (5 steps per ms) remains 599/599 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 599/599 properties
BEST_FIRST walk for 121 steps (8 resets) in 10 ms. (11 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 599/599 properties
BEST_FIRST walk for 121 steps (8 resets) in 10 ms. (11 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 599/599 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 5 ms. (20 steps per ms) remains 599/599 properties
BEST_FIRST walk for 121 steps (8 resets) in 6 ms. (17 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 599/599 properties
BEST_FIRST walk for 121 steps (8 resets) in 6 ms. (17 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 26 ms. (4 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 599/599 properties
BEST_FIRST walk for 121 steps (8 resets) in 6 ms. (17 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 599/599 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 599/599 properties
BEST_FIRST walk for 121 steps (8 resets) in 6 ms. (17 steps per ms) remains 599/599 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 599/599 properties
BEST_FIRST walk for 121 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 121 steps (8 resets) in 8 ms. (13 steps per ms) remains 599/599 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 599/599 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 599/599 properties
[2025-05-30 22:38:01] [INFO ] Flow matrix only has 6247 transitions (discarded 47 similar events)
// Phase 1: matrix 6247 rows 1432 cols
[2025-05-30 22:38:01] [INFO ] Computed 25 invariants in 199 ms
[2025-05-30 22:38:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 599/599 constraints. Problems are: Problem set: 0 solved, 599 unsolved
SMT process timed out in 6165ms, After SMT, problems are : Problem set: 0 solved, 599 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 599 out of 1432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1432/1432 places, 6294/6294 transitions.
Graph (complete) has 4302 edges and 1432 vertex of which 1428 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.23 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 439 rules applied. Total rules applied 440 place count 1428 transition count 5853
Reduce places removed 389 places and 0 transitions.
Iterating post reduction 1 with 389 rules applied. Total rules applied 829 place count 1039 transition count 5853
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 829 place count 1039 transition count 5845
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 845 place count 1031 transition count 5845
Discarding 195 places :
Symmetric choice reduction at 2 with 195 rule applications. Total rules 1040 place count 836 transition count 5650
Iterating global reduction 2 with 195 rules applied. Total rules applied 1235 place count 836 transition count 5650
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 1263 place count 836 transition count 5622
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 3 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1377 place count 779 transition count 5565
Performed 30 Post agglomeration using F-continuation condition with reduction of 36 identical transitions.
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1437 place count 749 transition count 5601
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1443 place count 749 transition count 5595
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1455 place count 743 transition count 5655
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1479 place count 743 transition count 5631
Free-agglomeration rule applied 67 times with reduction of 28 identical transitions.
Iterating global reduction 4 with 67 rules applied. Total rules applied 1546 place count 743 transition count 5536
Reduce places removed 67 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 4 with 190 rules applied. Total rules applied 1736 place count 676 transition count 5413
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 1773 place count 676 transition count 5376
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1774 place count 676 transition count 5376
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1775 place count 675 transition count 5375
Applied a total of 1775 rules in 1320 ms. Remains 675 /1432 variables (removed 757) and now considering 5375/6294 (removed 919) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1334 ms. Remains : 675/1432 places, 5375/6294 transitions.
RANDOM walk for 2627374 steps (4 resets) in 120004 ms. (21 steps per ms) remains 462/599 properties
BEST_FIRST walk for 40000 steps (8 resets) in 451 ms. (88 steps per ms) remains 331/462 properties
BEST_FIRST walk for 40001 steps (8 resets) in 431 ms. (92 steps per ms) remains 320/331 properties
BEST_FIRST walk for 40002 steps (8 resets) in 390 ms. (102 steps per ms) remains 289/320 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 271/289 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 206/271 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 200/206 properties
BEST_FIRST walk for 40003 steps (8 resets) in 313 ms. (127 steps per ms) remains 162/200 properties
BEST_FIRST walk for 40002 steps (8 resets) in 290 ms. (137 steps per ms) remains 155/162 properties
BEST_FIRST walk for 40001 steps (8 resets) in 296 ms. (134 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (8 resets) in 284 ms. (140 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40001 steps (8 resets) in 292 ms. (136 steps per ms) remains 141/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 130/141 properties
BEST_FIRST walk for 40001 steps (8 resets) in 271 ms. (147 steps per ms) remains 128/130 properties
BEST_FIRST walk for 40002 steps (8 resets) in 282 ms. (141 steps per ms) remains 123/128 properties
BEST_FIRST walk for 40003 steps (8 resets) in 257 ms. (155 steps per ms) remains 121/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 273 ms. (145 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (8 resets) in 267 ms. (149 steps per ms) remains 101/121 properties
BEST_FIRST walk for 40002 steps (8 resets) in 265 ms. (150 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40002 steps (8 resets) in 260 ms. (153 steps per ms) remains 93/101 properties
BEST_FIRST walk for 40003 steps (8 resets) in 265 ms. (150 steps per ms) remains 89/93 properties
BEST_FIRST walk for 40003 steps (8 resets) in 267 ms. (149 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40002 steps (8 resets) in 247 ms. (161 steps per ms) remains 87/89 properties
BEST_FIRST walk for 40003 steps (8 resets) in 251 ms. (158 steps per ms) remains 86/87 properties
BEST_FIRST walk for 40002 steps (8 resets) in 253 ms. (157 steps per ms) remains 86/86 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 86/86 properties
BEST_FIRST walk for 40001 steps (8 resets) in 263 ms. (151 steps per ms) remains 86/86 properties
BEST_FIRST walk for 40003 steps (8 resets) in 256 ms. (155 steps per ms) remains 84/86 properties
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 84/84 properties
BEST_FIRST walk for 40000 steps (8 resets) in 261 ms. (152 steps per ms) remains 84/84 properties
BEST_FIRST walk for 40002 steps (8 resets) in 244 ms. (163 steps per ms) remains 76/84 properties
BEST_FIRST walk for 40002 steps (8 resets) in 229 ms. (173 steps per ms) remains 74/76 properties
BEST_FIRST walk for 40002 steps (8 resets) in 250 ms. (159 steps per ms) remains 74/74 properties
BEST_FIRST walk for 40002 steps (8 resets) in 253 ms. (157 steps per ms) remains 72/74 properties
BEST_FIRST walk for 40003 steps (8 resets) in 251 ms. (158 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40001 steps (8 resets) in 248 ms. (160 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40002 steps (8 resets) in 251 ms. (158 steps per ms) remains 70/72 properties
BEST_FIRST walk for 40002 steps (8 resets) in 245 ms. (162 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40002 steps (8 resets) in 242 ms. (164 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40002 steps (8 resets) in 235 ms. (169 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40003 steps (8 resets) in 246 ms. (161 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40002 steps (8 resets) in 245 ms. (162 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40002 steps (8 resets) in 259 ms. (153 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40002 steps (8 resets) in 252 ms. (158 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40001 steps (8 resets) in 253 ms. (157 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40002 steps (8 resets) in 237 ms. (168 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40002 steps (8 resets) in 246 ms. (161 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40003 steps (8 resets) in 251 ms. (158 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40002 steps (8 resets) in 245 ms. (162 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40002 steps (8 resets) in 243 ms. (163 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40002 steps (8 resets) in 242 ms. (164 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40002 steps (8 resets) in 251 ms. (158 steps per ms) remains 68/70 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40001 steps (8 resets) in 243 ms. (163 steps per ms) remains 66/68 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 64/66 properties
BEST_FIRST walk for 40002 steps (8 resets) in 262 ms. (152 steps per ms) remains 64/64 properties
BEST_FIRST walk for 40002 steps (8 resets) in 236 ms. (168 steps per ms) remains 64/64 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 64/64 properties
BEST_FIRST walk for 40003 steps (8 resets) in 257 ms. (155 steps per ms) remains 64/64 properties
BEST_FIRST walk for 40003 steps (8 resets) in 250 ms. (159 steps per ms) remains 64/64 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 64/64 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 64/64 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 64/64 properties
BEST_FIRST walk for 40001 steps (8 resets) in 255 ms. (156 steps per ms) remains 64/64 properties
[2025-05-30 22:38:44] [INFO ] Flow matrix only has 5373 transitions (discarded 2 similar events)
// Phase 1: matrix 5373 rows 675 cols
[2025-05-30 22:38:44] [INFO ] Computed 25 invariants in 97 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 537/601 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 74/675 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/675 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 5373/6048 variables, 675/700 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6048 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/6048 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6048/6048 variables, and 700 constraints, problems are : Problem set: 0 solved, 64 unsolved in 15306 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 64/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 537/601 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 74/675 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/675 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 5373/6048 variables, 675/700 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6048 variables, 50/750 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6048 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/6048 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
After SMT solving in domain Int declared 6048/6048 variables, and 750 constraints, problems are : Problem set: 0 solved, 64 unsolved in 45019 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 64/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 60690ms problems are : Problem set: 0 solved, 64 unsolved
Fused 64 Parikh solutions to 23 different solutions.
Parikh walk visited 41 properties in 678 ms.
Support contains 23 out of 675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 5375/5375 transitions.
Graph (complete) has 2833 edges and 675 vertex of which 647 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4123 transitions
Reduce isomorphic transitions removed 4123 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 4385 rules applied. Total rules applied 4386 place count 647 transition count 985
Reduce places removed 262 places and 0 transitions.
Iterating post reduction 1 with 262 rules applied. Total rules applied 4648 place count 385 transition count 985
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 4648 place count 385 transition count 956
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 4706 place count 356 transition count 956
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 4796 place count 266 transition count 851
Iterating global reduction 2 with 90 rules applied. Total rules applied 4886 place count 266 transition count 851
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 4922 place count 266 transition count 815
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4922 place count 266 transition count 811
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4930 place count 262 transition count 811
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 4934 place count 258 transition count 807
Iterating global reduction 3 with 4 rules applied. Total rules applied 4938 place count 258 transition count 807
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 4941 place count 255 transition count 804
Iterating global reduction 3 with 3 rules applied. Total rules applied 4944 place count 255 transition count 804
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 4946 place count 253 transition count 802
Iterating global reduction 3 with 2 rules applied. Total rules applied 4948 place count 253 transition count 802
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 4949 place count 252 transition count 801
Iterating global reduction 3 with 1 rules applied. Total rules applied 4950 place count 252 transition count 801
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 5068 place count 193 transition count 742
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 5083 place count 193 transition count 727
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -167
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 5131 place count 169 transition count 894
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 5152 place count 169 transition count 873
Drop transitions (Redundant composition of simpler transitions.) removed 217 transitions
Redundant transition composition rules discarded 217 transitions
Iterating global reduction 5 with 217 rules applied. Total rules applied 5369 place count 169 transition count 656
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 5376 place count 169 transition count 649
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 37 rules applied. Total rules applied 5413 place count 162 transition count 619
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 5417 place count 158 transition count 591
Iterating global reduction 6 with 4 rules applied. Total rules applied 5421 place count 158 transition count 591
Applied a total of 5421 rules in 134 ms. Remains 158 /675 variables (removed 517) and now considering 591/5375 (removed 4784) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 158/675 places, 591/5375 transitions.
RANDOM walk for 4000000 steps (54137 resets) in 13376 ms. (299 steps per ms) remains 1/23 properties
BEST_FIRST walk for 4000004 steps (6745 resets) in 2567 ms. (1557 steps per ms) remains 1/1 properties
[2025-05-30 22:39:50] [INFO ] Flow matrix only has 345 transitions (discarded 246 similar events)
// Phase 1: matrix 345 rows 158 cols
[2025-05-30 22:39:50] [INFO ] Computed 24 invariants in 4 ms
[2025-05-30 22:39:50] [INFO ] State equation strengthened by 8 read => feed constraints.
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) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/71 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 198/269 variables, 39/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/283 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 130/413 variables, 50/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 50/463 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/463 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 40/503 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/503 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/503 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/503 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 158/158 constraints, ReadFeed: 8/8 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) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/71 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 198/269 variables, 39/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/283 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 130/413 variables, 50/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-30 22:39:50] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 12 ms to minimize.
[2025-05-30 22:39:50] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 50/463 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 7/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-30 22:39:50] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/463 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 40/503 variables, 43/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/503 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 158/158 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 724ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 591/591 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 0 with 6 rules applied. Total rules applied 6 place count 158 transition count 585
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 152 transition count 585
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 152 transition count 579
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 146 transition count 579
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 144 transition count 577
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 144 transition count 577
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 40 place count 144 transition count 565
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 48 place count 140 transition count 561
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 138 transition count 547
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 138 transition count 547
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 64 place count 132 transition count 581
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 3 with 36 rules applied. Total rules applied 100 place count 132 transition count 545
Applied a total of 100 rules in 35 ms. Remains 132 /158 variables (removed 26) and now considering 545/591 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 132/158 places, 545/591 transitions.
RANDOM walk for 4000000 steps (54071 resets) in 11382 ms. (351 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (6733 resets) in 2584 ms. (1547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2413399 steps, run timeout after 9001 ms. (steps per millisecond=268 ) properties seen :0 out of 1
Probabilistic random walk after 2413399 steps, saw 354448 distinct states, run finished after 9013 ms. (steps per millisecond=267 ) properties seen :0
[2025-05-30 22:40:03] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
// Phase 1: matrix 263 rows 132 cols
[2025-05-30 22:40:03] [INFO ] Computed 24 invariants in 1 ms
[2025-05-30 22:40:03] [INFO ] State equation strengthened by 8 read => feed constraints.
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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/56 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/212 variables, 39/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/226 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 92/318 variables, 36/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 42/360 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-30 22:40:03] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2025-05-30 22:40:03] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/360 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/395 variables, 40/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/395 variables, 6/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/395 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/395 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 166 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/56 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 156/212 variables, 39/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/226 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 92/318 variables, 36/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-30 22:40:03] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2025-05-30 22:40:04] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 42/360 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/360 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/360 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/360 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 35/395 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/395 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/395 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/395 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 631ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 545/545 transitions.
Applied a total of 0 rules in 8 ms. Remains 132 /132 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 132/132 places, 545/545 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 545/545 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2025-05-30 22:40:04] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
[2025-05-30 22:40:04] [INFO ] Invariant cache hit.
[2025-05-30 22:40:04] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-05-30 22:40:04] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
[2025-05-30 22:40:04] [INFO ] Invariant cache hit.
[2025-05-30 22:40:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 22:40:04] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2025-05-30 22:40:04] [INFO ] Redundant transitions in 32 ms returned []
Running 509 sub problems to find dead transitions.
[2025-05-30 22:40:04] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
[2025-05-30 22:40:04] [INFO ] Invariant cache hit.
[2025-05-30 22:40:04] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 6/132 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 263/395 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 509 unsolved
[2025-05-30 22:40:14] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 165 constraints, problems are : Problem set: 0 solved, 509 unsolved in 21061 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (OVERLAPS) 6/132 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 263/395 variables, 132/157 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 8/165 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 509/674 constraints. Problems are: Problem set: 0 solved, 509 unsolved
[2025-05-30 22:40:35] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 675 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 2/2 constraints]
After SMT, in 52052ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 52060ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52472 ms. Remains : 132/132 places, 545/545 transitions.
RANDOM walk for 400000 steps (5406 resets) in 3074 ms. (130 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2025-05-30 22:40:57] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
[2025-05-30 22:40:57] [INFO ] Invariant cache hit.
[2025-05-30 22:40:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-30 22:40:57] [INFO ] [Real]Absence check using 6 positive and 18 generalized place invariants in 6 ms returned sat
[2025-05-30 22:40:57] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-05-30 22:40:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 22:40:57] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 22:40:57] [INFO ] After 36ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-30 22:40:57] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-30 22:40:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-05-30 22:40:57] [INFO ] [Nat]Absence check using 6 positive and 18 generalized place invariants in 4 ms returned sat
[2025-05-30 22:40:57] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-30 22:40:57] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 22:40:57] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 22:40:57] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (54352 resets) in 14386 ms. (278 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (6749 resets) in 2603 ms. (1536 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3387846 steps, run timeout after 12001 ms. (steps per millisecond=282 ) properties seen :0 out of 1
Probabilistic random walk after 3387846 steps, saw 476118 distinct states, run finished after 12001 ms. (steps per millisecond=282 ) properties seen :0
[2025-05-30 22:41:14] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
[2025-05-30 22:41:14] [INFO ] Invariant cache hit.
[2025-05-30 22:41:14] [INFO ] State equation strengthened by 8 read => feed constraints.
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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/56 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/212 variables, 39/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/226 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 92/318 variables, 36/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 42/360 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-30 22:41:14] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2025-05-30 22:41:14] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2025-05-30 22:41:14] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2025-05-30 22:41:14] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/360 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/395 variables, 40/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/395 variables, 6/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/395 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/395 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/56 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 156/212 variables, 39/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/226 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 92/318 variables, 36/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 42/360 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/360 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/360 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 35/395 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/395 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/395 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/395 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 701ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 545/545 transitions.
Applied a total of 0 rules in 9 ms. Remains 132 /132 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 132/132 places, 545/545 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 545/545 transitions.
Applied a total of 0 rules in 8 ms. Remains 132 /132 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2025-05-30 22:41:14] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
[2025-05-30 22:41:15] [INFO ] Invariant cache hit.
[2025-05-30 22:41:15] [INFO ] Implicit Places using invariants in 295 ms returned []
[2025-05-30 22:41:15] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
[2025-05-30 22:41:15] [INFO ] Invariant cache hit.
[2025-05-30 22:41:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 22:41:15] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2025-05-30 22:41:15] [INFO ] Redundant transitions in 10 ms returned []
Running 509 sub problems to find dead transitions.
[2025-05-30 22:41:15] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
[2025-05-30 22:41:15] [INFO ] Invariant cache hit.
[2025-05-30 22:41:15] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 6/132 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 263/395 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 509 unsolved
[2025-05-30 22:41:24] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 165 constraints, problems are : Problem set: 0 solved, 509 unsolved in 20547 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (OVERLAPS) 6/132 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 263/395 variables, 132/157 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 8/165 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 509/674 constraints. Problems are: Problem set: 0 solved, 509 unsolved
[2025-05-30 22:41:45] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 675 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 2/2 constraints]
After SMT, in 51351ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 51359ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51909 ms. Remains : 132/132 places, 545/545 transitions.
RANDOM walk for 400000 steps (5401 resets) in 1287 ms. (310 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2025-05-30 22:42:07] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
[2025-05-30 22:42:07] [INFO ] Invariant cache hit.
[2025-05-30 22:42:07] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 22:42:07] [INFO ] [Real]Absence check using 6 positive and 18 generalized place invariants in 3 ms returned sat
[2025-05-30 22:42:07] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-05-30 22:42:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 22:42:07] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 22:42:07] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-30 22:42:07] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-30 22:42:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-05-30 22:42:07] [INFO ] [Nat]Absence check using 6 positive and 18 generalized place invariants in 3 ms returned sat
[2025-05-30 22:42:07] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-30 22:42:07] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 22:42:07] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 22:42:07] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (543 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (63 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 772256 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 1
Probabilistic random walk after 772256 steps, saw 121857 distinct states, run finished after 3001 ms. (steps per millisecond=257 ) properties seen :0
[2025-05-30 22:42:10] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
[2025-05-30 22:42:10] [INFO ] Invariant cache hit.
[2025-05-30 22:42:10] [INFO ] State equation strengthened by 8 read => feed constraints.
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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/56 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/212 variables, 39/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/226 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 92/318 variables, 36/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 42/360 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-30 22:42:10] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2025-05-30 22:42:10] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2025-05-30 22:42:10] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2025-05-30 22:42:11] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/360 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/395 variables, 40/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/395 variables, 6/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/395 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/395 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/56 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 156/212 variables, 39/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/226 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 92/318 variables, 36/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 42/360 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/360 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/360 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 35/395 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/395 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/395 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/395 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 619ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 545/545 transitions.
Applied a total of 0 rules in 14 ms. Remains 132 /132 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 132/132 places, 545/545 transitions.
RANDOM walk for 40000 steps (546 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (64 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 769243 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 1
Probabilistic random walk after 769243 steps, saw 121496 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
[2025-05-30 22:42:14] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
[2025-05-30 22:42:14] [INFO ] Invariant cache hit.
[2025-05-30 22:42:14] [INFO ] State equation strengthened by 8 read => feed constraints.
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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/56 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/212 variables, 39/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/226 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 92/318 variables, 36/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 42/360 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-30 22:42:14] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2025-05-30 22:42:14] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2025-05-30 22:42:14] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2025-05-30 22:42:14] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/360 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/395 variables, 40/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/395 variables, 6/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/395 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/395 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/56 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 156/212 variables, 39/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/226 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 92/318 variables, 36/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 42/360 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/360 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/360 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 35/395 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/395 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/395 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/395 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 614ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 545/545 transitions.
Applied a total of 0 rules in 8 ms. Remains 132 /132 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 132/132 places, 545/545 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 545/545 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2025-05-30 22:42:14] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
[2025-05-30 22:42:14] [INFO ] Invariant cache hit.
[2025-05-30 22:42:15] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-30 22:42:15] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
[2025-05-30 22:42:15] [INFO ] Invariant cache hit.
[2025-05-30 22:42:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 22:42:15] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2025-05-30 22:42:15] [INFO ] Redundant transitions in 6 ms returned []
Running 509 sub problems to find dead transitions.
[2025-05-30 22:42:15] [INFO ] Flow matrix only has 263 transitions (discarded 282 similar events)
[2025-05-30 22:42:15] [INFO ] Invariant cache hit.
[2025-05-30 22:42:15] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 6/132 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 263/395 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 509 unsolved
[2025-05-30 22:42:25] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 165 constraints, problems are : Problem set: 0 solved, 509 unsolved in 20771 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (OVERLAPS) 6/132 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 263/395 variables, 132/157 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 8/165 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 509/674 constraints. Problems are: Problem set: 0 solved, 509 unsolved
[2025-05-30 22:42:45] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 675 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 132/132 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 2/2 constraints]
After SMT, in 51588ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 51592ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51957 ms. Remains : 132/132 places, 545/545 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 132 edges and 132 vertex of which 47 / 132 are part of one of the 6 SCC in 0 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Ensure Unique test removed 294 transitions
Reduce isomorphic transitions removed 358 transitions.
Ensure Unique test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 80 transition count 171
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 44 place count 64 transition count 171
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 44 place count 64 transition count 161
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 64 place count 54 transition count 161
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 49 transition count 156
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 49 transition count 156
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 44 transition count 126
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 44 transition count 126
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 119 place count 44 transition count 91
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 133 place count 37 transition count 84
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 145 place count 37 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 157 place count 31 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 4 with 48 rules applied. Total rules applied 205 place count 31 transition count 54
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 220 place count 21 transition count 49
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 248 place count 21 transition count 21
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 21 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 250 place count 20 transition count 20
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 256 place count 20 transition count 20
Applied a total of 256 rules in 30 ms. Remains 20 /132 variables (removed 112) and now considering 20/545 (removed 525) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 20 rows 20 cols
[2025-05-30 22:43:06] [INFO ] Computed 8 invariants in 0 ms
[2025-05-30 22:43:06] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-30 22:43:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-30 22:43:06] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 5 ms returned sat
[2025-05-30 22:43:06] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 22:43:06] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 22:43:06] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 89 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 132 edges and 132 vertex of which 47 / 132 are part of one of the 6 SCC in 0 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Ensure Unique test removed 294 transitions
Reduce isomorphic transitions removed 358 transitions.
Ensure Unique test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 80 transition count 171
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 44 place count 64 transition count 171
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 44 place count 64 transition count 161
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 64 place count 54 transition count 161
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 49 transition count 156
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 49 transition count 156
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 44 transition count 126
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 44 transition count 126
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 119 place count 44 transition count 91
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 133 place count 37 transition count 84
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 145 place count 37 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 157 place count 31 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 4 with 48 rules applied. Total rules applied 205 place count 31 transition count 54
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 220 place count 21 transition count 49
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 248 place count 21 transition count 21
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 21 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 250 place count 20 transition count 20
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 256 place count 20 transition count 20
Applied a total of 256 rules in 10 ms. Remains 20 /132 variables (removed 112) and now considering 20/545 (removed 525) transitions.
Running SMT prover for 1 properties.
[2025-05-30 22:43:06] [INFO ] Invariant cache hit.
[2025-05-30 22:43:07] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-30 22:43:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-30 22:43:07] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-30 22:43:07] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 22:43:07] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 22:43:07] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 80 ms.
Unable to solve all queries for examination StableMarking. Remains :1 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 1 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 307654 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudDeployment-PT-6b

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 1888
TRANSITIONS: 6804
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 91831
NUPN UNITS: 49
LOADING TIME: 5.717

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.278
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 7.006
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: 746
MODEL NAME: /home/mcc/execution/model
1888 places, 6804 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1748645903599

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="CloudDeployment-PT-6b"
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 CloudDeployment-PT-6b, 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 r056-tall-174854041500048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-6b.tgz
mv CloudDeployment-PT-6b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;