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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.2K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:49 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-d1m10-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779525860772

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 08:44:23] [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:44:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:44:23] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2026-05-23 08:44:23] [INFO ] Transformed 1440 places.
[2026-05-23 08:44:23] [INFO ] Transformed 672 transitions.
[2026-05-23 08:44:23] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 1093 places in 9 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-15 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:44:23] [INFO ] Computed 6 invariants in 74 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 7, 10, 1741]
RANDOM walk for 10000 steps (2312 resets) in 210 ms. (47 steps per ms)
BEST_FIRST walk for 40004 steps (3891 resets) in 338 ms. (118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 7, 10, 1741]
[2026-05-23 08:44:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:44:24] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2026-05-23 08:44:24] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned sat
[2026-05-23 08:44:25] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2026-05-23 08:44:25] [INFO ] State equation strengthened by 418 read => feed constraints.
[2026-05-23 08:44:25] [INFO ] [Real]Added 418 Read/Feed constraints in 402 ms returned sat
[2026-05-23 08:44:26] [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:44:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2026-05-23 08:44:26] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2026-05-23 08:44:26] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2026-05-23 08:44:26] [INFO ] [Nat]Added 418 Read/Feed constraints in 258 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:27] [INFO ] Deduced a trap composed of 81 places in 313 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:27] [INFO ] Deduced a trap composed of 82 places in 293 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:28] [INFO ] Deduced a trap composed of 83 places in 326 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:28] [INFO ] Deduced a trap composed of 84 places in 292 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:28] [INFO ] Deduced a trap composed of 84 places in 327 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:29] [INFO ] Deduced a trap composed of 85 places in 336 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:29] [INFO ] Deduced a trap composed of 84 places in 322 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:30] [INFO ] Deduced a trap composed of 84 places in 388 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:30] [INFO ] Deduced a trap composed of 85 places in 255 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:30] [INFO ] Deduced a trap composed of 85 places in 325 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:31] [INFO ] Deduced a trap composed of 85 places in 302 ms of which 17 ms to minimize.
[2026-05-23 08:44:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:44:31] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2026-05-23 08:44:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2026-05-23 08:44:31] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2026-05-23 08:44:31] [INFO ] [Real]Added 418 Read/Feed constraints in 245 ms returned sat
[2026-05-23 08:44:32] [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:44:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2026-05-23 08:44:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2026-05-23 08:44:32] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2026-05-23 08:44:32] [INFO ] [Nat]Added 418 Read/Feed constraints in 248 ms returned sat
[2026-05-23 08:44:33] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 283 ms.
[2026-05-23 08:44:33] [INFO ] Added : 12 causal constraints over 3 iterations in 765 ms. Result :sat
Minimization took 585 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:44:34] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2026-05-23 08:44:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2026-05-23 08:44:34] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2026-05-23 08:44:34] [INFO ] [Real]Added 418 Read/Feed constraints in 138 ms returned sat
[2026-05-23 08:44:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:44:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2026-05-23 08:44:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2026-05-23 08:44:35] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2026-05-23 08:44:35] [INFO ] [Nat]Added 418 Read/Feed constraints in 171 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:35] [INFO ] Deduced a trap composed of 87 places in 400 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:36] [INFO ] Deduced a trap composed of 87 places in 481 ms of which 48 ms to minimize.
[2026-05-23 08:44:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1047 ms
[2026-05-23 08:44:36] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 145 ms.
[2026-05-23 08:44:36] [INFO ] Added : 12 causal constraints over 3 iterations in 584 ms. Result :sat
Minimization took 597 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:44:37] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2026-05-23 08:44:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2026-05-23 08:44:37] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2026-05-23 08:44:38] [INFO ] [Real]Added 418 Read/Feed constraints in 107 ms returned sat
[2026-05-23 08:44:38] [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:44:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2026-05-23 08:44:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2026-05-23 08:44:38] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2026-05-23 08:44:38] [INFO ] [Nat]Added 418 Read/Feed constraints in 123 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:38] [INFO ] Deduced a trap composed of 80 places in 455 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:39] [INFO ] Deduced a trap composed of 80 places in 502 ms of which 73 ms to minimize.
[2026-05-23 08:44:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1058 ms
[2026-05-23 08:44:39] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 126 ms.
[2026-05-23 08:44:39] [INFO ] Added : 11 causal constraints over 3 iterations in 432 ms. Result :sat
Minimization took 558 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 7, 10, 1741]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 7, 10, 1741]
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 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 353 place count 159 transition count 253
Iterating global reduction 2 with 72 rules applied. Total rules applied 425 place count 159 transition count 253
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 430 place count 159 transition count 248
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 469 place count 120 transition count 186
Iterating global reduction 3 with 39 rules applied. Total rules applied 508 place count 120 transition count 186
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 529 place count 120 transition count 165
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 540 place count 109 transition count 147
Iterating global reduction 4 with 11 rules applied. Total rules applied 551 place count 109 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 552 place count 109 transition count 146
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 561 place count 100 transition count 137
Iterating global reduction 5 with 9 rules applied. Total rules applied 570 place count 100 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 573 place count 100 transition count 134
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 580 place count 93 transition count 127
Iterating global reduction 6 with 7 rules applied. Total rules applied 587 place count 93 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 590 place count 93 transition count 124
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 591 place count 92 transition count 122
Iterating global reduction 7 with 1 rules applied. Total rules applied 592 place count 92 transition count 122
Applied a total of 592 rules in 147 ms. Remains 92 /347 variables (removed 255) and now considering 122/672 (removed 550) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 92/347 places, 122/672 transitions.
// Phase 1: matrix 122 rows 92 cols
[2026-05-23 08:44:40] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 7, 10, 1741]
RANDOM walk for 1000000 steps (229379 resets) in 1782 ms. (560 steps per ms)
BEST_FIRST walk for 4000003 steps (394060 resets) in 2809 ms. (1423 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 7, 10, 1741]
[2026-05-23 08:44:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:44:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:44:45] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-23 08:44:45] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-23 08:44:45] [INFO ] [Real]Added 41 Read/Feed constraints in 14 ms returned sat
[2026-05-23 08:44: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:44:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:44:45] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2026-05-23 08:44:45] [INFO ] [Nat]Added 41 Read/Feed constraints in 13 ms returned sat
[2026-05-23 08:44:45] [INFO ] Computed and/alt/rep : 32/77/32 causal constraints (skipped 89 transitions) in 14 ms.
[2026-05-23 08:44:45] [INFO ] Added : 8 causal constraints over 3 iterations in 72 ms. Result :sat
Minimization took 50 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:44:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:44:45] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-23 08:44:45] [INFO ] [Real]Added 41 Read/Feed constraints in 12 ms returned sat
[2026-05-23 08:44: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:44:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:44:45] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-23 08:44:45] [INFO ] [Nat]Added 41 Read/Feed constraints in 16 ms returned sat
[2026-05-23 08:44:45] [INFO ] Computed and/alt/rep : 32/77/32 causal constraints (skipped 89 transitions) in 9 ms.
[2026-05-23 08:44:46] [INFO ] Added : 10 causal constraints over 2 iterations in 56 ms. Result :sat
Minimization took 47 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:44:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:44:46] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2026-05-23 08:44:46] [INFO ] [Real]Added 41 Read/Feed constraints in 13 ms returned sat
[2026-05-23 08:44:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:44:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:44:46] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-23 08:44:46] [INFO ] [Nat]Added 41 Read/Feed constraints in 14 ms returned sat
[2026-05-23 08:44:46] [INFO ] Computed and/alt/rep : 32/77/32 causal constraints (skipped 89 transitions) in 9 ms.
[2026-05-23 08:44:46] [INFO ] Added : 9 causal constraints over 2 iterations in 55 ms. Result :sat
Minimization took 51 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:44:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:44:46] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-23 08:44:46] [INFO ] [Real]Added 41 Read/Feed constraints in 10 ms returned sat
[2026-05-23 08:44:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:44:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:44:46] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-23 08:44:46] [INFO ] [Nat]Added 41 Read/Feed constraints in 13 ms returned sat
[2026-05-23 08:44:46] [INFO ] Computed and/alt/rep : 32/77/32 causal constraints (skipped 89 transitions) in 13 ms.
[2026-05-23 08:44:46] [INFO ] Added : 10 causal constraints over 2 iterations in 61 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 7, 10, 1741]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 7, 10, 1741]
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 122/122 transitions.
Applied a total of 0 rules in 14 ms. Remains 92 /92 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 92/92 places, 122/122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 122/122 transitions.
Applied a total of 0 rules in 12 ms. Remains 92 /92 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2026-05-23 08:44:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:44:47] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-23 08:44:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:44:47] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-23 08:44:47] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:44:47] [INFO ] Redundant transitions in 7 ms returned []
Running 121 sub problems to find dead transitions.
[2026-05-23 08:44:47] [INFO ] Invariant cache hit.
[2026-05-23 08:44:47] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/214 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 41/135 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:44:52] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 136 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7797 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/214 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 121/257 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 214/214 variables, and 257 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38187ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 38217ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38820 ms. Remains : 92/92 places, 122/122 transitions.
RANDOM walk for 40000 steps (9142 resets) in 2177 ms. (18 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3844 resets) in 925 ms. (43 steps per ms) remains 8/8 properties
[2026-05-23 08:45:26] [INFO ] Flatten gal took : 193 ms
BEST_FIRST walk for 40003 steps (3854 resets) in 270 ms. (147 steps per ms) remains 8/8 properties
[2026-05-23 08:45:26] [INFO ] Flatten gal took : 84 ms
BEST_FIRST walk for 40001 steps (3870 resets) in 249 ms. (160 steps per ms) remains 8/8 properties
[2026-05-23 08:45:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16480018094745156239.gal : 28 ms
[2026-05-23 08:45:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10340667975120674115.prop : 12 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/ReachabilityCardinality16480018094745156239.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10340667975120674115.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40003 steps (3984 resets) in 351 ms. (113 steps per ms) remains 8/8 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 ...330
Loading property file /tmp/ReachabilityCardinality10340667975120674115.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :7 after 26
BEST_FIRST walk for 40004 steps (3879 resets) in 250 ms. (159 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :58 after 120
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :120 after 224
BEST_FIRST walk for 40003 steps (3884 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :224 after 422
BEST_FIRST walk for 40003 steps (3940 resets) in 211 ms. (188 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :422 after 768
BEST_FIRST walk for 40002 steps (3948 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :768 after 1784
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1784 after 12016
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :12016 after 27731
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :27731 after 167073
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :167073 after 360739
Interrupted probabilistic random walk after 446579 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :4 out of 8
Probabilistic random walk after 446579 steps, saw 183149 distinct states, run finished after 3012 ms. (steps per millisecond=148 ) properties seen :4
[2026-05-23 08:45:30] [INFO ] Invariant cache hit.
[2026-05-23 08:45:30] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 7/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 90/156 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
At refinement iteration 7 (OVERLAPS) 51/207 variables, 22/90 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 38/128 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/128 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 214/214 variables, and 132 constraints, problems are : Problem set: 4 solved, 0 unsolved in 331 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 38/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 346ms problems are : Problem set: 4 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, 0, 0] Max Struct:[7, 7, 10, 1741]
Starting property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2026-05-23 08:45:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2299 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10000 steps (993 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 08:45:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:45:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:45:31] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-23 08:45:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-23 08:45:31] [INFO ] [Real]Added 41 Read/Feed constraints in 13 ms returned sat
[2026-05-23 08:45:31] [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:45:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:45:31] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-23 08:45:31] [INFO ] [Nat]Added 41 Read/Feed constraints in 16 ms returned sat
[2026-05-23 08:45:31] [INFO ] Computed and/alt/rep : 32/77/32 causal constraints (skipped 89 transitions) in 12 ms.
[2026-05-23 08:45:31] [INFO ] Added : 8 causal constraints over 3 iterations in 69 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 122/122 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 89 transition count 118
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 89 transition count 118
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 89 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 87 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 87 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 87 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 86 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 86 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 85 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 85 transition count 105
Applied a total of 17 rules in 31 ms. Remains 85 /92 variables (removed 7) and now considering 105/122 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 85/92 places, 105/122 transitions.
// Phase 1: matrix 105 rows 85 cols
[2026-05-23 08:45:31] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229593 resets) in 1309 ms. (763 steps per ms)
BEST_FIRST walk for 1000000 steps (98280 resets) in 669 ms. (1492 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2026-05-23 08:45:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:45:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:45:33] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[1]
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-23 08:45:33] [INFO ] Flatten gal took : 28 ms
[2026-05-23 08:45:33] [INFO ] Flatten gal took : 21 ms
[2026-05-23 08:45:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality987166039949017559.gal : 6 ms
[2026-05-23 08:45:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2401811203996318716.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/ReachabilityCardinality987166039949017559.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2401811203996318716.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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 ...327
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-00 in 2700 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-01
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 122 rows 92 cols
[2026-05-23 08:45:33] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2275 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10000 steps (983 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 08:45:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:45:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:45:33] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-23 08:45:33] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-23 08:45:33] [INFO ] [Real]Added 41 Read/Feed constraints in 12 ms returned sat
[2026-05-23 08:45: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:45:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:45:33] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-23 08:45:33] [INFO ] [Nat]Added 41 Read/Feed constraints in 19 ms returned sat
[2026-05-23 08:45:33] [INFO ] Computed and/alt/rep : 32/77/32 causal constraints (skipped 89 transitions) in 11 ms.
[2026-05-23 08:45:33] [INFO ] Added : 10 causal constraints over 2 iterations in 67 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 122/122 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 89 transition count 118
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 89 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 89 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 87 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 87 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 85 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 85 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 85 transition count 108
Applied a total of 18 rules in 40 ms. Remains 85 /92 variables (removed 7) and now considering 108/122 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 85/92 places, 108/122 transitions.
// Phase 1: matrix 108 rows 85 cols
[2026-05-23 08:45:34] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229590 resets) in 1558 ms. (641 steps per ms)
BEST_FIRST walk for 1000000 steps (98437 resets) in 744 ms. (1342 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 08:45:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:45:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:45:36] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-23 08:45:36] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-23 08:45:36] [INFO ] [Real]Added 36 Read/Feed constraints in 16 ms returned sat
[2026-05-23 08:45:36] [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:45:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:45:36] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-23 08:45:36] [INFO ] [Nat]Added 36 Read/Feed constraints in 20 ms returned sat
[2026-05-23 08:45:36] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 15 ms.
[2026-05-23 08:45:36] [INFO ] Added : 10 causal constraints over 3 iterations in 96 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2026-05-23 08:45:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:45:37] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-23 08:45:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:45:37] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-23 08:45:37] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:45:37] [INFO ] Redundant transitions in 3 ms returned []
Running 107 sub problems to find dead transitions.
[2026-05-23 08:45:37] [INFO ] Invariant cache hit.
[2026-05-23 08:45:37] [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/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/193 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 36/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 123 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4088 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 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/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/193 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 36/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 107/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 230 constraints, problems are : Problem set: 0 solved, 107 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34206ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 34210ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34834 ms. Remains : 85/85 places, 108/108 transitions.
[2026-05-23 08:46:11] [INFO ] Flatten gal took : 30 ms
[2026-05-23 08:46:11] [INFO ] Flatten gal took : 39 ms
[2026-05-23 08:46:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1383065896569156391.gal : 13 ms
[2026-05-23 08:46:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4105303500435810689.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/ReachabilityCardinality1383065896569156391.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4105303500435810689.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 ...328
RANDOM walk for 40000 steps (9212 resets) in 386 ms. (103 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality4105303500435810689.prop.
BEST_FIRST walk for 40001 steps (3984 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
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
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
BEST_FIRST walk for 40001 steps (3942 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :224 after 422
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :422 after 768
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :768 after 1598
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1598 after 30549
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :30549 after 54352
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :54352 after 159930
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :159930 after 770184
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :770184 after 2.24447e+06
Interrupted probabilistic random walk after 2158543 steps, run timeout after 3001 ms. (steps per millisecond=719 ) properties seen :1 out of 2
Probabilistic random walk after 2158543 steps, saw 857340 distinct states, run finished after 3001 ms. (steps per millisecond=719 ) properties seen :1
[2026-05-23 08:46:14] [INFO ] Invariant cache hit.
[2026-05-23 08:46:14] [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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 77/137 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 184/193 variables, and 82 constraints, problems are : Problem set: 1 solved, 0 unsolved in 133 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/85 constraints, ReadFeed: 0/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 1 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] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-01 in 41556 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-04
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 122 rows 92 cols
[2026-05-23 08:46:15] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (2340 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10000 steps (1006 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2026-05-23 08:46:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:46:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:46:15] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-23 08:46:15] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-23 08:46:15] [INFO ] [Real]Added 41 Read/Feed constraints in 22 ms returned sat
[2026-05-23 08:46:15] [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:46:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:46:15] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-23 08:46:15] [INFO ] [Nat]Added 41 Read/Feed constraints in 22 ms returned sat
[2026-05-23 08:46:15] [INFO ] Computed and/alt/rep : 32/77/32 causal constraints (skipped 89 transitions) in 11 ms.
[2026-05-23 08:46:15] [INFO ] Added : 9 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 122/122 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 89 transition count 118
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 89 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 89 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 87 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 87 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 86 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 86 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 86 transition count 110
Applied a total of 16 rules in 23 ms. Remains 86 /92 variables (removed 6) and now considering 110/122 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 86/92 places, 110/122 transitions.
// Phase 1: matrix 110 rows 86 cols
[2026-05-23 08:46:15] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 1000000 steps (229816 resets) in 1595 ms. (626 steps per ms)
BEST_FIRST walk for 1000001 steps (98483 resets) in 590 ms. (1692 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2026-05-23 08:46:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:46:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:46:17] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-23 08:46:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-23 08:46:17] [INFO ] [Real]Added 37 Read/Feed constraints in 11 ms returned sat
[2026-05-23 08:46:17] [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:46:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:46:18] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2026-05-23 08:46:18] [INFO ] [Nat]Added 37 Read/Feed constraints in 16 ms returned sat
[2026-05-23 08:46:18] [INFO ] Computed and/alt/rep : 30/65/30 causal constraints (skipped 79 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:46:18] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 7 ms to minimize.
[2026-05-23 08:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2026-05-23 08:46:18] [INFO ] Added : 11 causal constraints over 3 iterations in 161 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 110/110 transitions.
Applied a total of 0 rules in 8 ms. Remains 86 /86 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 86/86 places, 110/110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2026-05-23 08:46:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:46:18] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-23 08:46:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:46:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-23 08:46:18] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:46:18] [INFO ] Redundant transitions in 5 ms returned []
Running 109 sub problems to find dead transitions.
[2026-05-23 08:46:18] [INFO ] Invariant cache hit.
[2026-05-23 08:46:18] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/196 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 37/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4988 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/196 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 37/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 21393 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26462ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 26463ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27067 ms. Remains : 86/86 places, 110/110 transitions.
[2026-05-23 08:46:45] [INFO ] Flatten gal took : 13 ms
[2026-05-23 08:46:45] [INFO ] Flatten gal took : 17 ms
RANDOM walk for 40000 steps (9265 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
[2026-05-23 08:46:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9938776805547706357.gal : 4 ms
[2026-05-23 08:46:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13722227251313629037.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/ReachabilityCardinality9938776805547706357.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13722227251313629037.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/ReachabilityCardinality13722227251313629037.prop.
BEST_FIRST walk for 40003 steps (3860 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
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
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
BEST_FIRST walk for 40004 steps (3785 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
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 374
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :374 after 708
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :708 after 1308
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1308 after 12194
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :12194 after 27731
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :27731 after 156439
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :156439 after 311289
Interrupted probabilistic random walk after 2126723 steps, run timeout after 3001 ms. (steps per millisecond=708 ) properties seen :1 out of 2
Probabilistic random walk after 2126723 steps, saw 850413 distinct states, run finished after 3001 ms. (steps per millisecond=708 ) properties seen :1
[2026-05-23 08:46:48] [INFO ] Invariant cache hit.
[2026-05-23 08:46:48] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/140 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 187/196 variables, and 83 constraints, problems are : Problem set: 1 solved, 0 unsolved in 95 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/86 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 1 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] Max Struct:[10]
Ending property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-04 in 33475 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-14
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:[1741]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1741]
// Phase 1: matrix 122 rows 92 cols
[2026-05-23 08:46:48] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1741]
RANDOM walk for 10000 steps (2358 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (1054 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1741]
[2026-05-23 08:46:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:46:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:46:48] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2026-05-23 08:46:48] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-23 08:46:48] [INFO ] [Real]Added 41 Read/Feed constraints in 9 ms returned sat
[2026-05-23 08:46:48] [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:46:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:46:48] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2026-05-23 08:46:48] [INFO ] [Nat]Added 41 Read/Feed constraints in 11 ms returned sat
[2026-05-23 08:46:48] [INFO ] Computed and/alt/rep : 32/77/32 causal constraints (skipped 89 transitions) in 11 ms.
[2026-05-23 08:46:48] [INFO ] Added : 10 causal constraints over 2 iterations in 49 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1741]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1741]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 122/122 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 89 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 89 transition count 119
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 89 transition count 118
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 86 transition count 114
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 86 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 86 transition count 113
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 84 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 84 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 84 transition count 108
Applied a total of 20 rules in 12 ms. Remains 84 /92 variables (removed 8) and now considering 108/122 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 84/92 places, 108/122 transitions.
// Phase 1: matrix 108 rows 84 cols
[2026-05-23 08:46:48] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1741]
RANDOM walk for 1000000 steps (229935 resets) in 1366 ms. (731 steps per ms)
BEST_FIRST walk for 1000001 steps (98127 resets) in 602 ms. (1658 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1741]
[2026-05-23 08:46:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:46:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:46:51] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-23 08:46:51] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-23 08:46:51] [INFO ] [Real]Added 36 Read/Feed constraints in 11 ms returned sat
[2026-05-23 08:46:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:46:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:46:51] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2026-05-23 08:46:51] [INFO ] [Nat]Added 36 Read/Feed constraints in 12 ms returned sat
[2026-05-23 08:46:51] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 78 transitions) in 12 ms.
[2026-05-23 08:46:51] [INFO ] Added : 9 causal constraints over 2 iterations in 49 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1741]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1741]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 84/84 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2026-05-23 08:46:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:46:51] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-23 08:46:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:46:51] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-23 08:46:51] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:46:51] [INFO ] Redundant transitions in 3 ms returned []
Running 107 sub problems to find dead transitions.
[2026-05-23 08:46:51] [INFO ] Invariant cache hit.
[2026-05-23 08:46:51] [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/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/192 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 122 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4440 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 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/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/192 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 107/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 229 constraints, problems are : Problem set: 0 solved, 107 unsolved in 17374 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21878ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 21880ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22521 ms. Remains : 84/84 places, 108/108 transitions.
[2026-05-23 08:47:13] [INFO ] Flatten gal took : 17 ms
[2026-05-23 08:47:13] [INFO ] Flatten gal took : 21 ms
[2026-05-23 08:47:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3203813608077355964.gal : 2 ms
[2026-05-23 08:47:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16842509851682366973.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/ReachabilityCardinality3203813608077355964.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16842509851682366973.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
RANDOM walk for 40000 steps (9231 resets) in 234 ms. (170 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16842509851682366973.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
SDD proceeding with computation,2 properties remain. new max is 16
BEST_FIRST walk for 40001 steps (4015 resets) in 117 ms. (338 steps per ms) remains 2/2 properties
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 40004 steps (3864 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :154 after 278
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :278 after 550
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :550 after 1008
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1008 after 5708
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5708 after 18218
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :18218 after 72114
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :72114 after 326101
Interrupted probabilistic random walk after 2258657 steps, run timeout after 3001 ms. (steps per millisecond=752 ) properties seen :1 out of 2
Probabilistic random walk after 2258657 steps, saw 886041 distinct states, run finished after 3001 ms. (steps per millisecond=752 ) properties seen :1
[2026-05-23 08:47:16] [INFO ] Invariant cache hit.
[2026-05-23 08:47:16] [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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/85 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 49/134 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/141 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 192/192 variables, and 93 constraints, problems are : Problem set: 1 solved, 0 unsolved in 160 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 7/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 1 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] Max Struct:[1741]
Ending property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-14 in 28540 ms.
[2026-05-23 08:47:17] [INFO ] Flatten gal took : 14 ms
[2026-05-23 08:47:17] [INFO ] Applying decomposition
[2026-05-23 08:47:17] [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/graph8485398730657693858.txt' '-o' '/tmp/graph8485398730657693858.bin' '-w' '/tmp/graph8485398730657693858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8485398730657693858.bin' '-l' '-1' '-v' '-w' '/tmp/graph8485398730657693858.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:47:17] [INFO ] Decomposing Gal with order
[2026-05-23 08:47:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:47:17] [INFO ] Removed a total of 141 redundant transitions.
[2026-05-23 08:47:17] [INFO ] Flatten gal took : 81 ms
[2026-05-23 08:47:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 16 ms.
[2026-05-23 08:47:17] [INFO ] Time to serialize gal into /tmp/UpperBounds3070517389825128035.gal : 5 ms
[2026-05-23 08:47:17] [INFO ] Time to serialize properties into /tmp/UpperBounds14358395262499339387.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/UpperBounds3070517389825128035.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14358395262499339387.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/UpperBounds14358395262499339387.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,1.94551e+08,14.6122,262456,5003,1794,321629,37054,399,1.24143e+06,125,321891,0
Total reachable state count : 194550945

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m10-UpperBounds-01 :0 <= i3.u7.p12 <= 1
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-01 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-d1m10-UpperBounds-01,0,15.2695,262456,1,0,321629,37054,514,1.24143e+06,156,321891,1484
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m10-UpperBounds-04 :0 <= i3.u3.l545 <= 1
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-04 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-d1m10-UpperBounds-04,0,15.2735,262456,1,0,321629,37054,531,1.24143e+06,161,321891,1558
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m10-UpperBounds-14 :0 <= i4.u0.l304 <= 1
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-14 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-d1m10-UpperBounds-14,0,15.276,262456,1,0,321629,37054,554,1.24143e+06,177,321891,2016
Total runtime 189812 ms.

BK_STOP 1779526052906

--------------------
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="DBSingleClientW-PT-d1m10"
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-d1m10, 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-177946996300024"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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