Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r077-tall-174860075000503.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 itstools
Input is EisenbergMcGuire-PT-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r077-tall-174860075000503
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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 4.2K 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 2.3M 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 1748657989465

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2025-05-31 02:19:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-05-31 02:19:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 02:19:51] [INFO ] Load time of PNML (sax parser for PT used): 279 ms
[2025-05-31 02:19:51] [INFO ] Transformed 891 places.
[2025-05-31 02:19:51] [INFO ] Transformed 3888 transitions.
[2025-05-31 02:19:51] [INFO ] Found NUPN structural information;
[2025-05-31 02:19:51] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 477 ms.
RANDOM walk for 40000 steps (8 resets) in 4506 ms. (8 steps per ms) remains 290/891 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 27 ms. (14 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 38 ms. (10 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 290/290 properties
[2025-05-31 02:19:53] [INFO ] Flatten gal took : 636 ms
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 290/290 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 290/290 properties
[2025-05-31 02:19:53] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2025-05-31 02:19:53] [INFO ] Flatten gal took : 213 ms
[2025-05-31 02:19:53] [INFO ] Computed 28 invariants in 49 ms
[2025-05-31 02:19:53] [INFO ] State equation strengthened by 932 read => feed constraints.
[2025-05-31 02:19:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality656656161171573558.gal : 122 ms
[2025-05-31 02:19:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8650487363854499815.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality656656161171573558.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8650487363854499815.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality8650487363854499815.prop.
SDD proceeding with computation,290 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,290 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,290 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,290 properties remain. new max is 32
SDD size :8 after 10
SDD proceeding with computation,290 properties remain. new max is 64
SDD size :10 after 12
SDD proceeding with computation,290 properties remain. new max is 128
SDD size :12 after 14
SDD proceeding with computation,290 properties remain. new max is 256
SDD size :14 after 67
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 290/290 constraints. Problems are: Problem set: 0 solved, 290 unsolved
SDD proceeding with computation,290 properties remain. new max is 512
SDD size :67 after 89
SDD proceeding with computation,290 properties remain. new max is 1024
SDD size :89 after 213
Invariant property smplace_648 does not hold.
Invariant property smplace_615 does not hold.
SDD proceeding with computation,288 properties remain. new max is 1024
SDD size :213 after 454
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 290/2700 variables, and 290 constraints, problems are : Problem set: 2 solved, 288 unsolved in 5217 ms.
Refiners :[Domain max(s): 290/891 constraints, Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/891 constraints, ReadFeed: 0/932 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 288 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 288/288 constraints. Problems are: Problem set: 2 solved, 288 unsolved
SDD proceeding with computation,288 properties remain. new max is 2048
SDD size :454 after 2137
Invariant property smplace_649 does not hold.
SDD proceeding with computation,287 properties remain. new max is 2048
SDD size :2137 after 4032
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 0/288 constraints. Problems are: Problem set: 3 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 576/864 variables, 18/306 constraints. Problems are: Problem set: 3 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/864 variables, 576/882 constraints. Problems are: Problem set: 3 solved, 287 unsolved
SDD proceeding with computation,287 properties remain. new max is 4096
SDD size :4032 after 7561
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 864/2700 variables, and 882 constraints, problems are : Problem set: 3 solved, 287 unsolved in 5021 ms.
Refiners :[Domain max(s): 864/891 constraints, Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/891 constraints, ReadFeed: 0/932 constraints, PredecessorRefiner: 0/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10669ms problems are : Problem set: 3 solved, 287 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 287 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 891 transition count 3879
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 882 transition count 3879
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 18 place count 882 transition count 3699
Deduced a syphon composed of 180 places in 3 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 378 place count 702 transition count 3699
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 450 place count 630 transition count 3051
Iterating global reduction 2 with 72 rules applied. Total rules applied 522 place count 630 transition count 3051
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 8 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 658 place count 562 transition count 2983
Applied a total of 658 rules in 381 ms. Remains 562 /891 variables (removed 329) and now considering 2983/3888 (removed 905) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 562/891 places, 2983/3888 transitions.
Invariant property smplace_624 does not hold.
SDD proceeding with computation,286 properties remain. new max is 4096
SDD size :7561 after 9020
SDD proceeding with computation,286 properties remain. new max is 8192
SDD size :9020 after 44690
SDD proceeding with computation,286 properties remain. new max is 16384
SDD size :44690 after 72041
RANDOM walk for 4000000 steps (8 resets) in 105990 ms. (37 steps per ms) remains 275/287 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 275/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 274/275 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 273/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 272/273 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 272/272 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 272/272 properties
Invariant property smplace_650 does not hold.
Invariant property smplace_613 does not hold.
SDD proceeding with computation,284 properties remain. new max is 16384
SDD size :72041 after 134230
Invariant property smplace_631 does not hold.
Invariant property smplace_630 does not hold.
Invariant property smplace_622 does not hold.
SDD proceeding with computation,281 properties remain. new max is 16384
SDD size :134230 after 204563
Invariant property smplace_633 does not hold.
SDD proceeding with computation,280 properties remain. new max is 16384
SDD size :204563 after 707795
SDD proceeding with computation,280 properties remain. new max is 32768
SDD size :707795 after 1.21005e+06
Interrupted probabilistic random walk after 6688910 steps, run timeout after 93001 ms. (steps per millisecond=71 ) properties seen :253 out of 272
Probabilistic random walk after 6688910 steps, saw 2454484 distinct states, run finished after 93011 ms. (steps per millisecond=71 ) properties seen :253
[2025-05-31 02:22:08] [INFO ] Flow matrix only has 904 transitions (discarded 2079 similar events)
// Phase 1: matrix 904 rows 562 cols
[2025-05-31 02:22:08] [INFO ] Computed 28 invariants in 14 ms
[2025-05-31 02:22:08] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 459/476 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/492 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 804/1296 variables, 492/516 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1296 variables, 184/700 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1296 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 25/1321 variables, 9/709 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1321 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1321 variables, 86/796 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1321 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 24/1345 variables, 11/807 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1345 variables, 11/818 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1345 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 48/1393 variables, 2/820 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1393 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 2/1395 variables, 1/821 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1395 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 71/1466 variables, 50/871 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1466 variables, 75/946 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1466 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 0/1466 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1466/1466 variables, and 946 constraints, problems are : Problem set: 0 solved, 17 unsolved in 6932 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 562/562 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 459/476 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
SDD proceeding with computation,280 properties remain. new max is 65536
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/492 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :1.21005e+06 after 1.66109e+06
[2025-05-31 02:22:16] [INFO ] Deduced a trap composed of 3 places in 513 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:16] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:17] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:17] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:17] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:17] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:17] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:17] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:18] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:18] [INFO ] Deduced a trap composed of 15 places in 253 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:18] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:18] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:19] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:19] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:19] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:19] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:19] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:19] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:20] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:20] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:20] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:20] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:20] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:21] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:21] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:21] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:21] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:21] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:21] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 804/1296 variables, 492/545 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1296 variables, 184/729 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1296 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 25/1321 variables, 9/738 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1321 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1321 variables, 86/825 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1321 variables, 10/835 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1321 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 24/1345 variables, 11/846 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1345 variables, 11/857 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1345 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 48/1393 variables, 2/859 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1393 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 2/1395 variables, 1/860 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1395 variables, 7/867 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:22:33] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1395 variables, 1/868 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1395 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (OVERLAPS) 71/1466 variables, 50/918 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1466 variables, 75/993 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1466 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (OVERLAPS) 0/1466 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1466/1466 variables, and 993 constraints, problems are : Problem set: 0 solved, 17 unsolved in 24953 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 562/562 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31945ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 7 properties in 21343 ms.
Support contains 10 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 2983/2983 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 562 transition count 2911
Deduced a syphon composed of 72 places in 7 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 490 transition count 2911
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 26 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 152 place count 486 transition count 2907
Applied a total of 152 rules in 233 ms. Remains 486 /562 variables (removed 76) and now considering 2907/2983 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 486/562 places, 2907/2983 transitions.
SDD proceeding with computation,280 properties remain. new max is 131072
SDD size :1.66109e+06 after 2.67881e+06
RANDOM walk for 4000000 steps (8 resets) in 28438 ms. (140 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4458 ms. (897 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4627 ms. (864 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4603 ms. (868 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4480 ms. (892 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4541 ms. (880 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4489 ms. (890 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4633 ms. (863 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4523 ms. (884 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4712 ms. (848 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4530 ms. (882 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 4866170 steps, run timeout after 60001 ms. (steps per millisecond=81 ) properties seen :2 out of 10
Probabilistic random walk after 4866170 steps, saw 2038751 distinct states, run finished after 60001 ms. (steps per millisecond=81 ) properties seen :2
[2025-05-31 02:24:22] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-05-31 02:24:22] [INFO ] Computed 28 invariants in 8 ms
[2025-05-31 02:24:22] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 247/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 460/725 variables, 265/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 70/350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 73/798 variables, 9/359 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/798 variables, 53/413 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 96/894 variables, 44/457 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/894 variables, 32/489 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/894 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 160/1054 variables, 8/497 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1054 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 8/1062 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1062 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 252/1314 variables, 168/669 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 201/870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1857 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 247/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:25] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:25] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:25] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:25] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:25] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:25] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:25] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:25] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:26] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:26] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:26] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:26] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:26] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:26] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:24:26] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 460/725 variables, 265/295 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 70/365 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 73/798 variables, 9/374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/798 variables, 53/428 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/798 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/798 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 96/894 variables, 44/479 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/894 variables, 32/511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/894 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 160/1054 variables, 8/519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1054 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 8/1062 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1062 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1062 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 252/1314 variables, 168/692 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 201/893 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 893 constraints, problems are : Problem set: 0 solved, 8 unsolved in 7151 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9042ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 4154 ms.
Support contains 8 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 99 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 4000000 steps (8 resets) in 28309 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4289 ms. (932 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4322 ms. (925 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4554 ms. (878 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4524 ms. (883 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4571 ms. (874 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4512 ms. (886 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4406 ms. (907 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4380 ms. (913 steps per ms) remains 8/8 properties
Invariant property smplace_651 does not hold.
Invariant property smplace_640 does not hold.
Invariant property smplace_639 does not hold.
Invariant property smplace_623 does not hold.
Invariant property smplace_614 does not hold.
SDD proceeding with computation,275 properties remain. new max is 131072
SDD size :2.67881e+06 after 4.38733e+06
Interrupted probabilistic random walk after 3310800 steps, run timeout after 51001 ms. (steps per millisecond=64 ) properties seen :0 out of 8
Probabilistic random walk after 3310800 steps, saw 1546630 distinct states, run finished after 51001 ms. (steps per millisecond=64 ) properties seen :0
[2025-05-31 02:25:44] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:25:44] [INFO ] Invariant cache hit.
[2025-05-31 02:25:44] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 247/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 460/725 variables, 265/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 70/350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 73/798 variables, 9/359 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/798 variables, 53/413 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 96/894 variables, 44/457 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/894 variables, 32/489 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/894 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 160/1054 variables, 8/497 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1054 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 8/1062 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1062 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 252/1314 variables, 168/669 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 201/870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1433 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 247/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:46] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:46] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:46] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:46] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:46] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:47] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:47] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:47] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:47] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:47] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:47] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:47] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:47] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:47] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 460/725 variables, 265/294 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 70/364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:25:48] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 73/798 variables, 9/374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/798 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/798 variables, 53/428 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/798 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/798 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 96/894 variables, 44/479 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/894 variables, 32/511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/894 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 160/1054 variables, 8/519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1054 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 8/1062 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1062 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1062 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 252/1314 variables, 168/692 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 201/893 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1314 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 0/1314 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 893 constraints, problems are : Problem set: 0 solved, 8 unsolved in 7139 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8590ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 5168 ms.
Support contains 8 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 100 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 166 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-05-31 02:25:58] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:25:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:25:59] [INFO ] Implicit Places using invariants in 860 ms returned []
[2025-05-31 02:25:59] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:25:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:25:59] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 02:26:02] [INFO ] Implicit Places using invariants and state equation in 3254 ms returned []
Implicit Place search using SMT with State Equation took 4127 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:26:02] [INFO ] Redundant transitions in 193 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-05-31 02:26:02] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:26:02] [INFO ] Invariant cache hit.
[2025-05-31 02:26:02] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:29] [INFO ] Deduced a trap composed of 3 places in 337 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:30] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:30] [INFO ] Deduced a trap composed of 19 places in 319 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:30] [INFO ] Deduced a trap composed of 29 places in 331 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:31] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:31] [INFO ] Deduced a trap composed of 33 places in 289 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:31] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:32] [INFO ] Deduced a trap composed of 35 places in 277 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:32] [INFO ] Deduced a trap composed of 39 places in 285 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:32] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:33] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:33] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:33] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 41 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:37] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:37] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:37] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:38] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:39] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:40] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:40] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:40] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:40] [INFO ] Deduced a trap composed of 47 places in 271 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:41] [INFO ] Deduced a trap composed of 69 places in 281 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:41] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:42] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:42] [INFO ] Deduced a trap composed of 47 places in 291 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:42] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:43] [INFO ] Deduced a trap composed of 47 places in 292 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:43] [INFO ] Deduced a trap composed of 47 places in 319 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:44] [INFO ] Deduced a trap composed of 47 places in 305 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:44] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:44] [INFO ] Deduced a trap composed of 69 places in 221 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:44] [INFO ] Deduced a trap composed of 47 places in 252 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:47] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:48] [INFO ] Deduced a trap composed of 47 places in 248 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:49] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:51] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:52] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:52] [INFO ] Deduced a trap composed of 77 places in 242 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:53] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:53] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:54] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:58] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:26:58] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:01] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:02] [INFO ] Deduced a trap composed of 69 places in 247 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:03] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:03] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 76 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61327ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 61345ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65857 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 400000 steps (8 resets) in 5381 ms. (74 steps per ms) remains 8/8 properties
Running SMT prover for 8 properties.
[2025-05-31 02:27:05] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:27:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:27:06] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2025-05-31 02:27:06] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2025-05-31 02:27:06] [INFO ] After 240ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
[2025-05-31 02:27:06] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 02:27:06] [INFO ] After 103ms SMT Verify possible using 356 Read/Feed constraints in real domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2025-05-31 02:27:06] [INFO ] After 565ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2025-05-31 02:27:06] [INFO ] After 1029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:27:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-05-31 02:27:07] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-05-31 02:27:07] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2025-05-31 02:27:07] [INFO ] After 133ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:07] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:07] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:07] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2025-05-31 02:27:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 351 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:07] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:08] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2025-05-31 02:27:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:08] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:08] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 5 ms to minimize.
[2025-05-31 02:27:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:08] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:08] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 6 ms to minimize.
[2025-05-31 02:27:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:09] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 3 ms to minimize.
[2025-05-31 02:27:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:09] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 4 ms to minimize.
[2025-05-31 02:27:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:09] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 8 ms to minimize.
[2025-05-31 02:27:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:10] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 5 ms to minimize.
[2025-05-31 02:27:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:27:10] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 4 ms to minimize.
[2025-05-31 02:27:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
TRAPS : Iteration 3
[2025-05-31 02:27:11] [INFO ] After 3802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2025-05-31 02:27:11] [INFO ] After 4214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
RANDOM walk for 4000000 steps (8 resets) in 26158 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4583 ms. (872 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4339 ms. (921 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4687 ms. (853 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4216 ms. (948 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4580 ms. (873 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4475 ms. (893 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4421 ms. (904 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4658 ms. (858 steps per ms) remains 8/8 properties
Invariant property smplace_641 does not hold.
Invariant property smplace_632 does not hold.
Interrupted probabilistic random walk after 3838740 steps, run timeout after 51001 ms. (steps per millisecond=75 ) properties seen :0 out of 8
Probabilistic random walk after 3838740 steps, saw 1746260 distinct states, run finished after 51001 ms. (steps per millisecond=75 ) properties seen :0
[2025-05-31 02:28:19] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:28:19] [INFO ] Invariant cache hit.
[2025-05-31 02:28:19] [INFO ] State equation strengthened by 356 read => feed constraints.
SDD proceeding with computation,273 properties remain. new max is 131072
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 247/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 460/725 variables, 265/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 70/350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 73/798 variables, 9/359 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/798 variables, 53/413 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD size :4.38733e+06 after 6.50701e+06
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 96/894 variables, 44/457 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/894 variables, 32/489 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/894 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 160/1054 variables, 8/497 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1054 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 8/1062 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1062 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 252/1314 variables, 168/669 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 201/870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1478 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 247/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:21] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:21] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:21] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:21] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:21] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:21] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:21] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:22] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:22] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:22] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:22] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:22] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:22] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:22] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 460/725 variables, 265/294 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 70/364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:28:23] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 73/798 variables, 9/374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/798 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/798 variables, 53/428 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/798 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/798 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 96/894 variables, 44/479 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/894 variables, 32/511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/894 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 160/1054 variables, 8/519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1054 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 8/1062 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1062 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1062 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 252/1314 variables, 168/692 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 201/893 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1314 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 0/1314 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 893 constraints, problems are : Problem set: 0 solved, 8 unsolved in 7134 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8629ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 5762 ms.
Support contains 8 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 108 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 86 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-05-31 02:28:33] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:28:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:28:34] [INFO ] Implicit Places using invariants in 748 ms returned []
[2025-05-31 02:28:34] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:28:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:28:34] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 02:28:37] [INFO ] Implicit Places using invariants and state equation in 3332 ms returned []
Implicit Place search using SMT with State Equation took 4087 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:28:38] [INFO ] Redundant transitions in 160 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-05-31 02:28:38] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:28:38] [INFO ] Invariant cache hit.
[2025-05-31 02:28:38] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:04] [INFO ] Deduced a trap composed of 3 places in 634 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:05] [INFO ] Deduced a trap composed of 3 places in 623 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:06] [INFO ] Deduced a trap composed of 19 places in 589 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:06] [INFO ] Deduced a trap composed of 29 places in 543 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:07] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:07] [INFO ] Deduced a trap composed of 33 places in 534 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:08] [INFO ] Deduced a trap composed of 23 places in 518 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:08] [INFO ] Deduced a trap composed of 35 places in 287 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:08] [INFO ] Deduced a trap composed of 39 places in 290 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:09] [INFO ] Deduced a trap composed of 65 places in 286 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:09] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 22 ms to minimize.
SMT process timed out in 31191ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 31200ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35585 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 400000 steps (8 resets) in 3832 ms. (104 steps per ms) remains 8/8 properties
Running SMT prover for 8 properties.
[2025-05-31 02:29:10] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:29:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:29:10] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-05-31 02:29:10] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2025-05-31 02:29:10] [INFO ] After 193ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
[2025-05-31 02:29:10] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 02:29:10] [INFO ] After 96ms SMT Verify possible using 356 Read/Feed constraints in real domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2025-05-31 02:29:11] [INFO ] After 515ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2025-05-31 02:29:11] [INFO ] After 808ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:29:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-05-31 02:29:11] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2025-05-31 02:29:11] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2025-05-31 02:29:11] [INFO ] After 126ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:11] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:11] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:12] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2025-05-31 02:29:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 351 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:12] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:12] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 3 ms to minimize.
[2025-05-31 02:29:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:12] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:12] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 5 ms to minimize.
[2025-05-31 02:29:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:12] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:13] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 6 ms to minimize.
[2025-05-31 02:29:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:13] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 3 ms to minimize.
[2025-05-31 02:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:13] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 4 ms to minimize.
[2025-05-31 02:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:14] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 8 ms to minimize.
[2025-05-31 02:29:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:14] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 5 ms to minimize.
[2025-05-31 02:29:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:15] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 10 ms to minimize.
[2025-05-31 02:29:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
TRAPS : Iteration 3
[2025-05-31 02:29:15] [INFO ] After 3946ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2025-05-31 02:29:15] [INFO ] After 4299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
RANDOM walk for 40000 steps (8 resets) in 225 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 405980 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 1
Probabilistic random walk after 405980 steps, saw 248982 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2025-05-31 02:29:18] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:29:18] [INFO ] Invariant cache hit.
[2025-05-31 02:29:18] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 313/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:19] [INFO ] Deduced a trap composed of 65 places in 387 ms of which 49 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 313/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:20] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 10 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1843ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 118 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 411940 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 1
Probabilistic random walk after 411940 steps, saw 252306 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2025-05-31 02:29:23] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:29:23] [INFO ] Invariant cache hit.
[2025-05-31 02:29:23] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 313/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:24] [INFO ] Deduced a trap composed of 65 places in 377 ms of which 48 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 313/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:25] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 10 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1326 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1783ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 97 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 96 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-05-31 02:29:25] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:29:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:29:26] [INFO ] Implicit Places using invariants in 751 ms returned []
[2025-05-31 02:29:26] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:29:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:29:27] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 02:29:30] [INFO ] Implicit Places using invariants and state equation in 3474 ms returned []
Implicit Place search using SMT with State Equation took 4230 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:29:30] [INFO ] Redundant transitions in 79 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-05-31 02:29:30] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:29:30] [INFO ] Invariant cache hit.
[2025-05-31 02:29:30] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Invariant property smplace_642 does not hold.
Detected timeout of ITS tools.
[2025-05-31 02:29:54] [INFO ] Flatten gal took : 113 ms
[2025-05-31 02:29:54] [INFO ] Applying decomposition
[2025-05-31 02:29:54] [INFO ] Flatten gal took : 107 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1553543783912561693.txt' '-o' '/tmp/graph1553543783912561693.bin' '-w' '/tmp/graph1553543783912561693.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1553543783912561693.bin' '-l' '-1' '-v' '-w' '/tmp/graph1553543783912561693.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:29:54] [INFO ] Decomposing Gal with order
[2025-05-31 02:29:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:29:55] [INFO ] Removed a total of 7864 redundant transitions.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-05-31 02:29:55] [INFO ] Flatten gal took : 589 ms
[2025-05-31 02:29:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 416 labels/synchronizations in 151 ms.
[2025-05-31 02:29:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14128884286816371824.gal : 47 ms
[2025-05-31 02:29:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9842524764320028659.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14128884286816371824.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9842524764320028659.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality9842524764320028659.prop.
[2025-05-31 02:29:56] [INFO ] Deduced a trap composed of 3 places in 308 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :1 after 4
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :4 after 32
[2025-05-31 02:29:57] [INFO ] Deduced a trap composed of 3 places in 319 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:57] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:57] [INFO ] Deduced a trap composed of 29 places in 291 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:58] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:58] [INFO ] Deduced a trap composed of 33 places in 304 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:58] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:59] [INFO ] Deduced a trap composed of 35 places in 327 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:59] [INFO ] Deduced a trap composed of 39 places in 298 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:29:59] [INFO ] Deduced a trap composed of 65 places in 297 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:00] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:00] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:00] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 41 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :32 after 19683
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:04] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:04] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:04] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:05] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:06] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:06] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:07] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:07] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:07] [INFO ] Deduced a trap composed of 47 places in 265 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:08] [INFO ] Deduced a trap composed of 69 places in 251 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:08] [INFO ] Deduced a trap composed of 47 places in 291 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:08] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:09] [INFO ] Deduced a trap composed of 47 places in 252 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:09] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:09] [INFO ] Deduced a trap composed of 47 places in 275 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:10] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:10] [INFO ] Deduced a trap composed of 47 places in 320 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:10] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:11] [INFO ] Deduced a trap composed of 69 places in 269 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:11] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:14] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:15] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:16] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:18] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:19] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:19] [INFO ] Deduced a trap composed of 77 places in 224 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:20] [INFO ] Deduced a trap composed of 69 places in 205 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:20] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:21] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:25] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:25] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:28] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:29] [INFO ] Deduced a trap composed of 69 places in 241 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:30] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:30] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 76 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61096ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 61103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65525 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 3 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 64 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-05-31 02:30:31] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:30:31] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:30:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2025-05-31 02:30:31] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 02:30:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 02:30:31] [INFO ] After 7ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 02:30:31] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 02:30:31] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 181 ms.
RANDOM walk for 40000 steps (8 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 428940 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 428940 steps, saw 261686 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
[2025-05-31 02:30:34] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-05-31 02:30:34] [INFO ] Computed 28 invariants in 10 ms
[2025-05-31 02:30:34] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:35] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:35] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1279ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 132 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 435050 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 1
Probabilistic random walk after 435050 steps, saw 264705 distinct states, run finished after 3003 ms. (steps per millisecond=144 ) properties seen :0
[2025-05-31 02:30:39] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:30:39] [INFO ] Invariant cache hit.
[2025-05-31 02:30:39] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:39] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:40] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:40] [INFO ] Deduced a trap composed of 52 places in 378 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:41] [INFO ] Deduced a trap composed of 64 places in 347 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:41] [INFO ] Deduced a trap composed of 87 places in 302 ms of which 40 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:41] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:30:42] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 5 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 2/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 878 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2686 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3129ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 113 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 90 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-05-31 02:30:42] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:30:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:30:43] [INFO ] Implicit Places using invariants in 670 ms returned []
[2025-05-31 02:30:43] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:30:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:30:43] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 02:30:46] [INFO ] Implicit Places using invariants and state equation in 3217 ms returned []
Implicit Place search using SMT with State Equation took 3893 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:30:46] [INFO ] Redundant transitions in 82 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-05-31 02:30:46] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:30:46] [INFO ] Invariant cache hit.
[2025-05-31 02:30:46] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:31:13] [INFO ] Deduced a trap composed of 3 places in 597 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:31:14] [INFO ] Deduced a trap composed of 3 places in 595 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:31:14] [INFO ] Deduced a trap composed of 19 places in 379 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:31:14] [INFO ] Deduced a trap composed of 29 places in 321 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:31:15] [INFO ] Deduced a trap composed of 31 places in 546 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:31:16] [INFO ] Deduced a trap composed of 33 places in 550 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:31:16] [INFO ] Deduced a trap composed of 23 places in 346 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:31:18] [INFO ] Deduced a trap composed of 35 places in 1511 ms of which 31 ms to minimize.
SMT process timed out in 31474ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 31481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35563 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 55 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-05-31 02:31:18] [INFO ] Computed 19 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:31:18] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:31:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 155 ms returned sat
[2025-05-31 02:31:18] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 02:31:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 02:31:18] [INFO ] After 11ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 02:31:18] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 02:31:18] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 609 ms.
RANDOM walk for 40000 steps (8 resets) in 304 ms. (131 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 423610 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 1
Probabilistic random walk after 423610 steps, saw 258893 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
[2025-05-31 02:31:21] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-05-31 02:31:21] [INFO ] Computed 28 invariants in 3 ms
[2025-05-31 02:31:21] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:31:22] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1534ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 186 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 532 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 404520 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 1
Probabilistic random walk after 404520 steps, saw 248155 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
[2025-05-31 02:31:26] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:31:26] [INFO ] Invariant cache hit.
[2025-05-31 02:31:26] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 872 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1312ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 129 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 109 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 112 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-05-31 02:31:28] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:31:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:31:29] [INFO ] Implicit Places using invariants in 1341 ms returned []
[2025-05-31 02:31:29] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:31:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:31:31] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 02:31:35] [INFO ] Implicit Places using invariants and state equation in 5571 ms returned []
Implicit Place search using SMT with State Equation took 6925 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:31:35] [INFO ] Redundant transitions in 78 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-05-31 02:31:35] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:31:35] [INFO ] Invariant cache hit.
[2025-05-31 02:31:35] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 28 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:09] [INFO ] Deduced a trap composed of 3 places in 609 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:10] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:10] [INFO ] Deduced a trap composed of 29 places in 289 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:10] [INFO ] Deduced a trap composed of 30 places in 271 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:10] [INFO ] Deduced a trap composed of 3 places in 225 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:11] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:11] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:11] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:11] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:12] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:12] [INFO ] Deduced a trap composed of 69 places in 208 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:14] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:14] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:14] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:14] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:14] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:15] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:15] [INFO ] Deduced a trap composed of 47 places in 245 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:15] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:16] [INFO ] Deduced a trap composed of 47 places in 264 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:19] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:21] [INFO ] Deduced a trap composed of 47 places in 236 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:21] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:22] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:23] [INFO ] Deduced a trap composed of 47 places in 304 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:23] [INFO ] Deduced a trap composed of 52 places in 269 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:24] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:24] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:24] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:24] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:25] [INFO ] Deduced a trap composed of 69 places in 240 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:26] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:26] [INFO ] Deduced a trap composed of 75 places in 257 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:27] [INFO ] Deduced a trap composed of 77 places in 260 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:27] [INFO ] Deduced a trap composed of 69 places in 304 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:28] [INFO ] Deduced a trap composed of 75 places in 278 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:30] [INFO ] Deduced a trap composed of 77 places in 259 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:30] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:32] [INFO ] Deduced a trap composed of 47 places in 265 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:32] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 68 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61202ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 61207ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68348 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 5 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 35 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-05-31 02:32:36] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:32:36] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:32:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2025-05-31 02:32:37] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 02:32:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 02:32:37] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 02:32:37] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 02:32:37] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 163 ms.
RANDOM walk for 40000 steps (8 resets) in 342 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 425120 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 1
Probabilistic random walk after 425120 steps, saw 259703 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
[2025-05-31 02:32:40] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-05-31 02:32:40] [INFO ] Computed 28 invariants in 6 ms
[2025-05-31 02:32:40] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:32:40] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 741 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1225ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 88 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 318 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 432320 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 1
Probabilistic random walk after 432320 steps, saw 263301 distinct states, run finished after 3003 ms. (steps per millisecond=143 ) properties seen :0
[2025-05-31 02:32:44] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:32:44] [INFO ] Invariant cache hit.
[2025-05-31 02:32:44] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1118ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 80 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-05-31 02:32:46] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:32:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:32:46] [INFO ] Implicit Places using invariants in 744 ms returned []
[2025-05-31 02:32:46] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:32:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:32:47] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 02:32:50] [INFO ] Implicit Places using invariants and state equation in 3360 ms returned []
Implicit Place search using SMT with State Equation took 4107 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:32:50] [INFO ] Redundant transitions in 78 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-05-31 02:32:50] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:32:50] [INFO ] Invariant cache hit.
[2025-05-31 02:32:50] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:16] [INFO ] Deduced a trap composed of 3 places in 342 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:16] [INFO ] Deduced a trap composed of 3 places in 354 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:17] [INFO ] Deduced a trap composed of 19 places in 355 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:17] [INFO ] Deduced a trap composed of 29 places in 311 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:17] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:18] [INFO ] Deduced a trap composed of 33 places in 302 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:18] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:18] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:19] [INFO ] Deduced a trap composed of 39 places in 285 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:19] [INFO ] Deduced a trap composed of 65 places in 308 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:19] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:19] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:20] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 41 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:24] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:24] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:25] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:25] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:26] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:26] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:27] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:27] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:27] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:28] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:28] [INFO ] Deduced a trap composed of 47 places in 272 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:28] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:29] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:29] [INFO ] Deduced a trap composed of 47 places in 287 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:29] [INFO ] Deduced a trap composed of 47 places in 283 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:30] [INFO ] Deduced a trap composed of 47 places in 289 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:30] [INFO ] Deduced a trap composed of 47 places in 282 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:30] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:31] [INFO ] Deduced a trap composed of 69 places in 234 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:31] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:34] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:35] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:36] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:38] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:39] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:39] [INFO ] Deduced a trap composed of 77 places in 215 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:40] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:40] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:41] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:45] [INFO ] Deduced a trap composed of 52 places in 205 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:45] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:49] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:49] [INFO ] Deduced a trap composed of 69 places in 246 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:50] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:50] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 76 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61144ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 61150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65433 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 30 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-05-31 02:33:51] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:33:51] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:33:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2025-05-31 02:33:51] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 02:33:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 02:33:51] [INFO ] After 6ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 02:33:51] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 02:33:51] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 145 ms.
RANDOM walk for 40000 steps (8 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 414750 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 1
Probabilistic random walk after 414750 steps, saw 253935 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
[2025-05-31 02:33:54] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-05-31 02:33:54] [INFO ] Computed 28 invariants in 7 ms
[2025-05-31 02:33:54] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:55] [INFO ] Deduced a trap composed of 65 places in 409 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:56] [INFO ] Deduced a trap composed of 85 places in 325 ms of which 42 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:33:56] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1630 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2043ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 87 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 284 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 434850 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 1
Probabilistic random walk after 434850 steps, saw 264625 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2025-05-31 02:34:00] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:34:00] [INFO ] Invariant cache hit.
[2025-05-31 02:34:00] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:00] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:01] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1343ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 95 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 80 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-05-31 02:34:01] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:34:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:34:02] [INFO ] Implicit Places using invariants in 670 ms returned []
[2025-05-31 02:34:02] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:34:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:34:02] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 02:34:05] [INFO ] Implicit Places using invariants and state equation in 3214 ms returned []
Implicit Place search using SMT with State Equation took 3890 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:34:05] [INFO ] Redundant transitions in 81 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-05-31 02:34:05] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:34:05] [INFO ] Invariant cache hit.
[2025-05-31 02:34:05] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:31] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:31] [INFO ] Deduced a trap composed of 3 places in 345 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:32] [INFO ] Deduced a trap composed of 19 places in 327 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:32] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:32] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:33] [INFO ] Deduced a trap composed of 33 places in 293 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:33] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:33] [INFO ] Deduced a trap composed of 35 places in 287 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:34] [INFO ] Deduced a trap composed of 39 places in 289 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:34] [INFO ] Deduced a trap composed of 65 places in 293 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:34] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:35] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:35] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 41 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:39] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:40] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:40] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:41] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:42] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:42] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:43] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:43] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:43] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:43] [INFO ] Deduced a trap composed of 69 places in 256 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:44] [INFO ] Deduced a trap composed of 47 places in 259 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:44] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:44] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:45] [INFO ] Deduced a trap composed of 47 places in 274 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:45] [INFO ] Deduced a trap composed of 47 places in 299 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:46] [INFO ] Deduced a trap composed of 47 places in 286 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:46] [INFO ] Deduced a trap composed of 47 places in 365 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:46] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:47] [INFO ] Deduced a trap composed of 69 places in 222 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:47] [INFO ] Deduced a trap composed of 47 places in 304 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:50] [INFO ] Deduced a trap composed of 47 places in 241 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:50] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:52] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:54] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:55] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:55] [INFO ] Deduced a trap composed of 77 places in 216 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:55] [INFO ] Deduced a trap composed of 69 places in 202 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:56] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:34:57] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:01] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:01] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:05] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:06] [INFO ] Deduced a trap composed of 69 places in 242 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:06] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 17 ms to minimize.
SMT process timed out in 61299ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 61305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65373 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 35 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-05-31 02:35:06] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:35:06] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:35:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2025-05-31 02:35:07] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 02:35:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 02:35:07] [INFO ] After 6ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 02:35:07] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 02:35:07] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 188 ms.
RANDOM walk for 40000 steps (8 resets) in 309 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 420110 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 1
Probabilistic random walk after 420110 steps, saw 256983 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
[2025-05-31 02:35:10] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-05-31 02:35:10] [INFO ] Computed 28 invariants in 10 ms
[2025-05-31 02:35:10] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 503 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1151ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 412290 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 1
Probabilistic random walk after 412290 steps, saw 252495 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2025-05-31 02:35:14] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:35:14] [INFO ] Invariant cache hit.
[2025-05-31 02:35:14] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1072ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 87 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 84 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-05-31 02:35:15] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:35:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:35:16] [INFO ] Implicit Places using invariants in 733 ms returned []
[2025-05-31 02:35:16] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:35:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:35:17] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 02:35:19] [INFO ] Implicit Places using invariants and state equation in 3209 ms returned []
Implicit Place search using SMT with State Equation took 3947 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:35:20] [INFO ] Redundant transitions in 78 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-05-31 02:35:20] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:35:20] [INFO ] Invariant cache hit.
[2025-05-31 02:35:20] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:45] [INFO ] Deduced a trap composed of 3 places in 330 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:45] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:45] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:46] [INFO ] Deduced a trap composed of 29 places in 301 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:46] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:46] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:47] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:47] [INFO ] Deduced a trap composed of 35 places in 256 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:47] [INFO ] Deduced a trap composed of 39 places in 268 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:47] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:48] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:48] [INFO ] Deduced a trap composed of 27 places in 379 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:48] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:50] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:50] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:51] [INFO ] Deduced a trap composed of 47 places in 241 ms of which 33 ms to minimize.
SMT process timed out in 31195ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 31201ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35329 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 37 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-05-31 02:35:51] [INFO ] Computed 19 invariants in 8 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:35:51] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:35:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2025-05-31 02:35:51] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 02:35:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 02:35:51] [INFO ] After 6ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:51] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
[2025-05-31 02:35:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
TRAPS : Iteration 1
[2025-05-31 02:35:51] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 02:35:51] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 208 ms.
RANDOM walk for 40000 steps (8 resets) in 304 ms. (131 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 406520 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 1
Probabilistic random walk after 406520 steps, saw 249209 distinct states, run finished after 3003 ms. (steps per millisecond=135 ) properties seen :0
[2025-05-31 02:35:54] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-05-31 02:35:54] [INFO ] Computed 28 invariants in 10 ms
[2025-05-31 02:35:54] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:55] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:55] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:55] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 971 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1400ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 93 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 435300 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 1
Probabilistic random walk after 435300 steps, saw 264801 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
[2025-05-31 02:35:59] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:35:59] [INFO ] Invariant cache hit.
[2025-05-31 02:35:59] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:59] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:00] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1296ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 84 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 106 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-05-31 02:36:00] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:36:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:36:01] [INFO ] Implicit Places using invariants in 714 ms returned []
[2025-05-31 02:36:01] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:36:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:36:01] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 02:36:04] [INFO ] Implicit Places using invariants and state equation in 3175 ms returned []
Implicit Place search using SMT with State Equation took 3894 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:36:04] [INFO ] Redundant transitions in 78 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-05-31 02:36:04] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:36:04] [INFO ] Invariant cache hit.
[2025-05-31 02:36:04] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:29] [INFO ] Deduced a trap composed of 3 places in 316 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:30] [INFO ] Deduced a trap composed of 3 places in 324 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:30] [INFO ] Deduced a trap composed of 19 places in 310 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:30] [INFO ] Deduced a trap composed of 29 places in 439 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:31] [INFO ] Deduced a trap composed of 31 places in 524 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:31] [INFO ] Deduced a trap composed of 33 places in 550 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:32] [INFO ] Deduced a trap composed of 23 places in 527 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:33] [INFO ] Deduced a trap composed of 35 places in 496 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:37] [INFO ] Deduced a trap composed of 39 places in 4339 ms of which 33 ms to minimize.
SMT process timed out in 32639ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32645ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36735 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 49 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-05-31 02:36:37] [INFO ] Computed 19 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:36:37] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:36:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2025-05-31 02:36:37] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 02:36:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 02:36:37] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 02:36:37] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 02:36:37] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 295 ms.
RANDOM walk for 40000 steps (8 resets) in 376 ms. (106 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 414190 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 1
Probabilistic random walk after 414190 steps, saw 253683 distinct states, run finished after 3003 ms. (steps per millisecond=137 ) properties seen :0
[2025-05-31 02:36:40] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-05-31 02:36:40] [INFO ] Computed 28 invariants in 2 ms
[2025-05-31 02:36:40] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1165ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 112 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 409910 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 409910 steps, saw 251232 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2025-05-31 02:36:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 02:36:45] [INFO ] Invariant cache hit.
[2025-05-31 02:36:45] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:46] [INFO ] Deduced a trap composed of 65 places in 358 ms of which 45 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:46] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1154 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1621ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 48 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 9 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2711 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 516 place count 152 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 588 place count 152 transition count 287
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 606 place count 143 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 615 place count 143 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 624 place count 143 transition count 269
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 696 place count 143 transition count 197
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 768 place count 71 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 777 place count 71 transition count 197
Applied a total of 777 rules in 25 ms. Remains 71 /486 variables (removed 415) and now considering 197/2907 (removed 2710) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 197 rows 71 cols
[2025-05-31 02:36:46] [INFO ] Computed 19 invariants in 6 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:36:47] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:36:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2025-05-31 02:36:47] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2025-05-31 02:36:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 02:36:47] [INFO ] After 42ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2025-05-31 02:36:47] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2025-05-31 02:36:47] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2025-05-31 02:36:47] [INFO ] Flatten gal took : 8 ms
[2025-05-31 02:36:47] [INFO ] Flatten gal took : 5 ms
[2025-05-31 02:36:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15037743626086113049.gal : 2 ms
[2025-05-31 02:36:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2105015265142574606.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15037743626086113049.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2105015265142574606.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2105015265142574606.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 16
Invariant property smplace_800 does not hold.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :16 after 60
Invariant property smplace_811 does not hold.
Invariant property smplace_810 does not hold.
Invariant property smplace_801 does not hold.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :60 after 300
Invariant property smplace_821 does not hold.
Invariant property smplace_820 does not hold.
Invariant property smplace_819 does not hold.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :300 after 1470
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1470 after 1494
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1494 after 1542
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1542 after 1670
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1670 after 2170
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2170 after 2630
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2630 after 18060
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6.804e+07,0.047637,6112,2,448,22,5832,7,0,485,3762,0
Total reachable state count : 68040000

Verifying 8 reachability properties.
Invariant property smplace_800 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_800,8,0.048205,6112,2,77,22,5832,8,0,488,3762,0
Invariant property smplace_801 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_801,12,0.048441,6112,2,90,22,5832,9,0,490,3762,0
Invariant property smplace_810 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_810,36,0.048537,6112,2,114,22,5832,10,0,492,3762,0
Invariant property smplace_811 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_811,36,0.048774,6112,2,114,22,5832,11,0,494,3762,0
Invariant property smplace_819 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_819,252,0.048932,6112,2,178,22,5832,12,0,496,3762,0
Invariant property smplace_820 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_820,252,0.049092,6112,2,178,22,5832,13,0,498,3762,0
Invariant property smplace_821 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_821,252,0.049251,6112,2,178,22,5832,14,0,500,3762,0
Invariant property smplace_831 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_831,8064,0.049425,6112,2,276,22,5832,14,0,501,3762,0
Over-approximation ignoring read arcs solved 0 properties in 422 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 02:36:48] [INFO ] Flatten gal took : 74 ms
[2025-05-31 02:36:48] [INFO ] Flatten gal took : 75 ms
[2025-05-31 02:36:48] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10577181218379445128.gal : 11 ms
[2025-05-31 02:36:48] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7813429467358915963.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10577181218379445128.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7813429467358915963.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability7813429467358915963.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :8 after 23
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :23 after 30
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :30 after 60
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :60 after 91
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :91 after 288
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :288 after 415
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :415 after 1330
Detected timeout of ITS tools.
[2025-05-31 02:36:51] [INFO ] Flatten gal took : 90 ms
[2025-05-31 02:36:51] [INFO ] Applying decomposition
[2025-05-31 02:36:51] [INFO ] Flatten gal took : 67 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10704987573367617259.txt' '-o' '/tmp/graph10704987573367617259.bin' '-w' '/tmp/graph10704987573367617259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10704987573367617259.bin' '-l' '-1' '-v' '-w' '/tmp/graph10704987573367617259.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:36:51] [INFO ] Decomposing Gal with order
[2025-05-31 02:36:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:36:52] [INFO ] Removed a total of 6298 redundant transitions.
[2025-05-31 02:36:52] [INFO ] Flatten gal took : 554 ms
[2025-05-31 02:36:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 583 labels/synchronizations in 111 ms.
[2025-05-31 02:36:52] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4648954272103989568.gal : 12 ms
[2025-05-31 02:36:52] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8453401066417379311.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4648954272103989568.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8453401066417379311.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability8453401066417379311.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 68824
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :68824 after 72643
Detected timeout of ITS tools.
[2025-05-31 02:36:55] [INFO ] Flatten gal took : 65 ms
[2025-05-31 02:36:55] [INFO ] Flatten gal took : 102 ms
[2025-05-31 02:36:55] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13186531913477549945.gal : 10 ms
[2025-05-31 02:36:55] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9832950436576602855.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability13186531913477549945.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9832950436576602855.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability9832950436576602855.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :8 after 23
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :23 after 30
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :30 after 60
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :60 after 91
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :91 after 288
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :288 after 415
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :415 after 1330
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :1330 after 5100
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :5100 after 13728
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :13728 after 54523
Detected timeout of ITS tools.
[2025-05-31 02:37:25] [INFO ] Flatten gal took : 83 ms
[2025-05-31 02:37:25] [INFO ] Applying decomposition
[2025-05-31 02:37:25] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3332059630696340843.txt' '-o' '/tmp/graph3332059630696340843.bin' '-w' '/tmp/graph3332059630696340843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3332059630696340843.bin' '-l' '-1' '-v' '-w' '/tmp/graph3332059630696340843.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:37:26] [INFO ] Decomposing Gal with order
[2025-05-31 02:37:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:37:26] [INFO ] Removed a total of 6288 redundant transitions.
[2025-05-31 02:37:26] [INFO ] Flatten gal took : 190 ms
[2025-05-31 02:37:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 744 labels/synchronizations in 82 ms.
[2025-05-31 02:37:26] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13264841614364866498.gal : 12 ms
[2025-05-31 02:37:26] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10635573650854003148.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability13264841614364866498.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10635573650854003148.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityFireability10635573650854003148.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 60
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :60 after 833
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :833 after 215662
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :215662 after 889482
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :889482 after 889592
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :889592 after 985475
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :985475 after 1.77519e+06
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1.77519e+06 after 1.5539e+07
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1.5539e+07 after 2.01797e+07
Detected timeout of ITS tools.
[2025-05-31 02:37:56] [INFO ] Flatten gal took : 69 ms
[2025-05-31 02:37:56] [INFO ] Flatten gal took : 84 ms
[2025-05-31 02:37:56] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9637233982014695638.gal : 10 ms
[2025-05-31 02:37:56] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8061825878576982602.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability9637233982014695638.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8061825878576982602.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityFireability8061825878576982602.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :8 after 23
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :23 after 30
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :30 after 60
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :60 after 91
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :91 after 288
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :288 after 415
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :415 after 1330
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :1330 after 5100
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :5100 after 13728
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :13728 after 54523
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :54523 after 99778
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :99778 after 270709
SDD proceeding with computation,8 properties remain. new max is 131072
SDD size :270709 after 1.32677e+06
Detected timeout of ITS tools.
[2025-05-31 02:42:56] [INFO ] Flatten gal took : 66 ms
[2025-05-31 02:42:56] [INFO ] Applying decomposition
[2025-05-31 02:42:57] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17439518192640586302.txt' '-o' '/tmp/graph17439518192640586302.bin' '-w' '/tmp/graph17439518192640586302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17439518192640586302.bin' '-l' '-1' '-v' '-w' '/tmp/graph17439518192640586302.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:42:57] [INFO ] Decomposing Gal with order
[2025-05-31 02:42:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:42:57] [INFO ] Removed a total of 6317 redundant transitions.
[2025-05-31 02:42:57] [INFO ] Flatten gal took : 259 ms
[2025-05-31 02:42:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 638 labels/synchronizations in 52 ms.
[2025-05-31 02:42:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability442086526072387614.gal : 46 ms
[2025-05-31 02:42:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9686414548246768328.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability442086526072387614.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9686414548246768328.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityFireability9686414548246768328.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 338
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :338 after 490
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :490 after 3752
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :3752 after 46674
Invariant property smplace_819 does not hold.
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :46674 after 798350
Invariant property smplace_821 does not hold.
Invariant property smplace_820 does not hold.
Invariant property smplace_810 does not hold.
Invariant property smplace_801 does not hold.
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :798350 after 1.41729e+06
Invariant property smplace_811 does not hold.
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1.41729e+06 after 3.89131e+06
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3.89131e+06 after 9.21132e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9.21132e+06 after 9.88724e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :9.88724e+06 after 4.46403e+07
Detected timeout of ITS tools.
[2025-05-31 02:47:58] [INFO ] Flatten gal took : 66 ms
[2025-05-31 02:47:58] [INFO ] Flatten gal took : 69 ms
[2025-05-31 02:47:58] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability805688086508611676.gal : 8 ms
[2025-05-31 02:47:58] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17050278652992426597.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability805688086508611676.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17050278652992426597.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityFireability17050278652992426597.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 60
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :60 after 91
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :91 after 288
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :288 after 415
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :415 after 1330
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1330 after 5100
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5100 after 13728
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :13728 after 54523
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :54523 after 99778
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :99778 after 270709

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="EisenbergMcGuire-PT-09"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
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 itstools"
echo " Input is EisenbergMcGuire-PT-09, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r077-tall-174860075000503"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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