fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r191-oct2-177969025600058
Last Updated
Jun 17, 2026

About the Execution of 2025-gold for MultiCrashLeafsetExtension-PT-S24C04

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16211.035 3600000.00 4123541.00 14452.80 ? 0 1 1 1 1 0 1 0 1 1 1 0 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r191-oct2-177969025600058.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is MultiCrashLeafsetExtension-PT-S24C04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025600058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 12K Mar 7 19:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 7 19:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 7 18:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 15 11:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 15 11:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 15 11:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Mar 7 19:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 7 19:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Mar 7 19:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 7 19:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 11:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 15 11:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 10M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779942986203

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:36:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-28 04:36:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:36:29] [INFO ] Load time of PNML (sax parser for PT used): 764 ms
[2026-05-28 04:36:29] [INFO ] Transformed 9748 places.
[2026-05-28 04:36:29] [INFO ] Transformed 14659 transitions.
[2026-05-28 04:36:29] [INFO ] Parsed PT model containing 9748 places and 14659 transitions and 58838 arcs in 976 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-28 04:36:29] [INFO ] Flow matrix only has 14059 transitions (discarded 600 similar events)
// Phase 1: matrix 14059 rows 9748 cols
[2026-05-28 04:36:30] [INFO ] Computed 921 invariants in 936 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 25, 75, 25, 75, 1, 25, 1, 75, 75, 25, 1, 25, 25, 75]
RANDOM walk for 10000 steps (242 resets) in 253 ms. (39 steps per ms)
BEST_FIRST walk for 160014 steps (704 resets) in 939 ms. (170 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1] Max Struct:[1, 1, 25, 75, 25, 75, 1, 25, 1, 75, 75, 25, 1, 25, 25, 75]
[2026-05-28 04:36:31] [INFO ] Flow matrix only has 14059 transitions (discarded 600 similar events)
[2026-05-28 04:36:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:33] [INFO ] [Real]Absence check using 62 positive place invariants in 229 ms returned sat
[2026-05-28 04:36:34] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 534 ms returned sat
[2026-05-28 04:36:36] [INFO ] [Real]Absence check using state equation in 2438 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:38] [INFO ] [Real]Absence check using 62 positive place invariants in 243 ms returned sat
[2026-05-28 04:36:38] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 530 ms returned sat
[2026-05-28 04:36:41] [INFO ] [Real]Absence check using state equation in 2905 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:43] [INFO ] [Real]Absence check using 62 positive place invariants in 172 ms returned sat
[2026-05-28 04:36:43] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 522 ms returned sat
[2026-05-28 04:36:46] [INFO ] [Real]Absence check using state equation in 3011 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:48] [INFO ] [Real]Absence check using 62 positive place invariants in 143 ms returned sat
[2026-05-28 04:36:48] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 256 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:49] [INFO ] [Real]Absence check using 62 positive place invariants in 145 ms returned sat
[2026-05-28 04:36:50] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 200 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:51] [INFO ] [Real]Absence check using 62 positive place invariants in 142 ms returned sat
[2026-05-28 04:36:52] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 517 ms returned sat
[2026-05-28 04:36:55] [INFO ] [Real]Absence check using state equation in 3091 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:56] [INFO ] [Real]Absence check using 62 positive place invariants in 178 ms returned sat
[2026-05-28 04:36:57] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 532 ms returned sat
[2026-05-28 04:37:00] [INFO ] [Real]Absence check using state equation in 3060 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:37:01] [INFO ] [Real]Absence check using 62 positive place invariants in 143 ms returned sat
[2026-05-28 04:37:01] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 187 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:37:03] [INFO ] [Real]Absence check using 62 positive place invariants in 135 ms returned sat
[2026-05-28 04:37:03] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 460 ms returned sat
[2026-05-28 04:37:06] [INFO ] [Real]Absence check using state equation in 3203 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:37:08] [INFO ] [Real]Absence check using 62 positive place invariants in 139 ms returned sat
[2026-05-28 04:37:08] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 570 ms returned sat
[2026-05-28 04:37:11] [INFO ] [Real]Absence check using state equation in 3067 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:37:13] [INFO ] [Real]Absence check using 62 positive place invariants in 144 ms returned sat
[2026-05-28 04:37:13] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 234 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:37:15] [INFO ] [Real]Absence check using 62 positive place invariants in 223 ms returned sat
[2026-05-28 04:37:15] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 225 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:37:17] [INFO ] [Real]Absence check using 62 positive place invariants in 141 ms returned sat
[2026-05-28 04:37:17] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 469 ms returned sat
[2026-05-28 04:37:20] [INFO ] [Real]Absence check using state equation in 3157 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:37:22] [INFO ] [Real]Absence check using 62 positive place invariants in 142 ms returned sat
[2026-05-28 04:37:22] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 275 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:37:23] [INFO ] [Real]Absence check using 62 positive place invariants in 157 ms returned sat
[2026-05-28 04:37:24] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 225 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:37:25] [INFO ] [Real]Absence check using 62 positive place invariants in 162 ms returned sat
[2026-05-28 04:37:25] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 239 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1] Max Struct:[1, 1, 25, 1, 1, 75, 1, 1, 1, 75, 1, 1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 25, 75, 1, 1, 75, 1]
Support contains 8 out of 9748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9748/9748 places, 14659/14659 transitions.
Graph (complete) has 33897 edges and 9748 vertex of which 9712 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.26 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2397 transitions
Trivial Post-agglo rules discarded 2397 transitions
Performed 2397 trivial Post agglomeration. Transition count delta: 2397
Iterating post reduction 0 with 2397 rules applied. Total rules applied 2398 place count 9712 transition count 12262
Reduce places removed 2397 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2399 rules applied. Total rules applied 4797 place count 7315 transition count 12260
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4799 place count 7313 transition count 12260
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 4799 place count 7313 transition count 12060
Deduced a syphon composed of 200 places in 12 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 5199 place count 7113 transition count 12060
Discarding 2197 places :
Symmetric choice reduction at 3 with 2197 rule applications. Total rules 7396 place count 4916 transition count 9863
Iterating global reduction 3 with 2197 rules applied. Total rules applied 9593 place count 4916 transition count 9863
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 9593 place count 4916 transition count 9858
Deduced a syphon composed of 5 places in 17 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 9603 place count 4911 transition count 9858
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 10150 place count 4364 transition count 7670
Iterating global reduction 3 with 547 rules applied. Total rules applied 10697 place count 4364 transition count 7670
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 17 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 10747 place count 4339 transition count 7645
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 3 with 337 rules applied. Total rules applied 11084 place count 4339 transition count 8949
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 3 with 337 rules applied. Total rules applied 11421 place count 4002 transition count 8949
Partial Free-agglomeration rule applied 75 times.
Drop transitions (Partial Free agglomeration) removed 75 transitions
Iterating global reduction 4 with 75 rules applied. Total rules applied 11496 place count 4002 transition count 8949
Applied a total of 11496 rules in 5112 ms. Remains 4002 /9748 variables (removed 5746) and now considering 8949/14659 (removed 5710) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5126 ms. Remains : 4002/9748 places, 8949/14659 transitions.
[2026-05-28 04:37:30] [INFO ] Flow matrix only has 8065 transitions (discarded 884 similar events)
// Phase 1: matrix 8065 rows 4002 cols
[2026-05-28 04:37:31] [INFO ] Computed 885 invariants in 229 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 2, 1, 1, 2, 1]
RANDOM walk for 1000000 steps (39709 resets) in 27921 ms. (35 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000007 steps (33460 resets) in 31486 ms. (222 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0, 1, 0] Max Struct:[1, 1, 2, 1, 1, 2, 1]
[2026-05-28 04:38:30] [INFO ] Flow matrix only has 8065 transitions (discarded 884 similar events)
[2026-05-28 04:38:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:38:31] [INFO ] [Real]Absence check using 49 positive place invariants in 87 ms returned sat
[2026-05-28 04:38:31] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 234 ms returned sat
[2026-05-28 04:38:35] [INFO ] [Real]Absence check using state equation in 4064 ms returned sat
[2026-05-28 04:38:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:38:36] [INFO ] [Nat]Absence check using 49 positive place invariants in 127 ms returned sat
[2026-05-28 04:38:37] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 251 ms returned sat
[2026-05-28 04:38:40] [INFO ] [Nat]Absence check using state equation in 3435 ms returned sat
[2026-05-28 04:38:40] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2026-05-28 04:38:44] [INFO ] [Nat]Added 4402 Read/Feed constraints in 4446 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:38:50] [INFO ] Deduced a trap composed of 107 places in 5092 ms of which 522 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:38:56] [INFO ] Deduced a trap composed of 225 places in 5752 ms of which 913 ms to minimize.
[2026-05-28 04:38:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 11858 ms
[2026-05-28 04:38:57] [INFO ] Computed and/alt/rep : 4618/6655/4618 causal constraints (skipped 3422 transitions) in 1019 ms.
[2026-05-28 04:38:59] [INFO ] Added : 5 causal constraints over 1 iterations in 2538 ms. Result :sat
Minimization took 5652 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:39:05] [INFO ] [Real]Absence check using 49 positive place invariants in 79 ms returned sat
[2026-05-28 04:39:06] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 378 ms returned sat
[2026-05-28 04:39:09] [INFO ] [Real]Absence check using state equation in 3647 ms returned sat
[2026-05-28 04:39:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:39:10] [INFO ] [Nat]Absence check using 49 positive place invariants in 79 ms returned sat
[2026-05-28 04:39:10] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 237 ms returned sat
[2026-05-28 04:39:15] [INFO ] [Nat]Absence check using state equation in 4527 ms returned sat
[2026-05-28 04:39:20] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-28 04:39:22] [INFO ] [Nat]Added 4402 Read/Feed constraints in 7342 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:39:23] [INFO ] [Real]Absence check using 49 positive place invariants in 78 ms returned sat
[2026-05-28 04:39:23] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 124 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:39:23] [INFO ] [Real]Absence check using 49 positive place invariants in 71 ms returned sat
[2026-05-28 04:39:24] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 237 ms returned sat
[2026-05-28 04:39:27] [INFO ] [Real]Absence check using state equation in 3773 ms returned sat
[2026-05-28 04:39:29] [INFO ] [Real]Added 4402 Read/Feed constraints in 845 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:39:29] [INFO ] [Real]Absence check using 49 positive place invariants in 78 ms returned sat
[2026-05-28 04:39:29] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 228 ms returned sat
[2026-05-28 04:39:33] [INFO ] [Real]Absence check using state equation in 3804 ms returned sat
[2026-05-28 04:39:34] [INFO ] [Real]Added 4402 Read/Feed constraints in 1028 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:39:35] [INFO ] [Real]Absence check using 49 positive place invariants in 78 ms returned sat
[2026-05-28 04:39:35] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 189 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:39:36] [INFO ] [Real]Absence check using 49 positive place invariants in 77 ms returned sat
[2026-05-28 04:39:36] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 250 ms returned sat
[2026-05-28 04:39:40] [INFO ] [Real]Absence check using state equation in 3538 ms returned sat
[2026-05-28 04:39:41] [INFO ] [Real]Added 4402 Read/Feed constraints in 830 ms returned sat
[2026-05-28 04:39:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:39:42] [INFO ] [Nat]Absence check using 49 positive place invariants in 87 ms returned sat
[2026-05-28 04:39:42] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 311 ms returned sat
[2026-05-28 04:39:45] [INFO ] [Nat]Absence check using state equation in 3527 ms returned sat
[2026-05-28 04:39:50] [INFO ] [Nat]Added 4402 Read/Feed constraints in 4375 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0, 1, 0] Max Struct:[1, 0, 1, 0, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 4002 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node23ThinksNode14ShouldBeNodeMasterToReplaceNode10) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 4002/4002 places, 8947/8947 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4001 transition count 8944
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 3999 transition count 8942
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 3998 transition count 8940
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 3997 transition count 8938
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7 place count 3996 transition count 8936
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8 place count 3995 transition count 8934
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 9 place count 3994 transition count 8932
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 10 place count 3993 transition count 8930
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 11 place count 3992 transition count 8928
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 12 place count 3991 transition count 8926
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 13 place count 3990 transition count 8924
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 14 place count 3989 transition count 8922
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 15 place count 3988 transition count 8920
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 16 place count 3987 transition count 8918
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 17 place count 3986 transition count 8916
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 18 place count 3985 transition count 8914
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 22 place count 3985 transition count 8910
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 26 place count 3981 transition count 8910
Discarding 3 places :
Symmetric choice reduction at 17 with 3 rule applications. Total rules 29 place count 3978 transition count 8907
Iterating global reduction 17 with 3 rules applied. Total rules applied 32 place count 3978 transition count 8907
Applied a total of 32 rules in 1868 ms. Remains 3978 /4002 variables (removed 24) and now considering 8907/8947 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1880 ms. Remains : 3978/4002 places, 8907/8947 transitions.
[2026-05-28 04:39:52] [INFO ] Flow matrix only has 8022 transitions (discarded 885 similar events)
// Phase 1: matrix 8022 rows 3978 cols
[2026-05-28 04:39:52] [INFO ] Computed 885 invariants in 228 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (39711 resets) in 27264 ms. (36 steps per ms)
BEST_FIRST walk for 1000001 steps (4780 resets) in 4188 ms. (238 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:40:23] [INFO ] Flow matrix only has 8022 transitions (discarded 885 similar events)
[2026-05-28 04:40:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:40:24] [INFO ] [Real]Absence check using 49 positive place invariants in 77 ms returned sat
[2026-05-28 04:40:24] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 246 ms returned sat
[2026-05-28 04:40:28] [INFO ] [Real]Absence check using state equation in 3903 ms returned sat
[2026-05-28 04:40:29] [INFO ] State equation strengthened by 4385 read => feed constraints.
[2026-05-28 04:40:29] [INFO ] [Real]Added 4385 Read/Feed constraints in 821 ms returned sat
[2026-05-28 04:40:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:40:30] [INFO ] [Nat]Absence check using 49 positive place invariants in 107 ms returned sat
[2026-05-28 04:40:30] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 240 ms returned sat
[2026-05-28 04:40:34] [INFO ] [Nat]Absence check using state equation in 3819 ms returned sat
[2026-05-28 04:40:39] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-28 04:40:44] [INFO ] [Nat]Added 4385 Read/Feed constraints in 9482 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 3978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3978/3978 places, 8907/8907 transitions.
Applied a total of 0 rules in 527 ms. Remains 3978 /3978 variables (removed 0) and now considering 8907/8907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 527 ms. Remains : 3978/3978 places, 8907/8907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3978/3978 places, 8907/8907 transitions.
Applied a total of 0 rules in 503 ms. Remains 3978 /3978 variables (removed 0) and now considering 8907/8907 (removed 0) transitions.
[2026-05-28 04:40:45] [INFO ] Flow matrix only has 8022 transitions (discarded 885 similar events)
[2026-05-28 04:40:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:40:59] [INFO ] Implicit Places using invariants in 14666 ms returned [4, 7, 9, 10, 11, 12, 13, 17, 23, 31, 41, 53, 67, 83, 101, 121, 143, 166, 188, 189, 190, 191, 192, 212, 230, 246, 260, 272, 282, 290, 296, 300, 302, 313, 319, 321, 322, 323, 324, 325, 327, 331, 337, 345, 355, 367, 381, 397, 415, 435, 456, 476, 477, 478, 479, 480, 498, 514, 528, 540, 550, 558, 564, 568, 570, 572, 583, 589, 591, 592, 593, 594, 595, 597, 599, 603, 609, 617, 627, 639, 653, 669, 687, 706, 724, 725, 726, 727, 728, 744, 758, 770, 780, 788, 794, 798, 800, 802, 804, 815, 821, 823, 824, 825, 826, 827, 829, 831, 833, 837, 843, 851, 861, 873, 887, 903, 920, 936, 937, 938, 939, 940, 954, 966, 976, 984, 990, 994, 996, 998, 1000, 1002, 1013, 1019, 1021, 1022, 1023, 1024, 1025, 1027, 1029, 1031, 1033, 1037, 1043, 1051, 1061, 1073, 1087, 1102, 1116, 1117, 1118, 1119, 1120, 1132, 1142, 1150, 1156, 1160, 1162, 1164, 1166, 1168, 1170, 1181, 1187, 1189, 1190, 1191, 1192, 1193, 1195, 1197, 1199, 1201, 1203, 1207, 1213, 1221, 1231, 1243, 1256, 1268, 1269, 1270, 1271, 1272, 1282, 1290, 1296, 1300, 1302, 1304, 1306, 1308, 1310, 1312, 1323, 1329, 1331, 1332, 1333, 1334, 1335, 1337, 1339, 1341, 1343, 1345, 1347, 1351, 1357, 1365, 1375, 1386, 1396, 1397, 1398, 1399, 1400, 1408, 1414, 1418, 1420, 1422, 1424, 1426, 1428, 1430, 1432, 1443, 1449, 1451, 1452, 1453, 1454, 1455, 1457, 1459, 1461, 1463, 1465, 1467, 1469, 1473, 1479, 1487, 1496, 1504, 1505, 1506, 1507, 1508, 1514, 1518, 1520, 1522, 1524, 1526, 1528, 1530, 1532, 1534, 1545, 1551, 1553, 1554, 1555, 1556, 1557, 1559, 1561, 1563, 1565, 1567, 1569, 1571, 1573, 1577, 1583, 1590, 1596, 1597, 1598, 1599, 1600, 1604, 1606, 1608, 1610, 1612, 1614, 1616, 1618, 1620, 1622, 1633, 1639, 1641, 1642, 1643, 1644, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1667, 1672, 1676, 1677, 1678, 1679, 1680, 1682, 1684, 1686, 1688, 1690, 1692, 1694, 1696, 1698, 1700, 1711, 1717, 1719, 1720, 1721, 1722, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1739, 1741, 1743, 1746, 1748, 1749, 1750, 1751, 1752, 1754, 1756, 1758, 1760, 1762, 1764, 1766, 1768, 1770, 1772, 1783, 1789, 1791, 1792, 1793, 1794, 1795, 1797, 1799, 1801, 1803, 1805, 1807, 1809, 1811, 1813, 1815, 1817, 1819, 1820, 1821, 1822, 1823, 1825, 1827, 1829, 1831, 1833, 1835, 1837, 1839, 1841, 1843, 1854, 1856, 1859, 1861, 1862, 1863, 1864, 1865, 1867, 1869, 1871, 1873, 1875, 1877, 1879, 1881, 1883, 1885, 1887, 1889, 1890, 1891, 1892, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1911, 1913, 1924, 1930, 1932, 1933, 1934, 1935, 1936, 1938, 1940, 1942, 1944, 1946, 1948, 1950, 1952, 1954, 1956, 1958, 1960, 1961, 1962, 1963, 1964, 1966, 1968, 1970, 1972, 1974, 1976, 1978, 1980, 1982, 1984, 1995, 2001, 2003, 2004, 2005, 2006, 2007, 2009, 2011, 2013, 2015, 2017, 2019, 2021, 2023, 2025, 2027, 2029, 2032, 2033, 2034, 2035, 2036, 2038, 2040, 2042, 2044, 2046, 2048, 2050, 2052, 2054, 2056, 2067, 2073, 2075, 2076, 2077, 2078, 2079, 2081, 2083, 2085, 2087, 2089, 2091, 2093, 2095, 2097, 2099, 2103, 2108, 2109, 2110, 2111, 2112, 2116, 2118, 2120, 2122, 2124, 2126, 2128, 2130, 2132, 2134, 2145, 2151, 2153, 2154, 2155, 2156, 2157, 2159, 2161, 2163, 2165, 2167, 2169, 2171, 2173, 2175, 2179, 2185, 2192, 2193, 2194, 2195, 2196, 2202, 2206, 2208, 2210, 2212, 2214, 2216, 2218, 2220, 2222, 2233, 2239, 2241, 2242, 2243, 2244, 2245, 2247, 2249, 2251, 2253, 2255, 2257, 2259, 2261, 2265, 2271, 2279, 2288, 2289, 2290, 2291, 2292, 2300, 2306, 2310, 2312, 2314, 2316, 2318, 2320, 2322, 2324, 2335, 2341, 2343, 2344, 2345, 2346, 2347, 2349, 2351, 2353, 2355, 2357, 2359, 2361, 2365, 2371, 2379, 2389, 2400, 2401, 2402, 2403, 2404, 2414, 2422, 2428, 2432, 2434, 2436, 2438, 2440, 2442, 2444, 2455, 2461, 2463, 2464, 2465, 2466, 2467, 2469, 2471, 2473, 2475, 2477, 2479, 2483, 2489, 2497, 2507, 2519, 2532, 2533, 2534, 2535, 2536, 2548, 2558, 2566, 2572, 2576, 2578, 2580, 2582, 2584, 2586, 2597, 2603, 2605, 2606, 2607, 2608, 2609, 2611, 2613, 2615, 2617, 2619, 2623, 2629, 2637, 2647, 2659, 2673, 2688, 2689, 2690, 2691, 2692, 2706, 2718, 2728, 2736, 2742, 2746, 2748, 2750, 2752, 2754, 2765, 2771, 2773, 2774, 2775, 2776, 2777, 2779, 2781, 2783, 2785, 2789, 2795, 2803, 2813, 2825, 2839, 2855, 2872, 2873, 2874, 2875, 2876, 2892, 2906, 2918, 2928, 2936, 2942, 2946, 2948, 2950, 2952, 2963, 2969, 2971, 2972, 2973, 2974, 2975, 2977, 2979, 2981, 2985, 2991, 2999, 3009, 3021, 3035, 3051, 3069, 3088, 3089, 3090, 3091, 3092, 3110, 3126, 3140, 3152, 3162, 3170, 3176, 3180, 3182, 3184, 3195, 3201, 3203, 3204, 3205, 3206, 3207, 3209, 3211, 3215, 3221, 3229, 3239, 3251, 3265, 3281, 3284, 3304, 3325, 3326, 3327, 3328, 3329, 3349, 3367, 3383, 3397, 3409, 3419, 3427, 3433, 3437, 3439, 3450, 3452, 3455, 3457, 3458, 3459, 3460, 3461, 3463, 3467, 3473, 3481, 3491, 3503, 3517, 3533, 3551, 3571, 3593, 3616, 3617, 3618, 3619, 3620, 3642, 3662, 3680, 3696, 3710, 3722, 3732, 3740, 3746, 3750, 3761]
[2026-05-28 04:40:59] [INFO ] Actually due to overlaps returned [313, 583, 815, 1013, 1181, 1323, 1443, 1545, 1633, 1711, 1783, 1854, 1924, 1995, 2067, 2145, 2233, 2335, 2455, 2597, 2765, 2963, 3195, 3450, 3761, 4, 9, 10, 11, 12, 188, 189, 190, 191, 321, 322, 323, 324, 476, 477, 478, 479, 591, 592, 593, 594, 724, 725, 726, 727, 823, 824, 825, 826, 936, 937, 938, 939, 1021, 1022, 1023, 1024, 1116, 1117, 1118, 1119, 1189, 1190, 1191, 1192, 1268, 1269, 1270, 1271, 1331, 1332, 1333, 1334, 1396, 1397, 1398, 1399, 1451, 1452, 1453, 1454, 1504, 1505, 1506, 1507, 1553, 1554, 1555, 1556, 1596, 1597, 1598, 1599, 1641, 1642, 1643, 1644, 1676, 1677, 1678, 1679, 1719, 1720, 1721, 1722, 1748, 1749, 1750, 1751, 1791, 1792, 1793, 1794, 1819, 1820, 1821, 1822, 1856, 1861, 1862, 1863, 1864, 1889, 1890, 1891, 1892, 1932, 1933, 1934, 1935, 1960, 1961, 1962, 1963, 2003, 2004, 2005, 2006, 2032, 2033, 2034, 2035, 2075, 2076, 2077, 2078, 2108, 2109, 2110, 2111, 2153, 2154, 2155, 2156, 2192, 2193, 2194, 2195, 2241, 2242, 2243, 2244, 2288, 2289, 2290, 2291, 2343, 2344, 2345, 2346, 2400, 2401, 2402, 2403, 2463, 2464, 2465, 2466, 2532, 2533, 2534, 2535, 2605, 2606, 2607, 2608, 2688, 2689, 2690, 2691, 2773, 2774, 2775, 2776, 2872, 2873, 2874, 2875, 2971, 2972, 2973, 2974, 3088, 3089, 3090, 3091, 3203, 3204, 3205, 3206, 3325, 3326, 3327, 3328, 3452, 3457, 3458, 3459, 3460, 3616, 3617, 3618, 3619]
Discarding 228 places :
Implicit Place search using SMT only with invariants took 14703 ms to find 228 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3750/3978 places, 8907/8907 transitions.
Discarding 192 places :
Symmetric choice reduction at 0 with 192 rule applications. Total rules 192 place count 3558 transition count 8715
Iterating global reduction 0 with 192 rules applied. Total rules applied 384 place count 3558 transition count 8715
Discarding 192 places :
Symmetric choice reduction at 0 with 192 rule applications. Total rules 576 place count 3366 transition count 8523
Iterating global reduction 0 with 192 rules applied. Total rules applied 768 place count 3366 transition count 8523
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 771 place count 3366 transition count 8520
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 774 place count 3363 transition count 8520
Applied a total of 774 rules in 1687 ms. Remains 3363 /3750 variables (removed 387) and now considering 8520/8907 (removed 387) transitions.
[2026-05-28 04:41:01] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
// Phase 1: matrix 7635 rows 3363 cols
[2026-05-28 04:41:01] [INFO ] Computed 657 invariants in 224 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:41:13] [INFO ] Implicit Places using invariants in 12233 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 78, 96, 116, 138, 161, 183, 203, 221, 237, 251, 263, 273, 281, 287, 291, 293, 308, 310, 312, 316, 322, 330, 340, 352, 366, 382, 400, 420, 441, 461, 479, 495, 509, 521, 531, 539, 545, 549, 551, 553, 561, 563, 565, 567, 571, 577, 585, 595, 607, 621, 637, 655, 674, 692, 708, 722, 734, 744, 752, 758, 762, 764, 766, 768, 776, 778, 780, 782, 784, 788, 794, 802, 812, 824, 838, 854, 871, 887, 901, 913, 923, 931, 937, 941, 943, 945, 947, 949, 957, 959, 961, 963, 965, 967, 971, 977, 985, 995, 1007, 1021, 1036, 1050, 1062, 1072, 1080, 1086, 1090, 1092, 1094, 1096, 1098, 1100, 1108, 1110, 1112, 1114, 1116, 1118, 1120, 1124, 1130, 1138, 1148, 1160, 1173, 1185, 1195, 1203, 1209, 1213, 1215, 1217, 1219, 1221, 1223, 1225, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1247, 1251, 1257, 1265, 1275, 1286, 1296, 1304, 1310, 1314, 1316, 1318, 1320, 1322, 1324, 1326, 1328, 1336, 1338, 1340, 1342, 1344, 1346, 1348, 1350, 1352, 1356, 1362, 1370, 1379, 1387, 1393, 1397, 1399, 1401, 1403, 1405, 1407, 1409, 1411, 1413, 1421, 1423, 1425, 1427, 1429, 1431, 1433, 1435, 1437, 1439, 1443, 1449, 1456, 1462, 1466, 1468, 1470, 1472, 1474, 1476, 1478, 1480, 1482, 1484, 1492, 1494, 1496, 1498, 1500, 1502, 1504, 1506, 1508, 1510, 1512, 1516, 1521, 1525, 1527, 1529, 1531, 1533, 1535, 1537, 1539, 1541, 1543, 1545, 1553, 1555, 1557, 1559, 1561, 1563, 1565, 1567, 1569, 1571, 1573, 1575, 1578, 1580, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1596, 1598, 1600, 1608, 1610, 1612, 1614, 1616, 1618, 1620, 1622, 1624, 1626, 1628, 1630, 1632, 1634, 1636, 1638, 1640, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1660, 1662, 1664, 1666, 1668, 1670, 1672, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1692, 1694, 1696, 1698, 1700, 1702, 1704, 1706, 1713, 1715, 1717, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1739, 1741, 1743, 1745, 1747, 1749, 1751, 1753, 1755, 1757, 1759, 1767, 1769, 1771, 1773, 1775, 1777, 1779, 1781, 1783, 1785, 1787, 1789, 1791, 1794, 1796, 1798, 1800, 1802, 1804, 1806, 1808, 1810, 1812, 1814, 1822, 1824, 1826, 1828, 1830, 1832, 1834, 1836, 1838, 1840, 1842, 1844, 1848, 1853, 1857, 1859, 1861, 1863, 1865, 1867, 1869, 1871, 1873, 1875, 1883, 1885, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1907, 1913, 1920, 1926, 1930, 1932, 1934, 1936, 1938, 1940, 1942, 1944, 1946, 1954, 1956, 1958, 1960, 1962, 1964, 1966, 1968, 1970, 1972, 1976, 1982, 1990, 1999, 2007, 2013, 2017, 2019, 2021, 2023, 2025, 2027, 2029, 2031, 2039, 2041, 2043, 2045, 2047, 2049, 2051, 2053, 2055, 2059, 2065, 2073, 2083, 2094, 2104, 2112, 2118, 2122, 2124, 2126, 2128, 2130, 2132, 2134, 2142, 2144, 2146, 2148, 2150, 2152, 2154, 2156, 2160, 2166, 2174, 2184, 2196, 2209, 2221, 2231, 2239, 2245, 2249, 2251, 2253, 2255, 2257, 2259, 2267, 2269, 2271, 2273, 2275, 2277, 2279, 2283, 2289, 2297, 2307, 2319, 2333, 2348, 2362, 2374, 2384, 2392, 2398, 2402, 2404, 2406, 2408, 2410, 2418, 2420, 2422, 2424, 2426, 2428, 2432, 2438, 2446, 2456, 2468, 2482, 2498, 2515, 2531, 2545, 2557, 2567, 2575, 2581, 2585, 2587, 2589, 2591, 2599, 2601, 2603, 2605, 2607, 2611, 2617, 2625, 2635, 2647, 2661, 2677, 2695, 2714, 2732, 2748, 2762, 2774, 2784, 2792, 2798, 2802, 2804, 2806, 2814, 2816, 2818, 2820, 2824, 2830, 2838, 2848, 2860, 2874, 2890, 2893, 2913, 2934, 2954, 2972, 2988, 3002, 3014, 3024, 3032, 3038, 3042, 3044, 3050, 3052, 3054, 3058, 3064, 3072, 3082, 3094, 3108, 3124, 3142, 3162, 3184, 3207, 3229, 3249, 3267, 3283, 3297, 3309, 3319, 3327, 3333, 3337]
Discarding 600 places :
Implicit Place search using SMT only with invariants took 12261 ms to find 600 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2763/3978 places, 8520/8907 transitions.
Applied a total of 0 rules in 461 ms. Remains 2763 /2763 variables (removed 0) and now considering 8520/8520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 29626 ms. Remains : 2763/3978 places, 8520/8907 transitions.
[2026-05-28 04:41:14] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
// Phase 1: matrix 7635 rows 2763 cols
[2026-05-28 04:41:14] [INFO ] Computed 57 invariants in 166 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (42714 resets) in 26441 ms. (37 steps per ms)
BEST_FIRST walk for 1000001 steps (3123 resets) in 2793 ms. (357 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:41:43] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:41:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:41:44] [INFO ] [Real]Absence check using 47 positive place invariants in 46 ms returned sat
[2026-05-28 04:41:44] [INFO ] [Real]Absence check using 47 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-28 04:41:46] [INFO ] [Real]Absence check using state equation in 2601 ms returned sat
[2026-05-28 04:41:47] [INFO ] State equation strengthened by 4385 read => feed constraints.
[2026-05-28 04:41:47] [INFO ] [Real]Added 4385 Read/Feed constraints in 782 ms returned sat
[2026-05-28 04:41:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:41:48] [INFO ] [Nat]Absence check using 47 positive place invariants in 59 ms returned sat
[2026-05-28 04:41:48] [INFO ] [Nat]Absence check using 47 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-28 04:41:52] [INFO ] [Nat]Absence check using state equation in 3557 ms returned sat
[2026-05-28 04:41:55] [INFO ] [Nat]Added 4385 Read/Feed constraints in 3667 ms returned sat
[2026-05-28 04:41:56] [INFO ] Computed and/alt/rep : 4514/6536/4514 causal constraints (skipped 3027 transitions) in 659 ms.
[2026-05-28 04:41:58] [INFO ] Added : 7 causal constraints over 2 iterations in 2122 ms. Result :sat
Minimization took 5309 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 2763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2763/2763 places, 8520/8520 transitions.
Applied a total of 0 rules in 484 ms. Remains 2763 /2763 variables (removed 0) and now considering 8520/8520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 2763/2763 places, 8520/8520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2763/2763 places, 8520/8520 transitions.
Applied a total of 0 rules in 497 ms. Remains 2763 /2763 variables (removed 0) and now considering 8520/8520 (removed 0) transitions.
[2026-05-28 04:42:04] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:42:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:42:10] [INFO ] Implicit Places using invariants in 5985 ms returned []
[2026-05-28 04:42:10] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:42:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:42:13] [INFO ] State equation strengthened by 4385 read => feed constraints.
[2026-05-28 04:42:44] [INFO ] Performed 245/2763 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-28 04:43:14] [INFO ] Performed 564/2763 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-28 04:43:45] [INFO ] Performed 859/2763 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2026-05-28 04:44:15] [INFO ] Performed 1093/2763 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2026-05-28 04:44:15] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2026-05-28 04:44:15] [INFO ] Implicit Places using invariants and state equation in 124949 ms returned []
Implicit Place search using SMT with State Equation took 130952 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:44:16] [INFO ] Redundant transitions in 1075 ms returned []
Running 8426 sub problems to find dead transitions.
[2026-05-28 04:44:16] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:44:16] [INFO ] Invariant cache hit.
[2026-05-28 04:44:16] [INFO ] State equation strengthened by 4385 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2760 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 8426 unsolved
SMT process timed out in 44246ms, After SMT, problems are : Problem set: 0 solved, 8426 unsolved
Search for dead transitions found 0 dead transitions in 44313ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176903 ms. Remains : 2763/2763 places, 8520/8520 transitions.
RANDOM walk for 40000 steps (1708 resets) in 2039 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (123 resets) in 339 ms. (117 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (123 resets) in 370 ms. (107 steps per ms) remains 2/2 properties
[2026-05-28 04:45:02] [INFO ] Flatten gal took : 618 ms
[2026-05-28 04:45:02] [INFO ] Flatten gal took : 315 ms
[2026-05-28 04:45:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8636341439885708042.gal : 94 ms
[2026-05-28 04:45:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12225077821497601842.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/ReachabilityCardinality8636341439885708042.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12225077821497601842.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/ReachabilityCardinality12225077821497601842.prop.
Interrupted probabilistic random walk after 25737 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 25737 steps, saw 10809 distinct states, run finished after 3019 ms. (steps per millisecond=8 ) properties seen :0
[2026-05-28 04:45:04] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:45:04] [INFO ] Invariant cache hit.
[2026-05-28 04:45:04] [INFO ] State equation strengthened by 4385 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2650/2651 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2651 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2677 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2677 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/2711 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2711 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/2755 variables, 44/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2755 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/2763 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2763 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7635/10398 variables, 2763/2820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10398/10398 variables, and 7205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4736 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 2763/2763 constraints, ReadFeed: 4385/4385 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2650/2651 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2651 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2677 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:13] [INFO ] Deduced a trap composed of 159 places in 3179 ms of which 459 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:15] [INFO ] Deduced a trap composed of 95 places in 2386 ms of which 313 ms to minimize.
SMT process timed out in 11130ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2763/2763 places, 8520/8520 transitions.
Applied a total of 0 rules in 475 ms. Remains 2763 /2763 variables (removed 0) and now considering 8520/8520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 476 ms. Remains : 2763/2763 places, 8520/8520 transitions.
RANDOM walk for 40000 steps (1708 resets) in 1904 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (124 resets) in 291 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (122 resets) in 398 ms. (100 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 24821 steps, run timeout after 3002 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 24821 steps, saw 10457 distinct states, run finished after 3016 ms. (steps per millisecond=8 ) properties seen :0
[2026-05-28 04:45:20] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:45:20] [INFO ] Invariant cache hit.
[2026-05-28 04:45:20] [INFO ] State equation strengthened by 4385 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2650/2651 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2651 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2677 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2677 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/2711 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2711 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/2755 variables, 44/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2755 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/2763 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2763 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7635/10398 variables, 2763/2820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/10398 variables, 4385/7205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/10398 variables, 0/7205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/10398 variables, 0/7205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 21
After SMT solving in domain Real declared 10398/10398 variables, and 7205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6308 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 2763/2763 constraints, ReadFeed: 4385/4385 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :21 after 25
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 29
At refinement iteration 1 (OVERLAPS) 2650/2651 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 65
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :65 after 67
At refinement iteration 2 (INCLUDED_ONLY) 0/2651 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2677 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :67 after 137
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :137 after 176
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :176 after 232
[2026-05-28 04:45:30] [INFO ] Deduced a trap composed of 159 places in 2993 ms of which 480 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :232 after 295
[2026-05-28 04:45:32] [INFO ] Deduced a trap composed of 95 places in 2641 ms of which 292 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:34] [INFO ] Deduced a trap composed of 89 places in 2205 ms of which 272 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :295 after 601
[2026-05-28 04:45:37] [INFO ] Deduced a trap composed of 185 places in 2620 ms of which 471 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:41] [INFO ] Deduced a trap composed of 105 places in 3425 ms of which 311 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :601 after 1026
[2026-05-28 04:45:43] [INFO ] Deduced a trap composed of 119 places in 2592 ms of which 369 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:46] [INFO ] Deduced a trap composed of 329 places in 3056 ms of which 821 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:49] [INFO ] Deduced a trap composed of 105 places in 2341 ms of which 308 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:51] [INFO ] Deduced a trap composed of 89 places in 2265 ms of which 269 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2026-05-28 04:45:52] [INFO ] Flatten gal took : 254 ms
[2026-05-28 04:45:52] [INFO ] Applying decomposition
[2026-05-28 04:45:53] [INFO ] Flatten gal took : 273 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/graph16582680752131832490.txt' '-o' '/tmp/graph16582680752131832490.bin' '-w' '/tmp/graph16582680752131832490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16582680752131832490.bin' '-l' '-1' '-v' '-w' '/tmp/graph16582680752131832490.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:45:53] [INFO ] Decomposing Gal with order
[2026-05-28 04:45:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:45:54] [INFO ] Deduced a trap composed of 215 places in 2811 ms of which 596 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:56] [INFO ] Removed a total of 12328 redundant transitions.
[2026-05-28 04:45:57] [INFO ] Flatten gal took : 2724 ms
[2026-05-28 04:45:57] [INFO ] Deduced a trap composed of 287 places in 3325 ms of which 788 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 7180 labels/synchronizations in 776 ms.
[2026-05-28 04:45:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9099970781288338089.gal : 92 ms
[2026-05-28 04:45:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12063520946840732272.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/ReachabilityCardinality9099970781288338089.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12063520946840732272.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
Loading property file /tmp/ReachabilityCardinality12063520946840732272.prop.
[2026-05-28 04:46:01] [INFO ] Deduced a trap composed of 119 places in 3125 ms of which 364 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 17
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :17 after 51
[2026-05-28 04:46:03] [INFO ] Deduced a trap composed of 88 places in 2297 ms of which 288 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :51 after 71
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :71 after 194
[2026-05-28 04:46:06] [INFO ] Deduced a trap composed of 215 places in 3232 ms of which 513 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :194 after 248
[2026-05-28 04:46:09] [INFO ] Deduced a trap composed of 159 places in 3063 ms of which 436 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :248 after 382
[2026-05-28 04:46:11] [INFO ] Deduced a trap composed of 137 places in 2140 ms of which 387 ms to minimize.
SMT process timed out in 51895ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2763/2763 places, 8520/8520 transitions.
Applied a total of 0 rules in 491 ms. Remains 2763 /2763 variables (removed 0) and now considering 8520/8520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 495 ms. Remains : 2763/2763 places, 8520/8520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2763/2763 places, 8520/8520 transitions.
Applied a total of 0 rules in 603 ms. Remains 2763 /2763 variables (removed 0) and now considering 8520/8520 (removed 0) transitions.
[2026-05-28 04:46:13] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:46:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :382 after 890
[2026-05-28 04:46:19] [INFO ] Implicit Places using invariants in 5971 ms returned []
[2026-05-28 04:46:19] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:46:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:46:22] [INFO ] State equation strengthened by 4385 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :890 after 1530
Detected timeout of ITS tools.
[2026-05-28 04:46:53] [INFO ] Performed 189/2763 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-28 04:47:23] [INFO ] Performed 509/2763 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-28 04:47:53] [INFO ] Performed 856/2763 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-28 04:48:23] [INFO ] Performed 1080/2763 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-28 04:48:23] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-28 04:48:23] [INFO ] Implicit Places using invariants and state equation in 124744 ms returned []
Implicit Place search using SMT with State Equation took 130733 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:48:24] [INFO ] Redundant transitions in 1024 ms returned []
Running 8426 sub problems to find dead transitions.
[2026-05-28 04:48:24] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:48:24] [INFO ] Invariant cache hit.
[2026-05-28 04:48:24] [INFO ] State equation strengthened by 4385 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2760 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 8426 unsolved
SMT process timed out in 43364ms, After SMT, problems are : Problem set: 0 solved, 8426 unsolved
Search for dead transitions found 0 dead transitions in 43395ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175797 ms. Remains : 2763/2763 places, 8520/8520 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:49:08] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:49:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (427 resets) in 392 ms. (25 steps per ms)
BEST_FIRST walk for 10001 steps (31 resets) in 29 ms. (333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:49:08] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:49:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:49:09] [INFO ] [Real]Absence check using 47 positive place invariants in 90 ms returned sat
[2026-05-28 04:49:09] [INFO ] [Real]Absence check using 47 positive and 10 generalized place invariants in 6 ms returned sat
[2026-05-28 04:49:13] [INFO ] [Real]Absence check using state equation in 3814 ms returned sat
[2026-05-28 04:49:13] [INFO ] State equation strengthened by 4385 read => feed constraints.
[2026-05-28 04:49:13] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-28 04:49:13] [INFO ] [Real]Added 4385 Read/Feed constraints in 392 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 2763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2763/2763 places, 8520/8520 transitions.
Applied a total of 0 rules in 519 ms. Remains 2763 /2763 variables (removed 0) and now considering 8520/8520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 519 ms. Remains : 2763/2763 places, 8520/8520 transitions.
[2026-05-28 04:49:14] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:49:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (42716 resets) in 26665 ms. (37 steps per ms)
BEST_FIRST walk for 1000001 steps (3122 resets) in 2771 ms. (360 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:49:43] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:49:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:49:44] [INFO ] [Real]Absence check using 47 positive place invariants in 51 ms returned sat
[2026-05-28 04:49:44] [INFO ] [Real]Absence check using 47 positive and 10 generalized place invariants in 12 ms returned sat
[2026-05-28 04:49:47] [INFO ] [Real]Absence check using state equation in 3125 ms returned sat
[2026-05-28 04:49:47] [INFO ] State equation strengthened by 4385 read => feed constraints.
[2026-05-28 04:49:48] [INFO ] [Real]Added 4385 Read/Feed constraints in 713 ms returned sat
[2026-05-28 04:49:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:49:49] [INFO ] [Nat]Absence check using 47 positive place invariants in 80 ms returned sat
[2026-05-28 04:49:49] [INFO ] [Nat]Absence check using 47 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-28 04:49:52] [INFO ] [Nat]Absence check using state equation in 3604 ms returned sat
[2026-05-28 04:49:56] [INFO ] [Nat]Added 4385 Read/Feed constraints in 3650 ms returned sat
[2026-05-28 04:49:57] [INFO ] Computed and/alt/rep : 4514/6536/4514 causal constraints (skipped 3027 transitions) in 477 ms.
[2026-05-28 04:49:58] [INFO ] Added : 7 causal constraints over 2 iterations in 2015 ms. Result :sat
Minimization took 6161 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 2763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2763/2763 places, 8520/8520 transitions.
Applied a total of 0 rules in 513 ms. Remains 2763 /2763 variables (removed 0) and now considering 8520/8520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 2763/2763 places, 8520/8520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2763/2763 places, 8520/8520 transitions.
Applied a total of 0 rules in 458 ms. Remains 2763 /2763 variables (removed 0) and now considering 8520/8520 (removed 0) transitions.
[2026-05-28 04:50:05] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:50:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:50:12] [INFO ] Implicit Places using invariants in 6197 ms returned []
[2026-05-28 04:50:12] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:50:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:50:15] [INFO ] State equation strengthened by 4385 read => feed constraints.
[2026-05-28 04:50:45] [INFO ] Performed 248/2763 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-28 04:51:15] [INFO ] Performed 590/2763 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-28 04:51:46] [INFO ] Performed 860/2763 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2026-05-28 04:52:17] [INFO ] Performed 1098/2763 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2026-05-28 04:52:17] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2026-05-28 04:52:17] [INFO ] Implicit Places using invariants and state equation in 124950 ms returned []
Implicit Place search using SMT with State Equation took 131186 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:52:17] [INFO ] Redundant transitions in 863 ms returned []
Running 8426 sub problems to find dead transitions.
[2026-05-28 04:52:18] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:52:18] [INFO ] Invariant cache hit.
[2026-05-28 04:52:18] [INFO ] State equation strengthened by 4385 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2760 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 8426 unsolved
SMT process timed out in 42903ms, After SMT, problems are : Problem set: 0 solved, 8426 unsolved
Search for dead transitions found 0 dead transitions in 42923ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175457 ms. Remains : 2763/2763 places, 8520/8520 transitions.
[2026-05-28 04:53:01] [INFO ] Flatten gal took : 300 ms
RANDOM walk for 40000 steps (1708 resets) in 2094 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (123 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
[2026-05-28 04:53:01] [INFO ] Flatten gal took : 382 ms
[2026-05-28 04:53:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11140232426623378848.gal : 34 ms
[2026-05-28 04:53:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13691816026344266934.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/ReachabilityCardinality11140232426623378848.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13691816026344266934.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 ...330
BEST_FIRST walk for 40003 steps (125 resets) in 270 ms. (147 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality13691816026344266934.prop.
Interrupted probabilistic random walk after 26325 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 26325 steps, saw 11079 distinct states, run finished after 3013 ms. (steps per millisecond=8 ) properties seen :0
[2026-05-28 04:53:04] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:53:04] [INFO ] Invariant cache hit.
[2026-05-28 04:53:04] [INFO ] State equation strengthened by 4385 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2650/2651 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2651 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2677 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2677 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/2711 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2711 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/2755 variables, 44/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2755 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/2763 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2763 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7635/10398 variables, 2763/2820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10398/10398 variables, and 7205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 2763/2763 constraints, ReadFeed: 4385/4385 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2650/2651 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2651 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2677 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:53:13] [INFO ] Deduced a trap composed of 159 places in 3223 ms of which 471 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:53:16] [INFO ] Deduced a trap composed of 95 places in 2462 ms of which 283 ms to minimize.
SMT process timed out in 11509ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2763/2763 places, 8520/8520 transitions.
Applied a total of 0 rules in 546 ms. Remains 2763 /2763 variables (removed 0) and now considering 8520/8520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 2763/2763 places, 8520/8520 transitions.
RANDOM walk for 40000 steps (1705 resets) in 1678 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (123 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (122 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 28256 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 2
Probabilistic random walk after 28256 steps, saw 11855 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
[2026-05-28 04:53:20] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:53:20] [INFO ] Invariant cache hit.
[2026-05-28 04:53:20] [INFO ] State equation strengthened by 4385 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2650/2651 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2651 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2677 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2677 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/2711 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2711 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/2755 variables, 44/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2755 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/2763 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2763 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7635/10398 variables, 2763/2820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/10398 variables, 4385/7205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :21 after 25
At refinement iteration 13 (INCLUDED_ONLY) 0/10398 variables, 0/7205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 65
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :65 after 67
At refinement iteration 14 (OVERLAPS) 0/10398 variables, 0/7205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10398/10398 variables, and 7205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6235 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 2763/2763 constraints, ReadFeed: 4385/4385 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 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, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :67 after 137
At refinement iteration 1 (OVERLAPS) 2650/2651 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2651 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2677 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :137 after 176
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :176 after 232
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :232 after 295
[2026-05-28 04:53:30] [INFO ] Deduced a trap composed of 159 places in 3372 ms of which 462 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:53:33] [INFO ] Deduced a trap composed of 95 places in 2779 ms of which 284 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :295 after 601
[2026-05-28 04:53:36] [INFO ] Deduced a trap composed of 89 places in 2635 ms of which 286 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:53:39] [INFO ] Deduced a trap composed of 185 places in 2958 ms of which 469 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :601 after 1026
[2026-05-28 04:53:43] [INFO ] Deduced a trap composed of 105 places in 3779 ms of which 309 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:53:46] [INFO ] Deduced a trap composed of 119 places in 3638 ms of which 338 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:53:50] [INFO ] Deduced a trap composed of 329 places in 3016 ms of which 813 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2026-05-28 04:53:52] [INFO ] Flatten gal took : 232 ms
[2026-05-28 04:53:52] [INFO ] Applying decomposition
[2026-05-28 04:53:52] [INFO ] Flatten gal took : 242 ms
[2026-05-28 04:53:52] [INFO ] Deduced a trap composed of 105 places in 2495 ms of which 356 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 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/graph16886249206517135713.txt' '-o' '/tmp/graph16886249206517135713.bin' '-w' '/tmp/graph16886249206517135713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16886249206517135713.bin' '-l' '-1' '-v' '-w' '/tmp/graph16886249206517135713.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:53:52] [INFO ] Decomposing Gal with order
[2026-05-28 04:53:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:53:54] [INFO ] Deduced a trap composed of 89 places in 1987 ms of which 275 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:53:54] [INFO ] Removed a total of 12689 redundant transitions.
[2026-05-28 04:53:55] [INFO ] Flatten gal took : 1567 ms
[2026-05-28 04:53:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 7284 labels/synchronizations in 580 ms.
[2026-05-28 04:53:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality249298796433710120.gal : 70 ms
[2026-05-28 04:53:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5036439397782264829.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/ReachabilityCardinality249298796433710120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5036439397782264829.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
[2026-05-28 04:53:57] [INFO ] Deduced a trap composed of 215 places in 2322 ms of which 613 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality5036439397782264829.prop.
[2026-05-28 04:54:00] [INFO ] Deduced a trap composed of 287 places in 2942 ms of which 746 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:54:02] [INFO ] Deduced a trap composed of 119 places in 2780 ms of which 348 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:54:05] [INFO ] Deduced a trap composed of 88 places in 2104 ms of which 265 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:54:07] [INFO ] Deduced a trap composed of 215 places in 2469 ms of which 521 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:54:10] [INFO ] Deduced a trap composed of 159 places in 2653 ms of which 447 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:54:12] [INFO ] Deduced a trap composed of 137 places in 2161 ms of which 386 ms to minimize.
SMT process timed out in 51958ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2763/2763 places, 8520/8520 transitions.
Applied a total of 0 rules in 639 ms. Remains 2763 /2763 variables (removed 0) and now considering 8520/8520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 640 ms. Remains : 2763/2763 places, 8520/8520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2763/2763 places, 8520/8520 transitions.
Applied a total of 0 rules in 479 ms. Remains 2763 /2763 variables (removed 0) and now considering 8520/8520 (removed 0) transitions.
[2026-05-28 04:54:13] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:54:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:54:19] [INFO ] Implicit Places using invariants in 5680 ms returned []
[2026-05-28 04:54:19] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:54:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:54:22] [INFO ] State equation strengthened by 4385 read => feed constraints.
Detected timeout of ITS tools.
[2026-05-28 04:54:52] [INFO ] Performed 207/2763 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-28 04:55:22] [INFO ] Performed 512/2763 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-28 04:55:53] [INFO ] Performed 857/2763 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-28 04:56:23] [INFO ] Performed 1084/2763 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-28 04:56:23] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-28 04:56:23] [INFO ] Implicit Places using invariants and state equation in 124191 ms returned []
Implicit Place search using SMT with State Equation took 129898 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:56:24] [INFO ] Redundant transitions in 933 ms returned []
Running 8426 sub problems to find dead transitions.
[2026-05-28 04:56:24] [INFO ] Flow matrix only has 7635 transitions (discarded 885 similar events)
[2026-05-28 04:56:24] [INFO ] Invariant cache hit.
[2026-05-28 04:56:24] [INFO ] State equation strengthened by 4385 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2760 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 8426 unsolved
SMT process timed out in 42941ms, After SMT, problems are : Problem set: 0 solved, 8426 unsolved
Search for dead transitions found 0 dead transitions in 42959ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174361 ms. Remains : 2763/2763 places, 8520/8520 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-00 in 479157 ms.
[2026-05-28 04:57:07] [INFO ] Flatten gal took : 234 ms
[2026-05-28 04:57:07] [INFO ] Applying decomposition
[2026-05-28 04:57:08] [INFO ] Flatten gal took : 236 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/graph4450960715922401171.txt' '-o' '/tmp/graph4450960715922401171.bin' '-w' '/tmp/graph4450960715922401171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4450960715922401171.bin' '-l' '-1' '-v' '-w' '/tmp/graph4450960715922401171.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:57:08] [INFO ] Decomposing Gal with order
[2026-05-28 04:57:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:57:10] [INFO ] Removed a total of 12721 redundant transitions.
[2026-05-28 04:57:10] [INFO ] Flatten gal took : 1469 ms
[2026-05-28 04:57:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 6780 labels/synchronizations in 547 ms.
[2026-05-28 04:57:11] [INFO ] Time to serialize gal into /tmp/UpperBounds10080081344447277681.gal : 72 ms
[2026-05-28 04:57:11] [INFO ] Time to serialize properties into /tmp/UpperBounds8332572015374921772.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/UpperBounds10080081344447277681.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8332572015374921772.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 ...284
Loading property file /tmp/UpperBounds8332572015374921772.prop.
ITS-tools command line returned an error code 137
[2026-05-28 05:05:36] [INFO ] Flatten gal took : 1762 ms
[2026-05-28 05:05:36] [INFO ] Time to serialize gal into /tmp/UpperBounds12684277412738845260.gal : 109 ms
[2026-05-28 05:05:36] [INFO ] Time to serialize properties into /tmp/UpperBounds5163737889075755665.prop : 10 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/UpperBounds12684277412738845260.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5163737889075755665.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 ...305
Loading property file /tmp/UpperBounds5163737889075755665.prop.
ITS-tools command line returned an error code 137
[2026-05-28 05:18:08] [INFO ] Flatten gal took : 237 ms
[2026-05-28 05:18:15] [INFO ] Input system was already deterministic with 8520 transitions.
[2026-05-28 05:18:16] [INFO ] Transformed 2763 places.
[2026-05-28 05:18:20] [INFO ] Transformed 8520 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-28 05:18:23] [INFO ] Time to serialize gal into /tmp/UpperBounds9559743060331049140.gal : 32 ms
[2026-05-28 05:18:23] [INFO ] Time to serialize properties into /tmp/UpperBounds4852593947040539764.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/UpperBounds9559743060331049140.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4852593947040539764.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds4852593947040539764.prop.

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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="MultiCrashLeafsetExtension-PT-S24C04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5973"
echo " Executing tool gold2025"
echo " Input is MultiCrashLeafsetExtension-PT-S24C04, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r191-oct2-177969025600058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C04.tgz
mv MultiCrashLeafsetExtension-PT-S24C04 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;