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.r095-smll-177946996300054.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 DES-PT-50a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-smll-177946996300054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.4K Mar 6 18:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 18:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 6 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 18:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 6 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 6 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 6 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 97K 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 DES-PT-50a-UpperBounds-00
FORMULA_NAME DES-PT-50a-UpperBounds-01
FORMULA_NAME DES-PT-50a-UpperBounds-02
FORMULA_NAME DES-PT-50a-UpperBounds-03
FORMULA_NAME DES-PT-50a-UpperBounds-04
FORMULA_NAME DES-PT-50a-UpperBounds-05
FORMULA_NAME DES-PT-50a-UpperBounds-06
FORMULA_NAME DES-PT-50a-UpperBounds-07
FORMULA_NAME DES-PT-50a-UpperBounds-08
FORMULA_NAME DES-PT-50a-UpperBounds-09
FORMULA_NAME DES-PT-50a-UpperBounds-10
FORMULA_NAME DES-PT-50a-UpperBounds-11
FORMULA_NAME DES-PT-50a-UpperBounds-12
FORMULA_NAME DES-PT-50a-UpperBounds-13
FORMULA_NAME DES-PT-50a-UpperBounds-14
FORMULA_NAME DES-PT-50a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779527977031

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 09:19:38] [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-23 09:19:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:19:39] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2026-05-23 09:19:39] [INFO ] Transformed 314 places.
[2026-05-23 09:19:39] [INFO ] Transformed 271 transitions.
[2026-05-23 09:19:39] [INFO ] Found NUPN structural information;
[2026-05-23 09:19:39] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
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 257 rows 314 cols
[2026-05-23 09:19:39] [INFO ] Computed 59 invariants in 39 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 (225 resets) in 92 ms. (107 steps per ms)
FORMULA DES-PT-50a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110010 steps (478 resets) in 266 ms. (412 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-23 09:19:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:19:40] [INFO ] [Real]Absence check using 34 positive place invariants in 28 ms returned sat
[2026-05-23 09:19:40] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 30 ms returned sat
[2026-05-23 09:19:40] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2026-05-23 09:19:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:19:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 28 ms returned sat
[2026-05-23 09:19:40] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 48 ms returned sat
[2026-05-23 09:19:41] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2026-05-23 09:19:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:19:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2026-05-23 09:19:41] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 41 ms.
[2026-05-23 09:19:43] [INFO ] Added : 173 causal constraints over 35 iterations in 1509 ms. Result :sat
Minimization took 341 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:19:43] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2026-05-23 09:19:43] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2026-05-23 09:19:43] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2026-05-23 09:19:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:19:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2026-05-23 09:19:44] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2026-05-23 09:19:44] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2026-05-23 09:19:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 80 ms returned sat
[2026-05-23 09:19:44] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 28 ms.
[2026-05-23 09:19:45] [INFO ] Added : 148 causal constraints over 30 iterations in 1319 ms. Result :sat
Minimization took 450 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:19:46] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2026-05-23 09:19:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2026-05-23 09:19:46] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2026-05-23 09:19: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-23 09:19:46] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2026-05-23 09:19:46] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2026-05-23 09:19:47] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2026-05-23 09:19:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 50 ms returned sat
[2026-05-23 09:19:47] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 25 ms.
[2026-05-23 09:19:48] [INFO ] Added : 154 causal constraints over 31 iterations in 1528 ms. Result :sat
Minimization took 501 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:19:49] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2026-05-23 09:19:49] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2026-05-23 09:19:49] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2026-05-23 09:19:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:19:49] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2026-05-23 09:19:49] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2026-05-23 09:19:49] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2026-05-23 09:19:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 148 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:19:50] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 22 ms to minimize.
[2026-05-23 09:19:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2026-05-23 09:19:50] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 27 ms.
[2026-05-23 09:19:51] [INFO ] Added : 65 causal constraints over 13 iterations in 1305 ms. Result :sat
Minimization took 414 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:19:52] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2026-05-23 09:19:52] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2026-05-23 09:19:52] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2026-05-23 09:19:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:19:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 25 ms returned sat
[2026-05-23 09:19:52] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2026-05-23 09:19:53] [INFO ] [Nat]Absence check using state equation in 763 ms returned sat
[2026-05-23 09:19:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 53 ms returned sat
[2026-05-23 09:19:53] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 27 ms.
[2026-05-23 09:19:54] [INFO ] Added : 103 causal constraints over 21 iterations in 833 ms. Result :sat
Minimization took 501 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:19:55] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2026-05-23 09:19:55] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2026-05-23 09:19:55] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2026-05-23 09:19:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:19:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2026-05-23 09:19:55] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 30 ms returned sat
[2026-05-23 09:19:55] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2026-05-23 09:19:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 143 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:19:55] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 10 ms to minimize.
[2026-05-23 09:19:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2026-05-23 09:19:56] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 30 ms.
[2026-05-23 09:19:57] [INFO ] Added : 79 causal constraints over 16 iterations in 1559 ms. Result :sat
Minimization took 501 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:19:58] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2026-05-23 09:19:58] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2026-05-23 09:19:58] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2026-05-23 09:19:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:19:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2026-05-23 09:19:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 47 ms returned sat
[2026-05-23 09:19:58] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2026-05-23 09:19:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 228 ms returned sat
[2026-05-23 09:19:59] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 23 ms.
[2026-05-23 09:20:01] [INFO ] Added : 82 causal constraints over 17 iterations in 2156 ms. Result :sat
Minimization took 502 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:20:02] [INFO ] [Real]Absence check using 34 positive place invariants in 23 ms returned sat
[2026-05-23 09:20:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2026-05-23 09:20:02] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2026-05-23 09:20:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:20:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 25 ms returned sat
[2026-05-23 09:20:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2026-05-23 09:20:02] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2026-05-23 09:20:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 77 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:20:03] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 13 ms to minimize.
[2026-05-23 09:20:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2026-05-23 09:20:03] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 16 ms.
[2026-05-23 09:20:04] [INFO ] Added : 90 causal constraints over 18 iterations in 870 ms. Result :sat
Minimization took 475 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:20:04] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2026-05-23 09:20:04] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2026-05-23 09:20:05] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2026-05-23 09:20:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:20:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2026-05-23 09:20:05] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2026-05-23 09:20:05] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2026-05-23 09:20:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 23 ms returned sat
[2026-05-23 09:20:05] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 21 ms.
[2026-05-23 09:20:06] [INFO ] Added : 68 causal constraints over 14 iterations in 1135 ms. Result :sat
Minimization took 288 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:20:07] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2026-05-23 09:20:07] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2026-05-23 09:20:07] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2026-05-23 09:20:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:20:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2026-05-23 09:20:07] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2026-05-23 09:20:07] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2026-05-23 09:20:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 296 ms returned sat
[2026-05-23 09:20:08] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 20 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:20:11] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 15 ms to minimize.
[2026-05-23 09:20:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2026-05-23 09:20:11] [INFO ] Added : 203 causal constraints over 42 iterations in 3518 ms. Result :sat
Minimization took 356 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:20:12] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2026-05-23 09:20:12] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2026-05-23 09:20:12] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2026-05-23 09:20:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:20:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 19 ms returned sat
[2026-05-23 09:20:12] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2026-05-23 09:20:13] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2026-05-23 09:20:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 48 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:20:13] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 8 ms to minimize.
[2026-05-23 09:20:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2026-05-23 09:20:13] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:20:15] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 12 ms to minimize.
[2026-05-23 09:20:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2026-05-23 09:20:15] [INFO ] Added : 104 causal constraints over 21 iterations in 2056 ms. Result :sat
Minimization took 503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA DES-PT-50a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
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 2 place count 314 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 313 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 313 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 313 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 312 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 311 transition count 253
Applied a total of 12 rules in 146 ms. Remains 311 /314 variables (removed 3) and now considering 253/257 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 311/314 places, 253/257 transitions.
// Phase 1: matrix 253 rows 311 cols
[2026-05-23 09:20:18] [INFO ] Computed 60 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13673 resets) in 2820 ms. (354 steps per ms)
BEST_FIRST walk for 10000008 steps (22739 resets) in 10531 ms. (949 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-23 09:20:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:31] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2026-05-23 09:20:31] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 35 ms returned sat
[2026-05-23 09:20:31] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2026-05-23 09:20:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-23 09:20:32] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 35 ms returned sat
[2026-05-23 09:20:32] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2026-05-23 09:20:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 09:20:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2026-05-23 09:20:32] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 26 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:20:34] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 7 ms to minimize.
[2026-05-23 09:20:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2026-05-23 09:20:34] [INFO ] Added : 226 causal constraints over 46 iterations in 2358 ms. Result :sat
Minimization took 313 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:35] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2026-05-23 09:20:35] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2026-05-23 09:20:35] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2026-05-23 09:20:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-23 09:20:35] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2026-05-23 09:20:36] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2026-05-23 09:20:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:20:36] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 11 ms to minimize.
[2026-05-23 09:20:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2026-05-23 09:20:36] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 28 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:20:37] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 7 ms to minimize.
[2026-05-23 09:20:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2026-05-23 09:20:37] [INFO ] Added : 178 causal constraints over 37 iterations in 1729 ms. Result :sat
Minimization took 291 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:38] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-23 09:20:38] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 42 ms returned sat
[2026-05-23 09:20:38] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2026-05-23 09:20:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned sat
[2026-05-23 09:20:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 29 ms returned sat
[2026-05-23 09:20:39] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2026-05-23 09:20:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2026-05-23 09:20:39] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 28 ms.
[2026-05-23 09:20:40] [INFO ] Added : 153 causal constraints over 32 iterations in 1354 ms. Result :sat
Minimization took 340 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:40] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-23 09:20:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 36 ms returned sat
[2026-05-23 09:20:41] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2026-05-23 09:20:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-23 09:20:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2026-05-23 09:20:41] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2026-05-23 09:20:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2026-05-23 09:20:41] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 28 ms.
[2026-05-23 09:20:42] [INFO ] Added : 69 causal constraints over 14 iterations in 696 ms. Result :sat
Minimization took 216 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:42] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-23 09:20:42] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2026-05-23 09:20:43] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2026-05-23 09:20: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-23 09:20:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-23 09:20:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2026-05-23 09:20:43] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2026-05-23 09:20:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2026-05-23 09:20:43] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 26 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:20:44] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 6 ms to minimize.
[2026-05-23 09:20:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2026-05-23 09:20:44] [INFO ] Added : 115 causal constraints over 24 iterations in 1232 ms. Result :sat
Minimization took 272 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:45] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-23 09:20:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 36 ms returned sat
[2026-05-23 09:20:45] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2026-05-23 09:20: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-23 09:20:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-23 09:20:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2026-05-23 09:20:45] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2026-05-23 09:20:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2026-05-23 09:20:45] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 27 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:20:46] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 16 ms to minimize.
[2026-05-23 09:20:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2026-05-23 09:20:47] [INFO ] Added : 87 causal constraints over 18 iterations in 1092 ms. Result :sat
Minimization took 243 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:47] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-23 09:20:47] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 39 ms returned sat
[2026-05-23 09:20:47] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2026-05-23 09:20:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2026-05-23 09:20:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2026-05-23 09:20:48] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2026-05-23 09:20:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2026-05-23 09:20:48] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 28 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:20:49] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 19 ms to minimize.
[2026-05-23 09:20:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2026-05-23 09:20:49] [INFO ] Added : 90 causal constraints over 18 iterations in 1199 ms. Result :sat
Minimization took 224 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:49] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-23 09:20:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 36 ms returned sat
[2026-05-23 09:20:50] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2026-05-23 09:20: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-23 09:20:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-23 09:20:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2026-05-23 09:20:50] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2026-05-23 09:20:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2026-05-23 09:20:50] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 28 ms.
[2026-05-23 09:20:51] [INFO ] Added : 101 causal constraints over 21 iterations in 824 ms. Result :sat
Minimization took 240 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:51] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-23 09:20:51] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 36 ms returned sat
[2026-05-23 09:20:52] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2026-05-23 09:20: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-23 09:20:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-23 09:20:52] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2026-05-23 09:20:52] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2026-05-23 09:20:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 30 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:20:52] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:20:53] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 18 ms to minimize.
[2026-05-23 09:20:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 533 ms
[2026-05-23 09:20:53] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 28 ms.
[2026-05-23 09:20:54] [INFO ] Added : 177 causal constraints over 36 iterations in 1521 ms. Result :sat
Minimization took 284 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:20:55] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2026-05-23 09:20:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 36 ms returned sat
[2026-05-23 09:20:55] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2026-05-23 09:20: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-23 09:20:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-23 09:20:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2026-05-23 09:20:55] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2026-05-23 09:20:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 14 ms returned sat
[2026-05-23 09:20:55] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 30 ms.
[2026-05-23 09:20:56] [INFO ] Added : 72 causal constraints over 15 iterations in 806 ms. Result :sat
Minimization took 308 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 21 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2026-05-23 09:21:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:21:02] [INFO ] Implicit Places using invariants in 550 ms returned []
[2026-05-23 09:21:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:21:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 09:21:03] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1759 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:21:03] [INFO ] Redundant transitions in 19 ms returned []
Running 250 sub problems to find dead transitions.
[2026-05-23 09:21:03] [INFO ] Invariant cache hit.
[2026-05-23 09:21:03] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:21:17] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:21:18] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:21:21] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:21:22] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:21:26] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:21:26] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:21:28] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 3/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/564 variables, and 379 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:21:38] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/378 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 250/630 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 630 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60427ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60446ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62276 ms. Remains : 311/311 places, 253/253 transitions.
[2026-05-23 09:22:04] [INFO ] Flatten gal took : 193 ms
[2026-05-23 09:22:04] [INFO ] Flatten gal took : 93 ms
[2026-05-23 09:22:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14201398408119886514.gal : 35 ms
RANDOM walk for 40000 steps (529 resets) in 2297 ms. (17 steps per ms) remains 20/20 properties
[2026-05-23 09:22:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9500351682500591381.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14201398408119886514.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9500351682500591381.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 20/20 properties

BEST_FIRST walk for 4004 steps (9 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4003 steps (9 resets) in 55 ms. (71 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (10 resets) in 69 ms. (57 steps per ms) remains 20/20 properties
Loading property file /tmp/ReachabilityCardinality9500351682500591381.prop.
BEST_FIRST walk for 4003 steps (11 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (10 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,20 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,20 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,20 properties remain. new max is 32
SDD size :10 after 18
SDD proceeding with computation,20 properties remain. new max is 64
SDD size :18 after 22
BEST_FIRST walk for 4004 steps (10 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (11 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 128
SDD size :22 after 576
BEST_FIRST walk for 4003 steps (10 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 256
SDD size :576 after 630
BEST_FIRST walk for 4004 steps (11 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (11 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 512
SDD size :630 after 1440
BEST_FIRST walk for 4003 steps (9 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 1024
SDD size :1440 after 11292
SDD proceeding with computation,20 properties remain. new max is 2048
SDD size :11292 after 69964
SDD proceeding with computation,20 properties remain. new max is 4096
SDD size :69964 after 93680
SDD proceeding with computation,20 properties remain. new max is 8192
SDD size :364744 after 412888
Interrupted probabilistic random walk after 468793 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 20
Probabilistic random walk after 468793 steps, saw 67803 distinct states, run finished after 3021 ms. (steps per millisecond=155 ) properties seen :0
[2026-05-23 09:22:07] [INFO ] Invariant cache hit.
[2026-05-23 09:22:07] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 179/189 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SDD proceeding with computation,20 properties remain. new max is 16384
SDD size :412888 after 6.77365e+08
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/222 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 25/247 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 7/254 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 208/462 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 63/525 variables, 18/329 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SDD proceeding with computation,20 properties remain. new max is 32768
SDD size :7.06975e+08 after 7.0795e+08
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 1/526 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/564 variables, and 335 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 273/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 179/189 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 33/222 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 25/247 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 7/254 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 208/462 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 12/323 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:22:16] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SMT process timed out in 10042ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 17 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 311/311 places, 253/253 transitions.
RANDOM walk for 40000 steps (546 resets) in 907 ms. (44 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (11 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (11 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (9 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (11 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (9 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 65536
SDD size :7.29588e+08 after 7.96643e+09
Interrupted probabilistic random walk after 424028 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 20
Probabilistic random walk after 424028 steps, saw 62231 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
[2026-05-23 09:22:21] [INFO ] Invariant cache hit.
[2026-05-23 09:22:21] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 179/189 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/222 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 25/247 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 7/254 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 208/462 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 63/525 variables, 18/329 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 1/526 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/526 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (OVERLAPS) 38/564 variables, 38/373 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:22:28] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/564 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:22:29] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:22:29] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 10 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SDD proceeding with computation,20 properties remain. new max is 131072
SDD size :8.45539e+09 after 3.36009e+10
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:22:33] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 6 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/564 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 24 (OVERLAPS) 0/564 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 377 constraints, problems are : Problem set: 0 solved, 20 unsolved in 15149 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 179/189 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 33/222 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 25/247 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 7/254 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 208/462 variables, 254/311 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 12/325 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 63/525 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/525 variables, 4/347 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/525 variables, 8/355 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/525 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:22:39] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 8 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/525 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/525 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 21 (OVERLAPS) 1/526 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/526 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 24 (OVERLAPS) 38/564 variables, 38/398 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:22:44] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/564 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/564 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 27 (OVERLAPS) 0/564 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 399 constraints, problems are : Problem set: 0 solved, 20 unsolved in 13464 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28625ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 4620 ms.
Support contains 10 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Detected timeout of ITS tools.
Applied a total of 0 rules in 18 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2026-05-23 09:22:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:22:54] [INFO ] Flatten gal took : 68 ms
[2026-05-23 09:22:54] [INFO ] Applying decomposition
[2026-05-23 09:22:54] [INFO ] Flatten gal took : 54 ms
[2026-05-23 09:22:55] [INFO ] Implicit Places using invariants in 360 ms returned []
[2026-05-23 09:22:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5895203367624969757.txt' '-o' '/tmp/graph5895203367624969757.bin' '-w' '/tmp/graph5895203367624969757.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5895203367624969757.bin' '-l' '-1' '-v' '-w' '/tmp/graph5895203367624969757.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:22:55] [INFO ] Decomposing Gal with order
[2026-05-23 09:22:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:22:55] [INFO ] Removed a total of 23 redundant transitions.
[2026-05-23 09:22:55] [INFO ] Flatten gal took : 97 ms
[2026-05-23 09:22:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2026-05-23 09:22:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13277452156690837693.gal : 10 ms
[2026-05-23 09:22:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14823092252593722444.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/ReachabilityCardinality13277452156690837693.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14823092252593722444.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality14823092252593722444.prop.
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,20 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,20 properties remain. new max is 16
SDD size :4 after 20
SDD proceeding with computation,20 properties remain. new max is 32
SDD size :20 after 148
SDD proceeding with computation,20 properties remain. new max is 64
SDD size :148 after 2640
[2026-05-23 09:22:55] [INFO ] State equation strengthened by 2 read => feed constraints.
SDD proceeding with computation,20 properties remain. new max is 128
SDD size :8206 after 1.15915e+08
[2026-05-23 09:22:56] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:22:56] [INFO ] Redundant transitions in 13 ms returned []
Running 250 sub problems to find dead transitions.
[2026-05-23 09:22:56] [INFO ] Invariant cache hit.
[2026-05-23 09:22:56] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,20 properties remain. new max is 256
SDD size :1.15915e+08 after 2.62454e+08
Invariant property MIN9 does not hold.
Reachability property MAX9 is true.
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :2.62454e+08 after 4.57838e+08
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :4.57838e+08 after 6.288e+08
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Invariant property MIN6 does not hold.
Reachability property MAX6 is true.
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :6.288e+08 after 9.21877e+08
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:23:06] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:23:08] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 21 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :4.00512e+12 after 4.02537e+12
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:23:11] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:23:11] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:23:15] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:23:15] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:23:17] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 3/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Invariant property MIN7 does not hold.
Reachability property MAX7 is true.
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1.23613e+13 after 1.29581e+13
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/564 variables, and 379 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.83299e+13 after 1.89268e+13
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:23:32] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Invariant property MIN8 does not hold.
Reachability property MAX8 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/378 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.48955e+13,47.5641,577752,23208,8321,1.24376e+06,24732,244,1.73803e+06,458,167114,0
Total reachable state count : 24895476284888

Verifying 20 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1974,47.7699,577124,74,373,1.24376e+06,24732,246,1.73803e+06,461,167114,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1974,47.7903,577124,74,373,1.24376e+06,24732,250,1.73803e+06,463,167114,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,1.01733e+07,47.7929,577124,793,704,1.24376e+06,24732,252,1.73803e+06,465,167114,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1.01733e+07,47.7952,577124,793,704,1.24376e+06,24732,256,1.73803e+06,467,167114,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,9.7258e+10,47.8019,577124,3134,886,1.24376e+06,24732,258,1.73803e+06,469,167114,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,9.7258e+10,47.8083,577124,3134,886,1.24376e+06,24732,262,1.73803e+06,471,167114,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,512,47.8091,577124,50,135,1.24376e+06,24732,264,1.73803e+06,473,167114,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,512,47.8101,577124,50,135,1.24376e+06,24732,268,1.73803e+06,475,167114,0
Reachability property MAX4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,9.7258e+10,47.8157,577124,3134,662,1.24376e+06,24732,270,1.73803e+06,477,167114,0
Invariant property MIN4 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,9.7258e+10,47.8212,577124,3134,662,1.24376e+06,24732,274,1.73803e+06,479,167114,0
Reachability property MAX5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX5,256,47.822,577124,50,143,1.24376e+06,24732,276,1.73803e+06,481,167114,0
Invariant property MIN5 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,256,47.8228,577124,50,143,1.24376e+06,24732,280,1.73803e+06,483,167114,0
Reachability property MAX6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX6,256,47.8232,577124,50,147,1.24376e+06,24732,282,1.73803e+06,485,167114,0
Invariant property MIN6 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN6,256,47.8235,577124,50,147,1.24376e+06,24732,286,1.73803e+06,487,167114,0
Reachability property MAX7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX7,9.7258e+10,47.8293,577124,3134,652,1.24376e+06,24732,288,1.73803e+06,489,167114,0
Invariant property MIN7 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN7,9.7258e+10,47.8353,577124,3134,652,1.24376e+06,24732,292,1.73803e+06,491,167114,0
Reachability property MAX8 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX8,1.61778e+10,47.8381,577124,1267,776,1.24376e+06,24732,294,1.73803e+06,493,167114,0
Invariant property MIN8 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN8,1.61778e+10,47.8407,577124,1267,776,1.24376e+06,24732,298,1.73803e+06,495,167114,0
Reachability property MAX9 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX9,512,47.8413,577124,50,135,1.24376e+06,24732,300,1.73803e+06,497,167114,0
Invariant property MIN9 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN9,512,47.8419,577124,50,135,1.24376e+06,24732,304,1.73803e+06,499,167114,0
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 250/630 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 630 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61746 ms. Remains : 311/311 places, 253/253 transitions.
FORMULA DES-PT-50a-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 10 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 257545 ms.

BK_STOP 1779528236591

--------------------
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="DES-PT-50a"
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 DES-PT-50a, 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 r095-smll-177946996300054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a 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 ;