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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.4K Mar 6 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 6 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 6 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 6 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Mar 6 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 432K 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 DBSingleClientW-PT-d1m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779525499961

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 08:38:22] [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 08:38:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:38:23] [INFO ] Load time of PNML (sax parser for PT used): 335 ms
[2026-05-23 08:38:23] [INFO ] Transformed 1440 places.
[2026-05-23 08:38:23] [INFO ] Transformed 672 transitions.
[2026-05-23 08:38:23] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 569 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Deduced a syphon composed of 1093 places in 13 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2026-05-23 08:38:23] [INFO ] Computed 6 invariants in 68 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 6, 6]
RANDOM walk for 10000 steps (2318 resets) in 260 ms. (38 steps per ms)
BEST_FIRST walk for 40002 steps (3860 resets) in 455 ms. (87 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 6, 6]
[2026-05-23 08:38:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:38:24] [INFO ] [Real]Absence check using 2 positive place invariants in 20 ms returned sat
[2026-05-23 08:38:24] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned sat
[2026-05-23 08:38:25] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2026-05-23 08:38:25] [INFO ] State equation strengthened by 418 read => feed constraints.
[2026-05-23 08:38:25] [INFO ] [Real]Added 418 Read/Feed constraints in 239 ms returned sat
[2026-05-23 08:38:25] [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 08:38:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2026-05-23 08:38:25] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2026-05-23 08:38:26] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2026-05-23 08:38:26] [INFO ] [Nat]Added 418 Read/Feed constraints in 117 ms returned sat
[2026-05-23 08:38:26] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 227 ms.
[2026-05-23 08:38:26] [INFO ] Added : 2 causal constraints over 1 iterations in 387 ms. Result :sat
Minimization took 596 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:38:27] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2026-05-23 08:38:27] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2026-05-23 08:38:27] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2026-05-23 08:38:28] [INFO ] [Real]Added 418 Read/Feed constraints in 206 ms returned sat
[2026-05-23 08:38:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:38:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2026-05-23 08:38:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2026-05-23 08:38:28] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2026-05-23 08:38:28] [INFO ] [Nat]Added 418 Read/Feed constraints in 144 ms returned sat
[2026-05-23 08:38:28] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 144 ms.
[2026-05-23 08:38:29] [INFO ] Added : 7 causal constraints over 2 iterations in 391 ms. Result :sat
Minimization took 628 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:38:29] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2026-05-23 08:38:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2026-05-23 08:38:30] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2026-05-23 08:38:30] [INFO ] [Real]Added 418 Read/Feed constraints in 222 ms returned sat
[2026-05-23 08:38:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:38:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2026-05-23 08:38:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2026-05-23 08:38:30] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2026-05-23 08:38:31] [INFO ] [Nat]Added 418 Read/Feed constraints in 209 ms returned sat
[2026-05-23 08:38:31] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 120 ms.
[2026-05-23 08:38:31] [INFO ] Added : 9 causal constraints over 2 iterations in 445 ms. Result :sat
Minimization took 657 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:38:32] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2026-05-23 08:38:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2026-05-23 08:38:32] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2026-05-23 08:38:33] [INFO ] [Real]Added 418 Read/Feed constraints in 211 ms returned sat
[2026-05-23 08:38:33] [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 08:38:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2026-05-23 08:38:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2026-05-23 08:38:33] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2026-05-23 08:38:33] [INFO ] [Nat]Added 418 Read/Feed constraints in 198 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:38:34] [INFO ] Deduced a trap composed of 84 places in 534 ms of which 89 ms to minimize.
[2026-05-23 08:38:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 637 ms
[2026-05-23 08:38:34] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 129 ms.
[2026-05-23 08:38:34] [INFO ] Added : 5 causal constraints over 1 iterations in 305 ms. Result :sat
Minimization took 672 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 6, 6]
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 183 place count 231 transition count 329
Iterating global reduction 1 with 94 rules applied. Total rules applied 277 place count 231 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 281 place count 231 transition count 325
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 352 place count 160 transition count 254
Iterating global reduction 2 with 71 rules applied. Total rules applied 423 place count 160 transition count 254
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 429 place count 160 transition count 248
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 469 place count 120 transition count 186
Iterating global reduction 3 with 40 rules applied. Total rules applied 509 place count 120 transition count 186
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 531 place count 120 transition count 164
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 542 place count 109 transition count 146
Iterating global reduction 4 with 11 rules applied. Total rules applied 553 place count 109 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 555 place count 109 transition count 144
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 561 place count 103 transition count 138
Iterating global reduction 5 with 6 rules applied. Total rules applied 567 place count 103 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 570 place count 103 transition count 135
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 574 place count 99 transition count 131
Iterating global reduction 6 with 4 rules applied. Total rules applied 578 place count 99 transition count 131
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 579 place count 98 transition count 125
Iterating global reduction 6 with 1 rules applied. Total rules applied 580 place count 98 transition count 125
Applied a total of 580 rules in 224 ms. Remains 98 /347 variables (removed 249) and now considering 125/672 (removed 547) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 98/347 places, 125/672 transitions.
// Phase 1: matrix 125 rows 98 cols
[2026-05-23 08:38:35] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 6, 6]
RANDOM walk for 1000000 steps (229541 resets) in 1938 ms. (515 steps per ms)
BEST_FIRST walk for 4000002 steps (392634 resets) in 3043 ms. (1314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1] Max Struct:[6, 6, 6, 6]
[2026-05-23 08:38:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:38:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2026-05-23 08:38:40] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:38:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:38:40] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-23 08:38:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 08:38:40] [INFO ] [Real]Added 38 Read/Feed constraints in 9 ms returned sat
[2026-05-23 08:38:40] [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 08:38:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:38:40] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-23 08:38:40] [INFO ] [Nat]Added 38 Read/Feed constraints in 8 ms returned sat
[2026-05-23 08:38:40] [INFO ] Computed and/alt/rep : 35/82/35 causal constraints (skipped 89 transitions) in 14 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:38:41] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 6 ms to minimize.
[2026-05-23 08:38:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2026-05-23 08:38:41] [INFO ] Added : 9 causal constraints over 3 iterations in 228 ms. Result :sat
Minimization took 146 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:38:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:38:41] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-23 08:38:41] [INFO ] [Real]Added 38 Read/Feed constraints in 13 ms returned sat
[2026-05-23 08:38: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 08:38:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:38:41] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-23 08:38:41] [INFO ] [Nat]Added 38 Read/Feed constraints in 11 ms returned sat
[2026-05-23 08:38:41] [INFO ] Computed and/alt/rep : 35/82/35 causal constraints (skipped 89 transitions) in 10 ms.
[2026-05-23 08:38:41] [INFO ] Added : 12 causal constraints over 3 iterations in 66 ms. Result :sat
Minimization took 49 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:38:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:38:41] [INFO ] [Real]Absence check using state equation in 46 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1] Max Struct:[1, 6, 6, 1]
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[6, 6]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 125/125 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 96 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 96 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 96 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 95 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 95 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 94 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 94 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 94 transition count 118
Applied a total of 10 rules in 23 ms. Remains 94 /98 variables (removed 4) and now considering 118/125 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 94/98 places, 118/125 transitions.
// Phase 1: matrix 118 rows 94 cols
[2026-05-23 08:38:41] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (229609 resets) in 1322 ms. (755 steps per ms)
BEST_FIRST walk for 2000001 steps (196524 resets) in 1247 ms. (1602 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[6, 6]
[2026-05-23 08:38:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:38:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:38:44] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-23 08:38:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-23 08:38:44] [INFO ] [Real]Added 36 Read/Feed constraints in 11 ms returned sat
[2026-05-23 08:38:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:38:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:38:44] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-23 08:38:44] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2026-05-23 08:38:44] [INFO ] Computed and/alt/rep : 33/76/33 causal constraints (skipped 84 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:38:44] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:38:44] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:38:45] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 4 ms to minimize.
[2026-05-23 08:38:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 313 ms
[2026-05-23 08:38:45] [INFO ] Added : 16 causal constraints over 4 iterations in 408 ms. Result :sat
Minimization took 95 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:38:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:38:45] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-23 08:38:45] [INFO ] [Real]Added 36 Read/Feed constraints in 10 ms returned sat
[2026-05-23 08:38: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 08:38:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:38:45] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2026-05-23 08:38:45] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2026-05-23 08:38:45] [INFO ] Computed and/alt/rep : 33/76/33 causal constraints (skipped 84 transitions) in 9 ms.
[2026-05-23 08:38:45] [INFO ] Added : 9 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[6, 6]
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 118/118 transitions.
Applied a total of 0 rules in 11 ms. Remains 94 /94 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 94/94 places, 118/118 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 118/118 transitions.
Applied a total of 0 rules in 10 ms. Remains 94 /94 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2026-05-23 08:38:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:38:45] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-23 08:38:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:38:45] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-23 08:38:46] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:38:46] [INFO ] Redundant transitions in 5 ms returned []
Running 117 sub problems to find dead transitions.
[2026-05-23 08:38:46] [INFO ] Invariant cache hit.
[2026-05-23 08:38:46] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/212 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 36/132 constraints. Problems are: Problem set: 0 solved, 117 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 132 constraints, problems are : Problem set: 0 solved, 117 unsolved in 7002 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/212 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 36/132 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 117/249 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 249 constraints, problems are : Problem set: 0 solved, 117 unsolved in 26917 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34189ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 34205ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35245 ms. Remains : 94/94 places, 118/118 transitions.
RANDOM walk for 40000 steps (9252 resets) in 1046 ms. (38 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3912 resets) in 760 ms. (52 steps per ms) remains 4/4 properties
[2026-05-23 08:39:21] [INFO ] Flatten gal took : 149 ms
[2026-05-23 08:39:21] [INFO ] Flatten gal took : 70 ms
BEST_FIRST walk for 40001 steps (3955 resets) in 619 ms. (64 steps per ms) remains 4/4 properties
[2026-05-23 08:39:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11429656004916874256.gal : 22 ms
[2026-05-23 08:39:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16282932496954957392.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11429656004916874256.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16282932496954957392.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16282932496954957392.prop.
BEST_FIRST walk for 40004 steps (3990 resets) in 346 ms. (115 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :58 after 90
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :90 after 154
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :154 after 272
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :272 after 596
BEST_FIRST walk for 40001 steps (3876 resets) in 260 ms. (153 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :596 after 3544
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :3544 after 8695
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :8695 after 20444
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :20444 after 89211
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :89211 after 152198
Invariant property MIN1 does not hold.
Invariant property MIN0 does not hold.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :152198 after 327775
Interrupted probabilistic random walk after 708612 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :2 out of 4
Probabilistic random walk after 708612 steps, saw 287601 distinct states, run finished after 3007 ms. (steps per millisecond=235 ) properties seen :2
[2026-05-23 08:39:24] [INFO ] Invariant cache hit.
[2026-05-23 08:39:24] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :327775 after 485455
At refinement iteration 5 (OVERLAPS) 92/161 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX1 is UNSAT
At refinement iteration 7 (OVERLAPS) 44/205 variables, 21/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 33/125 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/212 variables, 4/129 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 3/132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:39:25] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 8 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 212/212 variables, and 133 constraints, problems are : Problem set: 2 solved, 0 unsolved in 316 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 329ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[6, 6]
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2026-05-23 08:39:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2316 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (932 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2026-05-23 08:39:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:39:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:39:25] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-23 08:39:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-23 08:39:25] [INFO ] [Real]Added 36 Read/Feed constraints in 12 ms returned sat
[2026-05-23 08:39:25] [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 08:39:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:39:25] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-23 08:39:25] [INFO ] [Nat]Added 36 Read/Feed constraints in 11 ms returned sat
[2026-05-23 08:39:25] [INFO ] Computed and/alt/rep : 33/76/33 causal constraints (skipped 84 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:39:25] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:39:25] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:39:25] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 4 ms to minimize.
[2026-05-23 08:39:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 300 ms
[2026-05-23 08:39:25] [INFO ] Added : 16 causal constraints over 4 iterations in 406 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 92 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 92 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 91 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 91 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 90 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 90 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 89 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 88 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 87 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 87 transition count 108
Applied a total of 14 rules in 30 ms. Remains 87 /94 variables (removed 7) and now considering 108/118 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 87/94 places, 108/118 transitions.
// Phase 1: matrix 108 rows 87 cols
[2026-05-23 08:39:25] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229251 resets) in 1643 ms. (608 steps per ms)
BEST_FIRST walk for 1000001 steps (98480 resets) in 1013 ms. (986 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2026-05-23 08:39:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:39:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:39:28] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-23 08:39:28] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-23 08:39:28] [INFO ] [Real]Added 32 Read/Feed constraints in 12 ms returned sat
[2026-05-23 08:39:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:39:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:39:28] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-23 08:39:28] [INFO ] [Nat]Added 32 Read/Feed constraints in 12 ms returned sat
[2026-05-23 08:39:28] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 22 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:39:29] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 12 ms to minimize.
[2026-05-23 08:39:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2026-05-23 08:39:29] [INFO ] Added : 16 causal constraints over 4 iterations in 292 ms. Result :sat
Minimization took 168 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 23 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 87/87 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 9 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2026-05-23 08:39:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:39:29] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-23 08:39:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:39:29] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-23 08:39:30] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:39:30] [INFO ] Redundant transitions in 5 ms returned []
Running 107 sub problems to find dead transitions.
[2026-05-23 08:39:30] [INFO ] Invariant cache hit.
[2026-05-23 08:39:30] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 121 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5430 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 107/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 228 constraints, problems are : Problem set: 0 solved, 107 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35566ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 35567ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36226 ms. Remains : 87/87 places, 108/108 transitions.
[2026-05-23 08:40:05] [INFO ] Flatten gal took : 42 ms
[2026-05-23 08:40:05] [INFO ] Flatten gal took : 29 ms
RANDOM walk for 40000 steps (9232 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
[2026-05-23 08:40:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16362408993814863126.gal : 6 ms
[2026-05-23 08:40:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7148659560217551503.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/ReachabilityCardinality16362408993814863126.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7148659560217551503.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7148659560217551503.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40003 steps (3885 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 120
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :120 after 224
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :224 after 372
BEST_FIRST walk for 40001 steps (4001 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :372 after 916
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :916 after 4165
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4165 after 9767
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :9767 after 24155
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :24155 after 100630
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :100630 after 177601
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :177601 after 265653
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :265653 after 465400
Probably explored full state space saw : 773185 states, properties seen :1
Probabilistic random walk after 1967868 steps, saw 773185 distinct states, run finished after 2654 ms. (steps per millisecond=741 ) properties seen :1
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,775509,3.23985,76732,2,12292,20,223919,7,0,459,285112,0
Total reachable state count : 775509

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

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,0,3.24394,76732,1,0,20,223919,7,0,460,285112,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,798,3.24537,76732,2,474,20,223919,8,0,462,285112,0
ITS tools runner thread asked to quit. Dying gracefully.
Explored full state space saw : 775509 states, properties seen :0
Exhaustive walk after 1973695 steps, saw 775509 distinct states, run finished after 2510 ms. (steps per millisecond=786 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-07 in 45907 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 118 rows 94 cols
[2026-05-23 08:40:11] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2327 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (940 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2026-05-23 08:40:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:40:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:40:11] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-23 08:40:11] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-23 08:40:11] [INFO ] [Real]Added 36 Read/Feed constraints in 18 ms returned sat
[2026-05-23 08:40:11] [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 08:40:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:40:11] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-05-23 08:40:11] [INFO ] [Nat]Added 36 Read/Feed constraints in 16 ms returned sat
[2026-05-23 08:40:11] [INFO ] Computed and/alt/rep : 33/76/33 causal constraints (skipped 84 transitions) in 15 ms.
[2026-05-23 08:40:11] [INFO ] Added : 9 causal constraints over 3 iterations in 80 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 92 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 92 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 91 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 91 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 91 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 90 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 90 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 89 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 89 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 89 transition count 109
Applied a total of 13 rules in 31 ms. Remains 89 /94 variables (removed 5) and now considering 109/118 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 89/94 places, 109/118 transitions.
// Phase 1: matrix 109 rows 89 cols
[2026-05-23 08:40:11] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229348 resets) in 1522 ms. (656 steps per ms)
BEST_FIRST walk for 1000000 steps (98857 resets) in 617 ms. (1618 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2026-05-23 08:40:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:40:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:40:13] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2026-05-23 08:40:13] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-23 08:40:13] [INFO ] [Real]Added 33 Read/Feed constraints in 10 ms returned sat
[2026-05-23 08:40:13] [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 08:40:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:40:13] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-23 08:40:13] [INFO ] [Nat]Added 33 Read/Feed constraints in 9 ms returned sat
[2026-05-23 08:40:13] [INFO ] Computed and/alt/rep : 31/67/31 causal constraints (skipped 77 transitions) in 10 ms.
[2026-05-23 08:40:14] [INFO ] Added : 11 causal constraints over 3 iterations in 96 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 109/109 transitions.
Applied a total of 0 rules in 7 ms. Remains 89 /89 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 89/89 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 109/109 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2026-05-23 08:40:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:40:14] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-23 08:40:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:40:14] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-23 08:40:14] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:40:14] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2026-05-23 08:40:14] [INFO ] Invariant cache hit.
[2026-05-23 08:40:14] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/198 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 33/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 124 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6062 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/198 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 33/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 108/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 232 constraints, problems are : Problem set: 0 solved, 108 unsolved in 19125 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25240ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 25241ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25852 ms. Remains : 89/89 places, 109/109 transitions.
[2026-05-23 08:40:40] [INFO ] Flatten gal took : 28 ms
[2026-05-23 08:40:40] [INFO ] Flatten gal took : 75 ms
[2026-05-23 08:40:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15220132056194324007.gal : 8 ms
[2026-05-23 08:40:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15076238352410184987.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/ReachabilityCardinality15220132056194324007.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15076238352410184987.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (9208 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality15076238352410184987.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
BEST_FIRST walk for 40004 steps (3981 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 90
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :90 after 154
BEST_FIRST walk for 40003 steps (3888 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :154 after 272
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :272 after 596
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :596 after 2134
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2134 after 7713
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :7713 after 18228
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :18228 after 99902
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :99902 after 178250
Probably explored full state space saw : 511465 states, properties seen :1
Probabilistic random walk after 1286288 steps, saw 511465 distinct states, run finished after 1952 ms. (steps per millisecond=658 ) properties seen :1
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :178250 after 256008
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,513014,2.92965,68752,2,11990,19,209786,7,0,468,219086,0
Total reachable state count : 513014

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

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,0,2.93492,68752,1,0,19,209786,7,0,469,219086,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,3,2.93605,68752,2,95,19,209786,8,0,471,219086,0
Explored full state space saw : 513014 states, properties seen :0
Exhaustive walk after 1290079 steps, saw 513014 distinct states, run finished after 1397 ms. (steps per millisecond=923 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-09 in 32590 ms.
[2026-05-23 08:40:43] [INFO ] Flatten gal took : 11 ms
[2026-05-23 08:40:43] [INFO ] Applying decomposition
[2026-05-23 08:40:43] [INFO ] Flatten gal took : 13 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/graph12823966671830194589.txt' '-o' '/tmp/graph12823966671830194589.bin' '-w' '/tmp/graph12823966671830194589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12823966671830194589.bin' '-l' '-1' '-v' '-w' '/tmp/graph12823966671830194589.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:40:43] [INFO ] Decomposing Gal with order
[2026-05-23 08:40:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:40:43] [INFO ] Removed a total of 81 redundant transitions.
[2026-05-23 08:40:43] [INFO ] Flatten gal took : 71 ms
[2026-05-23 08:40:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 15 ms.
[2026-05-23 08:40:43] [INFO ] Time to serialize gal into /tmp/UpperBounds6717177632115662748.gal : 5 ms
[2026-05-23 08:40:43] [INFO ] Time to serialize properties into /tmp/UpperBounds11265224450250714709.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/UpperBounds6717177632115662748.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11265224450250714709.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds11265224450250714709.prop.
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,880363,5.86851,132636,1702,2143,83052,35023,346,1.02209e+06,216,371999,0
Total reachable state count : 880363

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property DBSingleClientW-PT-d1m06-UpperBounds-07 :0 <= i6.i1.u13.l1294 <= 3
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-07 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m06-UpperBounds-07,0,5.97498,132636,1,0,83052,35023,433,1.02209e+06,264,371999,1310
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m06-UpperBounds-09 :0 <= u1.l463 <= 1
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m06-UpperBounds-09,0,5.9828,132636,1,0,83052,35023,456,1.02209e+06,269,371999,1994
Total runtime 147361 ms.

BK_STOP 1779525650009

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="DBSingleClientW-PT-d1m06"
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 DBSingleClientW-PT-d1m06, 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-177946996300020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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