About the Execution of 2025-gold for FileSystem-PT-N02I15B15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 716.836 | 182187.00 | 215152.00 | 769.90 | 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 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.r351-smll-178021502100054.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 FileSystem-PT-N02I15B15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-smll-178021502100054
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.5K May 27 10:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 27 10:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 10:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 27 10:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 4.5K May 27 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 27 10:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 27 10:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 524K Jun 10 11:57 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 FileSystem-PT-N02I15B15-UpperBounds-00
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-01
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-02
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-03
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-04
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-05
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-06
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-07
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-08
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-09
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-10
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-11
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-12
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-13
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-14
FORMULA_NAME FileSystem-PT-N02I15B15-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1781614954411
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N02I15B15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-16 13:02:37] [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-06-16 13:02:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 13:02:37] [INFO ] Load time of PNML (sax parser for PT used): 333 ms
[2026-06-16 13:02:37] [INFO ] Transformed 1216 places.
[2026-06-16 13:02:37] [INFO ] Transformed 1155 transitions.
[2026-06-16 13:02:37] [INFO ] Parsed PT model containing 1216 places and 1155 transitions and 4125 arcs in 558 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Reduce places removed 15 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1155 rows 1201 cols
[2026-06-16 13:02:38] [INFO ] Computed 61 invariants in 218 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (131 resets) in 84 ms. (117 steps per ms)
FORMULA FileSystem-PT-N02I15B15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150013 steps (439 resets) in 500 ms. (299 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-06-16 13:02:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:02:39] [INFO ] [Real]Absence check using 46 positive place invariants in 106 ms returned sat
[2026-06-16 13:02:39] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 26 ms returned sat
[2026-06-16 13:02:40] [INFO ] [Real]Absence check using state equation in 1088 ms returned sat
[2026-06-16 13:02:41] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-16 13:02:41] [INFO ] [Real]Added 225 Read/Feed constraints in 182 ms returned sat
[2026-06-16 13:02:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:02:41] [INFO ] [Nat]Absence check using 46 positive place invariants in 100 ms returned sat
[2026-06-16 13:02:41] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 26 ms returned sat
[2026-06-16 13:02:43] [INFO ] [Nat]Absence check using state equation in 1414 ms returned sat
[2026-06-16 13:02:43] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:02:44] [INFO ] [Nat]Added 225 Read/Feed constraints in 1027 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:02:44] [INFO ] [Real]Absence check using 46 positive place invariants in 88 ms returned sat
[2026-06-16 13:02:44] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 23 ms returned sat
[2026-06-16 13:02:46] [INFO ] [Real]Absence check using state equation in 1396 ms returned sat
[2026-06-16 13:02:46] [INFO ] [Real]Added 225 Read/Feed constraints in 323 ms returned sat
[2026-06-16 13:02:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:02:47] [INFO ] [Nat]Absence check using 46 positive place invariants in 80 ms returned sat
[2026-06-16 13:02:47] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 24 ms returned sat
[2026-06-16 13:02:48] [INFO ] [Nat]Absence check using state equation in 1287 ms returned sat
[2026-06-16 13:02:48] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:02:49] [INFO ] [Nat]Added 225 Read/Feed constraints in 687 ms returned sat
[2026-06-16 13:02:49] [INFO ] Computed and/alt/rep : 915/930/915 causal constraints (skipped 225 transitions) in 91 ms.
[2026-06-16 13:02:51] [INFO ] Added : 75 causal constraints over 15 iterations in 2534 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:02:52] [INFO ] [Real]Absence check using 46 positive place invariants in 66 ms returned sat
[2026-06-16 13:02:52] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 21 ms returned sat
[2026-06-16 13:02:53] [INFO ] [Real]Absence check using state equation in 989 ms returned sat
[2026-06-16 13:02:53] [INFO ] [Real]Added 225 Read/Feed constraints in 123 ms returned sat
[2026-06-16 13:02:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:02:53] [INFO ] [Nat]Absence check using 46 positive place invariants in 84 ms returned sat
[2026-06-16 13:02:53] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 26 ms returned sat
[2026-06-16 13:02:54] [INFO ] [Nat]Absence check using state equation in 1082 ms returned sat
[2026-06-16 13:02:55] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:02:55] [INFO ] [Nat]Added 225 Read/Feed constraints in 1035 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:02:56] [INFO ] [Real]Absence check using 46 positive place invariants in 89 ms returned sat
[2026-06-16 13:02:56] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 23 ms returned sat
[2026-06-16 13:02:57] [INFO ] [Real]Absence check using state equation in 1151 ms returned sat
[2026-06-16 13:02:57] [INFO ] [Real]Added 225 Read/Feed constraints in 398 ms returned sat
[2026-06-16 13:02:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:02:58] [INFO ] [Nat]Absence check using 46 positive place invariants in 56 ms returned sat
[2026-06-16 13:02:58] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 12 ms returned sat
[2026-06-16 13:02:59] [INFO ] [Nat]Absence check using state equation in 932 ms returned sat
[2026-06-16 13:02:59] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:03:00] [INFO ] [Nat]Added 225 Read/Feed constraints in 868 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:00] [INFO ] [Real]Absence check using 46 positive place invariants in 90 ms returned sat
[2026-06-16 13:03:00] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 24 ms returned sat
[2026-06-16 13:03:01] [INFO ] [Real]Absence check using state equation in 1110 ms returned sat
[2026-06-16 13:03:01] [INFO ] [Real]Added 225 Read/Feed constraints in 168 ms returned sat
[2026-06-16 13:03:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:02] [INFO ] [Nat]Absence check using 46 positive place invariants in 83 ms returned sat
[2026-06-16 13:03:02] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 22 ms returned sat
[2026-06-16 13:03:03] [INFO ] [Nat]Absence check using state equation in 1246 ms returned sat
[2026-06-16 13:03:04] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:03:04] [INFO ] [Nat]Added 225 Read/Feed constraints in 1022 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:04] [INFO ] [Real]Absence check using 46 positive place invariants in 58 ms returned sat
[2026-06-16 13:03:04] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 18 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:05] [INFO ] [Real]Absence check using 46 positive place invariants in 79 ms returned sat
[2026-06-16 13:03:05] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 23 ms returned sat
[2026-06-16 13:03:06] [INFO ] [Real]Absence check using state equation in 1085 ms returned sat
[2026-06-16 13:03:06] [INFO ] [Real]Added 225 Read/Feed constraints in 229 ms returned sat
[2026-06-16 13:03:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:07] [INFO ] [Nat]Absence check using 46 positive place invariants in 82 ms returned sat
[2026-06-16 13:03:07] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 24 ms returned sat
[2026-06-16 13:03:08] [INFO ] [Nat]Absence check using state equation in 1124 ms returned sat
[2026-06-16 13:03:08] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:03:09] [INFO ] [Nat]Added 225 Read/Feed constraints in 1030 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:09] [INFO ] [Real]Absence check using 46 positive place invariants in 91 ms returned sat
[2026-06-16 13:03:09] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 23 ms returned sat
[2026-06-16 13:03:10] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2026-06-16 13:03:10] [INFO ] [Real]Added 225 Read/Feed constraints in 152 ms returned sat
[2026-06-16 13:03:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:11] [INFO ] [Nat]Absence check using 46 positive place invariants in 58 ms returned sat
[2026-06-16 13:03:11] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 13 ms returned sat
[2026-06-16 13:03:12] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2026-06-16 13:03:12] [INFO ] [Nat]Added 225 Read/Feed constraints in 270 ms returned sat
[2026-06-16 13:03:12] [INFO ] Computed and/alt/rep : 915/930/915 causal constraints (skipped 225 transitions) in 107 ms.
[2026-06-16 13:03:15] [INFO ] Added : 88 causal constraints over 18 iterations in 2674 ms. Result :sat
Minimization took 900 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:16] [INFO ] [Real]Absence check using 46 positive place invariants in 52 ms returned sat
[2026-06-16 13:03:16] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 18 ms returned sat
[2026-06-16 13:03:17] [INFO ] [Real]Absence check using state equation in 970 ms returned sat
[2026-06-16 13:03:17] [INFO ] [Real]Added 225 Read/Feed constraints in 288 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:17] [INFO ] [Real]Absence check using 46 positive place invariants in 51 ms returned sat
[2026-06-16 13:03:17] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 15 ms returned sat
[2026-06-16 13:03:19] [INFO ] [Real]Absence check using state equation in 1081 ms returned sat
[2026-06-16 13:03:19] [INFO ] [Real]Added 225 Read/Feed constraints in 157 ms returned sat
[2026-06-16 13:03:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:19] [INFO ] [Nat]Absence check using 46 positive place invariants in 65 ms returned sat
[2026-06-16 13:03:19] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 23 ms returned sat
[2026-06-16 13:03:20] [INFO ] [Nat]Absence check using state equation in 961 ms returned sat
[2026-06-16 13:03:21] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:03:21] [INFO ] [Nat]Added 225 Read/Feed constraints in 1037 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:21] [INFO ] [Real]Absence check using 46 positive place invariants in 52 ms returned sat
[2026-06-16 13:03:21] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 16 ms returned sat
[2026-06-16 13:03:22] [INFO ] [Real]Absence check using state equation in 940 ms returned sat
[2026-06-16 13:03:23] [INFO ] [Real]Added 225 Read/Feed constraints in 223 ms returned sat
[2026-06-16 13:03:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:23] [INFO ] [Nat]Absence check using 46 positive place invariants in 77 ms returned sat
[2026-06-16 13:03:23] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 22 ms returned sat
[2026-06-16 13:03:24] [INFO ] [Nat]Absence check using state equation in 1146 ms returned sat
[2026-06-16 13:03:25] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:03:25] [INFO ] [Nat]Added 225 Read/Feed constraints in 1040 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:26] [INFO ] [Real]Absence check using 46 positive place invariants in 86 ms returned sat
[2026-06-16 13:03:26] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 31 ms returned sat
[2026-06-16 13:03:27] [INFO ] [Real]Absence check using state equation in 1173 ms returned sat
[2026-06-16 13:03:27] [INFO ] [Real]Added 225 Read/Feed constraints in 106 ms returned sat
[2026-06-16 13:03:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:27] [INFO ] [Nat]Absence check using 46 positive place invariants in 83 ms returned sat
[2026-06-16 13:03:28] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 23 ms returned sat
[2026-06-16 13:03:29] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2026-06-16 13:03:29] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:03:29] [INFO ] [Nat]Added 225 Read/Feed constraints in 604 ms returned sat
[2026-06-16 13:03:29] [INFO ] Computed and/alt/rep : 915/930/915 causal constraints (skipped 225 transitions) in 73 ms.
[2026-06-16 13:03:32] [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 11
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-06-16 13:03:33] [INFO ] [Real]Absence check using 46 positive place invariants in 88 ms returned sat
[2026-06-16 13:03:33] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 22 ms returned sat
[2026-06-16 13:03:34] [INFO ] [Real]Absence check using state equation in 1167 ms returned sat
[2026-06-16 13:03:34] [INFO ] [Real]Added 225 Read/Feed constraints in 258 ms returned sat
[2026-06-16 13:03:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:35] [INFO ] [Nat]Absence check using 46 positive place invariants in 84 ms returned sat
[2026-06-16 13:03:35] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 19 ms returned sat
[2026-06-16 13:03:36] [INFO ] [Nat]Absence check using state equation in 965 ms returned sat
[2026-06-16 13:03:36] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:03:36] [INFO ] [Nat]Added 225 Read/Feed constraints in 585 ms returned sat
[2026-06-16 13:03:36] [INFO ] Computed and/alt/rep : 915/930/915 causal constraints (skipped 225 transitions) in 109 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:40] [INFO ] [Real]Absence check using 46 positive place invariants in 90 ms returned sat
[2026-06-16 13:03:40] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 25 ms returned sat
[2026-06-16 13:03:41] [INFO ] [Real]Absence check using state equation in 1235 ms returned sat
[2026-06-16 13:03:41] [INFO ] [Real]Added 225 Read/Feed constraints in 256 ms returned sat
[2026-06-16 13:03:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:42] [INFO ] [Nat]Absence check using 46 positive place invariants in 84 ms returned sat
[2026-06-16 13:03:42] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 22 ms returned sat
[2026-06-16 13:03:43] [INFO ] [Nat]Absence check using state equation in 1324 ms returned sat
[2026-06-16 13:03:44] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:03:44] [INFO ] [Nat]Added 225 Read/Feed constraints in 613 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:44] [INFO ] [Real]Absence check using 46 positive place invariants in 71 ms returned sat
[2026-06-16 13:03:44] [INFO ] [Real]Absence check using 46 positive and 15 generalized place invariants in 20 ms returned sat
[2026-06-16 13:03:45] [INFO ] [Real]Absence check using state equation in 1070 ms returned sat
[2026-06-16 13:03:45] [INFO ] [Real]Added 225 Read/Feed constraints in 121 ms returned sat
[2026-06-16 13:03:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:03:46] [INFO ] [Nat]Absence check using 46 positive place invariants in 57 ms returned sat
[2026-06-16 13:03:46] [INFO ] [Nat]Absence check using 46 positive and 15 generalized place invariants in 16 ms returned sat
[2026-06-16 13:03:47] [INFO ] [Nat]Absence check using state equation in 952 ms returned sat
[2026-06-16 13:03:47] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:03:48] [INFO ] [Nat]Added 225 Read/Feed constraints in 1029 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1]
FORMULA FileSystem-PT-N02I15B15-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 1201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1201/1201 places, 1155/1155 transitions.
Graph (complete) has 2760 edges and 1201 vertex of which 980 are kept as prefixes of interest. Removing 221 places using SCC suffix rule.7 ms
Discarding 221 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 980 transition count 1140
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 965 transition count 1140
Discarding 206 places :
Symmetric choice reduction at 2 with 206 rule applications. Total rules 237 place count 759 transition count 934
Iterating global reduction 2 with 206 rules applied. Total rules applied 443 place count 759 transition count 934
Performed 235 Post agglomeration using F-continuation condition.Transition count delta: 235
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 913 place count 524 transition count 699
Free-agglomeration rule (complex) applied 221 times.
Iterating global reduction 2 with 221 rules applied. Total rules applied 1134 place count 524 transition count 478
Reduce places removed 229 places and 0 transitions.
Iterating post reduction 2 with 229 rules applied. Total rules applied 1363 place count 295 transition count 478
Applied a total of 1363 rules in 403 ms. Remains 295 /1201 variables (removed 906) and now considering 478/1155 (removed 677) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 295/1201 places, 478/1155 transitions.
// Phase 1: matrix 478 rows 295 cols
[2026-06-16 13:03:48] [INFO ] Computed 24 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (32258 resets) in 3035 ms. (329 steps per ms)
BEST_FIRST walk for 11000010 steps (55121 resets) in 10187 ms. (1079 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-06-16 13:04:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:01] [INFO ] [Real]Absence check using 24 positive place invariants in 17 ms returned sat
[2026-06-16 13:04:02] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2026-06-16 13:04:02] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-16 13:04:02] [INFO ] [Real]Added 225 Read/Feed constraints in 131 ms returned sat
[2026-06-16 13:04:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:02] [INFO ] [Nat]Absence check using 24 positive place invariants in 18 ms returned sat
[2026-06-16 13:04:02] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2026-06-16 13:04:03] [INFO ] [Nat]Added 225 Read/Feed constraints in 453 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:03] [INFO ] [Real]Absence check using 24 positive place invariants in 22 ms returned sat
[2026-06-16 13:04:03] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2026-06-16 13:04:03] [INFO ] [Real]Added 225 Read/Feed constraints in 238 ms returned sat
[2026-06-16 13:04:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:04] [INFO ] [Nat]Absence check using 24 positive place invariants in 24 ms returned sat
[2026-06-16 13:04:04] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2026-06-16 13:04:04] [INFO ] [Nat]Added 225 Read/Feed constraints in 212 ms returned sat
[2026-06-16 13:04:04] [INFO ] Computed and/alt/rep : 238/253/238 causal constraints (skipped 225 transitions) in 42 ms.
[2026-06-16 13:04:04] [INFO ] Added : 16 causal constraints over 4 iterations in 199 ms. Result :sat
Minimization took 366 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:05] [INFO ] [Real]Absence check using 24 positive place invariants in 22 ms returned sat
[2026-06-16 13:04:05] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2026-06-16 13:04:05] [INFO ] [Real]Added 225 Read/Feed constraints in 54 ms returned sat
[2026-06-16 13:04:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:05] [INFO ] [Nat]Absence check using 24 positive place invariants in 16 ms returned sat
[2026-06-16 13:04:05] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2026-06-16 13:04:06] [INFO ] [Nat]Added 225 Read/Feed constraints in 290 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:06] [INFO ] [Real]Absence check using 24 positive place invariants in 18 ms returned sat
[2026-06-16 13:04:06] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2026-06-16 13:04:06] [INFO ] [Real]Added 225 Read/Feed constraints in 82 ms returned sat
[2026-06-16 13:04:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:06] [INFO ] [Nat]Absence check using 24 positive place invariants in 22 ms returned sat
[2026-06-16 13:04:06] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2026-06-16 13:04:07] [INFO ] [Nat]Added 225 Read/Feed constraints in 512 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:07] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2026-06-16 13:04:07] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2026-06-16 13:04:07] [INFO ] [Real]Added 225 Read/Feed constraints in 51 ms returned sat
[2026-06-16 13:04:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:07] [INFO ] [Nat]Absence check using 24 positive place invariants in 13 ms returned sat
[2026-06-16 13:04:08] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2026-06-16 13:04:09] [INFO ] [Nat]Added 225 Read/Feed constraints in 1013 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:09] [INFO ] [Real]Absence check using 24 positive place invariants in 22 ms returned sat
[2026-06-16 13:04:09] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2026-06-16 13:04:09] [INFO ] [Real]Added 225 Read/Feed constraints in 70 ms returned sat
[2026-06-16 13:04:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:09] [INFO ] [Nat]Absence check using 24 positive place invariants in 22 ms returned sat
[2026-06-16 13:04:10] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2026-06-16 13:04:10] [INFO ] [Nat]Added 225 Read/Feed constraints in 79 ms returned sat
[2026-06-16 13:04:10] [INFO ] Computed and/alt/rep : 238/253/238 causal constraints (skipped 225 transitions) in 65 ms.
[2026-06-16 13:04:10] [INFO ] Added : 16 causal constraints over 4 iterations in 342 ms. Result :sat
Minimization took 605 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:11] [INFO ] [Real]Absence check using 24 positive place invariants in 17 ms returned sat
[2026-06-16 13:04:11] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2026-06-16 13:04:11] [INFO ] [Real]Added 225 Read/Feed constraints in 58 ms returned sat
[2026-06-16 13:04:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:11] [INFO ] [Nat]Absence check using 24 positive place invariants in 17 ms returned sat
[2026-06-16 13:04:12] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2026-06-16 13:04:12] [INFO ] [Nat]Added 225 Read/Feed constraints in 388 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:12] [INFO ] [Real]Absence check using 24 positive place invariants in 22 ms returned sat
[2026-06-16 13:04:12] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2026-06-16 13:04:13] [INFO ] [Real]Added 225 Read/Feed constraints in 207 ms returned sat
[2026-06-16 13:04:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:13] [INFO ] [Nat]Absence check using 24 positive place invariants in 24 ms returned sat
[2026-06-16 13:04:13] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2026-06-16 13:04:13] [INFO ] [Nat]Added 225 Read/Feed constraints in 372 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:13] [INFO ] [Real]Absence check using 24 positive place invariants in 21 ms returned sat
[2026-06-16 13:04:14] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2026-06-16 13:04:14] [INFO ] [Real]Added 225 Read/Feed constraints in 62 ms returned sat
[2026-06-16 13:04:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:14] [INFO ] [Nat]Absence check using 24 positive place invariants in 17 ms returned sat
[2026-06-16 13:04:14] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2026-06-16 13:04:14] [INFO ] [Nat]Added 225 Read/Feed constraints in 103 ms returned sat
[2026-06-16 13:04:14] [INFO ] Computed and/alt/rep : 238/253/238 causal constraints (skipped 225 transitions) in 41 ms.
[2026-06-16 13:04:14] [INFO ] Added : 16 causal constraints over 4 iterations in 212 ms. Result :sat
Minimization took 359 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:15] [INFO ] [Real]Absence check using 24 positive place invariants in 14 ms returned sat
[2026-06-16 13:04:15] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2026-06-16 13:04:15] [INFO ] [Real]Added 225 Read/Feed constraints in 73 ms returned sat
[2026-06-16 13:04:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:15] [INFO ] [Nat]Absence check using 24 positive place invariants in 13 ms returned sat
[2026-06-16 13:04:15] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2026-06-16 13:04:16] [INFO ] [Nat]Added 225 Read/Feed constraints in 153 ms returned sat
[2026-06-16 13:04:16] [INFO ] Computed and/alt/rep : 238/253/238 causal constraints (skipped 225 transitions) in 55 ms.
[2026-06-16 13:04:16] [INFO ] Added : 17 causal constraints over 4 iterations in 302 ms. Result :sat
Minimization took 589 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:17] [INFO ] [Real]Absence check using 24 positive place invariants in 14 ms returned sat
[2026-06-16 13:04:17] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2026-06-16 13:04:17] [INFO ] [Real]Added 225 Read/Feed constraints in 44 ms returned sat
[2026-06-16 13:04:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:17] [INFO ] [Nat]Absence check using 24 positive place invariants in 20 ms returned sat
[2026-06-16 13:04:17] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2026-06-16 13:04:18] [INFO ] [Nat]Added 225 Read/Feed constraints in 511 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0]
FORMULA FileSystem-PT-N02I15B15-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N02I15B15-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 478/478 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 290 transition count 473
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 290 transition count 469
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 21 place count 283 transition count 469
Applied a total of 21 rules in 294 ms. Remains 283 /295 variables (removed 12) and now considering 469/478 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 283/295 places, 469/478 transitions.
// Phase 1: matrix 469 rows 283 cols
[2026-06-16 13:04:18] [INFO ] Computed 21 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (32258 resets) in 2411 ms. (414 steps per ms)
BEST_FIRST walk for 4000003 steps (20049 resets) in 3054 ms. (1309 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-06-16 13:04:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:24] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2026-06-16 13:04:24] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2026-06-16 13:04:24] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-16 13:04:24] [INFO ] [Real]Added 225 Read/Feed constraints in 76 ms returned sat
[2026-06-16 13:04:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2026-06-16 13:04:25] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2026-06-16 13:04:25] [INFO ] [Nat]Added 225 Read/Feed constraints in 156 ms returned sat
[2026-06-16 13:04:25] [INFO ] Computed and/alt/rep : 229/244/229 causal constraints (skipped 225 transitions) in 45 ms.
[2026-06-16 13:04:25] [INFO ] Added : 16 causal constraints over 4 iterations in 271 ms. Result :sat
Minimization took 917 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:26] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2026-06-16 13:04:26] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2026-06-16 13:04:26] [INFO ] [Real]Added 225 Read/Feed constraints in 36 ms returned sat
[2026-06-16 13:04:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2026-06-16 13:04:27] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2026-06-16 13:04:27] [INFO ] [Nat]Added 225 Read/Feed constraints in 58 ms returned sat
[2026-06-16 13:04:27] [INFO ] Computed and/alt/rep : 229/244/229 causal constraints (skipped 225 transitions) in 45 ms.
[2026-06-16 13:04:27] [INFO ] Added : 16 causal constraints over 4 iterations in 284 ms. Result :sat
Minimization took 788 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:28] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2026-06-16 13:04:28] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2026-06-16 13:04:28] [INFO ] [Real]Added 225 Read/Feed constraints in 54 ms returned sat
[2026-06-16 13:04:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:28] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2026-06-16 13:04:28] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2026-06-16 13:04:29] [INFO ] [Nat]Added 225 Read/Feed constraints in 98 ms returned sat
[2026-06-16 13:04:29] [INFO ] Computed and/alt/rep : 229/244/229 causal constraints (skipped 225 transitions) in 54 ms.
[2026-06-16 13:04:29] [INFO ] Added : 16 causal constraints over 4 iterations in 303 ms. Result :sat
Minimization took 868 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:30] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2026-06-16 13:04:30] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2026-06-16 13:04:30] [INFO ] [Real]Added 225 Read/Feed constraints in 42 ms returned sat
[2026-06-16 13:04:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:04:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2026-06-16 13:04:30] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2026-06-16 13:04:30] [INFO ] [Nat]Added 225 Read/Feed constraints in 120 ms returned sat
[2026-06-16 13:04:30] [INFO ] Computed and/alt/rep : 229/244/229 causal constraints (skipped 225 transitions) in 37 ms.
[2026-06-16 13:04:31] [INFO ] Added : 16 causal constraints over 4 iterations in 251 ms. Result :sat
Minimization took 896 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 469/469 transitions.
Applied a total of 0 rules in 20 ms. Remains 283 /283 variables (removed 0) and now considering 469/469 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 283/283 places, 469/469 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 469/469 transitions.
Applied a total of 0 rules in 20 ms. Remains 283 /283 variables (removed 0) and now considering 469/469 (removed 0) transitions.
[2026-06-16 13:04:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:04:33] [INFO ] Implicit Places using invariants in 710 ms returned []
[2026-06-16 13:04:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:04:33] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-16 13:04:36] [INFO ] Implicit Places using invariants and state equation in 3077 ms returned []
Implicit Place search using SMT with State Equation took 3793 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-06-16 13:04:36] [INFO ] Redundant transitions in 38 ms returned []
Running 454 sub problems to find dead transitions.
[2026-06-16 13:04:36] [INFO ] Invariant cache hit.
[2026-06-16 13:04:36] [INFO ] State equation strengthened by 225 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (OVERLAPS) 16/279 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:49] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:50] [INFO ] Deduced a trap composed of 80 places in 233 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:50] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:50] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:50] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:50] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:50] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:50] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:50] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:50] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:50] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:50] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:51] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:51] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:51] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:51] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 5 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 16/37 constraints. Problems are: Problem set: 435 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:53] [INFO ] Deduced a trap composed of 2 places in 187 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:53] [INFO ] Deduced a trap composed of 32 places in 292 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:53] [INFO ] Deduced a trap composed of 2 places in 283 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:53] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:54] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:54] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:54] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:54] [INFO ] Deduced a trap composed of 32 places in 284 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 8/45 constraints. Problems are: Problem set: 435 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:55] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:55] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:56] [INFO ] Deduced a trap composed of 32 places in 297 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:56] [INFO ] Deduced a trap composed of 34 places in 299 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:56] [INFO ] Deduced a trap composed of 32 places in 294 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:57] [INFO ] Deduced a trap composed of 32 places in 296 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:57] [INFO ] Deduced a trap composed of 2 places in 297 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:57] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:57] [INFO ] Deduced a trap composed of 34 places in 274 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:58] [INFO ] Deduced a trap composed of 32 places in 289 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:58] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:58] [INFO ] Deduced a trap composed of 2 places in 298 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:59] [INFO ] Deduced a trap composed of 33 places in 310 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:59] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 14/59 constraints. Problems are: Problem set: 435 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:04:59] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:00] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:00] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:00] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:00] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:01] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 6/65 constraints. Problems are: Problem set: 435 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:01] [INFO ] Deduced a trap composed of 33 places in 265 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:02] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:02] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:02] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:02] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 5/70 constraints. Problems are: Problem set: 435 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:03] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:03] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:04] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:04] [INFO ] Deduced a trap composed of 35 places in 264 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:04] [INFO ] Deduced a trap composed of 36 places in 271 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 5/75 constraints. Problems are: Problem set: 435 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:05] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:05] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:05] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 3/78 constraints. Problems are: Problem set: 435 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:06] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 16 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 1/79 constraints. Problems are: Problem set: 435 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 279/752 variables, and 79 constraints, problems are : Problem set: 435 solved, 19 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/283 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 435 solved, 19 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 4/4 constraints. Problems are: Problem set: 435 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 435 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 241/279 variables, 17/21 constraints. Problems are: Problem set: 435 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 58/79 constraints. Problems are: Problem set: 435 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:07] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:07] [INFO ] Deduced a trap composed of 33 places in 278 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:07] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:08] [INFO ] Deduced a trap composed of 36 places in 292 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:08] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:08] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:08] [INFO ] Deduced a trap composed of 34 places in 257 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:09] [INFO ] Deduced a trap composed of 33 places in 280 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:09] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:09] [INFO ] Deduced a trap composed of 33 places in 268 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:10] [INFO ] Deduced a trap composed of 34 places in 277 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:10] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:10] [INFO ] Deduced a trap composed of 34 places in 285 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 13/92 constraints. Problems are: Problem set: 435 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:11] [INFO ] Deduced a trap composed of 34 places in 290 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:11] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:11] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:11] [INFO ] Deduced a trap composed of 37 places in 255 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:12] [INFO ] Deduced a trap composed of 34 places in 261 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:12] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:12] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:12] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:13] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:13] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:13] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:14] [INFO ] Deduced a trap composed of 37 places in 274 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:14] [INFO ] Deduced a trap composed of 35 places in 279 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:14] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:14] [INFO ] Deduced a trap composed of 41 places in 278 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:15] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:15] [INFO ] Deduced a trap composed of 39 places in 285 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 17/109 constraints. Problems are: Problem set: 435 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:16] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:16] [INFO ] Deduced a trap composed of 32 places in 284 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:16] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:16] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:17] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:17] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:17] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:17] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:18] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:18] [INFO ] Deduced a trap composed of 34 places in 250 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:18] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:19] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:19] [INFO ] Deduced a trap composed of 33 places in 278 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:19] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:19] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:20] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:20] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:20] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:20] [INFO ] Deduced a trap composed of 34 places in 283 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:21] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 20/129 constraints. Problems are: Problem set: 435 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:21] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:21] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:21] [INFO ] Deduced a trap composed of 32 places in 285 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:21] [INFO ] Deduced a trap composed of 33 places in 237 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:22] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:22] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:22] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:22] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 8/137 constraints. Problems are: Problem set: 435 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/137 constraints. Problems are: Problem set: 435 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 469/748 variables, 279/416 constraints. Problems are: Problem set: 435 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 225/641 constraints. Problems are: Problem set: 435 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/748 variables, 11/652 constraints. Problems are: Problem set: 435 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/748 variables, 0/652 constraints. Problems are: Problem set: 435 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 4/752 variables, 4/656 constraints. Problems are: Problem set: 435 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/752 variables, 8/664 constraints. Problems are: Problem set: 435 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/752 variables, 0/664 constraints. Problems are: Problem set: 435 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 0/752 variables, 0/664 constraints. Problems are: Problem set: 435 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 752/752 variables, and 664 constraints, problems are : Problem set: 435 solved, 19 unsolved in 29939 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 283/283 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 19/454 constraints, Known Traps: 116/116 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60236ms problems are : Problem set: 435 solved, 19 unsolved
Search for dead transitions found 435 dead transitions in 60256ms
Found 435 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 435 transitions
Dead transitions reduction (with SMT) removed 435 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 283/283 places, 34/469 transitions.
Graph (complete) has 110 edges and 283 vertex of which 8 are kept as prefixes of interest. Removing 275 places using SCC suffix rule.0 ms
Discarding 275 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Reduce places removed 4 places and 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 4 transition count 0
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 5 rules in 2 ms. Remains 4 /283 variables (removed 279) and now considering 0/34 (removed 34) transitions.
[2026-06-16 13:05:36] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:05:36] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-06-16 13:05:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:05:36] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 4/283 places, 0/469 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64178 ms. Remains : 4/283 places, 0/469 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
FORMULA FileSystem-PT-N02I15B15-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 179320 ms.
BK_STOP 1781615136598
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FileSystem-PT-N02I15B15"
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 FileSystem-PT-N02I15B15, 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 r351-smll-178021502100054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FileSystem-PT-N02I15B15.tgz
mv FileSystem-PT-N02I15B15 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 ;
