About the Execution of 2025-gold for DBSingleClientW-PT-d2m08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1531.703 | 487133.00 | 581612.00 | 1802.50 | 1 1 0 0 0 0 1 0 0 0 1 1 0 1 1 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r095-smll-177946996300029.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-d2m08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-smll-177946996300029
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.7K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:51 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-d2m08-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779526583910
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 08:56:26] [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:56:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:56:26] [INFO ] Load time of PNML (sax parser for PT used): 527 ms
[2026-05-23 08:56:27] [INFO ] Transformed 4763 places.
[2026-05-23 08:56:27] [INFO ] Transformed 2478 transitions.
[2026-05-23 08:56:27] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 749 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Deduced a syphon composed of 3580 places in 29 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2026-05-23 08:56:27] [INFO ] Computed 6 invariants in 250 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 2887, 7, 2887, 2887, 8]
RANDOM walk for 10000 steps (2308 resets) in 679 ms. (14 steps per ms)
BEST_FIRST walk for 70007 steps (6526 resets) in 849 ms. (82 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 2887, 7, 2887, 2887, 8]
[2026-05-23 08:56:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:56:30] [INFO ] [Real]Absence check using 2 positive place invariants in 36 ms returned sat
[2026-05-23 08:56:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 28 ms returned sat
[2026-05-23 08:56:31] [INFO ] [Real]Absence check using state equation in 1367 ms returned sat
[2026-05-23 08:56:31] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2026-05-23 08:56:33] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-23 08:56:34] [INFO ] [Real]Added 1588 Read/Feed constraints in 2209 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:56:34] [INFO ] [Real]Absence check using 2 positive place invariants in 41 ms returned sat
[2026-05-23 08:56:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2026-05-23 08:56:36] [INFO ] [Real]Absence check using state equation in 1506 ms returned sat
[2026-05-23 08:56:37] [INFO ] [Real]Added 1588 Read/Feed constraints in 1111 ms returned sat
[2026-05-23 08:56: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:56:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 28 ms returned sat
[2026-05-23 08:56:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned sat
[2026-05-23 08:56:39] [INFO ] [Nat]Absence check using state equation in 1371 ms returned sat
[2026-05-23 08:56:40] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-23 08:56:40] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1842 ms returned sat
[2026-05-23 08:56:42] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 1349 ms.
[2026-05-23 08:56:42] [INFO ] Added : 0 causal constraints over 0 iterations in 1361 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:56:42] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2026-05-23 08:56:42] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned sat
[2026-05-23 08:56:44] [INFO ] [Real]Absence check using state equation in 1244 ms returned sat
[2026-05-23 08:56:45] [INFO ] [Real]Added 1588 Read/Feed constraints in 1150 ms returned sat
[2026-05-23 08:56: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:56:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 17 ms returned sat
[2026-05-23 08:56:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2026-05-23 08:56:46] [INFO ] [Nat]Absence check using state equation in 1162 ms returned sat
[2026-05-23 08:56:48] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1404 ms returned sat
[2026-05-23 08:56:49] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 1498 ms.
[2026-05-23 08:56:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:56:50] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2026-05-23 08:56:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2026-05-23 08:56:52] [INFO ] [Real]Absence check using state equation in 1218 ms returned sat
[2026-05-23 08:56:53] [INFO ] [Real]Added 1588 Read/Feed constraints in 1630 ms returned sat
[2026-05-23 08:56:53] [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:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 17 ms returned sat
[2026-05-23 08:56:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2026-05-23 08:56:55] [INFO ] [Nat]Absence check using state equation in 1265 ms returned sat
[2026-05-23 08:56:57] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1673 ms returned sat
[2026-05-23 08:56:58] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 961 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:56:59] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2026-05-23 08:56:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2026-05-23 08:57:00] [INFO ] [Real]Absence check using state equation in 1132 ms returned sat
[2026-05-23 08:57:01] [INFO ] [Real]Added 1588 Read/Feed constraints in 1161 ms returned sat
[2026-05-23 08:57:01] [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:57:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 25 ms returned sat
[2026-05-23 08:57:02] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2026-05-23 08:57:03] [INFO ] [Nat]Absence check using state equation in 1215 ms returned sat
[2026-05-23 08:57:04] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1398 ms returned sat
[2026-05-23 08:57:05] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 738 ms.
[2026-05-23 08:57:06] [INFO ] Added : 13 causal constraints over 3 iterations in 1850 ms. Result :sat
Minimization took 96 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:57:07] [INFO ] [Real]Absence check using 2 positive place invariants in 23 ms returned sat
[2026-05-23 08:57:07] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned sat
[2026-05-23 08:57:08] [INFO ] [Real]Absence check using state equation in 1452 ms returned sat
[2026-05-23 08:57:10] [INFO ] [Real]Added 1588 Read/Feed constraints in 1548 ms returned sat
[2026-05-23 08:57:10] [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:57:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 27 ms returned sat
[2026-05-23 08:57:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2026-05-23 08:57:12] [INFO ] [Nat]Absence check using state equation in 1296 ms returned sat
[2026-05-23 08:57:13] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-23 08:57:14] [INFO ] [Nat]Added 1588 Read/Feed constraints in 2054 ms returned sat
[2026-05-23 08:57:14] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 725 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:57:15] [INFO ] [Real]Absence check using 2 positive place invariants in 26 ms returned sat
[2026-05-23 08:57:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2026-05-23 08:57:16] [INFO ] [Real]Absence check using state equation in 1177 ms returned sat
[2026-05-23 08:57:18] [INFO ] [Real]Added 1588 Read/Feed constraints in 1158 ms returned sat
[2026-05-23 08:57:18] [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:57:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 28 ms returned sat
[2026-05-23 08:57:18] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 20 ms returned sat
[2026-05-23 08:57:19] [INFO ] [Nat]Absence check using state equation in 1200 ms returned sat
[2026-05-23 08:57:21] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-23 08:57:22] [INFO ] [Nat]Added 1588 Read/Feed constraints in 2390 ms returned sat
[2026-05-23 08:57:23] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 806 ms.
[2026-05-23 08:57:23] [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 6
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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
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, 0, 0, 0] Max Struct:[7, 7, 2887, 7, 2887, 2887, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 2887, 7, 2887, 2887, 8]
Support contains 7 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.15 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 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 606 place count 748 transition count 1241
Iterating global reduction 1 with 388 rules applied. Total rules applied 994 place count 748 transition count 1241
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1003 place count 748 transition count 1232
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1317 place count 434 transition count 918
Iterating global reduction 2 with 314 rules applied. Total rules applied 1631 place count 434 transition count 918
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1642 place count 434 transition count 907
Discarding 237 places :
Symmetric choice reduction at 3 with 237 rule applications. Total rules 1879 place count 197 transition count 569
Iterating global reduction 3 with 237 rules applied. Total rules applied 2116 place count 197 transition count 569
Ensure Unique test removed 239 transitions
Reduce isomorphic transitions removed 239 transitions.
Iterating post reduction 3 with 239 rules applied. Total rules applied 2355 place count 197 transition count 330
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 2378 place count 174 transition count 293
Iterating global reduction 4 with 23 rules applied. Total rules applied 2401 place count 174 transition count 293
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2406 place count 174 transition count 288
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2423 place count 157 transition count 271
Iterating global reduction 5 with 17 rules applied. Total rules applied 2440 place count 157 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2444 place count 157 transition count 267
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2458 place count 143 transition count 253
Iterating global reduction 6 with 14 rules applied. Total rules applied 2472 place count 143 transition count 253
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 2486 place count 143 transition count 239
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2491 place count 138 transition count 214
Iterating global reduction 7 with 5 rules applied. Total rules applied 2496 place count 138 transition count 214
Applied a total of 2496 rules in 480 ms. Remains 138 /1183 variables (removed 1045) and now considering 214/2478 (removed 2264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 138/1183 places, 214/2478 transitions.
// Phase 1: matrix 214 rows 138 cols
[2026-05-23 08:57:24] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 2887, 7, 2887, 2887, 8]
RANDOM walk for 1000000 steps (229789 resets) in 2762 ms. (361 steps per ms)
BEST_FIRST walk for 7000003 steps (669044 resets) in 8216 ms. (851 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0, 0, 0] Max Struct:[7, 7, 2887, 7, 2887, 2887, 8]
[2026-05-23 08:57:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:57:35] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2026-05-23 08:57:35] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-23 08:57:35] [INFO ] [Real]Added 85 Read/Feed constraints in 19 ms returned sat
[2026-05-23 08:57:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:57:35] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2026-05-23 08:57:35] [INFO ] [Nat]Added 85 Read/Feed constraints in 24 ms returned sat
[2026-05-23 08:57:35] [INFO ] Computed and/alt/rep : 52/132/52 causal constraints (skipped 161 transitions) in 16 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:57:35] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:57:36] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 19 ms to minimize.
[2026-05-23 08:57:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 534 ms
[2026-05-23 08:57:36] [INFO ] Added : 15 causal constraints over 3 iterations in 703 ms. Result :sat
Minimization took 285 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:36] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-23 08:57:36] [INFO ] [Real]Added 85 Read/Feed constraints in 39 ms returned sat
[2026-05-23 08:57:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:37] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2026-05-23 08:57:37] [INFO ] [Nat]Added 85 Read/Feed constraints in 41 ms returned sat
[2026-05-23 08:57:37] [INFO ] Computed and/alt/rep : 52/132/52 causal constraints (skipped 161 transitions) in 33 ms.
[2026-05-23 08:57:37] [INFO ] Added : 9 causal constraints over 2 iterations in 139 ms. Result :sat
Minimization took 277 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:37] [INFO ] [Real]Absence check using state equation in 115 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:37] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2026-05-23 08:57:38] [INFO ] [Real]Added 85 Read/Feed constraints in 35 ms returned sat
[2026-05-23 08:57:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:38] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2026-05-23 08:57:38] [INFO ] [Nat]Added 85 Read/Feed constraints in 39 ms returned sat
[2026-05-23 08:57:38] [INFO ] Computed and/alt/rep : 52/132/52 causal constraints (skipped 161 transitions) in 27 ms.
[2026-05-23 08:57:38] [INFO ] Added : 7 causal constraints over 2 iterations in 113 ms. Result :sat
Minimization took 246 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:38] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2026-05-23 08:57:38] [INFO ] [Real]Added 85 Read/Feed constraints in 26 ms returned sat
[2026-05-23 08:57:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:57:39] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2026-05-23 08:57:39] [INFO ] [Nat]Added 85 Read/Feed constraints in 27 ms returned sat
[2026-05-23 08:57:39] [INFO ] Computed and/alt/rep : 52/132/52 causal constraints (skipped 161 transitions) in 17 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:57:39] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:57:39] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 8 ms to minimize.
[2026-05-23 08:57:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 306 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:57:39] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 11 ms to minimize.
[2026-05-23 08:57:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2026-05-23 08:57:39] [INFO ] Added : 19 causal constraints over 5 iterations in 861 ms. Result :sat
Minimization took 261 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:40] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2026-05-23 08:57:40] [INFO ] [Real]Added 85 Read/Feed constraints in 32 ms returned sat
[2026-05-23 08:57:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:57:40] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2026-05-23 08:57:40] [INFO ] [Nat]Added 85 Read/Feed constraints in 28 ms returned sat
[2026-05-23 08:57:40] [INFO ] Computed and/alt/rep : 52/132/52 causal constraints (skipped 161 transitions) in 25 ms.
[2026-05-23 08:57:40] [INFO ] Added : 9 causal constraints over 2 iterations in 134 ms. Result :sat
Minimization took 281 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:57:41] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2026-05-23 08:57:41] [INFO ] [Real]Added 85 Read/Feed constraints in 36 ms returned sat
[2026-05-23 08:57:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:57:41] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2026-05-23 08:57:41] [INFO ] [Nat]Added 85 Read/Feed constraints in 30 ms returned sat
[2026-05-23 08:57:41] [INFO ] Computed and/alt/rep : 52/132/52 causal constraints (skipped 161 transitions) in 26 ms.
[2026-05-23 08:57:41] [INFO ] Added : 18 causal constraints over 5 iterations in 211 ms. Result :sat
Minimization took 185 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0, 0, 0] Max Struct:[7, 7, 1, 7, 2887, 2887, 8]
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 2887, 2887, 8]
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 214/214 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 137 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 137 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 137 transition count 212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 136 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 136 transition count 210
Applied a total of 5 rules in 42 ms. Remains 136 /138 variables (removed 2) and now considering 210/214 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 136/138 places, 210/214 transitions.
// Phase 1: matrix 210 rows 136 cols
[2026-05-23 08:57:42] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 2887, 2887, 8]
RANDOM walk for 1000000 steps (230184 resets) in 2794 ms. (357 steps per ms)
BEST_FIRST walk for 6000004 steps (572625 resets) in 6687 ms. (897 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 2887, 2887, 8]
[2026-05-23 08:57:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 11 ms returned sat
[2026-05-23 08:57:52] [INFO ] [Real]Absence check using state equation in 73 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:52] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2026-05-23 08:57:52] [INFO ] State equation strengthened by 82 read => feed constraints.
[2026-05-23 08:57:52] [INFO ] [Real]Added 82 Read/Feed constraints in 61 ms returned sat
[2026-05-23 08:57:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:52] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2026-05-23 08:57:52] [INFO ] [Nat]Added 82 Read/Feed constraints in 38 ms returned sat
[2026-05-23 08:57:52] [INFO ] Computed and/alt/rep : 52/130/52 causal constraints (skipped 157 transitions) in 24 ms.
[2026-05-23 08:57:53] [INFO ] Added : 22 causal constraints over 5 iterations in 263 ms. Result :sat
Minimization took 266 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:53] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-23 08:57:53] [INFO ] [Real]Added 82 Read/Feed constraints in 36 ms returned sat
[2026-05-23 08:57:53] [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:57:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:53] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2026-05-23 08:57:53] [INFO ] [Nat]Added 82 Read/Feed constraints in 41 ms returned sat
[2026-05-23 08:57:53] [INFO ] Computed and/alt/rep : 52/130/52 causal constraints (skipped 157 transitions) in 28 ms.
[2026-05-23 08:57:53] [INFO ] Added : 11 causal constraints over 3 iterations in 166 ms. Result :sat
Minimization took 276 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:54] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2026-05-23 08:57:54] [INFO ] [Real]Added 82 Read/Feed constraints in 43 ms returned sat
[2026-05-23 08:57:54] [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:57:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:54] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2026-05-23 08:57:54] [INFO ] [Nat]Added 82 Read/Feed constraints in 45 ms returned sat
[2026-05-23 08:57:54] [INFO ] Computed and/alt/rep : 52/130/52 causal constraints (skipped 157 transitions) in 29 ms.
[2026-05-23 08:57:54] [INFO ] Added : 12 causal constraints over 3 iterations in 167 ms. Result :sat
Minimization took 284 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:55] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2026-05-23 08:57:55] [INFO ] [Real]Added 82 Read/Feed constraints in 35 ms returned sat
[2026-05-23 08:57:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2026-05-23 08:57:55] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2026-05-23 08:57:55] [INFO ] [Nat]Added 82 Read/Feed constraints in 42 ms returned sat
[2026-05-23 08:57:55] [INFO ] Computed and/alt/rep : 52/130/52 causal constraints (skipped 157 transitions) in 27 ms.
[2026-05-23 08:57:55] [INFO ] Added : 12 causal constraints over 3 iterations in 156 ms. Result :sat
Minimization took 239 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:57:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:57:56] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2026-05-23 08:57:56] [INFO ] [Real]Added 82 Read/Feed constraints in 34 ms returned sat
[2026-05-23 08:57:56] [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:57:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:57:56] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2026-05-23 08:57:56] [INFO ] [Nat]Added 82 Read/Feed constraints in 47 ms returned sat
[2026-05-23 08:57:56] [INFO ] Computed and/alt/rep : 52/130/52 causal constraints (skipped 157 transitions) in 30 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:57:56] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 12 ms to minimize.
[2026-05-23 08:57:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2026-05-23 08:57:57] [INFO ] Added : 11 causal constraints over 3 iterations in 409 ms. Result :sat
Minimization took 253 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0, 0, 0] Max Struct:[1, 7, 7, 2887, 2887, 8]
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 7, 2887, 2887, 8]
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 210/210 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 134 transition count 206
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 134 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 133 transition count 205
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 133 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 133 transition count 204
Applied a total of 8 rules in 43 ms. Remains 133 /136 variables (removed 3) and now considering 204/210 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 133/136 places, 204/210 transitions.
// Phase 1: matrix 204 rows 133 cols
[2026-05-23 08:57:57] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 7, 2887, 2887, 8]
RANDOM walk for 1000000 steps (229872 resets) in 2525 ms. (395 steps per ms)
BEST_FIRST walk for 5000000 steps (478485 resets) in 5424 ms. (921 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 7, 2887, 2887, 8]
[2026-05-23 08:58:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:58:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:58:05] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2026-05-23 08:58:05] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-23 08:58:06] [INFO ] [Real]Added 80 Read/Feed constraints in 44 ms returned sat
[2026-05-23 08:58:06] [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:58:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:58:06] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2026-05-23 08:58:06] [INFO ] [Nat]Added 80 Read/Feed constraints in 24 ms returned sat
[2026-05-23 08:58:06] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 152 transitions) in 25 ms.
[2026-05-23 08:58:06] [INFO ] Added : 12 causal constraints over 3 iterations in 132 ms. Result :sat
Minimization took 246 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:58:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:58:06] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2026-05-23 08:58:06] [INFO ] [Real]Added 80 Read/Feed constraints in 21 ms returned sat
[2026-05-23 08:58:06] [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:58:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:58:06] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2026-05-23 08:58:07] [INFO ] [Nat]Added 80 Read/Feed constraints in 27 ms returned sat
[2026-05-23 08:58:07] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 152 transitions) in 27 ms.
[2026-05-23 08:58:07] [INFO ] Added : 7 causal constraints over 2 iterations in 129 ms. Result :sat
Minimization took 233 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:58:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:58:07] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2026-05-23 08:58:07] [INFO ] [Real]Added 80 Read/Feed constraints in 39 ms returned sat
[2026-05-23 08:58:07] [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:58:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2026-05-23 08:58:07] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2026-05-23 08:58:07] [INFO ] [Nat]Added 80 Read/Feed constraints in 37 ms returned sat
[2026-05-23 08:58:07] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 152 transitions) in 26 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:58:08] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:58:08] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 14 ms to minimize.
[2026-05-23 08:58:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 408 ms
[2026-05-23 08:58:08] [INFO ] Added : 17 causal constraints over 5 iterations in 732 ms. Result :sat
Minimization took 153 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:58:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2026-05-23 08:58:08] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2026-05-23 08:58:09] [INFO ] [Real]Added 80 Read/Feed constraints in 42 ms returned sat
[2026-05-23 08:58:09] [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:58:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:58:09] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-23 08:58:09] [INFO ] [Nat]Added 80 Read/Feed constraints in 27 ms returned sat
[2026-05-23 08:58:09] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 152 transitions) in 15 ms.
[2026-05-23 08:58:09] [INFO ] Added : 11 causal constraints over 3 iterations in 92 ms. Result :sat
Minimization took 157 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:58:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:58:09] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2026-05-23 08:58:09] [INFO ] [Real]Added 80 Read/Feed constraints in 38 ms returned sat
[2026-05-23 08:58:09] [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:58:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:58:09] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2026-05-23 08:58:09] [INFO ] [Nat]Added 80 Read/Feed constraints in 42 ms returned sat
[2026-05-23 08:58:09] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 152 transitions) in 27 ms.
[2026-05-23 08:58:10] [INFO ] Added : 11 causal constraints over 3 iterations in 182 ms. Result :sat
Minimization took 228 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 7, 2887, 2887, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 7, 2887, 2887, 8]
Support contains 5 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 133/133 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2026-05-23 08:58:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:58:10] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-23 08:58:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:58:10] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-23 08:58:11] [INFO ] Implicit Places using invariants and state equation in 1136 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:58:11] [INFO ] Redundant transitions in 10 ms returned []
Running 203 sub problems to find dead transitions.
[2026-05-23 08:58:11] [INFO ] Invariant cache hit.
[2026-05-23 08:58:11] [INFO ] State equation strengthened by 80 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, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 80/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 215 constraints, problems are : Problem set: 0 solved, 203 unsolved in 17455 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 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, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 80/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/418 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 418 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47857ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 47869ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49237 ms. Remains : 133/133 places, 204/204 transitions.
[2026-05-23 08:59:00] [INFO ] Flatten gal took : 263 ms
RANDOM walk for 40000 steps (9204 resets) in 3326 ms. (12 steps per ms) remains 10/10 properties
[2026-05-23 08:59:01] [INFO ] Flatten gal took : 114 ms
[2026-05-23 08:59:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17250090803978948265.gal : 29 ms
[2026-05-23 08:59:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3314800352661227764.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/ReachabilityCardinality17250090803978948265.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3314800352661227764.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (3797 resets) in 1015 ms. (39 steps per ms) remains 10/10 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3314800352661227764.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40002 steps (3884 resets) in 414 ms. (96 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :182 after 330
BEST_FIRST walk for 40002 steps (3898 resets) in 407 ms. (98 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :330 after 588
BEST_FIRST walk for 40003 steps (3740 resets) in 246 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3904 resets) in 313 ms. (127 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :588 after 1316
BEST_FIRST walk for 40003 steps (3741 resets) in 342 ms. (116 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3901 resets) in 277 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3937 resets) in 279 ms. (142 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :1316 after 9201
BEST_FIRST walk for 40003 steps (3760 resets) in 229 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (3904 resets) in 183 ms. (217 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :9201 after 21208
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :21208 after 156734
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :156734 after 368413
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :368413 after 3.49725e+06
Interrupted probabilistic random walk after 831561 steps, run timeout after 6001 ms. (steps per millisecond=138 ) properties seen :5 out of 10
Probabilistic random walk after 831561 steps, saw 338320 distinct states, run finished after 6009 ms. (steps per millisecond=138 ) properties seen :5
[2026-05-23 08:59:08] [INFO ] Invariant cache hit.
[2026-05-23 08:59:08] [INFO ] State equation strengthened by 80 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 74/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 143/237 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
After SMT solving in domain Real declared 328/337 variables, and 130 constraints, problems are : Problem set: 5 solved, 0 unsolved in 361 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/133 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 371ms problems are : Problem set: 5 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, 0] Max Struct:[7, 7, 2887, 2887, 8]
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2026-05-23 08:59:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2297 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (996 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 08:59:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:59:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:59:08] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2026-05-23 08:59:08] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-23 08:59:08] [INFO ] [Real]Added 80 Read/Feed constraints in 51 ms returned sat
[2026-05-23 08:59:08] [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:59:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:59:09] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2026-05-23 08:59:09] [INFO ] [Nat]Added 80 Read/Feed constraints in 24 ms returned sat
[2026-05-23 08:59:09] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 152 transitions) in 17 ms.
[2026-05-23 08:59:09] [INFO ] Added : 12 causal constraints over 3 iterations in 90 ms. Result :sat
Minimization took 159 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, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 130 transition count 194
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 130 transition count 194
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 193
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 128 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 128 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 127 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 127 transition count 184
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 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 126 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 126 transition count 176
Applied a total of 16 rules in 28 ms. Remains 126 /133 variables (removed 7) and now considering 176/204 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 126/133 places, 176/204 transitions.
// Phase 1: matrix 176 rows 126 cols
[2026-05-23 08:59:09] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229784 resets) in 2255 ms. (443 steps per ms)
BEST_FIRST walk for 1000000 steps (95584 resets) in 1108 ms. (901 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 08:59:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:59:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:59:12] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2026-05-23 08:59:12] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-23 08:59:12] [INFO ] [Real]Added 55 Read/Feed constraints in 25 ms returned sat
[2026-05-23 08:59:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:59:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:59:13] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2026-05-23 08:59:13] [INFO ] [Nat]Added 55 Read/Feed constraints in 30 ms returned sat
[2026-05-23 08:59:13] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 125 transitions) in 23 ms.
[2026-05-23 08:59:13] [INFO ] Added : 9 causal constraints over 2 iterations in 108 ms. Result :sat
Minimization took 154 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, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 126 /126 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 126/126 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 126 /126 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2026-05-23 08:59:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:59:13] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-23 08:59:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:59:13] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-23 08:59:14] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:59:14] [INFO ] Redundant transitions in 20 ms returned []
Running 175 sub problems to find dead transitions.
[2026-05-23 08:59:14] [INFO ] Invariant cache hit.
[2026-05-23 08:59:14] [INFO ] State equation strengthened by 55 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, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/302 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 183 constraints, problems are : Problem set: 0 solved, 175 unsolved in 14178 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 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, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/302 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 175/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44437ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 44444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45322 ms. Remains : 126/126 places, 176/176 transitions.
[2026-05-23 08:59:58] [INFO ] Flatten gal took : 35 ms
[2026-05-23 08:59:58] [INFO ] Flatten gal took : 49 ms
[2026-05-23 08:59:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18067177267963013014.gal : 14 ms
[2026-05-23 08:59:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4085966114333148963.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/ReachabilityCardinality18067177267963013014.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4085966114333148963.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 (9191 resets) in 328 ms. (121 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality4085966114333148963.prop.
BEST_FIRST walk for 40002 steps (3931 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40002 steps (3662 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
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 498
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :498 after 854
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :854 after 4604
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4604 after 12804
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :12804 after 114202
Interrupted probabilistic random walk after 1620576 steps, run timeout after 3001 ms. (steps per millisecond=540 ) properties seen :1 out of 2
Probabilistic random walk after 1620576 steps, saw 681392 distinct states, run finished after 3001 ms. (steps per millisecond=540 ) properties seen :1
[2026-05-23 09:00:02] [INFO ] Invariant cache hit.
[2026-05-23 09:00:02] [INFO ] State equation strengthened by 55 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 293/302 variables, and 123 constraints, problems are : Problem set: 1 solved, 0 unsolved in 152 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/126 constraints, ReadFeed: 0/55 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:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-01 in 53561 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 204 rows 133 cols
[2026-05-23 09:00:02] [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 (2280 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10000 steps (956 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 09:00:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:00:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:00:02] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2026-05-23 09:00:02] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-23 09:00:02] [INFO ] [Real]Added 80 Read/Feed constraints in 21 ms returned sat
[2026-05-23 09:00:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:00:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:00:02] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2026-05-23 09:00:02] [INFO ] [Nat]Added 80 Read/Feed constraints in 20 ms returned sat
[2026-05-23 09:00:02] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 152 transitions) in 26 ms.
[2026-05-23 09:00:02] [INFO ] Added : 7 causal constraints over 2 iterations in 101 ms. Result :sat
Minimization took 151 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, 204/204 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 129 transition count 193
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 129 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 129 transition count 192
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 126 transition count 183
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 126 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 126 transition count 182
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 124 transition count 176
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 124 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 124 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 123 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 123 transition count 168
Applied a total of 23 rules in 35 ms. Remains 123 /133 variables (removed 10) and now considering 168/204 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 123/133 places, 168/204 transitions.
// Phase 1: matrix 168 rows 123 cols
[2026-05-23 09:00:03] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229900 resets) in 2122 ms. (471 steps per ms)
BEST_FIRST walk for 1000001 steps (95679 resets) in 812 ms. (1230 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 09:00:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:00:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 09:00:06] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-23 09:00:06] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-23 09:00:06] [INFO ] [Real]Added 49 Read/Feed constraints in 15 ms returned sat
[2026-05-23 09:00:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:00:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:00:06] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-23 09:00:06] [INFO ] [Nat]Added 49 Read/Feed constraints in 21 ms returned sat
[2026-05-23 09:00:06] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 14 ms.
[2026-05-23 09:00:06] [INFO ] Added : 8 causal constraints over 3 iterations in 87 ms. Result :sat
Minimization took 79 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 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 10 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 8 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2026-05-23 09:00:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:00:06] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-23 09:00:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:00:06] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-23 09:00:07] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:00:07] [INFO ] Redundant transitions in 4 ms returned []
Running 167 sub problems to find dead transitions.
[2026-05-23 09:00:07] [INFO ] Invariant cache hit.
[2026-05-23 09:00:07] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 11175 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41360ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 41361ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42407 ms. Remains : 123/123 places, 168/168 transitions.
RANDOM walk for 40000 steps (9084 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
[2026-05-23 09:00:48] [INFO ] Flatten gal took : 58 ms
[2026-05-23 09:00:48] [INFO ] Flatten gal took : 32 ms
[2026-05-23 09:00:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10527047073184468800.gal : 6 ms
[2026-05-23 09:00:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12761397779079006483.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/ReachabilityCardinality10527047073184468800.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12761397779079006483.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (3735 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12761397779079006483.prop.
BEST_FIRST walk for 40002 steps (3795 resets) in 211 ms. (188 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 528
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :528 after 924
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :924 after 5240
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5240 after 15459
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :15459 after 133417
Interrupted probabilistic random walk after 1618343 steps, run timeout after 3001 ms. (steps per millisecond=539 ) properties seen :1 out of 2
Probabilistic random walk after 1618343 steps, saw 681615 distinct states, run finished after 3001 ms. (steps per millisecond=539 ) properties seen :1
[2026-05-23 09:00:52] [INFO ] Invariant cache hit.
[2026-05-23 09:00:52] [INFO ] State equation strengthened by 49 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) 73/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 128/217 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 282/291 variables, and 120 constraints, problems are : Problem set: 1 solved, 0 unsolved in 147 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/123 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 155ms 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-d2m08-UpperBounds-10 in 50023 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-11
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:[2887]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2887]
// Phase 1: matrix 204 rows 133 cols
[2026-05-23 09:00:52] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2887]
RANDOM walk for 10000 steps (2300 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (956 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2887]
[2026-05-23 09:00:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:00:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 09:00:52] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2026-05-23 09:00:52] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-23 09:00:52] [INFO ] [Real]Added 80 Read/Feed constraints in 39 ms returned sat
[2026-05-23 09:00:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:00:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 09:00:52] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2026-05-23 09:00:52] [INFO ] [Nat]Added 80 Read/Feed constraints in 36 ms returned sat
[2026-05-23 09:00:52] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 152 transitions) in 20 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:00:53] [INFO ] Deduced a trap composed of 16 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 09:00:53] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 9 ms to minimize.
[2026-05-23 09:00:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2026-05-23 09:00:53] [INFO ] Added : 17 causal constraints over 5 iterations in 609 ms. Result :sat
Minimization took 152 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2887]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2887]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 130 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 130 transition count 201
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 200
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 127 transition count 191
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 127 transition count 191
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 190
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 125 transition count 184
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 125 transition count 184
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 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 124 transition count 176
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 124 transition count 176
Applied a total of 21 rules in 16 ms. Remains 124 /133 variables (removed 9) and now considering 176/204 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 124/133 places, 176/204 transitions.
// Phase 1: matrix 176 rows 124 cols
[2026-05-23 09:00:53] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2887]
RANDOM walk for 1000000 steps (229759 resets) in 1879 ms. (531 steps per ms)
BEST_FIRST walk for 1000001 steps (95333 resets) in 854 ms. (1169 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2887]
[2026-05-23 09:00:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:00:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:00:56] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-23 09:00:56] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-23 09:00:56] [INFO ] [Real]Added 57 Read/Feed constraints in 30 ms returned sat
[2026-05-23 09:00:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:00:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:00:56] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2026-05-23 09:00:56] [INFO ] [Nat]Added 57 Read/Feed constraints in 29 ms returned sat
[2026-05-23 09:00:56] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 126 transitions) in 15 ms.
[2026-05-23 09:00:56] [INFO ] Added : 14 causal constraints over 4 iterations in 105 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2887]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2887]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 124 /124 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 124/124 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2026-05-23 09:00:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:00:57] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-23 09:00:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:00:57] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-23 09:00:57] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:00:57] [INFO ] Redundant transitions in 3 ms returned []
Running 175 sub problems to find dead transitions.
[2026-05-23 09:00:57] [INFO ] Invariant cache hit.
[2026-05-23 09:00:57] [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/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/300 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 57/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:01:06] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:01:07] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 185 constraints, problems are : Problem set: 0 solved, 175 unsolved in 22509 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/300 variables, 124/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 57/185 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 175/360 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/300 variables, and 360 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52682ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 52684ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53549 ms. Remains : 124/124 places, 176/176 transitions.
[2026-05-23 09:01:50] [INFO ] Flatten gal took : 36 ms
[2026-05-23 09:01:50] [INFO ] Flatten gal took : 42 ms
[2026-05-23 09:01:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4474940520252125709.gal : 9 ms
[2026-05-23 09:01:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9989418963546770344.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/ReachabilityCardinality4474940520252125709.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9989418963546770344.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (9134 resets) in 385 ms. (103 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality9989418963546770344.prop.
BEST_FIRST walk for 40002 steps (3818 resets) in 180 ms. (221 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
BEST_FIRST walk for 40003 steps (3750 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
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 498
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :498 after 878
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :878 after 5354
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5354 after 17897
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :17897 after 156419
Interrupted probabilistic random walk after 1697686 steps, run timeout after 3001 ms. (steps per millisecond=565 ) properties seen :1 out of 2
Probabilistic random walk after 1697686 steps, saw 706264 distinct states, run finished after 3001 ms. (steps per millisecond=565 ) properties seen :1
[2026-05-23 09:01:53] [INFO ] Invariant cache hit.
[2026-05-23 09:01:53] [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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/151 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/223 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 53/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/238 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 11/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 300/300 variables, and 147 constraints, problems are : Problem set: 1 solved, 0 unsolved in 208 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, ReadFeed: 21/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 216ms 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:[2887]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-11 in 61727 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-13
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:[2887]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2887]
// Phase 1: matrix 204 rows 133 cols
[2026-05-23 09:01:54] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2887]
RANDOM walk for 10000 steps (2297 resets) in 37 ms. (263 steps per ms)
BEST_FIRST walk for 10000 steps (948 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2887]
[2026-05-23 09:01:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:01:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:01:54] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2026-05-23 09:01:54] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-23 09:01:54] [INFO ] [Real]Added 80 Read/Feed constraints in 30 ms returned sat
[2026-05-23 09:01:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:01:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:01:54] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2026-05-23 09:01:54] [INFO ] [Nat]Added 80 Read/Feed constraints in 33 ms returned sat
[2026-05-23 09:01:54] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 152 transitions) in 24 ms.
[2026-05-23 09:01:54] [INFO ] Added : 11 causal constraints over 3 iterations in 122 ms. Result :sat
Minimization took 179 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2887]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2887]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 130 transition count 194
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 130 transition count 194
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 128 transition count 192
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 128 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 128 transition count 191
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 126 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 126 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 126 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 125 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 125 transition count 177
Applied a total of 18 rules in 21 ms. Remains 125 /133 variables (removed 8) and now considering 177/204 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 125/133 places, 177/204 transitions.
// Phase 1: matrix 177 rows 125 cols
[2026-05-23 09:01:54] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2887]
RANDOM walk for 1000000 steps (229582 resets) in 2100 ms. (475 steps per ms)
BEST_FIRST walk for 1000001 steps (95574 resets) in 871 ms. (1146 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2887]
[2026-05-23 09:01:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:01:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 09:01:57] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-23 09:01:57] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-23 09:01:57] [INFO ] [Real]Added 57 Read/Feed constraints in 18 ms returned sat
[2026-05-23 09:01:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:01:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:01:58] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2026-05-23 09:01:58] [INFO ] [Nat]Added 57 Read/Feed constraints in 30 ms returned sat
[2026-05-23 09:01:58] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 127 transitions) in 18 ms.
[2026-05-23 09:01:58] [INFO ] Added : 16 causal constraints over 4 iterations in 117 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2887]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2887]
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 7 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 7 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 7 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2026-05-23 09:01:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:01:58] [INFO ] Implicit Places using invariants in 220 ms returned []
[2026-05-23 09:01:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:01:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-23 09:01:59] [INFO ] Implicit Places using invariants and state equation in 1154 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:01:59] [INFO ] Redundant transitions in 2 ms returned []
Running 176 sub problems to find dead transitions.
[2026-05-23 09:01:59] [INFO ] Invariant cache hit.
[2026-05-23 09:01:59] [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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:02:23] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 10 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/302 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/302 variables, and 185 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 1/1 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, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 177/302 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 57/185 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 176/361 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/361 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 361 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61588 ms. Remains : 125/125 places, 177/177 transitions.
[2026-05-23 09:03:00] [INFO ] Flatten gal took : 62 ms
RANDOM walk for 40000 steps (9213 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
[2026-05-23 09:03:00] [INFO ] Flatten gal took : 37 ms
[2026-05-23 09:03:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17506525200841703066.gal : 8 ms
[2026-05-23 09:03:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7978701773079390164.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/ReachabilityCardinality17506525200841703066.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7978701773079390164.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 40002 steps (3803 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3916 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality7978701773079390164.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
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 528
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :528 after 924
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :924 after 5354
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5354 after 17238
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :17238 after 148592
Interrupted probabilistic random walk after 1583525 steps, run timeout after 3001 ms. (steps per millisecond=527 ) properties seen :1 out of 2
Probabilistic random walk after 1583525 steps, saw 665615 distinct states, run finished after 3001 ms. (steps per millisecond=527 ) properties seen :1
[2026-05-23 09:03:03] [INFO ] Invariant cache hit.
[2026-05-23 09:03:03] [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 149 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 155ms 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:[2887]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-13 in 69455 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
// Phase 1: matrix 204 rows 133 cols
[2026-05-23 09:03:03] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2303 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (961 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2026-05-23 09:03:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:03:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 09:03:03] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2026-05-23 09:03:03] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-23 09:03:03] [INFO ] [Real]Added 80 Read/Feed constraints in 26 ms returned sat
[2026-05-23 09:03:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:03:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:03:03] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2026-05-23 09:03:03] [INFO ] [Nat]Added 80 Read/Feed constraints in 28 ms returned sat
[2026-05-23 09:03:03] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 152 transitions) in 24 ms.
[2026-05-23 09:03:03] [INFO ] Added : 11 causal constraints over 3 iterations in 181 ms. Result :sat
Minimization took 243 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 130 transition count 194
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 130 transition count 194
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 193
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 128 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 128 transition count 185
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 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 127 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 127 transition count 179
Applied a total of 14 rules in 18 ms. Remains 127 /133 variables (removed 6) and now considering 179/204 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 127/133 places, 179/204 transitions.
// Phase 1: matrix 179 rows 127 cols
[2026-05-23 09:03:04] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 1000000 steps (230196 resets) in 2334 ms. (428 steps per ms)
BEST_FIRST walk for 1000000 steps (95973 resets) in 872 ms. (1145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2026-05-23 09:03:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:03:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:03:07] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-23 09:03:07] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-23 09:03:07] [INFO ] [Real]Added 58 Read/Feed constraints in 15 ms returned sat
[2026-05-23 09:03:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:03:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:03:07] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-05-23 09:03:07] [INFO ] [Nat]Added 58 Read/Feed constraints in 30 ms returned sat
[2026-05-23 09:03:07] [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 09:03:08] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 12 ms to minimize.
[2026-05-23 09:03:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2026-05-23 09:03:08] [INFO ] Added : 11 causal constraints over 3 iterations in 325 ms. Result :sat
Minimization took 159 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
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 7 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 7 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 6 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2026-05-23 09:03:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:03:08] [INFO ] Implicit Places using invariants in 208 ms returned []
[2026-05-23 09:03:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:03:08] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-23 09:03:09] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:03:09] [INFO ] Redundant transitions in 1 ms returned []
Running 178 sub problems to find dead transitions.
[2026-05-23 09:03:09] [INFO ] Invariant cache hit.
[2026-05-23 09:03:09] [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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:03:18] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 188 constraints, problems are : Problem set: 0 solved, 178 unsolved in 19864 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 1/1 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, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 179/306 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 58/188 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 178/366 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 366 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49993ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 49994ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51464 ms. Remains : 127/127 places, 179/179 transitions.
[2026-05-23 09:03:59] [INFO ] Flatten gal took : 42 ms
RANDOM walk for 40000 steps (9214 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
[2026-05-23 09:03:59] [INFO ] Flatten gal took : 22 ms
[2026-05-23 09:03:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15538182344682082545.gal : 4 ms
[2026-05-23 09:03:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9318404591073459115.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/ReachabilityCardinality15538182344682082545.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9318404591073459115.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 (3845 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality9318404591073459115.prop.
BEST_FIRST walk for 40003 steps (3930 resets) in 87 ms. (454 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 498
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :498 after 854
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :854 after 4622
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4622 after 13152
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13152 after 111376
Interrupted probabilistic random walk after 1590231 steps, run timeout after 3001 ms. (steps per millisecond=529 ) properties seen :1 out of 2
Probabilistic random walk after 1590231 steps, saw 666516 distinct states, run finished after 3001 ms. (steps per millisecond=529 ) properties seen :1
[2026-05-23 09:04:03] [INFO ] Invariant cache hit.
[2026-05-23 09:04:03] [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 129 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 144ms 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:[8]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-14 in 59732 ms.
[2026-05-23 09:04:03] [INFO ] Flatten gal took : 14 ms
[2026-05-23 09:04:03] [INFO ] Applying decomposition
[2026-05-23 09:04:03] [INFO ] Flatten gal took : 15 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/graph8980011127511475410.txt' '-o' '/tmp/graph8980011127511475410.bin' '-w' '/tmp/graph8980011127511475410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8980011127511475410.bin' '-l' '-1' '-v' '-w' '/tmp/graph8980011127511475410.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:04:03] [INFO ] Decomposing Gal with order
[2026-05-23 09:04:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:04:03] [INFO ] Removed a total of 255 redundant transitions.
[2026-05-23 09:04:03] [INFO ] Flatten gal took : 127 ms
[2026-05-23 09:04:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 31 ms.
[2026-05-23 09:04:03] [INFO ] Time to serialize gal into /tmp/UpperBounds16701742669987150505.gal : 12 ms
[2026-05-23 09:04:03] [INFO ] Time to serialize properties into /tmp/UpperBounds1892129445155680126.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/UpperBounds16701742669987150505.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1892129445155680126.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/UpperBounds1892129445155680126.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,5.88193e+07,26.2807,469932,4826,1754,426118,23109,570,3.62554e+06,131,341060,0
Total reachable state count : 58819284
Verifying 5 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-01 :0 <= i5.u10.p270 <= 1
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m08-UpperBounds-01,0,27.0781,469932,1,0,426118,23109,710,3.62554e+06,154,341060,1946
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-10 :0 <= i3.u2.p323 <= 1
FORMULA DBSingleClientW-PT-d2m08-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-d2m08-UpperBounds-10,0,27.0917,469932,1,0,426118,23109,741,3.62554e+06,161,341060,2786
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-11 :0 <= i4.u8.l3086 <= 1
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-11 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-d2m08-UpperBounds-11,0,27.096,469932,1,0,426118,23109,759,3.62554e+06,166,341060,3021
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-13 :0 <= i3.u7.l1622 <= 1
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-13 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-d2m08-UpperBounds-13,0,27.1004,469932,1,0,426118,23109,784,3.62554e+06,177,341060,3722
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-14 :0 <= i3.u2.l2593 <= 1
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m08-UpperBounds-14,0,27.1139,469932,1,0,426118,23109,808,3.62554e+06,182,341060,4582
Total runtime 484717 ms.
BK_STOP 1779527071043
--------------------
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-d2m08"
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-d2m08, 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-177946996300029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m08.tgz
mv DBSingleClientW-PT-d2m08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;