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.r047-tall-177946846400045.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 BugTracking-PT-q3m032, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tall-177946846400045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.1K Mar 5 17:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 5 17:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 5 17:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Mar 15 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 5 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Mar 5 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 17:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 5 17:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 07:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q3m032-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779483806820

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-22 21:03:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 21:03:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:03:28] [INFO ] Load time of PNML (sax parser for PT used): 784 ms
[2026-05-22 21:03:28] [INFO ] Transformed 754 places.
[2026-05-22 21:03:29] [INFO ] Transformed 27370 transitions.
[2026-05-22 21:03:29] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 992 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 514 places in 114 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m032-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2026-05-22 21:03:29] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2026-05-22 21:03:29] [INFO ] Computed 10 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, +inf, 1]
RANDOM walk for 10000 steps (20 resets) in 102 ms. (97 steps per ms)
FORMULA BugTracking-PT-q3m032-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BugTracking-PT-q3m032-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (5 resets) in 73 ms. (270 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, +inf]
[2026-05-22 21:03:29] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2026-05-22 21:03:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:03:29] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2026-05-22 21:03:30] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2026-05-22 21:03:30] [INFO ] State equation strengthened by 255 read => feed constraints.
[2026-05-22 21:03:30] [INFO ] [Real]Added 255 Read/Feed constraints in 79 ms returned sat
[2026-05-22 21:03:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:03:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-22 21:03:31] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2026-05-22 21:03:31] [INFO ] [Nat]Added 255 Read/Feed constraints in 117 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:03:32] [INFO ] Deduced a trap composed of 13 places in 1175 ms of which 862 ms to minimize.
[2026-05-22 21:03:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1332 ms
[2026-05-22 21:03:33] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 254 ms.
[2026-05-22 21:03:33] [INFO ] Added : 6 causal constraints over 2 iterations in 624 ms. Result :sat
Minimization took 669 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:03:34] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:03:34] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2026-05-22 21:03:34] [INFO ] [Real]Added 255 Read/Feed constraints in 43 ms returned sat
[2026-05-22 21:03:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:03:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-22 21:03:35] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2026-05-22 21:03:35] [INFO ] [Nat]Added 255 Read/Feed constraints in 186 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:03:35] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 8 ms to minimize.
[2026-05-22 21:03:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2026-05-22 21:03:35] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 180 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:03:36] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 9 ms to minimize.
[2026-05-22 21:03:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2026-05-22 21:03:37] [INFO ] Added : 18 causal constraints over 6 iterations in 1371 ms. Result :sat
Minimization took 617 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, +inf]
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 237 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 229/240 places, 2747/2769 transitions.
[2026-05-22 21:03:37] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {4=1, 1722=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 1722=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 2) seen :[0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0] Max Struct:[1, +inf]
[2026-05-22 21:03:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2026-05-22 21:03:38] [INFO ] Computed 8 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, +inf]
RANDOM walk for 1000005 steps (2 resets) in 1727 ms. (578 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 4264 ms. (468 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, +inf]
[2026-05-22 21:03:44] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2026-05-22 21:03:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:03:44] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:03:45] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2026-05-22 21:03: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-22 21:03:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:03:45] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2026-05-22 21:03:45] [INFO ] State equation strengthened by 241 read => feed constraints.
[2026-05-22 21:03:45] [INFO ] [Nat]Added 241 Read/Feed constraints in 99 ms returned sat
[2026-05-22 21:03:46] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 181 ms.
[2026-05-22 21:03:46] [INFO ] Added : 2 causal constraints over 1 iterations in 451 ms. Result :sat
Minimization took 1774 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:03:48] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:03:48] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2026-05-22 21:03:48] [INFO ] [Real]Added 241 Read/Feed constraints in 40 ms returned sat
[2026-05-22 21:03:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:03:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:03:49] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2026-05-22 21:03:49] [INFO ] [Nat]Added 241 Read/Feed constraints in 128 ms returned sat
[2026-05-22 21:03:49] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 177 ms.
[2026-05-22 21:03:49] [INFO ] Added : 5 causal constraints over 1 iterations in 421 ms. Result :sat
Minimization took 1747 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, +inf]
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 79 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 120 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2026-05-22 21:03:52] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2026-05-22 21:03:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:03:52] [INFO ] Implicit Places using invariants in 362 ms returned []
[2026-05-22 21:03:52] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2026-05-22 21:03:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:03:52] [INFO ] State equation strengthened by 241 read => feed constraints.
[2026-05-22 21:03:55] [INFO ] Implicit Places using invariants and state equation in 3094 ms returned []
Implicit Place search using SMT with State Equation took 3461 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:03:55] [INFO ] Redundant transitions in 219 ms returned []
Running 2746 sub problems to find dead transitions.
[2026-05-22 21:03:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2026-05-22 21:03:55] [INFO ] Invariant cache hit.
[2026-05-22 21:03:55] [INFO ] State equation strengthened by 241 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:04:20] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:04:23] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 5 ms to minimize.
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:04:23] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 4 ms to minimize.
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:04:24] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 3 ms to minimize.
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:04:24] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 3 ms to minimize.
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:04:24] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 4 ms to minimize.
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:04:24] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 3 ms to minimize.
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:04:30] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 8/16 constraints. Problems are: Problem set: 234 solved, 2512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/2847 variables, and 16 constraints, problems are : Problem set: 234 solved, 2512 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/1184 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 234 solved, 2512 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 7/7 constraints. Problems are: Problem set: 234 solved, 2512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 8/15 constraints. Problems are: Problem set: 234 solved, 2512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:04:41] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 3 ms to minimize.
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 1/16 constraints. Problems are: Problem set: 252 solved, 2494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 221/2847 variables, and 16 constraints, problems are : Problem set: 252 solved, 2494 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 1562/1184 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66024ms problems are : Problem set: 252 solved, 2494 unsolved
Search for dead transitions found 252 dead transitions in 66051ms
Found 252 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 252 transitions
Dead transitions reduction (with SMT) removed 252 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2495/2747 transitions.
Graph (complete) has 3016 edges and 229 vertex of which 221 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 650 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 191 transition count 1845
Reduce places removed 15 places and 271 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 46 place count 176 transition count 1574
Reduce places removed 9 places and 174 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 55 place count 167 transition count 1400
Reduce places removed 8 places and 119 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 63 place count 159 transition count 1281
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 158 transition count 1264
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 67 place count 155 transition count 1222
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 17 places and 270 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 87 place count 138 transition count 952
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 87 rules in 42 ms. Remains 138 /229 variables (removed 91) and now considering 952/2495 (removed 1543) transitions.
[2026-05-22 21:05:01] [INFO ] Flow matrix only has 902 transitions (discarded 50 similar events)
// Phase 1: matrix 902 rows 138 cols
[2026-05-22 21:05:01] [INFO ] Computed 8 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:05:01] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-22 21:05:01] [INFO ] Flow matrix only has 902 transitions (discarded 50 similar events)
[2026-05-22 21:05:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:05:02] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-22 21:05:02] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 138/229 places, 952/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 70922 ms. Remains : 138/229 places, 952/2747 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q3m032-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 21:05:02] [INFO ] Flow matrix only has 902 transitions (discarded 50 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {5=1, 75=1, 587=1, 862=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 587=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0] Max Struct:[1, +inf]
[2026-05-22 21:05:03] [INFO ] Flow matrix only has 902 transitions (discarded 50 similar events)
// Phase 1: matrix 902 rows 137 cols
[2026-05-22 21:05:03] [INFO ] Computed 7 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, +inf]
RANDOM walk for 1000000 steps (2 resets) in 957 ms. (1043 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1044 ms. (956 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, +inf]
[2026-05-22 21:05:05] [INFO ] Flow matrix only has 902 transitions (discarded 50 similar events)
[2026-05-22 21:05:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:05:05] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-22 21:05:05] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2026-05-22 21:05:05] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-22 21:05:05] [INFO ] [Real]Added 112 Read/Feed constraints in 17 ms returned sat
[2026-05-22 21:05:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:05:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:05:05] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2026-05-22 21:05:05] [INFO ] [Nat]Added 112 Read/Feed constraints in 36 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:05] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:05] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:06] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:06] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:06] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:06] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:06] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 6 ms to minimize.
[2026-05-22 21:05:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1154 ms
[2026-05-22 21:05:06] [INFO ] Computed and/alt/rep : 228/837/228 causal constraints (skipped 673 transitions) in 39 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:07] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:07] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:07] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:07] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 8 ms to minimize.
[2026-05-22 21:05:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 739 ms
[2026-05-22 21:05:07] [INFO ] Added : 13 causal constraints over 4 iterations in 1017 ms. Result :sat
Minimization took 426 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, +inf]
Support contains 1 out of 137 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place x2_PENDING_q6) removed 14 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 938/938 transitions.
Reduce places removed 2 places and 37 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 901
Reduce places removed 2 places and 31 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 133 transition count 870
Applied a total of 4 rules in 21 ms. Remains 133 /137 variables (removed 4) and now considering 870/938 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 133/137 places, 870/938 transitions.
[2026-05-22 21:05:08] [INFO ] Flow matrix only has 823 transitions (discarded 47 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {0=1, 542=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {5=1, 542=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0] Max Struct:[1, +inf]
[2026-05-22 21:05:08] [INFO ] Flow matrix only has 823 transitions (discarded 47 similar events)
// Phase 1: matrix 823 rows 133 cols
[2026-05-22 21:05:08] [INFO ] Computed 7 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, +inf]
RANDOM walk for 1000011 steps (2 resets) in 845 ms. (1182 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1008 ms. (991 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, +inf]
[2026-05-22 21:05:10] [INFO ] Flow matrix only has 823 transitions (discarded 47 similar events)
[2026-05-22 21:05:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:05:10] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-22 21:05:10] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2026-05-22 21:05:10] [INFO ] State equation strengthened by 107 read => feed constraints.
[2026-05-22 21:05:10] [INFO ] [Real]Added 107 Read/Feed constraints in 20 ms returned sat
[2026-05-22 21:05:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:05:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:05:10] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2026-05-22 21:05:10] [INFO ] [Nat]Added 107 Read/Feed constraints in 26 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:11] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:11] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:11] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 9 ms to minimize.
[2026-05-22 21:05:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 478 ms
[2026-05-22 21:05:11] [INFO ] Computed and/alt/rep : 208/726/208 causal constraints (skipped 614 transitions) in 48 ms.
[2026-05-22 21:05:11] [INFO ] Added : 10 causal constraints over 3 iterations in 207 ms. Result :sat
Minimization took 326 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, +inf]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 870/870 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 870/870 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 133/133 places, 870/870 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 870/870 transitions.
Applied a total of 0 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 870/870 (removed 0) transitions.
[2026-05-22 21:05:11] [INFO ] Flow matrix only has 823 transitions (discarded 47 similar events)
[2026-05-22 21:05:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:05:12] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-22 21:05:12] [INFO ] Flow matrix only has 823 transitions (discarded 47 similar events)
[2026-05-22 21:05:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:05:12] [INFO ] State equation strengthened by 107 read => feed constraints.
[2026-05-22 21:05:12] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:05:12] [INFO ] Redundant transitions in 34 ms returned []
Running 869 sub problems to find dead transitions.
[2026-05-22 21:05:12] [INFO ] Flow matrix only has 823 transitions (discarded 47 similar events)
[2026-05-22 21:05:12] [INFO ] Invariant cache hit.
[2026-05-22 21:05:12] [INFO ] State equation strengthened by 107 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 869 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:15] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:05:16] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 2 ms to minimize.
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 2/8 constraints. Problems are: Problem set: 124 solved, 745 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 124 solved, 745 unsolved
At refinement iteration 3 (OVERLAPS) 1/133 variables, 1/9 constraints. Problems are: Problem set: 124 solved, 745 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/9 constraints. Problems are: Problem set: 124 solved, 745 unsolved
Problem TDEAD571 is UNSAT
At refinement iteration 5 (OVERLAPS) 823/956 variables, 133/142 constraints. Problems are: Problem set: 125 solved, 744 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/956 variables, 107/249 constraints. Problems are: Problem set: 125 solved, 744 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/956 variables, 0/249 constraints. Problems are: Problem set: 125 solved, 744 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 956/956 variables, and 249 constraints, problems are : Problem set: 125 solved, 744 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 133/133 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 869/869 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 125 solved, 744 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 6/6 constraints. Problems are: Problem set: 125 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 2/8 constraints. Problems are: Problem set: 125 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 125 solved, 744 unsolved
At refinement iteration 3 (OVERLAPS) 1/133 variables, 1/9 constraints. Problems are: Problem set: 125 solved, 744 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/9 constraints. Problems are: Problem set: 125 solved, 744 unsolved
At refinement iteration 5 (OVERLAPS) 823/956 variables, 133/142 constraints. Problems are: Problem set: 125 solved, 744 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/956 variables, 107/249 constraints. Problems are: Problem set: 125 solved, 744 unsolved
Problem TDEAD103 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD855 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/956 variables, 744/993 constraints. Problems are: Problem set: 197 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:06:11] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:06:12] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:06:12] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:06:13] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 956/956 variables, and 997 constraints, problems are : Problem set: 197 solved, 672 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 133/133 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 744/869 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60921ms problems are : Problem set: 197 solved, 672 unsolved
Search for dead transitions found 197 dead transitions in 60925ms
Found 197 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 197 transitions
Dead transitions reduction (with SMT) removed 197 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/133 places, 673/870 transitions.
Graph (complete) has 967 edges and 133 vertex of which 1 are kept as prefixes of interest. Removing 132 places using SCC suffix rule.1 ms
Discarding 132 places :
Also discarding 673 output transitions
Drop transitions (Output transitions of discarded places.) removed 673 transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 1 /133 variables (removed 132) and now considering 0/673 (removed 673) transitions.
[2026-05-22 21:06:13] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:06:13] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-22 21:06:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:06:13] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/133 places, 0/870 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61707 ms. Remains : 1/133 places, 0/870 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q3m032-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 165598 ms.

BK_STOP 1779483973719

--------------------
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="BugTracking-PT-q3m032"
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 BugTracking-PT-q3m032, 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 r047-tall-177946846400045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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