About the Execution of 2025-gold for DBSingleClientW-PT-d2m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 635.768 | 212175.00 | 264270.00 | 894.40 | 1 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r095-smll-177946996300025.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-d2m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-smll-177946996300025
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K 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 1.6M 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-d2m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779526063965
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 08:47:45] [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:47:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:47:46] [INFO ] Load time of PNML (sax parser for PT used): 434 ms
[2026-05-23 08:47:46] [INFO ] Transformed 4763 places.
[2026-05-23 08:47:46] [INFO ] Transformed 2478 transitions.
[2026-05-23 08:47:46] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 625 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 3580 places in 25 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2026-05-23 08:47:47] [INFO ] Computed 6 invariants in 236 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[7, 4, 1597]
RANDOM walk for 10000 steps (2300 resets) in 642 ms. (15 steps per ms)
BEST_FIRST walk for 30003 steps (2912 resets) in 370 ms. (80 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[7, 4, 1597]
[2026-05-23 08:47:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:47:48] [INFO ] [Real]Absence check using 2 positive place invariants in 23 ms returned sat
[2026-05-23 08:47:48] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned sat
[2026-05-23 08:47:51] [INFO ] [Real]Absence check using state equation in 2256 ms returned sat
[2026-05-23 08:47:51] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2026-05-23 08:47:52] [INFO ] [Real]Added 1588 Read/Feed constraints in 1080 ms returned sat
[2026-05-23 08:47:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:47:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2026-05-23 08:47:53] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2026-05-23 08:47:54] [INFO ] [Nat]Absence check using state equation in 1231 ms returned sat
[2026-05-23 08:47:55] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-23 08:47:56] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1928 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:47:56] [INFO ] [Real]Absence check using 2 positive place invariants in 21 ms returned sat
[2026-05-23 08:47:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2026-05-23 08:47:57] [INFO ] [Real]Absence check using state equation in 1081 ms returned sat
[2026-05-23 08:47:58] [INFO ] [Real]Added 1588 Read/Feed constraints in 1110 ms returned sat
[2026-05-23 08:47:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:47:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2026-05-23 08:47:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2026-05-23 08:48:00] [INFO ] [Nat]Absence check using state equation in 992 ms returned sat
[2026-05-23 08:48:01] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1397 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:48:03] [INFO ] Deduced a trap composed of 24 places in 2122 ms of which 70 ms to minimize.
[2026-05-23 08:48:03] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 2371 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:48:04] [INFO ] [Real]Absence check using 2 positive place invariants in 17 ms returned sat
[2026-05-23 08:48:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2026-05-23 08:48:05] [INFO ] [Real]Absence check using state equation in 1298 ms returned sat
[2026-05-23 08:48:07] [INFO ] [Real]Added 1588 Read/Feed constraints in 1860 ms returned sat
[2026-05-23 08:48:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:48:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 27 ms returned sat
[2026-05-23 08:48:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2026-05-23 08:48:09] [INFO ] [Nat]Absence check using state equation in 1315 ms returned sat
[2026-05-23 08:48:10] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1661 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:48:12] [INFO ] Deduced a trap composed of 156 places in 1855 ms of which 244 ms to minimize.
[2026-05-23 08:48:12] [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 2
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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[7, 4, 1597]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[7, 4, 1597]
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1137 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.13 ms
Discarding 46 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 213 transitions.
Iterating post reduction 0 with 213 rules applied. Total rules applied 214 place count 1137 transition count 2265
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 603 place count 748 transition count 1205
Iterating global reduction 1 with 389 rules applied. Total rules applied 992 place count 748 transition count 1205
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1001 place count 748 transition count 1196
Discarding 315 places :
Symmetric choice reduction at 2 with 315 rule applications. Total rules 1316 place count 433 transition count 881
Iterating global reduction 2 with 315 rules applied. Total rules applied 1631 place count 433 transition count 881
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1643 place count 433 transition count 869
Discarding 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 1883 place count 193 transition count 531
Iterating global reduction 3 with 240 rules applied. Total rules applied 2123 place count 193 transition count 531
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Iterating post reduction 3 with 212 rules applied. Total rules applied 2335 place count 193 transition count 319
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 2358 place count 170 transition count 282
Iterating global reduction 4 with 23 rules applied. Total rules applied 2381 place count 170 transition count 282
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2387 place count 170 transition count 276
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2403 place count 154 transition count 260
Iterating global reduction 5 with 16 rules applied. Total rules applied 2419 place count 154 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2423 place count 154 transition count 256
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2436 place count 141 transition count 243
Iterating global reduction 6 with 13 rules applied. Total rules applied 2449 place count 141 transition count 243
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2462 place count 141 transition count 230
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2466 place count 137 transition count 208
Iterating global reduction 7 with 4 rules applied. Total rules applied 2470 place count 137 transition count 208
Applied a total of 2470 rules in 392 ms. Remains 137 /1183 variables (removed 1046) and now considering 208/2478 (removed 2270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 405 ms. Remains : 137/1183 places, 208/2478 transitions.
// Phase 1: matrix 208 rows 137 cols
[2026-05-23 08:48:13] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[7, 4, 1597]
RANDOM walk for 1000000 steps (230267 resets) in 2961 ms. (337 steps per ms)
BEST_FIRST walk for 3000003 steps (287762 resets) in 3535 ms. (848 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[7, 4, 1597]
[2026-05-23 08:48:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:48:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:48:20] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2026-05-23 08:48:20] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-23 08:48:20] [INFO ] [Real]Added 79 Read/Feed constraints in 27 ms returned sat
[2026-05-23 08:48:20] [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:48:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:48:20] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2026-05-23 08:48:20] [INFO ] [Nat]Added 79 Read/Feed constraints in 66 ms returned sat
[2026-05-23 08:48:20] [INFO ] Computed and/alt/rep : 52/126/52 causal constraints (skipped 155 transitions) in 82 ms.
[2026-05-23 08:48:20] [INFO ] Added : 13 causal constraints over 3 iterations in 258 ms. Result :sat
Minimization took 246 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:48:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:48:21] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-23 08:48:21] [INFO ] [Real]Added 79 Read/Feed constraints in 23 ms returned sat
[2026-05-23 08:48:21] [INFO ] Computed and/alt/rep : 52/126/52 causal constraints (skipped 155 transitions) in 35 ms.
[2026-05-23 08:48:21] [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:48:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:48:21] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2026-05-23 08:48:21] [INFO ] [Nat]Added 79 Read/Feed constraints in 33 ms returned sat
[2026-05-23 08:48:21] [INFO ] Computed and/alt/rep : 52/126/52 causal constraints (skipped 155 transitions) in 69 ms.
[2026-05-23 08:48:21] [INFO ] Added : 8 causal constraints over 2 iterations in 211 ms. Result :sat
Minimization took 265 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:48:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2026-05-23 08:48:22] [INFO ] [Real]Absence check using state equation in 116 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[7, 4, 1]
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[7, 4]
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 208/208 transitions.
Graph (complete) has 468 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 136 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 133 transition count 190
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 133 transition count 190
Applied a total of 10 rules in 52 ms. Remains 133 /137 variables (removed 4) and now considering 190/208 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 133/137 places, 190/208 transitions.
// Phase 1: matrix 190 rows 133 cols
[2026-05-23 08:48:22] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[7, 4]
RANDOM walk for 1000000 steps (229576 resets) in 2553 ms. (391 steps per ms)
BEST_FIRST walk for 2000000 steps (192153 resets) in 1835 ms. (1089 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[7, 4]
[2026-05-23 08:48:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:48:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:48:26] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2026-05-23 08:48:26] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-23 08:48:26] [INFO ] [Real]Added 61 Read/Feed constraints in 31 ms returned sat
[2026-05-23 08:48:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:48:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:48:27] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2026-05-23 08:48:27] [INFO ] [Nat]Added 61 Read/Feed constraints in 45 ms returned sat
[2026-05-23 08:48:27] [INFO ] Computed and/alt/rep : 52/126/52 causal constraints (skipped 137 transitions) in 36 ms.
[2026-05-23 08:48:27] [INFO ] Added : 10 causal constraints over 2 iterations in 150 ms. Result :sat
Minimization took 203 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:48:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2026-05-23 08:48:27] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2026-05-23 08:48:27] [INFO ] [Real]Added 61 Read/Feed constraints in 30 ms returned sat
[2026-05-23 08:48:27] [INFO ] Computed and/alt/rep : 52/126/52 causal constraints (skipped 137 transitions) in 53 ms.
[2026-05-23 08:48:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:48:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:48:28] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2026-05-23 08:48:28] [INFO ] [Nat]Added 61 Read/Feed constraints in 35 ms returned sat
[2026-05-23 08:48:28] [INFO ] Computed and/alt/rep : 52/126/52 causal constraints (skipped 137 transitions) in 42 ms.
[2026-05-23 08:48:28] [INFO ] Added : 16 causal constraints over 4 iterations in 241 ms. Result :sat
Minimization took 206 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[7, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[7, 4]
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 190/190 transitions.
Applied a total of 0 rules in 13 ms. Remains 133 /133 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 133/133 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 190/190 transitions.
Applied a total of 0 rules in 13 ms. Remains 133 /133 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2026-05-23 08:48:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:48:29] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-23 08:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:48:29] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-23 08:48:30] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:48:30] [INFO ] Redundant transitions in 12 ms returned []
Running 189 sub problems to find dead transitions.
[2026-05-23 08:48:30] [INFO ] Invariant cache hit.
[2026-05-23 08:48:30] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/323 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 61/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:48:41] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:48:41] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/323 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 198 constraints, problems are : Problem set: 0 solved, 189 unsolved in 25889 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 1/133 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/323 variables, 133/137 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 61/198 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 189/387 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 323/323 variables, and 387 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56404ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 56423ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58283 ms. Remains : 133/133 places, 190/190 transitions.
RANDOM walk for 40000 steps (9143 resets) in 901 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3941 resets) in 418 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3810 resets) in 348 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (3785 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
[2026-05-23 08:49:27] [INFO ] Flatten gal took : 231 ms
BEST_FIRST walk for 40001 steps (3869 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
[2026-05-23 08:49:27] [INFO ] Flatten gal took : 61 ms
[2026-05-23 08:49:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18229037335178048216.gal : 24 ms
[2026-05-23 08:49:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14908158065295579785.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/ReachabilityCardinality18229037335178048216.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14908158065295579785.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14908158065295579785.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :106 after 146
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :146 after 204
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :204 after 696
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :696 after 957
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :957 after 2875
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2875 after 7462
Probably explored full state space saw : 26891 states, properties seen :2
Probabilistic random walk after 64607 steps, saw 26891 distinct states, run finished after 666 ms. (steps per millisecond=97 ) properties seen :2
Explored full state space saw : 26960 states, properties seen :0
Exhaustive walk after 64704 steps, saw 26960 distinct states, run finished after 310 ms. (steps per millisecond=208 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[7, 4]
Starting property specific reduction for DBSingleClientW-PT-d2m04-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:49:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2270 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10000 steps (985 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 08:49:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:49:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:49:29] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2026-05-23 08:49:29] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-23 08:49:29] [INFO ] [Real]Added 61 Read/Feed constraints in 30 ms returned sat
[2026-05-23 08:49:29] [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:49:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:49:29] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2026-05-23 08:49:29] [INFO ] [Nat]Added 61 Read/Feed constraints in 43 ms returned sat
[2026-05-23 08:49:29] [INFO ] Computed and/alt/rep : 52/126/52 causal constraints (skipped 137 transitions) in 31 ms.
[2026-05-23 08:49:29] [INFO ] Added : 10 causal constraints over 2 iterations in 141 ms. Result :sat
Minimization took 208 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 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 190/190 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 132 transition count 189
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 132 transition count 189
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 131 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 131 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 130 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 130 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 129 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 129 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 128 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 128 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 127 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 127 transition count 181
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 126 transition count 179
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 126 transition count 179
Applied a total of 14 rules in 66 ms. Remains 126 /133 variables (removed 7) and now considering 179/190 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 126/133 places, 179/190 transitions.
// Phase 1: matrix 179 rows 126 cols
[2026-05-23 08:49:29] [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 (230010 resets) in 2150 ms. (464 steps per ms)
BEST_FIRST walk for 1000000 steps (95757 resets) in 872 ms. (1145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 08:49:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:49:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:49:32] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-23 08:49:32] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-23 08:49:33] [INFO ] [Real]Added 57 Read/Feed constraints in 17 ms returned sat
[2026-05-23 08:49:33] [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:49:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:49:33] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-23 08:49:33] [INFO ] [Nat]Added 57 Read/Feed constraints in 18 ms returned sat
[2026-05-23 08:49:33] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 128 transitions) in 15 ms.
[2026-05-23 08:49:33] [INFO ] Added : 11 causal constraints over 3 iterations in 121 ms. Result :sat
Minimization took 155 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 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 126/126 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 14 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2026-05-23 08:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:49:33] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-23 08:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:49:33] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-23 08:49:34] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:49:34] [INFO ] Redundant transitions in 12 ms returned []
Running 178 sub problems to find dead transitions.
[2026-05-23 08:49:34] [INFO ] Invariant cache hit.
[2026-05-23 08:49:34] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/305 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 57/185 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/305 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 185 constraints, problems are : Problem set: 0 solved, 178 unsolved in 15675 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/305 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 57/185 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 178/363 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/305 variables, and 363 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45921ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 45924ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46978 ms. Remains : 126/126 places, 179/179 transitions.
[2026-05-23 08:50:20] [INFO ] Flatten gal took : 47 ms
RANDOM walk for 40000 steps (9206 resets) in 213 ms. (186 steps per ms) remains 2/2 properties
[2026-05-23 08:50:20] [INFO ] Flatten gal took : 43 ms
[2026-05-23 08:50:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12987154011576043527.gal : 11 ms
[2026-05-23 08:50:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14902292058955316425.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/ReachabilityCardinality12987154011576043527.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14902292058955316425.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40002 steps (3848 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality14902292058955316425.prop.
BEST_FIRST walk for 40003 steps (3786 resets) in 140 ms. (283 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 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 170
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :170 after 276
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :276 after 534
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :534 after 1056
Probably explored full state space saw : 24082 states, properties seen :1
Probabilistic random walk after 56568 steps, saw 24082 distinct states, run finished after 225 ms. (steps per millisecond=251 ) properties seen :1
Explored full state space saw : 24117 states, properties seen :0
Exhaustive walk after 56603 steps, saw 24117 distinct states, run finished after 114 ms. (steps per millisecond=496 ) properties seen :0
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-d2m04-UpperBounds-00 in 52259 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-03
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:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
// Phase 1: matrix 190 rows 133 cols
[2026-05-23 08:50:21] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (2279 resets) in 35 ms. (277 steps per ms)
BEST_FIRST walk for 10000 steps (994 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2026-05-23 08:50:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:50:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:50:21] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2026-05-23 08:50:21] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-23 08:50:21] [INFO ] [Real]Added 61 Read/Feed constraints in 27 ms returned sat
[2026-05-23 08:50:21] [INFO ] Computed and/alt/rep : 52/126/52 causal constraints (skipped 137 transitions) in 25 ms.
[2026-05-23 08:50:21] [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:50:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:50:21] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2026-05-23 08:50:21] [INFO ] [Nat]Added 61 Read/Feed constraints in 29 ms returned sat
[2026-05-23 08:50:21] [INFO ] Computed and/alt/rep : 52/126/52 causal constraints (skipped 137 transitions) in 23 ms.
[2026-05-23 08:50:21] [INFO ] Added : 16 causal constraints over 4 iterations in 201 ms. Result :sat
Minimization took 195 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 190/190 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 132 transition count 189
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 132 transition count 189
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 131 transition count 187
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 131 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 131 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 130 transition count 179
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 130 transition count 179
Applied a total of 7 rules in 29 ms. Remains 130 /133 variables (removed 3) and now considering 179/190 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 130/133 places, 179/190 transitions.
// Phase 1: matrix 179 rows 130 cols
[2026-05-23 08:50:22] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (230037 resets) in 2286 ms. (437 steps per ms)
BEST_FIRST walk for 1000001 steps (95898 resets) in 868 ms. (1150 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2026-05-23 08:50:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:50:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:50:25] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-23 08:50:25] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-23 08:50:25] [INFO ] [Real]Added 53 Read/Feed constraints in 17 ms returned sat
[2026-05-23 08:50:25] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 127 transitions) in 15 ms.
[2026-05-23 08:50:25] [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:50:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:50:25] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-05-23 08:50:25] [INFO ] [Nat]Added 53 Read/Feed constraints in 33 ms returned sat
[2026-05-23 08:50:25] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 127 transitions) in 18 ms.
[2026-05-23 08:50:25] [INFO ] Added : 13 causal constraints over 3 iterations in 153 ms. Result :sat
Minimization took 173 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 179/179 transitions.
Applied a total of 0 rules in 10 ms. Remains 130 /130 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 130/130 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 179/179 transitions.
Applied a total of 0 rules in 9 ms. Remains 130 /130 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2026-05-23 08:50:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:50:26] [INFO ] Implicit Places using invariants in 229 ms returned []
[2026-05-23 08:50:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:50:26] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-23 08:50:28] [INFO ] Implicit Places using invariants and state equation in 1649 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:50:28] [INFO ] Redundant transitions in 2 ms returned []
Running 178 sub problems to find dead transitions.
[2026-05-23 08:50:28] [INFO ] Invariant cache hit.
[2026-05-23 08:50:28] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/309 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 53/185 constraints. Problems are: Problem set: 0 solved, 178 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 185 constraints, problems are : Problem set: 0 solved, 178 unsolved in 16094 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/130 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/309 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 53/185 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 178/363 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 309/309 variables, and 363 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/130 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46303ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 46304ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48204 ms. Remains : 130/130 places, 179/179 transitions.
[2026-05-23 08:51:14] [INFO ] Flatten gal took : 68 ms
[2026-05-23 08:51:14] [INFO ] Flatten gal took : 54 ms
[2026-05-23 08:51:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14371084754858366200.gal : 24 ms
[2026-05-23 08:51:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11958849894596588100.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/ReachabilityCardinality14371084754858366200.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11958849894596588100.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (9238 resets) in 572 ms. (69 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11958849894596588100.prop.
BEST_FIRST walk for 40002 steps (3950 resets) in 111 ms. (357 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 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
BEST_FIRST walk for 40002 steps (3766 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 136
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :136 after 202
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :202 after 428
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :428 after 694
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :694 after 2875
Probably explored full state space saw : 26332 states, properties seen :1
Probabilistic random walk after 62900 steps, saw 26332 distinct states, run finished after 346 ms. (steps per millisecond=181 ) properties seen :1
Explored full state space saw : 26384 states, properties seen :0
Exhaustive walk after 62954 steps, saw 26384 distinct states, run finished after 140 ms. (steps per millisecond=449 ) properties seen :0
ITS runner timed out or was interrupted.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2875 after 7206
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-03 in 54084 ms.
[2026-05-23 08:51:15] [INFO ] Flatten gal took : 25 ms
[2026-05-23 08:51:15] [INFO ] Applying decomposition
[2026-05-23 08:51:15] [INFO ] Flatten gal took : 25 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/graph16374217054723234762.txt' '-o' '/tmp/graph16374217054723234762.bin' '-w' '/tmp/graph16374217054723234762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16374217054723234762.bin' '-l' '-1' '-v' '-w' '/tmp/graph16374217054723234762.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:51:15] [INFO ] Decomposing Gal with order
[2026-05-23 08:51:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:51:15] [INFO ] Removed a total of 226 redundant transitions.
[2026-05-23 08:51:15] [INFO ] Flatten gal took : 93 ms
[2026-05-23 08:51:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 21 ms.
[2026-05-23 08:51:15] [INFO ] Time to serialize gal into /tmp/UpperBounds12909719129266142734.gal : 8 ms
[2026-05-23 08:51:15] [INFO ] Time to serialize properties into /tmp/UpperBounds4024233506486629366.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/UpperBounds12909719129266142734.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4024233506486629366.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/UpperBounds4024233506486629366.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,26960,0.406243,14956,906,442,16383,4401,534,28780,141,16010,0
Total reachable state count : 26960
Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-00 :0 <= i0.u0.p44 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-00 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-d2m04-UpperBounds-00,0,0.422013,14956,1,0,16383,4401,676,28780,180,16010,858
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-03 :0 <= i0.u6.l2331 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-03 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-d2m04-UpperBounds-03,0,0.422723,14956,1,0,16383,4401,701,28780,185,16010,1080
Total runtime 210065 ms.
BK_STOP 1779526276140
--------------------
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-d2m04"
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-d2m04, 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-177946996300025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m04.tgz
mv DBSingleClientW-PT-d2m04 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;