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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 9.5K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:50 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-d2m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779526287787

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 08:51:30] [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:51:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:51:31] [INFO ] Load time of PNML (sax parser for PT used): 587 ms
[2026-05-23 08:51:31] [INFO ] Transformed 4763 places.
[2026-05-23 08:51:31] [INFO ] Transformed 2478 transitions.
[2026-05-23 08:51:31] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 838 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 3580 places in 30 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2026-05-23 08:51:31] [INFO ] Computed 6 invariants in 291 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[2343, 6, 7, 2343]
RANDOM walk for 10000 steps (2296 resets) in 601 ms. (16 steps per ms)
BEST_FIRST walk for 40001 steps (3884 resets) in 468 ms. (85 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[2343, 6, 7, 2343]
[2026-05-23 08:51:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:51:33] [INFO ] [Real]Absence check using 2 positive place invariants in 39 ms returned sat
[2026-05-23 08:51:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 25 ms returned sat
[2026-05-23 08:51:34] [INFO ] [Real]Absence check using state equation in 1251 ms returned sat
[2026-05-23 08:51:35] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2026-05-23 08:51:37] [INFO ] [Real]Added 1588 Read/Feed constraints in 2006 ms returned sat
[2026-05-23 08:51:37] [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:51:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 27 ms returned sat
[2026-05-23 08:51:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2026-05-23 08:51:39] [INFO ] [Nat]Absence check using state equation in 1271 ms returned sat
[2026-05-23 08:51:41] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-23 08:51:41] [INFO ] [Nat]Added 1588 Read/Feed constraints in 2511 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:51:42] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2026-05-23 08:51:42] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2026-05-23 08:51:43] [INFO ] [Real]Absence check using state equation in 1194 ms returned sat
[2026-05-23 08:51:44] [INFO ] [Real]Added 1588 Read/Feed constraints in 1640 ms returned sat
[2026-05-23 08:51:45] [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:51:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 26 ms returned sat
[2026-05-23 08:51:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2026-05-23 08:51:46] [INFO ] [Nat]Absence check using state equation in 1186 ms returned sat
[2026-05-23 08:51:48] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-23 08:51:48] [INFO ] [Nat]Added 1588 Read/Feed constraints in 2063 ms returned sat
[2026-05-23 08:51:50] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 1324 ms.
[2026-05-23 08:51:50] [INFO ] Added : 0 causal constraints over 0 iterations in 1340 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:51:50] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2026-05-23 08:51:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2026-05-23 08:51:51] [INFO ] [Real]Absence check using state equation in 1254 ms returned sat
[2026-05-23 08:51:51] [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:51:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 26 ms returned sat
[2026-05-23 08:51:52] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2026-05-23 08:51:53] [INFO ] [Nat]Absence check using state equation in 1347 ms returned sat
[2026-05-23 08:51:55] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-23 08:51:55] [INFO ] [Nat]Added 1588 Read/Feed constraints in 2034 ms returned sat
[2026-05-23 08:51:57] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 1376 ms.
[2026-05-23 08:51:57] [INFO ] Added : 0 causal constraints over 0 iterations in 1377 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:51:57] [INFO ] [Real]Absence check using 2 positive place invariants in 24 ms returned sat
[2026-05-23 08:51:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2026-05-23 08:51:58] [INFO ] [Real]Absence check using state equation in 1301 ms returned sat
[2026-05-23 08:52:00] [INFO ] [Real]Added 1588 Read/Feed constraints in 1626 ms returned sat
[2026-05-23 08:52:00] [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:52:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 26 ms returned sat
[2026-05-23 08:52:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 30 ms returned sat
[2026-05-23 08:52:02] [INFO ] [Nat]Absence check using state equation in 1433 ms returned sat
[2026-05-23 08:52:04] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-23 08:52:04] [INFO ] [Nat]Added 1588 Read/Feed constraints in 2425 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:52:06] [INFO ] Deduced a trap composed of 182 places in 1955 ms of which 324 ms to minimize.
[2026-05-23 08:52:06] [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 3
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, 0] Max Struct:[2343, 6, 7, 2343]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[2343, 6, 7, 2343]
Support contains 4 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 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.10 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 390 places :
Symmetric choice reduction at 1 with 390 rule applications. Total rules 608 place count 746 transition count 1201
Iterating global reduction 1 with 390 rules applied. Total rules applied 998 place count 746 transition count 1201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1007 place count 746 transition count 1192
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1321 place count 432 transition count 878
Iterating global reduction 2 with 314 rules applied. Total rules applied 1635 place count 432 transition count 878
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1647 place count 432 transition count 866
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 1885 place count 194 transition count 527
Iterating global reduction 3 with 238 rules applied. Total rules applied 2123 place count 194 transition count 527
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Iterating post reduction 3 with 209 rules applied. Total rules applied 2332 place count 194 transition count 318
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2357 place count 169 transition count 278
Iterating global reduction 4 with 25 rules applied. Total rules applied 2382 place count 169 transition count 278
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2388 place count 169 transition count 272
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2405 place count 152 transition count 255
Iterating global reduction 5 with 17 rules applied. Total rules applied 2422 place count 152 transition count 255
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2426 place count 152 transition count 251
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2440 place count 138 transition count 237
Iterating global reduction 6 with 14 rules applied. Total rules applied 2454 place count 138 transition count 237
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2467 place count 138 transition count 224
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2472 place count 133 transition count 203
Iterating global reduction 7 with 5 rules applied. Total rules applied 2477 place count 133 transition count 203
Applied a total of 2477 rules in 400 ms. Remains 133 /1183 variables (removed 1050) and now considering 203/2478 (removed 2275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 133/1183 places, 203/2478 transitions.
// Phase 1: matrix 203 rows 133 cols
[2026-05-23 08:52:07] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[2343, 6, 7, 2343]
RANDOM walk for 1000000 steps (229632 resets) in 2437 ms. (410 steps per ms)
BEST_FIRST walk for 4000002 steps (384277 resets) in 3982 ms. (1004 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[2343, 6, 7, 2343]
[2026-05-23 08:52:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:52:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:52:14] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2026-05-23 08:52:14] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-23 08:52:14] [INFO ] [Real]Added 77 Read/Feed constraints in 42 ms returned sat
[2026-05-23 08:52:14] [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:52:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:52:14] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2026-05-23 08:52:14] [INFO ] [Nat]Added 77 Read/Feed constraints in 53 ms returned sat
[2026-05-23 08:52:14] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 151 transitions) in 26 ms.
[2026-05-23 08:52:14] [INFO ] Added : 9 causal constraints over 2 iterations in 183 ms. Result :sat
Minimization took 234 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:52:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:52:15] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2026-05-23 08:52:15] [INFO ] [Real]Added 77 Read/Feed constraints in 33 ms returned sat
[2026-05-23 08:52:15] [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:52:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:52:15] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2026-05-23 08:52:15] [INFO ] [Nat]Added 77 Read/Feed constraints in 30 ms returned sat
[2026-05-23 08:52:15] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 151 transitions) in 22 ms.
[2026-05-23 08:52:15] [INFO ] Added : 10 causal constraints over 2 iterations in 145 ms. Result :sat
Minimization took 267 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:52:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:52:15] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2026-05-23 08:52:16] [INFO ] [Real]Added 77 Read/Feed constraints in 37 ms returned sat
[2026-05-23 08:52:16] [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:52:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:52:16] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2026-05-23 08:52:16] [INFO ] [Nat]Added 77 Read/Feed constraints in 43 ms returned sat
[2026-05-23 08:52:16] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 151 transitions) in 27 ms.
[2026-05-23 08:52:16] [INFO ] Added : 14 causal constraints over 3 iterations in 299 ms. Result :sat
Minimization took 223 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:52:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:52:17] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2026-05-23 08:52:17] [INFO ] [Real]Added 77 Read/Feed constraints in 33 ms returned sat
[2026-05-23 08:52:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:52:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:52:17] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2026-05-23 08:52:17] [INFO ] [Nat]Added 77 Read/Feed constraints in 44 ms returned sat
[2026-05-23 08:52:17] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 151 transitions) in 33 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:52:17] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:52:17] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:52:18] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:52:18] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 12 ms to minimize.
[2026-05-23 08:52:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 947 ms
[2026-05-23 08:52:18] [INFO ] Added : 14 causal constraints over 5 iterations in 1300 ms. Result :sat
Minimization took 278 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[2343, 6, 7, 2343]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[2343, 6, 7, 2343]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 203/203 transitions.
Applied a total of 0 rules in 28 ms. Remains 133 /133 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 133/133 places, 203/203 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 203/203 transitions.
Applied a total of 0 rules in 17 ms. Remains 133 /133 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2026-05-23 08:52:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:52:19] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-23 08:52:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:52:19] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-23 08:52:20] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:52:20] [INFO ] Redundant transitions in 10 ms returned []
Running 202 sub problems to find dead transitions.
[2026-05-23 08:52:20] [INFO ] Invariant cache hit.
[2026-05-23 08:52:20] [INFO ] State equation strengthened by 77 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, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/336 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 77/212 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:52:33] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 336/336 variables, and 213 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 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, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 1/133 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/336 variables, 133/136 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 77/213 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 202/415 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 336/336 variables, and 415 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60456ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61683 ms. Remains : 133/133 places, 203/203 transitions.
RANDOM walk for 40000 steps (9193 resets) in 1384 ms. (28 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3892 resets) in 266 ms. (149 steps per ms) remains 8/8 properties
[2026-05-23 08:53:21] [INFO ] Flatten gal took : 137 ms
BEST_FIRST walk for 40003 steps (3862 resets) in 270 ms. (147 steps per ms) remains 8/8 properties
[2026-05-23 08:53:21] [INFO ] Flatten gal took : 61 ms
[2026-05-23 08:53:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11638636236424396183.gal : 29 ms
BEST_FIRST walk for 40002 steps (3771 resets) in 237 ms. (168 steps per ms) remains 8/8 properties
[2026-05-23 08:53:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3156894156531426998.prop : 5 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/ReachabilityCardinality11638636236424396183.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3156894156531426998.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3156894156531426998.prop.
BEST_FIRST walk for 40002 steps (3931 resets) in 369 ms. (108 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :7 after 30
BEST_FIRST walk for 40003 steps (3862 resets) in 210 ms. (189 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :106 after 182
BEST_FIRST walk for 40002 steps (3765 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :182 after 324
BEST_FIRST walk for 40002 steps (3827 resets) in 244 ms. (163 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3710 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :324 after 708
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :708 after 7614
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :7614 after 14601
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :14601 after 42995
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :42995 after 173913
Interrupted probabilistic random walk after 426791 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :4 out of 8
Probabilistic random walk after 426791 steps, saw 173171 distinct states, run finished after 3007 ms. (steps per millisecond=141 ) properties seen :4
[2026-05-23 08:53:25] [INFO ] Invariant cache hit.
[2026-05-23 08:53:25] [INFO ] State equation strengthened by 77 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 138/232 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
After SMT solving in domain Real declared 327/336 variables, and 130 constraints, problems are : Problem set: 4 solved, 0 unsolved in 297 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/133 constraints, ReadFeed: 0/77 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 307ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[2343, 6, 7, 2343]
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-05
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:[2343]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2343]
[2026-05-23 08:53:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2343]
RANDOM walk for 10000 steps (2290 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10000 steps (941 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2343]
[2026-05-23 08:53:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:53:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:53:25] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-23 08:53:25] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-23 08:53:25] [INFO ] [Real]Added 77 Read/Feed constraints in 37 ms returned sat
[2026-05-23 08:53:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:53:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:53:25] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-23 08:53:25] [INFO ] [Nat]Added 77 Read/Feed constraints in 29 ms returned sat
[2026-05-23 08:53:25] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 151 transitions) in 18 ms.
[2026-05-23 08:53:25] [INFO ] Added : 9 causal constraints over 2 iterations in 91 ms. Result :sat
Minimization took 157 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2343]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2343]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 203/203 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 130 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 130 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 130 transition count 198
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 127 transition count 188
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 127 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 127 transition count 187
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 125 transition count 178
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 125 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 125 transition count 177
Applied a total of 19 rules in 27 ms. Remains 125 /133 variables (removed 8) and now considering 177/203 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 125/133 places, 177/203 transitions.
// Phase 1: matrix 177 rows 125 cols
[2026-05-23 08:53:26] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2343]
RANDOM walk for 1000000 steps (229866 resets) in 1897 ms. (526 steps per ms)
BEST_FIRST walk for 1000001 steps (95983 resets) in 814 ms. (1226 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2343]
[2026-05-23 08:53:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:53:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:53:29] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-23 08:53:29] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-23 08:53:29] [INFO ] [Real]Added 57 Read/Feed constraints in 15 ms returned sat
[2026-05-23 08:53:29] [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:53:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:53:29] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2026-05-23 08:53:29] [INFO ] [Nat]Added 57 Read/Feed constraints in 25 ms returned sat
[2026-05-23 08:53:29] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 127 transitions) in 24 ms.
[2026-05-23 08:53:29] [INFO ] Added : 16 causal constraints over 4 iterations in 164 ms. Result :sat
Minimization took 118 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2343]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2343]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 12 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 125/125 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 11 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2026-05-23 08:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:53:29] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-23 08:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:53:29] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-23 08:53:30] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:53:30] [INFO ] Redundant transitions in 8 ms returned []
Running 176 sub problems to find dead transitions.
[2026-05-23 08:53:30] [INFO ] Invariant cache hit.
[2026-05-23 08:53:30] [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/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/302 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 184 constraints, problems are : Problem set: 0 solved, 176 unsolved in 19099 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/302 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 176/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 360 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49319ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 49321ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50126 ms. Remains : 125/125 places, 177/177 transitions.
[2026-05-23 08:54:19] [INFO ] Flatten gal took : 65 ms
[2026-05-23 08:54:19] [INFO ] Flatten gal took : 43 ms
RANDOM walk for 40000 steps (9171 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
[2026-05-23 08:54:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12721191131611568928.gal : 11 ms
[2026-05-23 08:54:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9661245985432042240.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/ReachabilityCardinality12721191131611568928.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9661245985432042240.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40001 steps (3711 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality9661245985432042240.prop.
BEST_FIRST walk for 40002 steps (3943 resets) in 100 ms. (396 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 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 500
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :500 after 2006
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2006 after 4352
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4352 after 24513
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :24513 after 71224
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :71224 after 229926
Interrupted probabilistic random walk after 1636373 steps, run timeout after 3001 ms. (steps per millisecond=545 ) properties seen :1 out of 2
Probabilistic random walk after 1636373 steps, saw 686750 distinct states, run finished after 3001 ms. (steps per millisecond=545 ) properties seen :1
[2026-05-23 08:54:22] [INFO ] Invariant cache hit.
[2026-05-23 08:54:22] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/133 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/205 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/220 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 302/302 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 224 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 8/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[2343]
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-05 in 57698 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 203 rows 133 cols
[2026-05-23 08:54:23] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2312 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (986 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2026-05-23 08:54:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:54:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:54:23] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2026-05-23 08:54:23] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-23 08:54:23] [INFO ] [Real]Added 77 Read/Feed constraints in 39 ms returned sat
[2026-05-23 08:54:23] [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:54:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:54:23] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2026-05-23 08:54:23] [INFO ] [Nat]Added 77 Read/Feed constraints in 31 ms returned sat
[2026-05-23 08:54:23] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 151 transitions) in 28 ms.
[2026-05-23 08:54:23] [INFO ] Added : 10 causal constraints over 2 iterations in 159 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 203/203 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 130 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 130 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 130 transition count 197
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 128 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 128 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 128 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 127 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 127 transition count 179
Applied a total of 15 rules in 24 ms. Remains 127 /133 variables (removed 6) and now considering 179/203 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 127/133 places, 179/203 transitions.
// Phase 1: matrix 179 rows 127 cols
[2026-05-23 08:54:24] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229865 resets) in 2243 ms. (445 steps per ms)
BEST_FIRST walk for 1000000 steps (94770 resets) in 833 ms. (1199 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2026-05-23 08:54:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:54:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:54:27] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-23 08:54:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-23 08:54:27] [INFO ] [Real]Added 58 Read/Feed constraints in 25 ms returned sat
[2026-05-23 08:54: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:54:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:54:27] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2026-05-23 08:54:27] [INFO ] [Nat]Added 58 Read/Feed constraints in 22 ms returned sat
[2026-05-23 08:54:27] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 20 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:54:27] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:54:27] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 10 ms to minimize.
[2026-05-23 08:54:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2026-05-23 08:54:28] [INFO ] Added : 22 causal constraints over 6 iterations in 658 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 127/127 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2026-05-23 08:54:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:54:28] [INFO ] Implicit Places using invariants in 206 ms returned []
[2026-05-23 08:54:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:54:28] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-23 08:54:29] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:54:29] [INFO ] Redundant transitions in 3 ms returned []
Running 178 sub problems to find dead transitions.
[2026-05-23 08:54:29] [INFO ] Invariant cache hit.
[2026-05-23 08:54:29] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 13279 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 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/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43429ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 43430ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44302 ms. Remains : 127/127 places, 179/179 transitions.
[2026-05-23 08:55:12] [INFO ] Flatten gal took : 22 ms
[2026-05-23 08:55:12] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:55:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12667298151786671088.gal : 4 ms
[2026-05-23 08:55:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8420140866281890770.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/ReachabilityCardinality12667298151786671088.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8420140866281890770.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (9169 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality8420140866281890770.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
BEST_FIRST walk for 40002 steps (3867 resets) in 163 ms. (243 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 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
BEST_FIRST walk for 40003 steps (3819 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 466
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :466 after 1832
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1832 after 3470
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3470 after 21966
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :21966 after 56141
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :56141 after 225313
Interrupted probabilistic random walk after 1698122 steps, run timeout after 3001 ms. (steps per millisecond=565 ) properties seen :1 out of 2
Probabilistic random walk after 1698122 steps, saw 710021 distinct states, run finished after 3001 ms. (steps per millisecond=565 ) properties seen :1
[2026-05-23 08:55:16] [INFO ] Invariant cache hit.
[2026-05-23 08:55:16] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/222 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 124 constraints, problems are : Problem set: 1 solved, 0 unsolved in 155 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/127 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-10 in 53021 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 203 rows 133 cols
[2026-05-23 08:55:16] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2289 resets) in 37 ms. (263 steps per ms)
BEST_FIRST walk for 10001 steps (1015 resets) in 21 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 08:55:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:55:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:55:16] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2026-05-23 08:55:16] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-23 08:55:16] [INFO ] [Real]Added 77 Read/Feed constraints in 32 ms returned sat
[2026-05-23 08:55:16] [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:55:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:55:16] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-05-23 08:55:16] [INFO ] [Nat]Added 77 Read/Feed constraints in 28 ms returned sat
[2026-05-23 08:55:16] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 151 transitions) in 25 ms.
[2026-05-23 08:55:16] [INFO ] Added : 14 causal constraints over 3 iterations in 204 ms. Result :sat
Minimization took 153 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, 203/203 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 130 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 130 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 130 transition count 197
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 128 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 128 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 127 transition count 187
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 127 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 127 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 126 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 126 transition count 179
Applied a total of 17 rules in 30 ms. Remains 126 /133 variables (removed 7) and now considering 179/203 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 126/133 places, 179/203 transitions.
// Phase 1: matrix 179 rows 126 cols
[2026-05-23 08:55:17] [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 (229687 resets) in 2003 ms. (499 steps per ms)
BEST_FIRST walk for 1000001 steps (95137 resets) in 821 ms. (1216 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 08:55:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:55:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:55:20] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-23 08:55:20] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-23 08:55:20] [INFO ] [Real]Added 58 Read/Feed constraints in 17 ms returned sat
[2026-05-23 08:55: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:55:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:55:20] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-23 08:55:20] [INFO ] [Nat]Added 58 Read/Feed constraints in 22 ms returned sat
[2026-05-23 08:55:20] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 14 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:55:20] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 9 ms to minimize.
[2026-05-23 08:55:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2026-05-23 08:55:20] [INFO ] Added : 17 causal constraints over 4 iterations in 360 ms. Result :sat
Minimization took 109 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 6 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 6 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 5 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2026-05-23 08:55:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:55:20] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-23 08:55:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:55:21] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-23 08:55:21] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:55:21] [INFO ] Redundant transitions in 2 ms returned []
Running 178 sub problems to find dead transitions.
[2026-05-23 08:55:21] [INFO ] Invariant cache hit.
[2026-05-23 08:55:21] [INFO ] State equation strengthened by 58 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, 58/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/305 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 186 constraints, problems are : Problem set: 0 solved, 178 unsolved in 11740 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 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, 58/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 178/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/364 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 364 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41878ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 41879ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42670 ms. Remains : 126/126 places, 179/179 transitions.
[2026-05-23 08:56:03] [INFO ] Flatten gal took : 43 ms
[2026-05-23 08:56:03] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:56:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality114131181326879948.gal : 3 ms
[2026-05-23 08:56:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality749816647934762625.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/ReachabilityCardinality114131181326879948.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality749816647934762625.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 ...326
RANDOM walk for 40000 steps (9234 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality749816647934762625.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
BEST_FIRST walk for 40003 steps (3820 resets) in 117 ms. (339 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 142
BEST_FIRST walk for 40003 steps (3801 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :142 after 218
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :218 after 372
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :372 after 846
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :846 after 3224
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3224 after 18480
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :18480 after 44904
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :44904 after 224433
Interrupted probabilistic random walk after 1769659 steps, run timeout after 3001 ms. (steps per millisecond=589 ) properties seen :1 out of 2
Probabilistic random walk after 1769659 steps, saw 733093 distinct states, run finished after 3001 ms. (steps per millisecond=589 ) properties seen :1
[2026-05-23 08:56:06] [INFO ] Invariant cache hit.
[2026-05-23 08:56:06] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 130/220 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 296/305 variables, and 123 constraints, problems are : Problem set: 1 solved, 0 unsolved in 161 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/126 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-12 in 50635 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-15
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:[2343]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2343]
// Phase 1: matrix 203 rows 133 cols
[2026-05-23 08:56:06] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2343]
RANDOM walk for 10000 steps (2315 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (891 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2343]
[2026-05-23 08:56:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:56:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:56:07] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2026-05-23 08:56:07] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-23 08:56:07] [INFO ] [Real]Added 77 Read/Feed constraints in 34 ms returned sat
[2026-05-23 08:56: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:56:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:56:07] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2026-05-23 08:56:07] [INFO ] [Nat]Added 77 Read/Feed constraints in 28 ms returned sat
[2026-05-23 08:56:07] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 151 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:56:07] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:56:07] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:56:07] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:56:07] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 12 ms to minimize.
[2026-05-23 08:56:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 599 ms
[2026-05-23 08:56:08] [INFO ] Added : 14 causal constraints over 5 iterations in 791 ms. Result :sat
Minimization took 174 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2343]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2343]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 203/203 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 130 transition count 200
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 130 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 130 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 128 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 128 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 128 transition count 196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 126 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 126 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 126 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 125 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 125 transition count 179
Applied a total of 19 rules in 18 ms. Remains 125 /133 variables (removed 8) and now considering 179/203 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 125/133 places, 179/203 transitions.
// Phase 1: matrix 179 rows 125 cols
[2026-05-23 08:56:08] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2343]
RANDOM walk for 1000000 steps (229574 resets) in 1846 ms. (541 steps per ms)
BEST_FIRST walk for 1000001 steps (95449 resets) in 828 ms. (1206 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2343]
[2026-05-23 08:56:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:56:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:56:11] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-23 08:56:11] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-23 08:56:11] [INFO ] [Real]Added 58 Read/Feed constraints in 23 ms returned sat
[2026-05-23 08:56:11] [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:56:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:56:11] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-23 08:56:11] [INFO ] [Nat]Added 58 Read/Feed constraints in 18 ms returned sat
[2026-05-23 08:56:11] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 129 transitions) in 14 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:56:11] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:56:11] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:56:11] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 8 ms to minimize.
[2026-05-23 08:56:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 430 ms
[2026-05-23 08:56:11] [INFO ] Added : 18 causal constraints over 5 iterations in 583 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2343]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2343]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 125/125 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2026-05-23 08:56:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:56:12] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-23 08:56:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:56:12] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-23 08:56:13] [INFO ] Implicit Places using invariants and state equation in 1087 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:56:13] [INFO ] Redundant transitions in 3 ms returned []
Running 178 sub problems to find dead transitions.
[2026-05-23 08:56:13] [INFO ] Invariant cache hit.
[2026-05-23 08:56:13] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 185 constraints, problems are : Problem set: 0 solved, 178 unsolved in 14277 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 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/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 178/363 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 363 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44441ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 44443ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45724 ms. Remains : 125/125 places, 179/179 transitions.
[2026-05-23 08:56:57] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:56:57] [INFO ] Flatten gal took : 14 ms
RANDOM walk for 40000 steps (9150 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
[2026-05-23 08:56:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2720260974750531234.gal : 4 ms
[2026-05-23 08:56:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18396318457494355284.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/ReachabilityCardinality2720260974750531234.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18396318457494355284.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality18396318457494355284.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 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
BEST_FIRST walk for 40003 steps (3858 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
BEST_FIRST walk for 40004 steps (3970 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 500
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :500 after 2332
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2332 after 4560
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4560 after 23166
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :23166 after 102904
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :102904 after 237852
Interrupted probabilistic random walk after 1816574 steps, run timeout after 3001 ms. (steps per millisecond=605 ) properties seen :1 out of 2
Probabilistic random walk after 1816574 steps, saw 748714 distinct states, run finished after 3001 ms. (steps per millisecond=605 ) properties seen :1
[2026-05-23 08:57:00] [INFO ] Invariant cache hit.
[2026-05-23 08:57:00] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/136 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 71/207 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/222 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 304/304 variables, and 136 constraints, problems are : Problem set: 1 solved, 0 unsolved in 142 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 9/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[2343]
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-15 in 54222 ms.
[2026-05-23 08:57:01] [INFO ] Flatten gal took : 17 ms
[2026-05-23 08:57:01] [INFO ] Applying decomposition
[2026-05-23 08:57:01] [INFO ] Flatten gal took : 17 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/graph17052402089094671482.txt' '-o' '/tmp/graph17052402089094671482.bin' '-w' '/tmp/graph17052402089094671482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17052402089094671482.bin' '-l' '-1' '-v' '-w' '/tmp/graph17052402089094671482.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:57:01] [INFO ] Decomposing Gal with order
[2026-05-23 08:57:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:57:01] [INFO ] Removed a total of 182 redundant transitions.
[2026-05-23 08:57:01] [INFO ] Flatten gal took : 115 ms
[2026-05-23 08:57:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 123 labels/synchronizations in 21 ms.
[2026-05-23 08:57:01] [INFO ] Time to serialize gal into /tmp/UpperBounds14694060594648874872.gal : 8 ms
[2026-05-23 08:57:01] [INFO ] Time to serialize properties into /tmp/UpperBounds3630455598589893562.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/UpperBounds14694060594648874872.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3630455598589893562.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/UpperBounds3630455598589893562.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.96332e+06,2.07423,48276,1360,1870,40565,17342,489,179080,318,208868,0
Total reachable state count : 1963323

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-05 :0 <= u8.l1612 <= 1
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-05 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-d2m06-UpperBounds-05,0,2.20646,48276,1,0,40565,17342,589,179080,377,208868,921
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-10 :0 <= i0.u2.l2613 <= 1
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-10 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-d2m06-UpperBounds-10,0,2.22087,48276,1,0,40565,17342,610,179080,410,208868,1335
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-12 :0 <= i6.u6.p67 <= 1
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-12 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-d2m06-UpperBounds-12,0,2.22908,48276,1,0,40565,17342,633,179080,430,208868,1485
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-15 :0 <= u5.l1805 <= 1
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-15 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-d2m06-UpperBounds-15,0,2.23573,48276,1,0,40565,17342,647,179080,465,208868,1520
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 333532 ms.

BK_STOP 1779526623847

--------------------
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-d2m06"
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-d2m06, 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-177946996300027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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