About the Execution of 2025-gold for FireWire-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 698.104 | 187894.00 | 221102.00 | 631.50 | 1 1 1 1 1 1 1 1 1 1 1 1 1 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/fkordon/mcc2026-input.r143-smll-177955812400034.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is FireWire-PT-16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-smll-177955812400034
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 8.6K Mar 7 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 7 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 7 05:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 05:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 05:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 7 05:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Mar 7 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Mar 7 05:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 84K 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 FireWire-PT-16-UpperBounds-00
FORMULA_NAME FireWire-PT-16-UpperBounds-01
FORMULA_NAME FireWire-PT-16-UpperBounds-02
FORMULA_NAME FireWire-PT-16-UpperBounds-03
FORMULA_NAME FireWire-PT-16-UpperBounds-04
FORMULA_NAME FireWire-PT-16-UpperBounds-05
FORMULA_NAME FireWire-PT-16-UpperBounds-06
FORMULA_NAME FireWire-PT-16-UpperBounds-07
FORMULA_NAME FireWire-PT-16-UpperBounds-08
FORMULA_NAME FireWire-PT-16-UpperBounds-09
FORMULA_NAME FireWire-PT-16-UpperBounds-10
FORMULA_NAME FireWire-PT-16-UpperBounds-11
FORMULA_NAME FireWire-PT-16-UpperBounds-12
FORMULA_NAME FireWire-PT-16-UpperBounds-13
FORMULA_NAME FireWire-PT-16-UpperBounds-14
FORMULA_NAME FireWire-PT-16-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779625962038
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-24 12:32:44] [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-24 12:32:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:32:44] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2026-05-24 12:32:44] [INFO ] Transformed 254 places.
[2026-05-24 12:32:44] [INFO ] Transformed 368 transitions.
[2026-05-24 12:32:44] [INFO ] Found NUPN structural information;
[2026-05-24 12:32:44] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 451 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 368 rows 254 cols
[2026-05-24 12:32:44] [INFO ] Computed 5 invariants in 21 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 41 ms. (238 steps per ms)
FORMULA FireWire-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100000 steps (31 resets) in 183 ms. (543 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-24 12:32:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:32:45] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2026-05-24 12:32:45] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2026-05-24 12:32:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:32:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2026-05-24 12:32:46] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:32:46] [INFO ] Deduced a trap composed of 129 places in 330 ms of which 33 ms to minimize.
[2026-05-24 12:32:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
[2026-05-24 12:32:46] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 40 ms.
[2026-05-24 12:32:50] [INFO ] Added : 306 causal constraints over 62 iterations in 3692 ms. Result :sat
Minimization took 502 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:32:51] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2026-05-24 12:32:51] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:32:51] [INFO ] Deduced a trap composed of 80 places in 219 ms of which 28 ms to minimize.
[2026-05-24 12:32:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:32:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2026-05-24 12:32:52] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:32:52] [INFO ] Deduced a trap composed of 80 places in 256 ms of which 32 ms to minimize.
[2026-05-24 12:32:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2026-05-24 12:32:52] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 54 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:32:56] [INFO ] Deduced a trap composed of 88 places in 354 ms of which 59 ms to minimize.
[2026-05-24 12:32:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 493 ms
[2026-05-24 12:32:56] [INFO ] Added : 296 causal constraints over 60 iterations in 4286 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:32:56] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2026-05-24 12:32:57] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2026-05-24 12:32:57] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 44 ms.
[2026-05-24 12:32:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:32:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2026-05-24 12:32:57] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:32:58] [INFO ] Deduced a trap composed of 76 places in 296 ms of which 59 ms to minimize.
[2026-05-24 12:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2026-05-24 12:32:58] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 53 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:02] [INFO ] Deduced a trap composed of 88 places in 245 ms of which 51 ms to minimize.
[2026-05-24 12:33:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2026-05-24 12:33:02] [INFO ] Added : 287 causal constraints over 58 iterations in 4202 ms. Result :sat
Minimization took 109 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:33:02] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2026-05-24 12:33:02] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2026-05-24 12:33:02] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 51 ms.
[2026-05-24 12:33:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:33:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2026-05-24 12:33:03] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2026-05-24 12:33:03] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 45 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:07] [INFO ] Deduced a trap composed of 88 places in 350 ms of which 75 ms to minimize.
[2026-05-24 12:33:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 465 ms
[2026-05-24 12:33:07] [INFO ] Added : 298 causal constraints over 60 iterations in 3986 ms. Result :sat
Minimization took 458 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:33:08] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2026-05-24 12:33:08] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2026-05-24 12:33:08] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 45 ms.
[2026-05-24 12:33:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:33:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2026-05-24 12:33:09] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:09] [INFO ] Deduced a trap composed of 76 places in 219 ms of which 29 ms to minimize.
[2026-05-24 12:33:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2026-05-24 12:33:09] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 40 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:12] [INFO ] Deduced a trap composed of 88 places in 291 ms of which 59 ms to minimize.
[2026-05-24 12:33:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
[2026-05-24 12:33:12] [INFO ] Added : 281 causal constraints over 57 iterations in 3411 ms. Result :sat
Minimization took 426 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:33:13] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2026-05-24 12:33:13] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2026-05-24 12:33:13] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 35 ms.
[2026-05-24 12:33:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:33:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2026-05-24 12:33:14] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:14] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:14] [INFO ] Deduced a trap composed of 76 places in 171 ms of which 35 ms to minimize.
[2026-05-24 12:33:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 376 ms
[2026-05-24 12:33:14] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 27 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:17] [INFO ] Deduced a trap composed of 88 places in 330 ms of which 66 ms to minimize.
[2026-05-24 12:33:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 471 ms
[2026-05-24 12:33:17] [INFO ] Added : 270 causal constraints over 54 iterations in 3207 ms. Result :sat
Minimization took 405 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:33:18] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2026-05-24 12:33:18] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2026-05-24 12:33:18] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 41 ms.
[2026-05-24 12:33:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:33:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2026-05-24 12:33:19] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2026-05-24 12:33:19] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 42 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:21] [INFO ] Deduced a trap composed of 88 places in 283 ms of which 61 ms to minimize.
[2026-05-24 12:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2026-05-24 12:33:22] [INFO ] Added : 269 causal constraints over 54 iterations in 2913 ms. Result :sat
Minimization took 265 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:33:22] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2026-05-24 12:33:22] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2026-05-24 12:33:22] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 37 ms.
[2026-05-24 12:33:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:33:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2026-05-24 12:33:23] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:23] [INFO ] Deduced a trap composed of 124 places in 346 ms of which 71 ms to minimize.
[2026-05-24 12:33:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 392 ms
[2026-05-24 12:33:23] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 36 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:26] [INFO ] Deduced a trap composed of 88 places in 323 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:27] [INFO ] Deduced a trap composed of 101 places in 203 ms of which 26 ms to minimize.
[2026-05-24 12:33:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 687 ms
[2026-05-24 12:33:27] [INFO ] Added : 280 causal constraints over 56 iterations in 3610 ms. Result :sat
Minimization took 422 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:33:27] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2026-05-24 12:33:28] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2026-05-24 12:33:28] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 40 ms.
[2026-05-24 12:33:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:33:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2026-05-24 12:33:28] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:28] [INFO ] Deduced a trap composed of 76 places in 254 ms of which 44 ms to minimize.
[2026-05-24 12:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2026-05-24 12:33:28] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 38 ms.
[2026-05-24 12:33:32] [INFO ] Added : 297 causal constraints over 60 iterations in 3551 ms. Result :sat
Minimization took 467 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 368/368 transitions.
Graph (trivial) has 204 edges and 254 vertex of which 19 / 254 are part of one of the 3 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 581 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 235 transition count 279
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 167 transition count 276
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 150 place count 165 transition count 270
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 156 place count 159 transition count 270
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 156 place count 159 transition count 266
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 164 place count 155 transition count 266
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 188 place count 131 transition count 242
Iterating global reduction 4 with 24 rules applied. Total rules applied 212 place count 131 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 213 place count 131 transition count 241
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 213 place count 131 transition count 236
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 223 place count 126 transition count 236
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 227 place count 122 transition count 221
Iterating global reduction 5 with 4 rules applied. Total rules applied 231 place count 122 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 233 place count 122 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 234 place count 121 transition count 219
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 276 place count 100 transition count 198
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 302 place count 87 transition count 254
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 304 place count 87 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 311 place count 87 transition count 245
Free-agglomeration rule applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 323 place count 87 transition count 233
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 337 place count 75 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 9 with 42 rules applied. Total rules applied 379 place count 75 transition count 189
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 380 place count 75 transition count 189
Applied a total of 380 rules in 175 ms. Remains 75 /254 variables (removed 179) and now considering 189/368 (removed 179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 75/254 places, 189/368 transitions.
[2026-05-24 12:33:36] [INFO ] Flow matrix only has 185 transitions (discarded 4 similar events)
// Phase 1: matrix 185 rows 75 cols
[2026-05-24 12:33:36] [INFO ] Computed 4 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (99649 resets) in 1275 ms. (783 steps per ms)
FORMULA FireWire-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000002 steps (256326 resets) in 3909 ms. (1790 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-24 12:33:42] [INFO ] Flow matrix only has 185 transitions (discarded 4 similar events)
[2026-05-24 12:33:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:42] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-24 12:33:42] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2026-05-24 12:33:42] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-24 12:33:42] [INFO ] [Real]Added 31 Read/Feed constraints in 14 ms returned sat
[2026-05-24 12:33:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:42] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2026-05-24 12:33:42] [INFO ] [Nat]Added 31 Read/Feed constraints in 18 ms returned sat
[2026-05-24 12:33:42] [INFO ] Computed and/alt/rep : 86/442/86 causal constraints (skipped 97 transitions) in 21 ms.
[2026-05-24 12:33:42] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Minimization took 83 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:42] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:33:42] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2026-05-24 12:33:42] [INFO ] [Real]Added 31 Read/Feed constraints in 10 ms returned sat
[2026-05-24 12:33:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2026-05-24 12:33:42] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2026-05-24 12:33:42] [INFO ] [Nat]Added 31 Read/Feed constraints in 12 ms returned sat
[2026-05-24 12:33:42] [INFO ] Computed and/alt/rep : 86/442/86 causal constraints (skipped 97 transitions) in 22 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:43] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 18 ms to minimize.
[2026-05-24 12:33:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2026-05-24 12:33:43] [INFO ] Added : 50 causal constraints over 11 iterations in 515 ms. Result :sat
Minimization took 141 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:43] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-24 12:33:43] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2026-05-24 12:33:43] [INFO ] [Real]Added 31 Read/Feed constraints in 15 ms returned sat
[2026-05-24 12:33:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:33:43] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2026-05-24 12:33:43] [INFO ] [Nat]Added 31 Read/Feed constraints in 27 ms returned sat
[2026-05-24 12:33:43] [INFO ] Computed and/alt/rep : 86/442/86 causal constraints (skipped 97 transitions) in 21 ms.
[2026-05-24 12:33:43] [INFO ] Added : 2 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 79 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:44] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:33:44] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2026-05-24 12:33:44] [INFO ] [Real]Added 31 Read/Feed constraints in 10 ms returned sat
[2026-05-24 12:33:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:44] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2026-05-24 12:33:44] [INFO ] [Nat]Added 31 Read/Feed constraints in 19 ms returned sat
[2026-05-24 12:33:44] [INFO ] Computed and/alt/rep : 86/442/86 causal constraints (skipped 97 transitions) in 18 ms.
[2026-05-24 12:33:44] [INFO ] Added : 40 causal constraints over 9 iterations in 284 ms. Result :sat
Minimization took 127 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:44] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:44] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-24 12:33:44] [INFO ] [Real]Added 31 Read/Feed constraints in 13 ms returned sat
[2026-05-24 12:33:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:45] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2026-05-24 12:33:45] [INFO ] [Nat]Added 31 Read/Feed constraints in 23 ms returned sat
[2026-05-24 12:33:45] [INFO ] Computed and/alt/rep : 86/442/86 causal constraints (skipped 97 transitions) in 19 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:45] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 6 ms to minimize.
[2026-05-24 12:33:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2026-05-24 12:33:45] [INFO ] Added : 44 causal constraints over 10 iterations in 409 ms. Result :sat
Minimization took 130 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:45] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-24 12:33:45] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2026-05-24 12:33:45] [INFO ] [Real]Added 31 Read/Feed constraints in 11 ms returned sat
[2026-05-24 12:33:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:45] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2026-05-24 12:33:45] [INFO ] [Nat]Added 31 Read/Feed constraints in 16 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:46] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 7 ms to minimize.
[2026-05-24 12:33:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2026-05-24 12:33:46] [INFO ] Computed and/alt/rep : 86/442/86 causal constraints (skipped 97 transitions) in 19 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:46] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 7 ms to minimize.
[2026-05-24 12:33:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2026-05-24 12:33:46] [INFO ] Added : 45 causal constraints over 11 iterations in 514 ms. Result :sat
Minimization took 131 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:46] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:46] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-24 12:33:46] [INFO ] [Real]Added 31 Read/Feed constraints in 9 ms returned sat
[2026-05-24 12:33:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:47] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2026-05-24 12:33:47] [INFO ] [Nat]Added 31 Read/Feed constraints in 21 ms returned sat
[2026-05-24 12:33:47] [INFO ] Computed and/alt/rep : 86/442/86 causal constraints (skipped 97 transitions) in 21 ms.
[2026-05-24 12:33:47] [INFO ] Added : 0 causal constraints over 0 iterations in 47 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 189/189 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 74 transition count 188
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 73 transition count 189
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 73 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 72 transition count 188
Applied a total of 8 rules in 47 ms. Remains 72 /75 variables (removed 3) and now considering 188/189 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 72/75 places, 188/189 transitions.
[2026-05-24 12:33:47] [INFO ] Flow matrix only has 169 transitions (discarded 19 similar events)
// Phase 1: matrix 169 rows 72 cols
[2026-05-24 12:33:47] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (99420 resets) in 1028 ms. (971 steps per ms)
FORMULA FireWire-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000003 steps (183181 resets) in 2257 ms. (2214 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-24 12:33:50] [INFO ] Flow matrix only has 169 transitions (discarded 19 similar events)
[2026-05-24 12:33:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:50] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:33:50] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2026-05-24 12:33:50] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-24 12:33:50] [INFO ] [Real]Added 31 Read/Feed constraints in 7 ms returned sat
[2026-05-24 12:33:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:33:51] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2026-05-24 12:33:51] [INFO ] [Nat]Added 31 Read/Feed constraints in 12 ms returned sat
[2026-05-24 12:33:51] [INFO ] Computed and/alt/rep : 85/418/85 causal constraints (skipped 82 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:51] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 9 ms to minimize.
[2026-05-24 12:33:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2026-05-24 12:33:51] [INFO ] Added : 50 causal constraints over 11 iterations in 292 ms. Result :sat
Minimization took 84 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:51] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:51] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2026-05-24 12:33:51] [INFO ] [Real]Added 31 Read/Feed constraints in 13 ms returned sat
[2026-05-24 12:33:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:33:51] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2026-05-24 12:33:51] [INFO ] [Nat]Added 31 Read/Feed constraints in 22 ms returned sat
[2026-05-24 12:33:51] [INFO ] Computed and/alt/rep : 85/418/85 causal constraints (skipped 82 transitions) in 18 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:52] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:52] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 16 ms to minimize.
[2026-05-24 12:33:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2026-05-24 12:33:52] [INFO ] Added : 55 causal constraints over 13 iterations in 771 ms. Result :sat
Minimization took 122 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:52] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:52] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-24 12:33:52] [INFO ] [Real]Added 31 Read/Feed constraints in 21 ms returned sat
[2026-05-24 12:33:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:52] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-24 12:33:52] [INFO ] [Nat]Added 31 Read/Feed constraints in 15 ms returned sat
[2026-05-24 12:33:52] [INFO ] Computed and/alt/rep : 85/418/85 causal constraints (skipped 82 transitions) in 19 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:53] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 14 ms to minimize.
[2026-05-24 12:33:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2026-05-24 12:33:53] [INFO ] Added : 50 causal constraints over 10 iterations in 461 ms. Result :sat
Minimization took 125 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:53] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:53] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-24 12:33:53] [INFO ] [Real]Added 31 Read/Feed constraints in 19 ms returned sat
[2026-05-24 12:33:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:53] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-24 12:33:53] [INFO ] [Nat]Added 31 Read/Feed constraints in 17 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:53] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 7 ms to minimize.
[2026-05-24 12:33:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2026-05-24 12:33:54] [INFO ] Computed and/alt/rep : 85/418/85 causal constraints (skipped 82 transitions) in 18 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:54] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 16 ms to minimize.
[2026-05-24 12:33:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2026-05-24 12:33:54] [INFO ] Added : 60 causal constraints over 13 iterations in 548 ms. Result :sat
Minimization took 122 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:54] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:54] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2026-05-24 12:33:54] [INFO ] [Real]Added 31 Read/Feed constraints in 12 ms returned sat
[2026-05-24 12:33:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:33:54] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-24 12:33:54] [INFO ] [Nat]Added 31 Read/Feed constraints in 15 ms returned sat
[2026-05-24 12:33:54] [INFO ] Computed and/alt/rep : 85/418/85 causal constraints (skipped 82 transitions) in 16 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:55] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:55] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 19 ms to minimize.
[2026-05-24 12:33:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2026-05-24 12:33:55] [INFO ] Added : 39 causal constraints over 8 iterations in 588 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA FireWire-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 188/188 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 72 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 71 transition count 187
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 68 transition count 194
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 68 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 26 place count 68 transition count 176
Applied a total of 26 rules in 27 ms. Remains 68 /72 variables (removed 4) and now considering 176/188 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 68/72 places, 176/188 transitions.
[2026-05-24 12:33:55] [INFO ] Flow matrix only has 159 transitions (discarded 17 similar events)
// Phase 1: matrix 159 rows 68 cols
[2026-05-24 12:33:55] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (99626 resets) in 1096 ms. (911 steps per ms)
BEST_FIRST walk for 3000002 steps (109713 resets) in 1194 ms. (2510 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-24 12:33:58] [INFO ] Flow matrix only has 159 transitions (discarded 17 similar events)
[2026-05-24 12:33:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-24 12:33:58] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-24 12:33:58] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-24 12:33:58] [INFO ] [Real]Added 32 Read/Feed constraints in 10 ms returned sat
[2026-05-24 12:33:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-24 12:33:58] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2026-05-24 12:33:58] [INFO ] [Nat]Added 32 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:58] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:58] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 8 ms to minimize.
[2026-05-24 12:33:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2026-05-24 12:33:58] [INFO ] Computed and/alt/rep : 76/411/76 causal constraints (skipped 81 transitions) in 20 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:58] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 6 ms to minimize.
[2026-05-24 12:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2026-05-24 12:33:58] [INFO ] Added : 40 causal constraints over 9 iterations in 383 ms. Result :sat
Minimization took 134 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:59] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:59] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-24 12:33:59] [INFO ] [Real]Added 32 Read/Feed constraints in 15 ms returned sat
[2026-05-24 12:33:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:33:59] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-24 12:33:59] [INFO ] [Nat]Added 32 Read/Feed constraints in 15 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:59] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:33:59] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 8 ms to minimize.
[2026-05-24 12:33:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2026-05-24 12:33:59] [INFO ] Computed and/alt/rep : 76/411/76 causal constraints (skipped 81 transitions) in 17 ms.
[2026-05-24 12:33:59] [INFO ] Added : 11 causal constraints over 3 iterations in 126 ms. Result :sat
Minimization took 81 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:59] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:33:59] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2026-05-24 12:33:59] [INFO ] [Real]Added 32 Read/Feed constraints in 17 ms returned sat
[2026-05-24 12:33:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:33:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:34:00] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2026-05-24 12:34:00] [INFO ] [Nat]Added 32 Read/Feed constraints in 19 ms returned sat
[2026-05-24 12:34:00] [INFO ] Computed and/alt/rep : 76/411/76 causal constraints (skipped 81 transitions) in 19 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:00] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 9 ms to minimize.
[2026-05-24 12:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2026-05-24 12:34:00] [INFO ] Added : 37 causal constraints over 9 iterations in 410 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 68/68 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2026-05-24 12:34:00] [INFO ] Flow matrix only has 159 transitions (discarded 17 similar events)
[2026-05-24 12:34:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:34:00] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-24 12:34:00] [INFO ] Flow matrix only has 159 transitions (discarded 17 similar events)
[2026-05-24 12:34:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:34:00] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-24 12:34:01] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:34:01] [INFO ] Redundant transitions in 11 ms returned []
Running 174 sub problems to find dead transitions.
[2026-05-24 12:34:01] [INFO ] Flow matrix only has 159 transitions (discarded 17 similar events)
[2026-05-24 12:34:01] [INFO ] Invariant cache hit.
[2026-05-24 12:34:01] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:03] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 9 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:03] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 9 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD159 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 2/6 constraints. Problems are: Problem set: 12 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 12 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 159/227 variables, 68/74 constraints. Problems are: Problem set: 12 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 32/106 constraints. Problems are: Problem set: 12 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/106 constraints. Problems are: Problem set: 12 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/106 constraints. Problems are: Problem set: 12 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 106 constraints, problems are : Problem set: 12 solved, 162 unsolved in 9855 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 162 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 2/6 constraints. Problems are: Problem set: 12 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 12 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 159/227 variables, 68/74 constraints. Problems are: Problem set: 12 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 32/106 constraints. Problems are: Problem set: 12 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 162/268 constraints. Problems are: Problem set: 12 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/268 constraints. Problems are: Problem set: 12 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/268 constraints. Problems are: Problem set: 12 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 268 constraints, problems are : Problem set: 12 solved, 162 unsolved in 14296 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 162/174 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24426ms problems are : Problem set: 12 solved, 162 unsolved
Search for dead transitions found 12 dead transitions in 24442ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 68/68 places, 164/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 68 /68 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:34:25] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24883 ms. Remains : 68/68 places, 164/176 transitions.
[2026-05-24 12:34:25] [INFO ] Flow matrix only has 147 transitions (discarded 17 similar events)
// Phase 1: matrix 147 rows 68 cols
[2026-05-24 12:34:25] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (99612 resets) in 1067 ms. (936 steps per ms)
BEST_FIRST walk for 3000000 steps (109926 resets) in 1191 ms. (2516 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-24 12:34:27] [INFO ] Flow matrix only has 147 transitions (discarded 17 similar events)
[2026-05-24 12:34:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:34:27] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:34:27] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-24 12:34:27] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-24 12:34:27] [INFO ] [Real]Added 32 Read/Feed constraints in 11 ms returned sat
[2026-05-24 12:34:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:34:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:34:28] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2026-05-24 12:34:28] [INFO ] [Nat]Added 32 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:28] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 5 ms to minimize.
[2026-05-24 12:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2026-05-24 12:34:28] [INFO ] Computed and/alt/rep : 76/371/76 causal constraints (skipped 69 transitions) in 11 ms.
[2026-05-24 12:34:28] [INFO ] Added : 53 causal constraints over 11 iterations in 174 ms. Result :sat
Minimization took 117 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:34:28] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:34:28] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-24 12:34:28] [INFO ] [Real]Added 32 Read/Feed constraints in 13 ms returned sat
[2026-05-24 12:34:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:34:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:34:28] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-24 12:34:28] [INFO ] [Nat]Added 32 Read/Feed constraints in 16 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:28] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 8 ms to minimize.
[2026-05-24 12:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2026-05-24 12:34:28] [INFO ] Computed and/alt/rep : 76/371/76 causal constraints (skipped 69 transitions) in 15 ms.
[2026-05-24 12:34:29] [INFO ] Added : 56 causal constraints over 12 iterations in 307 ms. Result :sat
Minimization took 145 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:34:29] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:34:29] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-24 12:34:29] [INFO ] [Real]Added 32 Read/Feed constraints in 15 ms returned sat
[2026-05-24 12:34:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:34:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-24 12:34:29] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-24 12:34:29] [INFO ] [Nat]Added 32 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:29] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 8 ms to minimize.
[2026-05-24 12:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2026-05-24 12:34:29] [INFO ] Computed and/alt/rep : 76/371/76 causal constraints (skipped 69 transitions) in 16 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:30] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 6 ms to minimize.
[2026-05-24 12:34:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2026-05-24 12:34:30] [INFO ] Added : 54 causal constraints over 12 iterations in 481 ms. Result :sat
Minimization took 139 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 164/164 transitions.
Applied a total of 0 rules in 8 ms. Remains 68 /68 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 68/68 places, 164/164 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 164/164 transitions.
Applied a total of 0 rules in 7 ms. Remains 68 /68 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2026-05-24 12:34:30] [INFO ] Flow matrix only has 147 transitions (discarded 17 similar events)
[2026-05-24 12:34:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:34:30] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-24 12:34:30] [INFO ] Flow matrix only has 147 transitions (discarded 17 similar events)
[2026-05-24 12:34:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:34:30] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-24 12:34:30] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:34:30] [INFO ] Redundant transitions in 20 ms returned []
Running 162 sub problems to find dead transitions.
[2026-05-24 12:34:30] [INFO ] Flow matrix only has 147 transitions (discarded 17 similar events)
[2026-05-24 12:34:30] [INFO ] Invariant cache hit.
[2026-05-24 12:34:30] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:32] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 7 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:32] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 10 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:32] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 11 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 3/7 constraints. Problems are: Problem set: 34 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 34 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 147/215 variables, 68/75 constraints. Problems are: Problem set: 34 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 32/107 constraints. Problems are: Problem set: 34 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/107 constraints. Problems are: Problem set: 34 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/215 variables, 0/107 constraints. Problems are: Problem set: 34 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 107 constraints, problems are : Problem set: 34 solved, 128 unsolved in 6932 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 34 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 34 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 4/4 constraints. Problems are: Problem set: 34 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 3/7 constraints. Problems are: Problem set: 34 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 34 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 147/215 variables, 68/75 constraints. Problems are: Problem set: 34 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 32/107 constraints. Problems are: Problem set: 34 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 128/235 constraints. Problems are: Problem set: 34 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:40] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 1/236 constraints. Problems are: Problem set: 34 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/236 constraints. Problems are: Problem set: 34 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/215 variables, 0/236 constraints. Problems are: Problem set: 34 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 236 constraints, problems are : Problem set: 34 solved, 128 unsolved in 15835 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 128/162 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22861ms problems are : Problem set: 34 solved, 128 unsolved
Search for dead transitions found 34 dead transitions in 22863ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 68/68 places, 130/164 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:34:53] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 23254 ms. Remains : 68/68 places, 130/164 transitions.
[2026-05-24 12:34:53] [INFO ] Flow matrix only has 113 transitions (discarded 17 similar events)
// Phase 1: matrix 113 rows 68 cols
[2026-05-24 12:34:53] [INFO ] Computed 4 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (99653 resets) in 1023 ms. (976 steps per ms)
BEST_FIRST walk for 3000002 steps (109730 resets) in 1135 ms. (2640 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-24 12:34:55] [INFO ] Flow matrix only has 113 transitions (discarded 17 similar events)
[2026-05-24 12:34:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:34:55] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:34:55] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-24 12:34:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-24 12:34:55] [INFO ] [Real]Added 25 Read/Feed constraints in 7 ms returned sat
[2026-05-24 12:34:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:34:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-24 12:34:56] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2026-05-24 12:34:56] [INFO ] [Nat]Added 25 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:56] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 4 ms to minimize.
[2026-05-24 12:34:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2026-05-24 12:34:56] [INFO ] Computed and/alt/rep : 70/340/70 causal constraints (skipped 41 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:56] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 5 ms to minimize.
[2026-05-24 12:34:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2026-05-24 12:34:56] [INFO ] Added : 41 causal constraints over 9 iterations in 216 ms. Result :sat
Minimization took 72 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:34:56] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:34:56] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-24 12:34:56] [INFO ] [Real]Added 25 Read/Feed constraints in 13 ms returned sat
[2026-05-24 12:34:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:34:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:34:56] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-24 12:34:56] [INFO ] [Nat]Added 25 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:56] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:56] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 7 ms to minimize.
[2026-05-24 12:34:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2026-05-24 12:34:56] [INFO ] Computed and/alt/rep : 70/340/70 causal constraints (skipped 41 transitions) in 12 ms.
[2026-05-24 12:34:56] [INFO ] Added : 19 causal constraints over 4 iterations in 88 ms. Result :sat
Minimization took 53 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:34:57] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:34:57] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-24 12:34:57] [INFO ] [Real]Added 25 Read/Feed constraints in 11 ms returned sat
[2026-05-24 12:34:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:34:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:34:57] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-24 12:34:57] [INFO ] [Nat]Added 25 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:57] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 6 ms to minimize.
[2026-05-24 12:34:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2026-05-24 12:34:57] [INFO ] Computed and/alt/rep : 70/340/70 causal constraints (skipped 41 transitions) in 14 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:57] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:57] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 6 ms to minimize.
[2026-05-24 12:34:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2026-05-24 12:34:57] [INFO ] Added : 35 causal constraints over 8 iterations in 421 ms. Result :sat
Minimization took 104 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 130/130 transitions.
Applied a total of 0 rules in 6 ms. Remains 68 /68 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 68/68 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 130/130 transitions.
Applied a total of 0 rules in 5 ms. Remains 68 /68 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2026-05-24 12:34:57] [INFO ] Flow matrix only has 113 transitions (discarded 17 similar events)
[2026-05-24 12:34:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:34:58] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-24 12:34:58] [INFO ] Flow matrix only has 113 transitions (discarded 17 similar events)
[2026-05-24 12:34:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:34:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-24 12:34:58] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:34:58] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2026-05-24 12:34:58] [INFO ] Flow matrix only has 113 transitions (discarded 17 similar events)
[2026-05-24 12:34:58] [INFO ] Invariant cache hit.
[2026-05-24 12:34:58] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:34:59] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 7 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 113/181 variables, 68/73 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 25/98 constraints. Problems are: Problem set: 2 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:35:01] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 1/99 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 99 constraints, problems are : Problem set: 2 solved, 126 unsolved in 6922 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 126 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 113/181 variables, 68/74 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 25/99 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 126/225 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:35:12] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/181 variables, 1/226 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/226 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/181 variables, 0/226 constraints. Problems are: Problem set: 2 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 226 constraints, problems are : Problem set: 2 solved, 126 unsolved in 18675 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 126/128 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25642ms problems are : Problem set: 2 solved, 126 unsolved
Search for dead transitions found 2 dead transitions in 25645ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 68/68 places, 128/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:35:24] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26068 ms. Remains : 68/68 places, 128/130 transitions.
[2026-05-24 12:35:24] [INFO ] Flow matrix only has 111 transitions (discarded 17 similar events)
// Phase 1: matrix 111 rows 68 cols
[2026-05-24 12:35:24] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (99615 resets) in 802 ms. (1245 steps per ms)
BEST_FIRST walk for 3000003 steps (109785 resets) in 1123 ms. (2669 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-24 12:35:25] [INFO ] Flow matrix only has 111 transitions (discarded 17 similar events)
[2026-05-24 12:35:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:35:26] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:35:26] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-24 12:35:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-24 12:35:26] [INFO ] [Real]Added 25 Read/Feed constraints in 16 ms returned sat
[2026-05-24 12:35:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:35:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:35:26] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2026-05-24 12:35:26] [INFO ] [Nat]Added 25 Read/Feed constraints in 16 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:35:26] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 7 ms to minimize.
[2026-05-24 12:35:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2026-05-24 12:35:26] [INFO ] Computed and/alt/rep : 68/330/68 causal constraints (skipped 41 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:35:26] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 13 ms to minimize.
[2026-05-24 12:35:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2026-05-24 12:35:26] [INFO ] Added : 44 causal constraints over 10 iterations in 318 ms. Result :sat
Minimization took 114 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:35:26] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:35:26] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-24 12:35:26] [INFO ] [Real]Added 25 Read/Feed constraints in 14 ms returned sat
[2026-05-24 12:35:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:35:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:35:26] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-24 12:35:26] [INFO ] [Nat]Added 25 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:35:27] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 11 ms to minimize.
[2026-05-24 12:35:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2026-05-24 12:35:27] [INFO ] Computed and/alt/rep : 68/330/68 causal constraints (skipped 41 transitions) in 9 ms.
[2026-05-24 12:35:27] [INFO ] Added : 43 causal constraints over 10 iterations in 200 ms. Result :sat
Minimization took 109 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:35:27] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:35:27] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2026-05-24 12:35:27] [INFO ] [Real]Added 25 Read/Feed constraints in 10 ms returned sat
[2026-05-24 12:35:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:35:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:35:27] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-24 12:35:27] [INFO ] [Nat]Added 25 Read/Feed constraints in 20 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:35:27] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 8 ms to minimize.
[2026-05-24 12:35:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2026-05-24 12:35:27] [INFO ] Computed and/alt/rep : 68/330/68 causal constraints (skipped 41 transitions) in 11 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:35:27] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 4 ms to minimize.
[2026-05-24 12:35:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2026-05-24 12:35:28] [INFO ] Added : 34 causal constraints over 7 iterations in 254 ms. Result :sat
Minimization took 124 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA FireWire-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 128/128 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 127
Applied a total of 2 rules in 9 ms. Remains 67 /68 variables (removed 1) and now considering 127/128 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 67/68 places, 127/128 transitions.
[2026-05-24 12:35:28] [INFO ] Flow matrix only has 110 transitions (discarded 17 similar events)
// Phase 1: matrix 110 rows 67 cols
[2026-05-24 12:35:28] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (99656 resets) in 1299 ms. (769 steps per ms)
BEST_FIRST walk for 2000002 steps (73293 resets) in 800 ms. (2496 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-24 12:35:30] [INFO ] Flow matrix only has 110 transitions (discarded 17 similar events)
[2026-05-24 12:35:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:35:30] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:35:30] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2026-05-24 12:35:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-24 12:35:30] [INFO ] [Real]Added 25 Read/Feed constraints in 12 ms returned sat
[2026-05-24 12:35: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-24 12:35:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:35:30] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2026-05-24 12:35:30] [INFO ] [Nat]Added 25 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:35:30] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 5 ms to minimize.
[2026-05-24 12:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2026-05-24 12:35:30] [INFO ] Computed and/alt/rep : 67/329/67 causal constraints (skipped 41 transitions) in 11 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:35:30] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 6 ms to minimize.
[2026-05-24 12:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2026-05-24 12:35:30] [INFO ] Added : 38 causal constraints over 9 iterations in 280 ms. Result :sat
Minimization took 101 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:35:31] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:35:31] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-24 12:35:31] [INFO ] [Real]Added 25 Read/Feed constraints in 16 ms returned sat
[2026-05-24 12:35:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:35:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:35:31] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-24 12:35:31] [INFO ] [Nat]Added 25 Read/Feed constraints in 14 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:35:31] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 8 ms to minimize.
[2026-05-24 12:35:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2026-05-24 12:35:31] [INFO ] Computed and/alt/rep : 67/329/67 causal constraints (skipped 41 transitions) in 12 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:35:31] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 6 ms to minimize.
[2026-05-24 12:35:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2026-05-24 12:35:31] [INFO ] Added : 39 causal constraints over 9 iterations in 332 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 127/127 transitions.
Applied a total of 0 rules in 6 ms. Remains 67 /67 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 67/67 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2026-05-24 12:35:31] [INFO ] Flow matrix only has 110 transitions (discarded 17 similar events)
[2026-05-24 12:35:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:35:31] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-24 12:35:31] [INFO ] Flow matrix only has 110 transitions (discarded 17 similar events)
[2026-05-24 12:35:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:35:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-24 12:35:32] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:35:32] [INFO ] Redundant transitions in 0 ms returned []
Running 125 sub problems to find dead transitions.
[2026-05-24 12:35:32] [INFO ] Flow matrix only has 110 transitions (discarded 17 similar events)
[2026-05-24 12:35:32] [INFO ] Invariant cache hit.
[2026-05-24 12:35:32] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 110/177 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:35:34] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 97 constraints, problems are : Problem set: 0 solved, 125 unsolved in 5644 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 67/67 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 110/177 variables, 67/72 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 125/222 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 222 constraints, problems are : Problem set: 0 solved, 125 unsolved in 11192 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 67/67 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16861ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 16862ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17241 ms. Remains : 67/67 places, 127/127 transitions.
RANDOM walk for 40000 steps (3969 resets) in 1034 ms. (38 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1454 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1443 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1449 resets) in 176 ms. (226 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1492 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
[2026-05-24 12:35:49] [INFO ] Flatten gal took : 94 ms
[2026-05-24 12:35:49] [INFO ] Flatten gal took : 48 ms
Finished probabilistic random walk after 5754 steps, run visited all 4 properties in 122 ms. (steps per millisecond=47 )
Probabilistic random walk after 5754 steps, saw 2078 distinct states, run finished after 128 ms. (steps per millisecond=44 ) properties seen :4
[2026-05-24 12:35:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality534055248787428527.gal : 15 ms
[2026-05-24 12:35:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17726179224712559640.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/ReachabilityCardinality534055248787428527.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17726179224712559640.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-16-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-16-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 185494 ms.
BK_STOP 1779626149932
--------------------
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="FireWire-PT-16"
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 FireWire-PT-16, 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 r143-smll-177955812400034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-16.tgz
mv FireWire-PT-16 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 '
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 ;