Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r083-tall-174860079700062.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is DoubleExponent-PT-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079700062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 169K May 29 14:32 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 DoubleExponent-PT-010-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748731009148

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 22:36:50] [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]
[2025-05-31 22:36:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:36:50] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2025-05-31 22:36:50] [INFO ] Transformed 534 places.
[2025-05-31 22:36:50] [INFO ] Transformed 498 transitions.
[2025-05-31 22:36:50] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
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 498 rows 534 cols
[2025-05-31 22:36:50] [INFO ] Computed 54 invariants in 66 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, 3, 3, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 2, +inf]
RANDOM walk for 10000 steps (315 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 160005 steps (4537 resets) in 229 ms. (695 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 3, 3, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 2, +inf]
[2025-05-31 22:36:51] [INFO ] Invariant cache hit.
[2025-05-31 22:36:51] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-05-31 22:36:51] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2025-05-31 22:36:51] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2025-05-31 22:36:51] [INFO ] Deduced a trap composed of 206 places in 438 ms of which 163 ms to minimize.
[2025-05-31 22:36:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:36:52] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2025-05-31 22:36:52] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2025-05-31 22:36:52] [INFO ] Deduced a trap composed of 206 places in 147 ms of which 4 ms to minimize.
[2025-05-31 22:36:52] [INFO ] Deduced a trap composed of 194 places in 144 ms of which 4 ms to minimize.
[2025-05-31 22:36:52] [INFO ] Deduced a trap composed of 202 places in 153 ms of which 4 ms to minimize.
[2025-05-31 22:36:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 584 ms
[2025-05-31 22:36:52] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 31 ms.
[2025-05-31 22:36:54] [INFO ] Added : 153 causal constraints over 31 iterations in 1422 ms. Result :sat
Minimization took 667 ms.
[2025-05-31 22:36:55] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-05-31 22:36:55] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 19 ms returned sat
[2025-05-31 22:36:55] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2025-05-31 22:36:55] [INFO ] Deduced a trap composed of 183 places in 147 ms of which 3 ms to minimize.
[2025-05-31 22:36:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-05-31 22:36:55] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 19 ms returned sat
[2025-05-31 22:36:55] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2025-05-31 22:36:56] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 3 ms to minimize.
[2025-05-31 22:36:56] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 3 ms to minimize.
[2025-05-31 22:36:56] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 4 ms to minimize.
[2025-05-31 22:36:56] [INFO ] Deduced a trap composed of 193 places in 148 ms of which 3 ms to minimize.
[2025-05-31 22:36:56] [INFO ] Deduced a trap composed of 175 places in 142 ms of which 3 ms to minimize.
[2025-05-31 22:36:56] [INFO ] Deduced a trap composed of 171 places in 140 ms of which 3 ms to minimize.
[2025-05-31 22:36:57] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 4 ms to minimize.
[2025-05-31 22:36:57] [INFO ] Deduced a trap composed of 211 places in 148 ms of which 5 ms to minimize.
[2025-05-31 22:36:57] [INFO ] Deduced a trap composed of 201 places in 140 ms of which 3 ms to minimize.
[2025-05-31 22:36:57] [INFO ] Deduced a trap composed of 191 places in 145 ms of which 3 ms to minimize.
[2025-05-31 22:36:57] [INFO ] Deduced a trap composed of 222 places in 142 ms of which 3 ms to minimize.
[2025-05-31 22:36:57] [INFO ] Deduced a trap composed of 162 places in 131 ms of which 3 ms to minimize.
[2025-05-31 22:36:58] [INFO ] Deduced a trap composed of 213 places in 130 ms of which 3 ms to minimize.
[2025-05-31 22:36:58] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 4 ms to minimize.
[2025-05-31 22:36:58] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2362 ms
[2025-05-31 22:36:58] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 29 ms.
[2025-05-31 22:37:00] [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 1
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 22:37:00] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:00] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned unsat
[2025-05-31 22:37:00] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:00] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 11 ms returned unsat
[2025-05-31 22:37:00] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:00] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2025-05-31 22:37:01] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-05-31 22:37:01] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 33 ms.
[2025-05-31 22:37:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-05-31 22:37:01] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 19 ms returned sat
[2025-05-31 22:37:01] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-05-31 22:37:01] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 3 ms to minimize.
[2025-05-31 22:37:02] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 3 ms to minimize.
[2025-05-31 22:37:02] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 3 ms to minimize.
[2025-05-31 22:37:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 489 ms
[2025-05-31 22:37:02] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 23 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-05-31 22:37:06] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-05-31 22:37:06] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned sat
[2025-05-31 22:37:06] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2025-05-31 22:37:06] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2025-05-31 22:37:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-05-31 22:37:06] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2025-05-31 22:37:07] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2025-05-31 22:37:07] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 3 ms to minimize.
[2025-05-31 22:37:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2025-05-31 22:37:07] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 32 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 22:37:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:11] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2025-05-31 22:37:12] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2025-05-31 22:37:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2025-05-31 22:37:12] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 29 ms.
[2025-05-31 22:37:15] [INFO ] Added : 235 causal constraints over 47 iterations in 2552 ms. Result :sat
Minimization took 666 ms.
[2025-05-31 22:37:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:15] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2025-05-31 22:37:16] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2025-05-31 22:37:16] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 2 ms to minimize.
[2025-05-31 22:37:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:16] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2025-05-31 22:37:16] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2025-05-31 22:37:16] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 2 ms to minimize.
[2025-05-31 22:37:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2025-05-31 22:37:16] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 22 ms.
[2025-05-31 22:37:19] [INFO ] Added : 291 causal constraints over 59 iterations in 2658 ms. Result :sat
Minimization took 680 ms.
[2025-05-31 22:37:20] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-05-31 22:37:20] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned sat
[2025-05-31 22:37:20] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2025-05-31 22:37:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-05-31 22:37:20] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2025-05-31 22:37:21] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-05-31 22:37:21] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 3 ms to minimize.
[2025-05-31 22:37:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2025-05-31 22:37:21] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2025-05-31 22:37:23] [INFO ] Added : 160 causal constraints over 32 iterations in 2326 ms. Result :sat
Minimization took 658 ms.
[2025-05-31 22:37:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 19 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2025-05-31 22:37:24] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2025-05-31 22:37:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2025-05-31 22:37:25] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2025-05-31 22:37:25] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2025-05-31 22:37:28] [INFO ] Deduced a trap composed of 202 places in 146 ms of which 4 ms to minimize.
[2025-05-31 22:37:28] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 4 ms to minimize.
[2025-05-31 22:37:28] [INFO ] Deduced a trap composed of 196 places in 138 ms of which 4 ms to minimize.
[2025-05-31 22:37:28] [INFO ] Deduced a trap composed of 194 places in 136 ms of which 3 ms to minimize.
[2025-05-31 22:37:28] [INFO ] Deduced a trap composed of 190 places in 136 ms of which 3 ms to minimize.
[2025-05-31 22:37:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 934 ms
[2025-05-31 22:37:28] [INFO ] Added : 306 causal constraints over 63 iterations in 3635 ms. Result :sat
Minimization took 658 ms.
[2025-05-31 22:37:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:29] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2025-05-31 22:37:29] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2025-05-31 22:37:30] [INFO ] Deduced a trap composed of 187 places in 118 ms of which 3 ms to minimize.
[2025-05-31 22:37:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:30] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2025-05-31 22:37:30] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2025-05-31 22:37:30] [INFO ] Deduced a trap composed of 187 places in 114 ms of which 3 ms to minimize.
[2025-05-31 22:37:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2025-05-31 22:37:30] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2025-05-31 22:37:33] [INFO ] Added : 197 causal constraints over 40 iterations in 2655 ms. Result :sat
Minimization took 676 ms.
[2025-05-31 22:37:33] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:33] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2025-05-31 22:37:34] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2025-05-31 22:37:34] [INFO ] Deduced a trap composed of 208 places in 147 ms of which 5 ms to minimize.
[2025-05-31 22:37:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:34] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2025-05-31 22:37:34] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2025-05-31 22:37:34] [INFO ] Deduced a trap composed of 208 places in 134 ms of which 3 ms to minimize.
[2025-05-31 22:37:35] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 3 ms to minimize.
[2025-05-31 22:37:35] [INFO ] Deduced a trap composed of 193 places in 138 ms of which 3 ms to minimize.
[2025-05-31 22:37:35] [INFO ] Deduced a trap composed of 184 places in 128 ms of which 3 ms to minimize.
[2025-05-31 22:37:35] [INFO ] Deduced a trap composed of 101 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:37:35] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 3 ms to minimize.
[2025-05-31 22:37:35] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 3 ms to minimize.
[2025-05-31 22:37:35] [INFO ] Deduced a trap composed of 222 places in 130 ms of which 3 ms to minimize.
[2025-05-31 22:37:36] [INFO ] Deduced a trap composed of 159 places in 125 ms of which 3 ms to minimize.
[2025-05-31 22:37:36] [INFO ] Deduced a trap composed of 113 places in 133 ms of which 3 ms to minimize.
[2025-05-31 22:37:36] [INFO ] Deduced a trap composed of 216 places in 136 ms of which 3 ms to minimize.
[2025-05-31 22:37:36] [INFO ] Deduced a trap composed of 211 places in 130 ms of which 3 ms to minimize.
[2025-05-31 22:37:36] [INFO ] Deduced a trap composed of 152 places in 126 ms of which 3 ms to minimize.
[2025-05-31 22:37:36] [INFO ] Deduced a trap composed of 119 places in 127 ms of which 3 ms to minimize.
[2025-05-31 22:37:37] [INFO ] Deduced a trap composed of 209 places in 137 ms of which 3 ms to minimize.
[2025-05-31 22:37:37] [INFO ] Deduced a trap composed of 218 places in 132 ms of which 4 ms to minimize.
[2025-05-31 22:37:37] [INFO ] Deduced a trap composed of 181 places in 131 ms of which 3 ms to minimize.
[2025-05-31 22:37:37] [INFO ] Deduced a trap composed of 223 places in 130 ms of which 3 ms to minimize.
[2025-05-31 22:37:37] [INFO ] Deduced a trap composed of 211 places in 125 ms of which 3 ms to minimize.
[2025-05-31 22:37:37] [INFO ] Deduced a trap composed of 219 places in 133 ms of which 3 ms to minimize.
[2025-05-31 22:37:38] [INFO ] Deduced a trap composed of 174 places in 132 ms of which 3 ms to minimize.
[2025-05-31 22:37:38] [INFO ] Deduced a trap composed of 143 places in 136 ms of which 3 ms to minimize.
[2025-05-31 22:37:38] [INFO ] Deduced a trap composed of 193 places in 139 ms of which 3 ms to minimize.
[2025-05-31 22:37:38] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2025-05-31 22:37:38] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2025-05-31 22:37:38] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2025-05-31 22:37:38] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2025-05-31 22:37:38] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4086 ms
[2025-05-31 22:37:38] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2025-05-31 22:37:39] [INFO ] Added : 35 causal constraints over 7 iterations in 585 ms. Result :unknown
[2025-05-31 22:37:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-05-31 22:37:39] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 19 ms returned sat
[2025-05-31 22:37:39] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2025-05-31 22:37:39] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 3 ms to minimize.
[2025-05-31 22:37:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:40] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2025-05-31 22:37:40] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2025-05-31 22:37:40] [INFO ] Deduced a trap composed of 159 places in 101 ms of which 2 ms to minimize.
[2025-05-31 22:37:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2025-05-31 22:37:40] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 36 ms.
[2025-05-31 22:37:43] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
[2025-05-31 22:37:43] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 3 ms to minimize.
[2025-05-31 22:37:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 353 ms
[2025-05-31 22:37:43] [INFO ] Added : 328 causal constraints over 67 iterations in 3361 ms. Result :sat
Minimization took 652 ms.
[2025-05-31 22:37:44] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:44] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2025-05-31 22:37:45] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2025-05-31 22:37:45] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 30 ms.
[2025-05-31 22:37:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:45] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2025-05-31 22:37:45] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2025-05-31 22:37:45] [INFO ] Deduced a trap composed of 101 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:37:45] [INFO ] Deduced a trap composed of 108 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:37:45] [INFO ] Deduced a trap composed of 108 places in 86 ms of which 2 ms to minimize.
[2025-05-31 22:37:46] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 2 ms to minimize.
[2025-05-31 22:37:46] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 2 ms to minimize.
[2025-05-31 22:37:46] [INFO ] Deduced a trap composed of 103 places in 83 ms of which 2 ms to minimize.
[2025-05-31 22:37:46] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:37:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 748 ms
[2025-05-31 22:37:46] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2025-05-31 22:37:50] [INFO ] Added : 405 causal constraints over 81 iterations in 3771 ms. Result :unknown
[2025-05-31 22:37:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:50] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned sat
[2025-05-31 22:37:50] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2025-05-31 22:37:50] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 3 ms to minimize.
[2025-05-31 22:37:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:50] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned sat
[2025-05-31 22:37:50] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2025-05-31 22:37:51] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 3 ms to minimize.
[2025-05-31 22:37:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2025-05-31 22:37:51] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2025-05-31 22:37:53] [INFO ] Added : 219 causal constraints over 44 iterations in 2851 ms. Result :sat
Minimization took 662 ms.
[2025-05-31 22:37:54] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:54] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2025-05-31 22:37:55] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2025-05-31 22:37:55] [INFO ] Deduced a trap composed of 200 places in 135 ms of which 3 ms to minimize.
[2025-05-31 22:37:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:37:55] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2025-05-31 22:37:56] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2025-05-31 22:37:56] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2025-05-31 22:38:00] [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 15
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 2, +inf]
FORMULA DoubleExponent-PT-010-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-010-UpperBounds-02 1 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, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 2, +inf]
Support contains 14 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 527 transition count 384
Reduce places removed 112 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 116 rules applied. Total rules applied 232 place count 415 transition count 380
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 236 place count 411 transition count 380
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 236 place count 411 transition count 359
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 278 place count 390 transition count 359
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 3 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 448 place count 305 transition count 274
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 482 place count 288 transition count 274
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 483 place count 288 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 484 place count 287 transition count 273
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 4 with 33 rules applied. Total rules applied 517 place count 287 transition count 240
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 550 place count 254 transition count 240
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 5 with 39 rules applied. Total rules applied 589 place count 254 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 590 place count 253 transition count 239
Applied a total of 590 rules in 271 ms. Remains 253 /534 variables (removed 281) and now considering 239/498 (removed 259) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 253/534 places, 239/498 transitions.
Found an invariant !
This invariant on transitions {36=1, 55=1, 57=1, 86=1, 89=1, 123=1, 171=1, 215=1, 230=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 2 ms.
This minimized invariant on transitions {36=1, 55=1, 57=1, 86=1, 89=1, 123=1, 171=1, 215=1, 230=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1288 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 2, +inf]
// Phase 1: matrix 239 rows 253 cols
[2025-05-31 22:38:31] [INFO ] Computed 50 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 2, +inf]
RANDOM walk for 1000000 steps (128324 resets) in 918 ms. (1088 steps per ms)
BEST_FIRST walk for 14000004 steps (1185539 resets) in 8428 ms. (1660 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 2, +inf]
[2025-05-31 22:38:41] [INFO ] Invariant cache hit.
[2025-05-31 22:38:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:41] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2025-05-31 22:38:41] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-05-31 22:38:41] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-31 22:38:41] [INFO ] [Real]Added 32 Read/Feed constraints in 65 ms returned sat
[2025-05-31 22:38:41] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 20 ms.
[2025-05-31 22:38:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:41] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2025-05-31 22:38:41] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-05-31 22:38:41] [INFO ] [Nat]Added 32 Read/Feed constraints in 86 ms returned sat
[2025-05-31 22:38:41] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 17 ms.
[2025-05-31 22:38:42] [INFO ] Added : 96 causal constraints over 20 iterations in 720 ms. Result :sat
Minimization took 259 ms.
[2025-05-31 22:38:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:42] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2025-05-31 22:38:42] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-05-31 22:38:42] [INFO ] [Real]Added 32 Read/Feed constraints in 144 ms returned sat
[2025-05-31 22:38:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:43] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2025-05-31 22:38:43] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2025-05-31 22:38:43] [INFO ] [Nat]Added 32 Read/Feed constraints in 139 ms returned sat
[2025-05-31 22:38:43] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:38:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2025-05-31 22:38:43] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 13 ms.
[2025-05-31 22:38:44] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:38:45] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:38:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2025-05-31 22:38:45] [INFO ] Added : 186 causal constraints over 38 iterations in 1736 ms. Result :sat
Minimization took 561 ms.
[2025-05-31 22:38:45] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-05-31 22:38:45] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2025-05-31 22:38:45] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2025-05-31 22:38:45] [INFO ] [Real]Added 32 Read/Feed constraints in 51 ms returned sat
[2025-05-31 22:38:45] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 17 ms.
[2025-05-31 22:38:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-05-31 22:38:46] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2025-05-31 22:38:46] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-05-31 22:38:46] [INFO ] [Nat]Added 32 Read/Feed constraints in 163 ms returned sat
[2025-05-31 22:38:46] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 12 ms.
[2025-05-31 22:38:47] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:38:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2025-05-31 22:38:47] [INFO ] Added : 148 causal constraints over 30 iterations in 1198 ms. Result :sat
Minimization took 576 ms.
[2025-05-31 22:38:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-05-31 22:38:48] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2025-05-31 22:38:48] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-05-31 22:38:48] [INFO ] [Real]Added 32 Read/Feed constraints in 74 ms returned sat
[2025-05-31 22:38:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:48] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2025-05-31 22:38:48] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2025-05-31 22:38:48] [INFO ] [Nat]Added 32 Read/Feed constraints in 80 ms returned sat
[2025-05-31 22:38:48] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 25 ms.
[2025-05-31 22:38:50] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:38:50] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:38:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2025-05-31 22:38:50] [INFO ] Added : 202 causal constraints over 41 iterations in 2175 ms. Result :sat
Minimization took 600 ms.
[2025-05-31 22:38:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:51] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2025-05-31 22:38:51] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-05-31 22:38:51] [INFO ] [Real]Added 32 Read/Feed constraints in 34 ms returned sat
[2025-05-31 22:38:51] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 13 ms.
[2025-05-31 22:38:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:51] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2025-05-31 22:38:51] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2025-05-31 22:38:51] [INFO ] [Nat]Added 32 Read/Feed constraints in 61 ms returned sat
[2025-05-31 22:38:51] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 14 ms.
[2025-05-31 22:38:51] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2025-05-31 22:38:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2025-05-31 22:38:52] [INFO ] Added : 43 causal constraints over 10 iterations in 315 ms. Result :sat
Minimization took 240 ms.
[2025-05-31 22:38:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:52] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2025-05-31 22:38:52] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-05-31 22:38:52] [INFO ] [Real]Added 32 Read/Feed constraints in 55 ms returned sat
[2025-05-31 22:38:52] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 14 ms.
[2025-05-31 22:38:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:52] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2025-05-31 22:38:52] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-05-31 22:38:52] [INFO ] [Nat]Added 32 Read/Feed constraints in 77 ms returned sat
[2025-05-31 22:38:52] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 14 ms.
[2025-05-31 22:38:53] [INFO ] Added : 77 causal constraints over 16 iterations in 450 ms. Result :sat
Minimization took 271 ms.
[2025-05-31 22:38:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:53] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2025-05-31 22:38:53] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2025-05-31 22:38:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:53] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2025-05-31 22:38:53] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-05-31 22:38:54] [INFO ] [Nat]Added 32 Read/Feed constraints in 330 ms returned sat
[2025-05-31 22:38:54] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:38:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2025-05-31 22:38:54] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 13 ms.
[2025-05-31 22:38:56] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:38:56] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:38:56] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:38:56] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:38:56] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:38:56] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:38:56] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 2 ms to minimize.
[2025-05-31 22:38:56] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:38:56] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:38:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 955 ms
[2025-05-31 22:38:56] [INFO ] Added : 157 causal constraints over 32 iterations in 2629 ms. Result :sat
Minimization took 596 ms.
[2025-05-31 22:38:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:57] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2025-05-31 22:38:57] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2025-05-31 22:38:57] [INFO ] [Real]Added 32 Read/Feed constraints in 111 ms returned sat
[2025-05-31 22:38:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:57] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2025-05-31 22:38:57] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-05-31 22:38:58] [INFO ] [Nat]Added 32 Read/Feed constraints in 121 ms returned sat
[2025-05-31 22:38:58] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 14 ms.
[2025-05-31 22:38:58] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2025-05-31 22:38:58] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2025-05-31 22:38:58] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:38:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 317 ms
[2025-05-31 22:38:59] [INFO ] Added : 108 causal constraints over 22 iterations in 960 ms. Result :sat
Minimization took 372 ms.
[2025-05-31 22:38:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:59] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2025-05-31 22:38:59] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-05-31 22:38:59] [INFO ] [Real]Added 32 Read/Feed constraints in 45 ms returned sat
[2025-05-31 22:38:59] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 13 ms.
[2025-05-31 22:38:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:38:59] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2025-05-31 22:38:59] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-05-31 22:38:59] [INFO ] [Nat]Added 32 Read/Feed constraints in 68 ms returned sat
[2025-05-31 22:38:59] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 14 ms.
[2025-05-31 22:39:00] [INFO ] Added : 117 causal constraints over 25 iterations in 793 ms. Result :sat
Minimization took 251 ms.
[2025-05-31 22:39:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:39:01] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2025-05-31 22:39:01] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-05-31 22:39:01] [INFO ] [Real]Added 32 Read/Feed constraints in 80 ms returned sat
[2025-05-31 22:39:01] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:39:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:39:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:39:01] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2025-05-31 22:39:01] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2025-05-31 22:39:01] [INFO ] [Nat]Added 32 Read/Feed constraints in 107 ms returned sat
[2025-05-31 22:39:01] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 1 ms to minimize.
[2025-05-31 22:39:01] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:39:01] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 1 ms to minimize.
[2025-05-31 22:39:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 291 ms
[2025-05-31 22:39:01] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 12 ms.
[2025-05-31 22:39:04] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:39:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2025-05-31 22:39:04] [INFO ] Added : 194 causal constraints over 39 iterations in 2259 ms. Result :sat
Minimization took 688 ms.
[2025-05-31 22:39:04] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-05-31 22:39:04] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2025-05-31 22:39:05] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2025-05-31 22:39:05] [INFO ] [Real]Added 32 Read/Feed constraints in 103 ms returned sat
[2025-05-31 22:39:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:39:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:39:05] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2025-05-31 22:39:05] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-05-31 22:39:05] [INFO ] [Nat]Added 32 Read/Feed constraints in 109 ms returned sat
[2025-05-31 22:39:05] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 14 ms.
[2025-05-31 22:39:06] [INFO ] Added : 169 causal constraints over 34 iterations in 1449 ms. Result :sat
Minimization took 547 ms.
[2025-05-31 22:39:07] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:39:07] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2025-05-31 22:39:07] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2025-05-31 22:39:07] [INFO ] [Real]Added 32 Read/Feed constraints in 122 ms returned sat
[2025-05-31 22:39:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:39:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:39:07] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2025-05-31 22:39:08] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-05-31 22:39:08] [INFO ] [Nat]Added 32 Read/Feed constraints in 220 ms returned sat
[2025-05-31 22:39:08] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 13 ms.
[2025-05-31 22:39:10] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:39:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2025-05-31 22:39:10] [INFO ] Added : 205 causal constraints over 41 iterations in 2223 ms. Result :sat
Minimization took 433 ms.
[2025-05-31 22:39:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:39:10] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2025-05-31 22:39:11] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2025-05-31 22:39:11] [INFO ] [Real]Added 32 Read/Feed constraints in 22 ms returned sat
[2025-05-31 22:39:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:39:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-05-31 22:39:11] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2025-05-31 22:39:11] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-05-31 22:39:11] [INFO ] [Nat]Added 32 Read/Feed constraints in 80 ms returned sat
[2025-05-31 22:39:11] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 15 ms.
[2025-05-31 22:39:11] [INFO ] Added : 53 causal constraints over 11 iterations in 337 ms. Result :sat
Minimization took 238 ms.
[2025-05-31 22:39:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:39:11] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2025-05-31 22:39:12] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2025-05-31 22:39:12] [INFO ] [Real]Added 32 Read/Feed constraints in 123 ms returned sat
[2025-05-31 22:39:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:39:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:39:12] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2025-05-31 22:39:12] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-05-31 22:39:12] [INFO ] [Nat]Added 32 Read/Feed constraints in 181 ms returned sat
[2025-05-31 22:39:12] [INFO ] Computed and/alt/rep : 221/1171/221 causal constraints (skipped 17 transitions) in 13 ms.
[2025-05-31 22:39:14] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2025-05-31 22:39:15] [INFO ] Added : 215 causal constraints over 43 iterations in 2437 ms. Result :sat
Minimization took 734 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 2, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 2, +inf]
Support contains 14 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 239/239 transitions.
Applied a total of 0 rules in 10 ms. Remains 253 /253 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 253/253 places, 239/239 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 239/239 transitions.
Applied a total of 0 rules in 9 ms. Remains 253 /253 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2025-05-31 22:40:02] [INFO ] Invariant cache hit.
[2025-05-31 22:40:02] [INFO ] Implicit Places using invariants in 288 ms returned [24, 30, 80, 87, 107, 114, 135, 140, 141, 169, 191, 199, 206, 214, 220, 243]
[2025-05-31 22:40:02] [INFO ] Actually due to overlaps returned [87, 206, 80, 140, 24, 30]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 292 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 247/253 places, 239/239 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 245 transition count 237
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 245 transition count 237
Applied a total of 5 rules in 24 ms. Remains 245 /247 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 245 cols
[2025-05-31 22:40:02] [INFO ] Computed 44 invariants in 19 ms
[2025-05-31 22:40:03] [INFO ] Implicit Places using invariants in 241 ms returned [102, 109, 130, 135, 163, 185, 193, 207, 212, 235]
[2025-05-31 22:40:03] [INFO ] Actually due to overlaps returned [109, 102, 235]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 244 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 242/253 places, 237/239 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 241 transition count 236
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 241 transition count 236
Applied a total of 3 rules in 31 ms. Remains 241 /242 variables (removed 1) and now considering 236/237 (removed 1) transitions.
// Phase 1: matrix 236 rows 241 cols
[2025-05-31 22:40:03] [INFO ] Computed 41 invariants in 10 ms
[2025-05-31 22:40:03] [INFO ] Implicit Places using invariants in 166 ms returned [127, 132, 160, 182, 190, 204, 209]
[2025-05-31 22:40:03] [INFO ] Actually due to overlaps returned [132, 127]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 168 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 239/253 places, 236/239 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 238 transition count 235
Applied a total of 2 rules in 13 ms. Remains 238 /239 variables (removed 1) and now considering 235/236 (removed 1) transitions.
// Phase 1: matrix 235 rows 238 cols
[2025-05-31 22:40:03] [INFO ] Computed 39 invariants in 15 ms
[2025-05-31 22:40:03] [INFO ] Implicit Places using invariants in 158 ms returned [157, 179, 187, 201, 206]
[2025-05-31 22:40:03] [INFO ] Actually due to overlaps returned [157]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 237/253 places, 235/239 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 235
Applied a total of 1 rules in 19 ms. Remains 237 /237 variables (removed 0) and now considering 235/235 (removed 0) transitions.
// Phase 1: matrix 235 rows 237 cols
[2025-05-31 22:40:03] [INFO ] Computed 38 invariants in 12 ms
[2025-05-31 22:40:03] [INFO ] Implicit Places using invariants in 147 ms returned [178, 186, 200, 205]
[2025-05-31 22:40:03] [INFO ] Actually due to overlaps returned [178, 186]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 149 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 235/253 places, 235/239 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 234
Applied a total of 2 rules in 9 ms. Remains 234 /235 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 234 cols
[2025-05-31 22:40:03] [INFO ] Computed 36 invariants in 14 ms
[2025-05-31 22:40:03] [INFO ] Implicit Places using invariants in 157 ms returned [197, 202]
[2025-05-31 22:40:03] [INFO ] Actually due to overlaps returned [197]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 159 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 233/253 places, 234/239 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 233
Applied a total of 2 rules in 9 ms. Remains 232 /233 variables (removed 1) and now considering 233/234 (removed 1) transitions.
// Phase 1: matrix 233 rows 232 cols
[2025-05-31 22:40:03] [INFO ] Computed 35 invariants in 16 ms
[2025-05-31 22:40:03] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-31 22:40:03] [INFO ] Invariant cache hit.
[2025-05-31 22:40:04] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-31 22:40:04] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 232/253 places, 233/239 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 2352 ms. Remains : 232/253 places, 233/239 transitions.
Found an invariant !
This invariant on transitions {33=1, 52=1, 76=1, 105=1, 153=1, 196=1, 211=1, 222=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {33=1, 52=1, 76=1, 105=1, 153=1, 196=1, 211=1, 222=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1434 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 2, +inf]
[2025-05-31 22:44:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 1, 5]
RANDOM walk for 1000000 steps (144126 resets) in 788 ms. (1267 steps per ms)
BEST_FIRST walk for 14000006 steps (1280086 resets) in 7761 ms. (1803 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 1, 5]
[2025-05-31 22:45:00] [INFO ] Invariant cache hit.
[2025-05-31 22:45:00] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:00] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:00] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-05-31 22:45:00] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-31 22:45:00] [INFO ] [Real]Added 31 Read/Feed constraints in 64 ms returned sat
[2025-05-31 22:45:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:45:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:00] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:00] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-05-31 22:45:01] [INFO ] [Nat]Added 31 Read/Feed constraints in 66 ms returned sat
[2025-05-31 22:45:01] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 12 ms.
[2025-05-31 22:45:01] [INFO ] Added : 40 causal constraints over 8 iterations in 223 ms. Result :sat
Minimization took 268 ms.
[2025-05-31 22:45:01] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:01] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 6 ms returned sat
[2025-05-31 22:45:01] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2025-05-31 22:45:01] [INFO ] [Real]Added 31 Read/Feed constraints in 101 ms returned sat
[2025-05-31 22:45:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:45:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2025-05-31 22:45:01] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 6 ms returned sat
[2025-05-31 22:45:01] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-05-31 22:45:02] [INFO ] [Nat]Added 31 Read/Feed constraints in 92 ms returned sat
[2025-05-31 22:45:02] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 22 ms.
[2025-05-31 22:45:04] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:45:04] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:45:04] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:45:04] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:45:04] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:45:04] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:45:04] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2025-05-31 22:45:04] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:45:04] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2025-05-31 22:45:04] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:45:05] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:45:05] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:45:05] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:45:05] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:45:05] [INFO ] Deduced a trap composed of 93 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:45:05] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 1 ms to minimize.
[2025-05-31 22:45:05] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 2 ms to minimize.
[2025-05-31 22:45:05] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:45:05] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:45:05] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 2 ms to minimize.
[2025-05-31 22:45:05] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
[2025-05-31 22:45:06] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:06] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2082 ms
[2025-05-31 22:45:06] [INFO ] Added : 206 causal constraints over 42 iterations in 4036 ms. Result :sat
Minimization took 1020 ms.
[2025-05-31 22:45:07] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:07] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:07] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-05-31 22:45:07] [INFO ] [Real]Added 31 Read/Feed constraints in 108 ms returned sat
[2025-05-31 22:45:07] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 12 ms.
[2025-05-31 22:45:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:45:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 22:45:07] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:07] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-05-31 22:45:07] [INFO ] [Nat]Added 31 Read/Feed constraints in 145 ms returned sat
[2025-05-31 22:45:07] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 13 ms.
[2025-05-31 22:45:09] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:45:09] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:45:09] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:45:09] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:45:09] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:45:09] [INFO ] Deduced a trap composed of 91 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:45:10] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:45:10] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:45:10] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 2 ms to minimize.
[2025-05-31 22:45:10] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:45:10] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:45:10] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:10] [INFO ] Deduced a trap composed of 95 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:45:10] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:45:10] [INFO ] Deduced a trap composed of 96 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:10] [INFO ] Deduced a trap composed of 94 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:45:11] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:45:11] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:45:11] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:45:11] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:45:11] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:45:11] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:45:11] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 2 ms to minimize.
[2025-05-31 22:45:11] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:45:11] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 2 ms to minimize.
[2025-05-31 22:45:11] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:45:11] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:45:12] [INFO ] Deduced a trap composed of 83 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:45:12] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 2 ms to minimize.
[2025-05-31 22:45:12] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 2 ms to minimize.
[2025-05-31 22:45:12] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:45:12] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:45:12] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
[2025-05-31 22:45:12] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:45:12] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 3411 ms
[2025-05-31 22:45:12] [INFO ] Added : 169 causal constraints over 36 iterations in 5091 ms. Result :sat
Minimization took 1031 ms.
[2025-05-31 22:45:13] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:13] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:14] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2025-05-31 22:45:14] [INFO ] [Real]Added 31 Read/Feed constraints in 55 ms returned sat
[2025-05-31 22:45:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:45:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 22:45:14] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:14] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2025-05-31 22:45:14] [INFO ] [Nat]Added 31 Read/Feed constraints in 197 ms returned sat
[2025-05-31 22:45:14] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 14 ms.
[2025-05-31 22:45:16] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:45:16] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:45:16] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:45:16] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:45:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 359 ms
[2025-05-31 22:45:16] [INFO ] Added : 191 causal constraints over 39 iterations in 2372 ms. Result :sat
Minimization took 667 ms.
[2025-05-31 22:45:17] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:17] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 3 ms returned sat
[2025-05-31 22:45:17] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-05-31 22:45:17] [INFO ] [Real]Added 31 Read/Feed constraints in 27 ms returned sat
[2025-05-31 22:45:17] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 13 ms.
[2025-05-31 22:45:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:45:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:17] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:17] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-05-31 22:45:18] [INFO ] [Nat]Added 31 Read/Feed constraints in 53 ms returned sat
[2025-05-31 22:45:18] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 11 ms.
[2025-05-31 22:45:18] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2025-05-31 22:45:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2025-05-31 22:45:18] [INFO ] Added : 56 causal constraints over 12 iterations in 398 ms. Result :sat
Minimization took 294 ms.
[2025-05-31 22:45:18] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 22:45:18] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:18] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2025-05-31 22:45:18] [INFO ] [Real]Added 31 Read/Feed constraints in 53 ms returned sat
[2025-05-31 22:45:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:45:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:19] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:19] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-05-31 22:45:19] [INFO ] [Nat]Added 31 Read/Feed constraints in 134 ms returned sat
[2025-05-31 22:45:19] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 11 ms.
[2025-05-31 22:45:19] [INFO ] Added : 75 causal constraints over 16 iterations in 556 ms. Result :sat
Minimization took 367 ms.
[2025-05-31 22:45:20] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:20] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 3 ms returned sat
[2025-05-31 22:45:20] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2025-05-31 22:45:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:45:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 22:45:20] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:20] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-05-31 22:45:20] [INFO ] [Nat]Added 31 Read/Feed constraints in 436 ms returned sat
[2025-05-31 22:45:20] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 14 ms.
[2025-05-31 22:45:24] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:45:24] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:24] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:45:24] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:45:24] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:45:24] [INFO ] Deduced a trap composed of 98 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:24] [INFO ] Deduced a trap composed of 99 places in 62 ms of which 2 ms to minimize.
[2025-05-31 22:45:24] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 2 ms to minimize.
[2025-05-31 22:45:24] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:45:24] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:45:24] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:45:25] [INFO ] Deduced a trap composed of 91 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:45:25] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:45:25] [INFO ] Deduced a trap composed of 96 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:45:25] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:45:25] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:25] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:45:25] [INFO ] Deduced a trap composed of 95 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:45:25] [INFO ] Deduced a trap composed of 103 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:45:25] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:45:25] [INFO ] Deduced a trap composed of 97 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:26] [INFO ] Deduced a trap composed of 98 places in 63 ms of which 2 ms to minimize.
[2025-05-31 22:45:26] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:45:26] [INFO ] Deduced a trap composed of 94 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:45:26] [INFO ] Deduced a trap composed of 96 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:45:26] [INFO ] Deduced a trap composed of 101 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:45:26] [INFO ] Deduced a trap composed of 95 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:45:26] [INFO ] Deduced a trap composed of 99 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:45:26] [INFO ] Deduced a trap composed of 99 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:45:26] [INFO ] Deduced a trap composed of 92 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:45:26] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 2 ms to minimize.
[2025-05-31 22:45:27] [INFO ] Deduced a trap composed of 96 places in 57 ms of which 2 ms to minimize.
[2025-05-31 22:45:27] [INFO ] Deduced a trap composed of 97 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:45:27] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:45:27] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:45:27] [INFO ] Deduced a trap composed of 99 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:45:27] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:45:27] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:45:27] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 2 ms to minimize.
[2025-05-31 22:45:27] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 2 ms to minimize.
[2025-05-31 22:45:27] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:45:27] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:45:28] [INFO ] Deduced a trap composed of 94 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:45:28] [INFO ] Deduced a trap composed of 90 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:45:28] [INFO ] Deduced a trap composed of 98 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:45:28] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:45:28] [INFO ] Deduced a trap composed of 93 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:45:28] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 2 ms to minimize.
[2025-05-31 22:45:28] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:45:28] [INFO ] Deduced a trap composed of 97 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:45:28] [INFO ] Deduced a trap composed of 93 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:45:28] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:28] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 2 ms to minimize.
[2025-05-31 22:45:29] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:45:29] [INFO ] Deduced a trap composed of 95 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:45:29] [INFO ] Deduced a trap composed of 100 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:29] [INFO ] Deduced a trap composed of 101 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:45:29] [INFO ] Deduced a trap composed of 92 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:45:29] [INFO ] Deduced a trap composed of 99 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:45:29] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 5650 ms
[2025-05-31 22:45:29] [INFO ] Added : 214 causal constraints over 44 iterations in 8706 ms. Result :sat
Minimization took 2056 ms.
[2025-05-31 22:45:31] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:31] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:31] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-05-31 22:45:31] [INFO ] [Real]Added 31 Read/Feed constraints in 101 ms returned sat
[2025-05-31 22:45:31] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 14 ms.
[2025-05-31 22:45:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:45:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:32] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:32] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-05-31 22:45:32] [INFO ] [Nat]Added 31 Read/Feed constraints in 142 ms returned sat
[2025-05-31 22:45:32] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 14 ms.
[2025-05-31 22:45:32] [INFO ] Added : 102 causal constraints over 22 iterations in 597 ms. Result :sat
Minimization took 401 ms.
[2025-05-31 22:45:33] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 22:45:33] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 3 ms returned sat
[2025-05-31 22:45:33] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-05-31 22:45:33] [INFO ] [Real]Added 31 Read/Feed constraints in 32 ms returned sat
[2025-05-31 22:45:33] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 15 ms.
[2025-05-31 22:45:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:45:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 22:45:33] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 3 ms returned sat
[2025-05-31 22:45:33] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-05-31 22:45:33] [INFO ] [Nat]Added 31 Read/Feed constraints in 70 ms returned sat
[2025-05-31 22:45:33] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 12 ms.
[2025-05-31 22:45:34] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2025-05-31 22:45:34] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:45:34] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:45:34] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:45:34] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:45:34] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2025-05-31 22:45:35] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:45:35] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:45:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 803 ms
[2025-05-31 22:45:35] [INFO ] Added : 89 causal constraints over 19 iterations in 1413 ms. Result :sat
Minimization took 324 ms.
[2025-05-31 22:45:35] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:35] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:35] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2025-05-31 22:45:35] [INFO ] [Real]Added 31 Read/Feed constraints in 79 ms returned sat
[2025-05-31 22:45:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:45:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:35] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:36] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2025-05-31 22:45:36] [INFO ] [Nat]Added 31 Read/Feed constraints in 164 ms returned sat
[2025-05-31 22:45:36] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 15 ms.
[2025-05-31 22:45:39] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:45:39] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:45:39] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:45:39] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:45:40] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:40] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 2 ms to minimize.
[2025-05-31 22:45:40] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:45:40] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:45:40] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:45:40] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:45:40] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:45:40] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 2 ms to minimize.
[2025-05-31 22:45:40] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:45:40] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:41] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:45:41] [INFO ] Deduced a trap composed of 89 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:45:41] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:45:41] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:45:41] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:45:41] [INFO ] Deduced a trap composed of 92 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:45:41] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:45:41] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:41] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 4 ms to minimize.
[2025-05-31 22:45:42] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:45:42] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2025-05-31 22:45:42] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:45:42] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:45:42] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:45:42] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:45:42] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:45:42] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:45:42] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:45:42] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:43] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:45:43] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:43] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:45:43] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:45:43] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:45:43] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:43] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:45:43] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:45:43] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:45:43] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:45:44] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:45:44] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:45:44] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:45:44] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:45:44] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:45:44] [INFO ] Deduced a trap composed of 86 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:45:44] [INFO ] Deduced a trap composed of 89 places in 61 ms of which 2 ms to minimize.
[2025-05-31 22:45:44] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:45:44] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:45:44] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 1 ms to minimize.
[2025-05-31 22:45:45] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 2 ms to minimize.
[2025-05-31 22:45:45] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:45:45] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:45:45] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:45:45] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:45:45] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:45:45] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
[2025-05-31 22:45:45] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:45:45] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 2 ms to minimize.
[2025-05-31 22:45:45] [INFO ] Deduced a trap composed of 92 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:45:45] [INFO ] Trap strengthening (SAT) tested/added 64/63 trap constraints in 6388 ms
[2025-05-31 22:45:46] [INFO ] Added : 212 causal constraints over 43 iterations in 9624 ms. Result :sat
Minimization took 1373 ms.
[2025-05-31 22:45:47] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:47] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 5 ms returned sat
[2025-05-31 22:45:47] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-05-31 22:45:47] [INFO ] [Real]Added 31 Read/Feed constraints in 48 ms returned sat
[2025-05-31 22:45:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:45:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 22:45:47] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:47] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-05-31 22:45:47] [INFO ] [Nat]Added 31 Read/Feed constraints in 174 ms returned sat
[2025-05-31 22:45:47] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 13 ms.
[2025-05-31 22:45:49] [INFO ] Added : 156 causal constraints over 32 iterations in 1651 ms. Result :sat
Minimization took 613 ms.
[2025-05-31 22:45:50] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 22:45:50] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:50] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2025-05-31 22:45:50] [INFO ] [Real]Added 31 Read/Feed constraints in 94 ms returned sat
[2025-05-31 22:45:50] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 14 ms.
[2025-05-31 22:45:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:45:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:50] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 3 ms returned sat
[2025-05-31 22:45:50] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2025-05-31 22:45:50] [INFO ] [Nat]Added 31 Read/Feed constraints in 125 ms returned sat
[2025-05-31 22:45:50] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 13 ms.
[2025-05-31 22:45:53] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:45:53] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:45:53] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2025-05-31 22:45:53] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:45:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 374 ms
[2025-05-31 22:45:53] [INFO ] Added : 212 causal constraints over 43 iterations in 2828 ms. Result :sat
Minimization took 890 ms.
[2025-05-31 22:45:54] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 22:45:54] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:54] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-05-31 22:45:54] [INFO ] [Real]Added 31 Read/Feed constraints in 57 ms returned sat
[2025-05-31 22:45:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:45:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:54] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:54] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-05-31 22:45:55] [INFO ] [Nat]Added 31 Read/Feed constraints in 75 ms returned sat
[2025-05-31 22:45:55] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 13 ms.
[2025-05-31 22:45:55] [INFO ] Added : 34 causal constraints over 7 iterations in 141 ms. Result :sat
Minimization took 271 ms.
[2025-05-31 22:45:55] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:55] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 3 ms returned sat
[2025-05-31 22:45:55] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2025-05-31 22:45:55] [INFO ] [Real]Added 31 Read/Feed constraints in 132 ms returned sat
[2025-05-31 22:45:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:45:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:45:55] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:45:56] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2025-05-31 22:45:56] [INFO ] [Nat]Added 31 Read/Feed constraints in 170 ms returned sat
[2025-05-31 22:45:56] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 12 ms.
[2025-05-31 22:45:58] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 2 ms to minimize.
[2025-05-31 22:45:58] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:45:59] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:59] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:45:59] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:45:59] [INFO ] Deduced a trap composed of 97 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:45:59] [INFO ] Deduced a trap composed of 87 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:45:59] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:45:59] [INFO ] Deduced a trap composed of 94 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:45:59] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:45:59] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:45:59] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:46:00] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:46:00] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:46:00] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:46:00] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:46:00] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1631 ms
[2025-05-31 22:46:00] [INFO ] Added : 213 causal constraints over 44 iterations in 4340 ms. Result :sat
Minimization took 1040 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 1, 5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 1, 5]
Support contains 14 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 233/233 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 232/232 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 233/233 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2025-05-31 22:46:30] [INFO ] Invariant cache hit.
[2025-05-31 22:46:30] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-05-31 22:46:30] [INFO ] Invariant cache hit.
[2025-05-31 22:46:30] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-31 22:46:31] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
[2025-05-31 22:46:31] [INFO ] Redundant transitions in 9 ms returned []
Running 232 sub problems to find dead transitions.
[2025-05-31 22:46:31] [INFO ] Invariant cache hit.
[2025-05-31 22:46:31] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 1/232 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2025-05-31 22:46:34] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:46:34] [INFO ] Deduced a trap composed of 105 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:46:34] [INFO ] Deduced a trap composed of 108 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:46:34] [INFO ] Deduced a trap composed of 107 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:46:34] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:46:35] [INFO ] Deduced a trap composed of 103 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:46:35] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:46:35] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:46:35] [INFO ] Deduced a trap composed of 108 places in 62 ms of which 2 ms to minimize.
[2025-05-31 22:46:35] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:46:35] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:46:35] [INFO ] Deduced a trap composed of 110 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:46:35] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:46:35] [INFO ] Deduced a trap composed of 108 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:46:35] [INFO ] Deduced a trap composed of 89 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:46:35] [INFO ] Deduced a trap composed of 90 places in 57 ms of which 2 ms to minimize.
[2025-05-31 22:46:36] [INFO ] Deduced a trap composed of 109 places in 61 ms of which 2 ms to minimize.
[2025-05-31 22:46:36] [INFO ] Deduced a trap composed of 103 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:46:36] [INFO ] Deduced a trap composed of 112 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:46:36] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2025-05-31 22:46:37] [INFO ] Deduced a trap composed of 102 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:46:37] [INFO ] Deduced a trap composed of 96 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:46:38] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:46:38] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:46:38] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:46:38] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:46:38] [INFO ] Deduced a trap composed of 79 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:46:38] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:46:38] [INFO ] Deduced a trap composed of 118 places in 62 ms of which 3 ms to minimize.
[2025-05-31 22:46:38] [INFO ] Deduced a trap composed of 112 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:46:39] [INFO ] Deduced a trap composed of 123 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2025-05-31 22:46:39] [INFO ] Deduced a trap composed of 98 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:46:39] [INFO ] Deduced a trap composed of 95 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:46:39] [INFO ] Deduced a trap composed of 105 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:46:39] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:46:39] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:46:39] [INFO ] Deduced a trap composed of 109 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:46:40] [INFO ] Deduced a trap composed of 111 places in 53 ms of which 2 ms to minimize.
[2025-05-31 22:46:40] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2025-05-31 22:46:43] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:46:43] [INFO ] Deduced a trap composed of 104 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2025-05-31 22:46:44] [INFO ] Deduced a trap composed of 102 places in 64 ms of which 2 ms to minimize.
[2025-05-31 22:46:44] [INFO ] Deduced a trap composed of 102 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:46:44] [INFO ] Deduced a trap composed of 111 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2025-05-31 22:46:45] [INFO ] Deduced a trap composed of 106 places in 64 ms of which 2 ms to minimize.
[2025-05-31 22:46:45] [INFO ] Deduced a trap composed of 98 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:46:45] [INFO ] Deduced a trap composed of 104 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:46:46] [INFO ] Deduced a trap composed of 108 places in 84 ms of which 1 ms to minimize.
[2025-05-31 22:46:46] [INFO ] Deduced a trap composed of 99 places in 59 ms of which 1 ms to minimize.
[2025-05-31 22:46:46] [INFO ] Deduced a trap composed of 98 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:46:46] [INFO ] Deduced a trap composed of 97 places in 55 ms of which 2 ms to minimize.
[2025-05-31 22:46:46] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 2 ms to minimize.
[2025-05-31 22:46:46] [INFO ] Deduced a trap composed of 99 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:46:46] [INFO ] Deduced a trap composed of 103 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 102 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 111 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 102 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 109 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 111 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 112 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:46:47] [INFO ] Deduced a trap composed of 109 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2025-05-31 22:46:49] [INFO ] Deduced a trap composed of 112 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:46:49] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:46:49] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:46:50] [INFO ] Deduced a trap composed of 106 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:46:50] [INFO ] Deduced a trap composed of 103 places in 61 ms of which 1 ms to minimize.
[2025-05-31 22:46:50] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:46:50] [INFO ] Deduced a trap composed of 107 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:46:50] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2025-05-31 22:46:51] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2025-05-31 22:46:51] [INFO ] Deduced a trap composed of 117 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:46:52] [INFO ] Deduced a trap composed of 110 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:46:52] [INFO ] Deduced a trap composed of 114 places in 51 ms of which 2 ms to minimize.
[2025-05-31 22:46:53] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2025-05-31 22:46:53] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:46:53] [INFO ] Deduced a trap composed of 104 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:46:53] [INFO ] Deduced a trap composed of 100 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:46:53] [INFO ] Deduced a trap composed of 110 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:46:54] [INFO ] Deduced a trap composed of 110 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 14 (OVERLAPS) 233/465 variables, 232/349 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 31/380 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/465 variables, and 380 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 232/232 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 1/232 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 82/117 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2025-05-31 22:47:02] [INFO ] Deduced a trap composed of 109 places in 64 ms of which 2 ms to minimize.
[2025-05-31 22:47:02] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:47:03] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:47:04] [INFO ] Deduced a trap composed of 110 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:47:04] [INFO ] Deduced a trap composed of 112 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:47:04] [INFO ] Deduced a trap composed of 108 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2025-05-31 22:47:05] [INFO ] Deduced a trap composed of 93 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:47:05] [INFO ] Deduced a trap composed of 112 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 233/465 variables, 232/357 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 31/388 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 232/620 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2025-05-31 22:47:17] [INFO ] Deduced a trap composed of 99 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:47:18] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 3 ms to minimize.
[2025-05-31 22:47:18] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 2 ms to minimize.
[2025-05-31 22:47:18] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:47:18] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:47:18] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:47:19] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:47:19] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:47:19] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:47:19] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 2 ms to minimize.
[2025-05-31 22:47:19] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:47:19] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:47:19] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:47:19] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 2 ms to minimize.
[2025-05-31 22:47:19] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:47:20] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:47:20] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:47:20] [INFO ] Deduced a trap composed of 93 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:47:20] [INFO ] Deduced a trap composed of 99 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:47:20] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 20/640 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2025-05-31 22:47:24] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2025-05-31 22:47:30] [INFO ] Deduced a trap composed of 107 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:47:30] [INFO ] Deduced a trap composed of 110 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:47:30] [INFO ] Deduced a trap composed of 115 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:47:30] [INFO ] Deduced a trap composed of 107 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:47:30] [INFO ] Deduced a trap composed of 119 places in 66 ms of which 2 ms to minimize.
[2025-05-31 22:47:30] [INFO ] Deduced a trap composed of 96 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 647 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 232/232 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 117/117 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61178 ms. Remains : 232/232 places, 233/233 transitions.
Found an invariant !
This invariant on transitions {33=1, 52=1, 76=1, 105=1, 153=1, 196=1, 211=1, 222=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {33=1, 52=1, 76=1, 105=1, 153=1, 196=1, 211=1, 222=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1481 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 1, 5]
RANDOM walk for 40000 steps (5782 resets) in 825 ms. (48 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (373 resets) in 44 ms. (88 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (358 resets) in 99 ms. (40 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (376 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (351 resets) in 84 ms. (47 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (360 resets) in 66 ms. (59 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (350 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
[2025-05-31 22:52:18] [INFO ] Flatten gal took : 114 ms
BEST_FIRST walk for 4002 steps (359 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (370 resets) in 35 ms. (111 steps per ms) remains 27/27 properties
[2025-05-31 22:52:19] [INFO ] Flatten gal took : 51 ms
BEST_FIRST walk for 4000 steps (358 resets) in 38 ms. (102 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (365 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (361 resets) in 30 ms. (129 steps per ms) remains 27/27 properties
[2025-05-31 22:52:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9517089235879527927.gal : 12 ms
BEST_FIRST walk for 4001 steps (365 resets) in 32 ms. (121 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (365 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
[2025-05-31 22:52:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10756607305519380146.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9517089235879527927.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10756607305519380146.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (345 resets) in 35 ms. (111 steps per ms) remains 27/27 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4003 steps (371 resets) in 41 ms. (95 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (392 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (374 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
Loading property file /tmp/ReachabilityCardinality10756607305519380146.prop.
BEST_FIRST walk for 4001 steps (348 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
SDD proceeding with computation,27 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,27 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,27 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,27 properties remain. new max is 32
SDD size :8 after 14
BEST_FIRST walk for 4002 steps (370 resets) in 50 ms. (78 steps per ms) remains 27/27 properties
SDD proceeding with computation,27 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,27 properties remain. new max is 128
SDD size :27 after 47
SDD proceeding with computation,27 properties remain. new max is 256
SDD size :47 after 140
SDD proceeding with computation,27 properties remain. new max is 512
SDD size :140 after 509
BEST_FIRST walk for 4002 steps (373 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
Invariant property MIN12 does not hold.
Reachability property MAX12 is true.
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,21 properties remain. new max is 512
SDD size :509 after 1443
SDD proceeding with computation,21 properties remain. new max is 1024
BEST_FIRST walk for 4003 steps (362 resets) in 46 ms. (85 steps per ms) remains 27/27 properties
SDD size :1443 after 8719
BEST_FIRST walk for 4001 steps (352 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (374 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
SDD proceeding with computation,21 properties remain. new max is 2048
SDD size :8719 after 45016
BEST_FIRST walk for 4001 steps (341 resets) in 22 ms. (173 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (365 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (363 resets) in 30 ms. (129 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (342 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
Invariant property MIN8 does not hold.
Reachability property MAX8 is true.
SDD proceeding with computation,19 properties remain. new max is 2048
SDD size :45016 after 134223
SDD proceeding with computation,19 properties remain. new max is 4096
SDD size :134223 after 227362
SDD proceeding with computation,19 properties remain. new max is 8192
SDD size :227362 after 427558
SDD proceeding with computation,19 properties remain. new max is 16384
SDD size :427558 after 2.48667e+06
SDD proceeding with computation,19 properties remain. new max is 32768
SDD size :2.48667e+06 after 1.21608e+08
Interrupted probabilistic random walk after 179253 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :8 out of 27
Probabilistic random walk after 179253 steps, saw 89656 distinct states, run finished after 3004 ms. (steps per millisecond=59 ) properties seen :8
[2025-05-31 22:52:22] [INFO ] Invariant cache hit.
[2025-05-31 22:52:22] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 157/167 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem MAX13 is UNSAT
At refinement iteration 3 (OVERLAPS) 60/227 variables, 23/33 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2025-05-31 22:52:22] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2025-05-31 22:52:22] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
SDD proceeding with computation,19 properties remain. new max is 65536
SDD size :1.21608e+08 after 6.61221e+08
[2025-05-31 22:52:22] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2025-05-31 22:52:22] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2025-05-31 22:52:22] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2025-05-31 22:52:23] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2025-05-31 22:52:23] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:52:23] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2025-05-31 22:52:23] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2025-05-31 22:52:23] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2025-05-31 22:52:23] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:52:23] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:52:23] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:52:23] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:52:23] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:52:23] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:52:23] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:52:24] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:52:24] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:52:24] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 20/53 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2025-05-31 22:52:24] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:52:24] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:52:24] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 2 ms to minimize.
[2025-05-31 22:52:24] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:52:24] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:52:24] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:52:24] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:52:24] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:52:24] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:52:24] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:52:24] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:52:25] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:52:25] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:52:25] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:52:25] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 2 ms to minimize.
[2025-05-31 22:52:25] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:52:25] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 2 ms to minimize.
[2025-05-31 22:52:25] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2025-05-31 22:52:25] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:52:25] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 20/73 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2025-05-31 22:52:25] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:52:25] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:52:25] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:52:25] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:52:26] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:52:26] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:52:26] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:52:26] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2025-05-31 22:52:26] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:52:26] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:52:26] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:52:26] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:52:26] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:52:26] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:52:26] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:52:26] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:52:27] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:52:27] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:52:27] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2025-05-31 22:52:27] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 20/93 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2025-05-31 22:52:27] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
SMT process timed out in 5031ms, After SMT, problems are : Problem set: 1 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 233/233 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 230 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 231
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 229 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 228 transition count 230
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 228 transition count 227
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 225 transition count 227
Applied a total of 14 rules in 25 ms. Remains 225 /232 variables (removed 7) and now considering 227/233 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 225/232 places, 227/233 transitions.
RANDOM walk for 40000 steps (5778 resets) in 353 ms. (112 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (385 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (364 resets) in 60 ms. (65 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (370 resets) in 42 ms. (93 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (376 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (369 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (355 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (373 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (381 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (370 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (372 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (368 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (356 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (353 resets) in 22 ms. (173 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (372 resets) in 62 ms. (63 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (368 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (361 resets) in 22 ms. (173 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (368 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (353 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
SDD proceeding with computation,19 properties remain. new max is 131072
SDD size :6.61221e+08 after 2.44273e+09
Interrupted probabilistic random walk after 174569 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 18
Probabilistic random walk after 174569 steps, saw 87314 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 227 rows 225 cols
[2025-05-31 22:52:30] [INFO ] Computed 35 invariants in 12 ms
[2025-05-31 22:52:30] [INFO ] State equation strengthened by 33 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 129/139 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 81/220 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-31 22:52:30] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:52:31] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:52:31] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:52:31] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:52:31] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:52:31] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:52:31] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:52:31] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:52:31] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:52:31] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:52:31] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:52:31] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:52:31] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 3 ms to minimize.
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 2 ms to minimize.
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:52:32] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:52:33] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:52:34] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:52:34] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:52:34] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:52:34] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:52:34] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 227/447 variables, 220/301 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 33/334 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 5/452 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/452 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/452 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 341 constraints, problems are : Problem set: 0 solved, 18 unsolved in 4693 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 225/225 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 129/139 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-31 22:52:35] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:52:35] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 2 ms to minimize.
[2025-05-31 22:52:35] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 81/220 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 48/84 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-31 22:52:35] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:52:36] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:52:36] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 ms to minimize.
[2025-05-31 22:52:36] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2025-05-31 22:52:36] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:52:36] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:52:36] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:52:36] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:52:36] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:52:36] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:52:36] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:52:36] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 2 ms to minimize.
[2025-05-31 22:52:36] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:52:36] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:52:36] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:52:37] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 2 ms to minimize.
[2025-05-31 22:52:37] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:52:37] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 2 ms to minimize.
[2025-05-31 22:52:37] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:52:37] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-31 22:52:37] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:52:37] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:52:37] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:52:37] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:52:37] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 227/447 variables, 220/329 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 33/362 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 18/380 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-31 22:52:40] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:52:40] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:52:40] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:52:40] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:52:40] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2025-05-31 22:52:40] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:52:41] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:52:41] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
[2025-05-31 22:52:41] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 2 ms to minimize.
[2025-05-31 22:52:41] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:52:41] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:52:41] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:52:41] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:52:41] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:52:41] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 2 ms to minimize.
[2025-05-31 22:52:41] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:52:42] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:52:42] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:52:42] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:52:42] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-31 22:52:42] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:52:43] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:52:43] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2025-05-31 22:52:43] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:52:43] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2025-05-31 22:52:43] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:52:43] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:52:43] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-31 22:52:44] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2025-05-31 22:52:44] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-31 22:52:44] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:52:44] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-31 22:52:45] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/447 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-31 22:52:45] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:52:45] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/447 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-31 22:52:46] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:52:46] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:52:46] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/447 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/447 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (OVERLAPS) 5/452 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/452 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/452 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (OVERLAPS) 0/452 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 425 constraints, problems are : Problem set: 0 solved, 18 unsolved in 12895 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 225/225 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 114/114 constraints]
After SMT, in 17612ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 10 different solutions.
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
SDD proceeding with computation,17 properties remain. new max is 131072
SDD size :2.44273e+09 after 7.62505e+09
SDD proceeding with computation,17 properties remain. new max is 262144
SDD size :7.62505e+09 after 1.31505e+10
Detected timeout of ITS tools.
[2025-05-31 22:53:09] [INFO ] Flatten gal took : 26 ms
[2025-05-31 22:53:09] [INFO ] Applying decomposition
[2025-05-31 22:53:09] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17677948495975972850.txt' '-o' '/tmp/graph17677948495975972850.bin' '-w' '/tmp/graph17677948495975972850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17677948495975972850.bin' '-l' '-1' '-v' '-w' '/tmp/graph17677948495975972850.weights' '-q' '0' '-e' '0.001'
[2025-05-31 22:53:09] [INFO ] Decomposing Gal with order
[2025-05-31 22:53:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 22:53:09] [INFO ] Removed a total of 115 redundant transitions.
[2025-05-31 22:53:09] [INFO ] Flatten gal took : 94 ms
[2025-05-31 22:53:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 20 ms.
[2025-05-31 22:53:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality558532945978312040.gal : 18 ms
[2025-05-31 22:53:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5573352192230884133.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality558532945978312040.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5573352192230884133.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality5573352192230884133.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 33
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :33 after 95
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :95 after 1257
Parikh walk visited 0 properties in 32754 ms.
Support contains 9 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 227/227 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 225 transition count 224
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 222 transition count 224
Applied a total of 6 rules in 13 ms. Remains 222 /225 variables (removed 3) and now considering 224/227 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 222/225 places, 224/227 transitions.
RANDOM walk for 40000 steps (5742 resets) in 207 ms. (192 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (370 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (389 resets) in 45 ms. (86 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (349 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (360 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (371 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (352 resets) in 28 ms. (137 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (348 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (346 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (358 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (369 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (364 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (365 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (359 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (355 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (370 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (343 resets) in 28 ms. (137 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 197119 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 16
Probabilistic random walk after 197119 steps, saw 98570 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
// Phase 1: matrix 224 rows 222 cols
[2025-05-31 22:53:24] [INFO ] Computed 35 invariants in 10 ms
[2025-05-31 22:53:24] [INFO ] State equation strengthened by 33 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 125/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 81/215 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:24] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2025-05-31 22:53:24] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 9 ms to minimize.
[2025-05-31 22:53:24] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2025-05-31 22:53:24] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:53:25] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2025-05-31 22:53:25] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2025-05-31 22:53:25] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:53:25] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:53:25] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:53:25] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:53:25] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2025-05-31 22:53:25] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:53:25] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:25] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2025-05-31 22:53:25] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:25] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:26] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:26] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:26] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:53:26] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:26] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:53:26] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2025-05-31 22:53:26] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:53:26] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:26] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:26] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:26] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2025-05-31 22:53:26] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:27] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:27] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2025-05-31 22:53:27] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:53:27] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2025-05-31 22:53:27] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2025-05-31 22:53:27] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2025-05-31 22:53:27] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 1 ms to minimize.
[2025-05-31 22:53:27] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 1 ms to minimize.
[2025-05-31 22:53:27] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2025-05-31 22:53:27] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2025-05-31 22:53:27] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2025-05-31 22:53:28] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:28] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:53:28] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2025-05-31 22:53:28] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:53:28] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2025-05-31 22:53:28] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:28] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:53:28] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2025-05-31 22:53:28] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:53:28] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:53:28] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:53:28] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 1 ms to minimize.
[2025-05-31 22:53:29] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:53:29] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:53:29] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:53:29] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:53:29] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2025-05-31 22:53:29] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:53:29] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:53:29] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2025-05-31 22:53:29] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:29] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2025-05-31 22:53:29] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:30] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:30] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:53:30] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 1 ms to minimize.
[2025-05-31 22:53:30] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 1 ms to minimize.
[2025-05-31 22:53:30] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2025-05-31 22:53:30] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2025-05-31 22:53:30] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2025-05-31 22:53:30] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2025-05-31 22:53:30] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2025-05-31 22:53:30] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:53:30] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2025-05-31 22:53:30] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
[2025-05-31 22:53:31] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:53:31] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2025-05-31 22:53:31] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:31] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:31] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 1 ms to minimize.
[2025-05-31 22:53:31] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:31] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2025-05-31 22:53:31] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2025-05-31 22:53:31] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 1 ms to minimize.
[2025-05-31 22:53:31] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2025-05-31 22:53:32] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 1 ms to minimize.
[2025-05-31 22:53:32] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:53:32] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 1 ms to minimize.
[2025-05-31 22:53:32] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2025-05-31 22:53:32] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:32] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2025-05-31 22:53:32] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2025-05-31 22:53:32] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:53:32] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2025-05-31 22:53:32] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:53:32] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:32] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:53:33] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:53:33] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:53:33] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2025-05-31 22:53:33] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :1257 after 752101
[2025-05-31 22:53:33] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2025-05-31 22:53:33] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2025-05-31 22:53:33] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:33] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:53:33] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 2 ms to minimize.
[2025-05-31 22:53:33] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:33] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2025-05-31 22:53:33] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:53:33] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:34] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:34] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:34] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 13 ms to minimize.
[2025-05-31 22:53:34] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:53:34] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:53:34] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:34] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:53:34] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 1 ms to minimize.
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :752101 after 1.14401e+07
[2025-05-31 22:53:34] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:34] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:53:34] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:35] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:53:35] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:35] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:35] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:35] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:35] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:35] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:35] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:53:35] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:35] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 1 ms to minimize.
[2025-05-31 22:53:35] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:35] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:36] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:53:36] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:36] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:36] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2025-05-31 22:53:36] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:36] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2025-05-31 22:53:36] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:53:36] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:36] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2025-05-31 22:53:36] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:53:36] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:37] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:37] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:37] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:37] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:37] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:37] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 9/181 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:37] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:37] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:53:37] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:37] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:53:37] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:53:38] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:38] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:38] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:38] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:38] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:38] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:38] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:38] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:38] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:53:38] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:38] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:38] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:39] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2025-05-31 22:53:39] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:39] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:39] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:53:39] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:39] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:53:39] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:39] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:53:39] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:39] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:39] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:40] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:53:40] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:40] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:40] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:40] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:40] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:53:40] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:40] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 2 ms to minimize.
[2025-05-31 22:53:40] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:40] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:40] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:40] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:41] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:41] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:53:41] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 2 ms to minimize.
[2025-05-31 22:53:41] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:53:41] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:41] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:41] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:53:41] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:53:41] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:41] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:41] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:42] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:42] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:53:42] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2025-05-31 22:53:42] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:53:42] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:42] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:42] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:53:42] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:53:42] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:42] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:42] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:53:42] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2025-05-31 22:53:43] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:43] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:43] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:53:43] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:43] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/215 variables, 8/249 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:43] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2025-05-31 22:53:43] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:53:43] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:43] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:43] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:44] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:53:44] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:44] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:44] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:44] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
[2025-05-31 22:53:44] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:53:44] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:44] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/215 variables, 13/262 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:44] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2025-05-31 22:53:44] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:45] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:45] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:45] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:53:45] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:45] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:53:45] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:45] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:45] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:53:45] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:45] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:45] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:46] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:46] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:46] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:46] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:46] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:53:46] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:46] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/215 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:46] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:46] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:46] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:53:46] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:53:46] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:46] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:47] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:47] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:47] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:53:47] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:47] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:47] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:53:47] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:47] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:47] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:47] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:53:47] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:53:47] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:53:48] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:48] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/215 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:48] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:53:48] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:48] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:48] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:53:48] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:48] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:48] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:48] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:48] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:49] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:53:49] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 2 ms to minimize.
[2025-05-31 22:53:49] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 13 ms to minimize.
[2025-05-31 22:53:49] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:53:49] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:49] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:49] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:49] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:49] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:49] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:53:49] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/215 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:50] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2025-05-31 22:53:50] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:53:50] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:53:50] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:50] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:50] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:50] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:50] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:50] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:50] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:53:50] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:51] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:53:51] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:53:51] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:53:51] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:53:51] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2025-05-31 22:53:51] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:51] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2025-05-31 22:53:51] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:51] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/215 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:51] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:53:51] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:53:51] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:52] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:52] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:52] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:52] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:53:52] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:52] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:52] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:52] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:53:52] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:52] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:52] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:53:52] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:53] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:53:53] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:53] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:53:53] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:53] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/215 variables, 20/362 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:53] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:53:53] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:53] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:53] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:53] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:53:53] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:53:53] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:53:54] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:54] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:53:54] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:54] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:54] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:54] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:53:54] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:54] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:54] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2025-05-31 22:53:54] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:53:54] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:54] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:55] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/215 variables, 20/382 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:55] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:53:55] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:55] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:55] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:55] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:53:55] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:53:55] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:53:55] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:55] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:53:56] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:53:56] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:56] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:53:56] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:53:56] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:53:56] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 2 ms to minimize.
[2025-05-31 22:53:56] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:53:56] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:56] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:56] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:53:56] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/215 variables, 20/402 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:56] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2025-05-31 22:53:57] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:53:57] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:53:57] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:57] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:53:57] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:53:57] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:53:57] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:57] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:57] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:53:57] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:57] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:58] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:53:58] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:58] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:58] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:53:58] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:53:58] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:58] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:53:58] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/215 variables, 20/422 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:53:59] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2025-05-31 22:53:59] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:53:59] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:59] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:59] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2025-05-31 22:53:59] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:53:59] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:53:59] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-05-31 22:53:59] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:59] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:53:59] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:53:59] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:54:00] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:00] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2025-05-31 22:54:00] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:54:00] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:00] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:54:00] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:00] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:00] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/215 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:00] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:54:01] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:54:01] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:01] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:01] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:01] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:54:01] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:54:01] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:54:01] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:01] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:01] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:01] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:54:01] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:54:02] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:54:02] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:54:02] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 2 ms to minimize.
[2025-05-31 22:54:02] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:54:02] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:54:02] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:02] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/215 variables, 20/462 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:02] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2025-05-31 22:54:02] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:03] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:03] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:03] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:03] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:54:03] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:54:03] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:54:03] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:03] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:54:03] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 2 ms to minimize.
[2025-05-31 22:54:03] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:03] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:03] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/215 variables, 14/476 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:04] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:54:04] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:04] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:04] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:04] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:04] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
[2025-05-31 22:54:04] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:54:04] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 1 ms to minimize.
[2025-05-31 22:54:04] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:04] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:05] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:05] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:05] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:54:05] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:05] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:05] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:05] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:05] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:54:05] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:54:05] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/215 variables, 20/496 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/215 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 30 (OVERLAPS) 2/217 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:06] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:54:06] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:06] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:06] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:06] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:54:06] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2025-05-31 22:54:07] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:54:07] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:07] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:07] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:07] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:07] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:54:07] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:07] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:07] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:07] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:07] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:07] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:08] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:08] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/217 variables, 20/517 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:08] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:08] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:54:08] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:08] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:08] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:54:08] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:08] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:08] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:09] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:09] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:54:09] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:09] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:09] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:09] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:09] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:09] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:09] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:54:09] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:09] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:54:09] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/217 variables, 20/537 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:10] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:54:10] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:54:10] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:10] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:10] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:10] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:10] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:10] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:11] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:54:11] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:11] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:11] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:54:11] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:11] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:11] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:11] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:54:11] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:11] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:54:11] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:11] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/217 variables, 20/557 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:12] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:12] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:12] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:12] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:12] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:54:12] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:12] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:12] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2025-05-31 22:54:12] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:54:12] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:12] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2025-05-31 22:54:12] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:13] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:13] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:13] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:13] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:13] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:13] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:13] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:13] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/217 variables, 20/577 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/217 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 36 (OVERLAPS) 224/441 variables, 217/794 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/441 variables, 33/827 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/441 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 39 (OVERLAPS) 5/446 variables, 5/832 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/446 variables, 2/834 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/446 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 42 (OVERLAPS) 0/446 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 834 constraints, problems are : Problem set: 0 solved, 16 unsolved in 54046 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 222/222 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 544/544 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 125/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:18] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 81/215 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 527/561 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:19] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:54:19] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:54:19] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:54:19] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:54:19] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 2 ms to minimize.
[2025-05-31 22:54:19] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:54:19] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:19] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:19] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:19] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:20] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:20] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:20] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:20] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:20] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:54:20] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:20] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:20] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:54:20] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:20] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 20/581 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 2/217 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 16/598 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:21] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2025-05-31 22:54:21] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:54:21] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:54:21] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:54:21] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:54:21] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:22] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:22] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:54:22] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:22] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:22] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:54:22] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:22] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:22] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:22] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:54:22] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:22] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:54:23] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2025-05-31 22:54:23] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:23] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:23] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:23] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:23] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:23] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:54:23] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:23] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:23] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:54:24] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:24] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:24] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:24] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:24] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:24] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:24] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:24] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:24] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:54:24] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:54:24] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:24] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:25] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 20/638 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:25] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2025-05-31 22:54:25] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:25] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:25] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:54:25] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:25] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:25] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:54:25] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:25] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:26] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:26] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:26] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:54:26] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:26] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:26] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:26] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:54:26] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 2 ms to minimize.
[2025-05-31 22:54:26] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:26] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:26] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 20/658 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:27] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:54:27] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:27] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:27] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:54:27] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:27] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:27] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:27] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 8/666 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:27] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:54:28] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:28] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:28] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:54:28] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:28] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:54:28] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:28] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:28] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:28] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:54:28] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:54:28] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:28] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:54:29] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:29] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:54:29] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:54:29] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:54:29] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2025-05-31 22:54:29] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2025-05-31 22:54:29] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 20/686 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:29] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:29] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:30] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:30] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:54:30] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:30] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:54:30] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:54:30] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:54:30] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:30] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:54:30] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:54:30] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:30] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:30] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:54:31] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:31] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:31] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:31] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:54:31] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:54:31] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/217 variables, 20/706 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:31] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:54:31] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:54:31] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:31] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:31] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:32] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:54:32] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:32] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:32] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:32] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:32] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:32] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:32] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:32] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:32] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:32] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:54:32] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:33] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:33] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:33] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/217 variables, 20/726 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:33] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:54:33] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:33] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:33] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:33] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:33] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:34] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:34] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:34] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:34] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:34] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:34] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:34] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:34] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:54:34] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:34] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:34] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:34] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:35] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:35] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 20/746 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:35] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:35] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:54:35] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:35] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:54:35] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:54:35] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:35] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:36] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:36] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:36] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/217 variables, 10/756 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:36] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2025-05-31 22:54:36] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:36] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:36] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:54:37] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:37] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:54:37] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:54:37] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:54:37] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:54:37] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:54:37] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:37] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:54:37] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:37] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:54:37] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:54:38] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:38] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:54:38] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:38] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:54:38] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/217 variables, 20/776 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:38] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:54:38] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:54:38] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:54:38] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:54:38] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:54:38] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:54:39] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:54:39] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:54:39] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 2 ms to minimize.
[2025-05-31 22:54:39] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:54:39] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:39] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 2 ms to minimize.
[2025-05-31 22:54:39] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/217 variables, 13/789 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/217 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (OVERLAPS) 224/441 variables, 217/1006 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/441 variables, 33/1039 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/441 variables, 16/1055 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:50] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:50] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:54:50] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:50] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:54:50] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 1 ms to minimize.
[2025-05-31 22:54:50] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:54:51] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/441 variables, 7/1062 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/441 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 28 (OVERLAPS) 5/446 variables, 5/1067 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/446 variables, 2/1069 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/446 variables, 0/1069 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-31 22:54:57] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:54:57] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:54:57] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 2 ms to minimize.
At refinement iteration 31 (OVERLAPS) 0/446 variables, 3/1072 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/446 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 33 (OVERLAPS) 0/446 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 1072 constraints, problems are : Problem set: 0 solved, 16 unsolved in 44999 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 222/222 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 766/766 constraints]
After SMT, in 99065ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 16453 ms.
Support contains 9 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 224/224 transitions.
Applied a total of 0 rules in 6 ms. Remains 222 /222 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 222/222 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 222 /222 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2025-05-31 22:55:19] [INFO ] Invariant cache hit.
[2025-05-31 22:55:20] [INFO ] Implicit Places using invariants in 184 ms returned [42, 47, 219]
[2025-05-31 22:55:20] [INFO ] Actually due to overlaps returned [219]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 188 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 221/222 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 223
Applied a total of 2 rules in 12 ms. Remains 220 /221 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 220 cols
[2025-05-31 22:55:20] [INFO ] Computed 34 invariants in 13 ms
[2025-05-31 22:55:20] [INFO ] Implicit Places using invariants in 170 ms returned [42, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 171 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 218/222 places, 223/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 222
Applied a total of 2 rules in 10 ms. Remains 217 /218 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 217 cols
[2025-05-31 22:55:20] [INFO ] Computed 32 invariants in 13 ms
[2025-05-31 22:55:20] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-05-31 22:55:20] [INFO ] Invariant cache hit.
[2025-05-31 22:55:20] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-05-31 22:55:21] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 217/222 places, 222/224 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1633 ms. Remains : 217/222 places, 222/224 transitions.
FORMULA DoubleExponent-PT-010-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-010-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-010-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-010-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-010-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 5 queries.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, +inf, 1, 1, 1, 1, 5]
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 233 rows 232 cols
[2025-05-31 22:55:21] [INFO ] Computed 35 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1434 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (928 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 22:55:21] [INFO ] Invariant cache hit.
[2025-05-31 22:55:21] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:55:21] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:55:21] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-05-31 22:55:21] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-31 22:55:21] [INFO ] [Real]Added 31 Read/Feed constraints in 103 ms returned sat
[2025-05-31 22:55:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:55:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:55:21] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:55:22] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2025-05-31 22:55:22] [INFO ] [Nat]Added 31 Read/Feed constraints in 93 ms returned sat
[2025-05-31 22:55:22] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 14 ms.
[2025-05-31 22:55:24] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:55:24] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:55:24] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2025-05-31 22:55:24] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:55:24] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:55:24] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:55:24] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:55:24] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:55:25] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:55:25] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:55:25] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:55:25] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:55:25] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:55:25] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2025-05-31 22:55:25] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:55:25] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:55:25] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:55:25] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2025-05-31 22:55:26] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:55:26] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:55:26] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 2 ms to minimize.
[2025-05-31 22:55:26] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:55:26] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2228 ms
[2025-05-31 22:55:26] [INFO ] Added : 206 causal constraints over 42 iterations in 4266 ms. Result :sat
Minimization took 476 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 232 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p399) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 232/232 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 229
Reduce places removed 3 places and 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 228 transition count 227
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 227 transition count 223
Reduce places removed 4 places and 12 transitions.
Graph (complete) has 802 edges and 223 vertex of which 221 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 5 rules applied. Total rules applied 11 place count 221 transition count 211
Reduce places removed 7 places and 9 transitions.
Graph (complete) has 765 edges and 214 vertex of which 209 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 9 rules applied. Total rules applied 20 place count 209 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 21 place count 208 transition count 201
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 31 transitions.
Iterating global reduction 6 with 41 rules applied. Total rules applied 62 place count 173 transition count 164
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 66 place count 169 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 68 place count 168 transition count 164
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 69 place count 168 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 70 place count 167 transition count 163
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 78 place count 167 transition count 156
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 86 place count 159 transition count 156
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 87 place count 159 transition count 156
Applied a total of 87 rules in 27 ms. Remains 159 /232 variables (removed 73) and now considering 156/232 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 159/232 places, 156/232 transitions.
// Phase 1: matrix 156 rows 159 cols
[2025-05-31 22:55:26] [INFO ] Computed 28 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144300 resets) in 674 ms. (1481 steps per ms)
BEST_FIRST walk for 1000001 steps (91511 resets) in 473 ms. (2109 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 22:55:28] [INFO ] Invariant cache hit.
[2025-05-31 22:55:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:55:28] [INFO ] [Real]Absence check using 4 positive and 24 generalized place invariants in 4 ms returned sat
[2025-05-31 22:55:28] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-05-31 22:55:28] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-31 22:55:28] [INFO ] [Real]Added 31 Read/Feed constraints in 37 ms returned sat
[2025-05-31 22:55:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:55:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:55:28] [INFO ] [Nat]Absence check using 4 positive and 24 generalized place invariants in 3 ms returned sat
[2025-05-31 22:55:28] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2025-05-31 22:55:28] [INFO ] [Nat]Added 31 Read/Feed constraints in 39 ms returned sat
[2025-05-31 22:55:28] [INFO ] Computed and/alt/rep : 126/766/126 causal constraints (skipped 29 transitions) in 10 ms.
[2025-05-31 22:55:29] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2025-05-31 22:55:29] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:55:29] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:55:29] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2025-05-31 22:55:29] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2025-05-31 22:55:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 320 ms
[2025-05-31 22:55:29] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2025-05-31 22:55:29] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2025-05-31 22:55:29] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2025-05-31 22:55:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 163 ms
[2025-05-31 22:55:29] [INFO ] Added : 95 causal constraints over 20 iterations in 1029 ms. Result :sat
Minimization took 237 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 159/159 places, 156/156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-05-31 22:55:30] [INFO ] Invariant cache hit.
[2025-05-31 22:55:30] [INFO ] Implicit Places using invariants in 150 ms returned [42, 47, 122, 125, 156]
[2025-05-31 22:55:30] [INFO ] Actually due to overlaps returned [156, 125]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 166 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 157/159 places, 156/156 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 155
Applied a total of 2 rules in 5 ms. Remains 156 /157 variables (removed 1) and now considering 155/156 (removed 1) transitions.
// Phase 1: matrix 155 rows 156 cols
[2025-05-31 22:55:30] [INFO ] Computed 26 invariants in 5 ms
[2025-05-31 22:55:30] [INFO ] Implicit Places using invariants in 110 ms returned [42, 47, 122]
[2025-05-31 22:55:30] [INFO ] Actually due to overlaps returned [47, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 122 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 154/159 places, 155/156 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 154 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 154
Applied a total of 2 rules in 5 ms. Remains 153 /154 variables (removed 1) and now considering 154/155 (removed 1) transitions.
// Phase 1: matrix 154 rows 153 cols
[2025-05-31 22:55:30] [INFO ] Computed 24 invariants in 4 ms
[2025-05-31 22:55:30] [INFO ] Implicit Places using invariants in 95 ms returned [119]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 152/159 places, 154/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 400 ms. Remains : 152/159 places, 154/156 transitions.
// Phase 1: matrix 154 rows 152 cols
[2025-05-31 22:55:30] [INFO ] Computed 23 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144426 resets) in 623 ms. (1602 steps per ms)
BEST_FIRST walk for 1000000 steps (91584 resets) in 445 ms. (2242 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 22:55:31] [INFO ] Invariant cache hit.
[2025-05-31 22:55:31] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-31 22:55:31] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 2 ms returned sat
[2025-05-31 22:55:31] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2025-05-31 22:55:31] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-05-31 22:55:31] [INFO ] [Real]Added 29 Read/Feed constraints in 33 ms returned sat
[2025-05-31 22:55:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:55:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-05-31 22:55:31] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 1 ms returned sat
[2025-05-31 22:55:31] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-05-31 22:55:32] [INFO ] [Nat]Added 29 Read/Feed constraints in 59 ms returned sat
[2025-05-31 22:55:32] [INFO ] Computed and/alt/rep : 126/773/126 causal constraints (skipped 27 transitions) in 11 ms.
[2025-05-31 22:55:32] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2025-05-31 22:55:32] [INFO ] Added : 110 causal constraints over 24 iterations in 642 ms. Result :sat
Minimization took 269 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 154/154 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 152/152 places, 154/154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 154/154 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2025-05-31 22:55:33] [INFO ] Invariant cache hit.
[2025-05-31 22:55:33] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-05-31 22:55:33] [INFO ] Invariant cache hit.
[2025-05-31 22:55:33] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-05-31 22:55:34] [INFO ] Implicit Places using invariants and state equation in 524 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 616 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/152 places, 154/154 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 150 transition count 153
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 149 transition count 152
Applied a total of 4 rules in 13 ms. Remains 149 /151 variables (removed 2) and now considering 152/154 (removed 2) transitions.
// Phase 1: matrix 152 rows 149 cols
[2025-05-31 22:55:34] [INFO ] Computed 23 invariants in 3 ms
[2025-05-31 22:55:34] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-31 22:55:34] [INFO ] Invariant cache hit.
[2025-05-31 22:55:34] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-31 22:55:34] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 149/152 places, 152/154 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1267 ms. Remains : 149/152 places, 152/154 transitions.
[2025-05-31 22:55:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143959 resets) in 628 ms. (1589 steps per ms)
BEST_FIRST walk for 1000000 steps (91181 resets) in 457 ms. (2183 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 22:55:35] [INFO ] Invariant cache hit.
[2025-05-31 22:55:36] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-31 22:55:36] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2025-05-31 22:55:36] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-05-31 22:55:36] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-31 22:55:36] [INFO ] [Real]Added 32 Read/Feed constraints in 20 ms returned sat
[2025-05-31 22:55:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:55:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-31 22:55:36] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 2 ms returned sat
[2025-05-31 22:55:36] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-05-31 22:55:36] [INFO ] [Nat]Added 32 Read/Feed constraints in 38 ms returned sat
[2025-05-31 22:55:36] [INFO ] Computed and/alt/rep : 124/761/124 causal constraints (skipped 27 transitions) in 13 ms.
[2025-05-31 22:55:36] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:55:37] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:55:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2025-05-31 22:55:37] [INFO ] Added : 106 causal constraints over 23 iterations in 819 ms. Result :sat
Minimization took 267 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 152/152 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 149/149 places, 152/152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 152/152 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2025-05-31 22:55:37] [INFO ] Invariant cache hit.
[2025-05-31 22:55:38] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-05-31 22:55:38] [INFO ] Invariant cache hit.
[2025-05-31 22:55:38] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-31 22:55:38] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2025-05-31 22:55:38] [INFO ] Redundant transitions in 4 ms returned []
Running 151 sub problems to find dead transitions.
[2025-05-31 22:55:38] [INFO ] Invariant cache hit.
[2025-05-31 22:55:38] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 2/149 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:55:39] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:55:40] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:55:40] [INFO ] Deduced a trap composed of 62 places in 41 ms of which 0 ms to minimize.
[2025-05-31 22:55:40] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:55:40] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:55:40] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:55:40] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:55:40] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:55:40] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:55:40] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:55:40] [INFO ] Deduced a trap composed of 63 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:55:40] [INFO ] Deduced a trap composed of 68 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:55:41] [INFO ] Deduced a trap composed of 62 places in 43 ms of which 0 ms to minimize.
[2025-05-31 22:55:41] [INFO ] Deduced a trap composed of 66 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:55:41] [INFO ] Deduced a trap composed of 62 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:55:41] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:55:41] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:55:41] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:55:41] [INFO ] Deduced a trap composed of 67 places in 42 ms of which 0 ms to minimize.
[2025-05-31 22:55:41] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:55:41] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2025-05-31 22:55:41] [INFO ] Deduced a trap composed of 69 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:55:42] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 152/301 variables, 149/195 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 32/227 constraints. Problems are: Problem set: 0 solved, 151 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/301 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 227 constraints, problems are : Problem set: 0 solved, 151 unsolved in 7907 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 149/149 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 2/149 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:55:47] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:55:47] [INFO ] Deduced a trap composed of 62 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:55:47] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:55:47] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:55:47] [INFO ] Deduced a trap composed of 70 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:55:47] [INFO ] Deduced a trap composed of 62 places in 39 ms of which 0 ms to minimize.
[2025-05-31 22:55:47] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:55:48] [INFO ] Deduced a trap composed of 69 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:55:48] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:55:48] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:55:48] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:55:48] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:55:48] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:55:48] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:55:48] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:55:48] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:55:48] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:55:48] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:55:49] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 0 ms to minimize.
[2025-05-31 22:55:49] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:55:49] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:55:49] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 0 ms to minimize.
[2025-05-31 22:55:49] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:55:50] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:55:50] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2025-05-31 22:55:50] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:55:50] [INFO ] Deduced a trap composed of 71 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:55:50] [INFO ] Deduced a trap composed of 69 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:55:50] [INFO ] Deduced a trap composed of 69 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:55:50] [INFO ] Deduced a trap composed of 67 places in 36 ms of which 1 ms to minimize.
[2025-05-31 22:55:50] [INFO ] Deduced a trap composed of 65 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:55:50] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:55:50] [INFO ] Deduced a trap composed of 65 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:55:50] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2025-05-31 22:55:50] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 0 ms to minimize.
[2025-05-31 22:55:51] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2025-05-31 22:55:51] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2025-05-31 22:55:51] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:55:51] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2025-05-31 22:55:51] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:55:51] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:55:51] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 19/88 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:55:51] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2025-05-31 22:55:51] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 0 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:55:53] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:55:53] [INFO ] Deduced a trap composed of 61 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:55:54] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:55:54] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:55:54] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:55:54] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:55:55] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 0 ms to minimize.
[2025-05-31 22:55:55] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:55:55] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:55:55] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:55:55] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:55:56] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2025-05-31 22:55:56] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:55:56] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:55:56] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:55:57] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:55:58] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:55:58] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 0 ms to minimize.
[2025-05-31 22:55:58] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 0 ms to minimize.
[2025-05-31 22:55:58] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:55:58] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:55:59] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2025-05-31 22:55:59] [INFO ] Deduced a trap composed of 62 places in 39 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/149 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:00] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/149 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/149 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 19 (OVERLAPS) 152/301 variables, 149/298 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/301 variables, 32/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/301 variables, 151/481 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/301 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 23 (OVERLAPS) 0/301 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 481 constraints, problems are : Problem set: 0 solved, 151 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 149/149 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 126/126 constraints]
After SMT, in 37975ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 37980ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38628 ms. Remains : 149/149 places, 152/152 transitions.
[2025-05-31 22:56:16] [INFO ] Flatten gal took : 13 ms
[2025-05-31 22:56:16] [INFO ] Flatten gal took : 13 ms
RANDOM walk for 40000 steps (5785 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
[2025-05-31 22:56:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3866594379690921814.gal : 14 ms
[2025-05-31 22:56:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9038369811713449460.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3866594379690921814.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9038369811713449460.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40000 steps (3690 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality9038369811713449460.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 27
BEST_FIRST walk for 40000 steps (3662 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :27 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 168
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :168 after 261
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :261 after 743
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :743 after 6443
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6443 after 24094
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :24094 after 43864
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :43864 after 122858
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :122858 after 264910
Interrupted probabilistic random walk after 493620 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 2
Probabilistic random walk after 493620 steps, saw 247066 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
[2025-05-31 22:56:19] [INFO ] Invariant cache hit.
[2025-05-31 22:56:19] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 42/144 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 22:56:19] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:56:20] [INFO ] Deduced a trap composed of 9 places in 338 ms of which 1 ms to minimize.
[2025-05-31 22:56:20] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
[2025-05-31 22:56:20] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
SDD size :264910 after 577058
[2025-05-31 22:56:20] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:56:20] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 151/295 variables, 144/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 31/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/301 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/301 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 843 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 149/149 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 22:56:20] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 42/144 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 151/295 variables, 144/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 31/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/301 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/301 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 149/149 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 1117ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 773 ms.
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 152/152 transitions.
Applied a total of 0 rules in 11 ms. Remains 149 /149 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Running 151 sub problems to find dead transitions.
[2025-05-31 22:56:21] [INFO ] Invariant cache hit.
[2025-05-31 22:56:21] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 2/149 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:23] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:56:23] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:56:23] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:56:23] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:56:23] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:56:23] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:56:23] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:56:23] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:56:23] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 0 ms to minimize.
[2025-05-31 22:56:23] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 0 ms to minimize.
[2025-05-31 22:56:23] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 0 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :577058 after 9.99434e+06
[2025-05-31 22:56:24] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:56:24] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:56:24] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:56:24] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:24] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:56:24] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:56:24] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:56:24] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:56:25] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:56:25] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:56:25] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:56:25] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 152/301 variables, 149/195 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 32/227 constraints. Problems are: Problem set: 0 solved, 151 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/301 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 227 constraints, problems are : Problem set: 0 solved, 151 unsolved in 8022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 149/149 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 2/149 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:30] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:56:30] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:56:30] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:56:30] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:56:31] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:56:31] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:56:31] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:56:31] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:56:31] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:31] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:56:31] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:56:31] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :9.99434e+06 after 4.84081e+07
[2025-05-31 22:56:31] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 0 ms to minimize.
[2025-05-31 22:56:31] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:56:31] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:56:31] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:56:31] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:56:32] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:32] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:56:32] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 0 ms to minimize.
[2025-05-31 22:56:32] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:56:32] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:56:33] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:33] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-05-31 22:56:33] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2025-05-31 22:56:33] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 0 ms to minimize.
[2025-05-31 22:56:33] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 0 ms to minimize.
[2025-05-31 22:56:33] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:56:33] [INFO ] Deduced a trap composed of 69 places in 38 ms of which 0 ms to minimize.
[2025-05-31 22:56:33] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:56:33] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 0 ms to minimize.
[2025-05-31 22:56:33] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 0 ms to minimize.
[2025-05-31 22:56:34] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2025-05-31 22:56:34] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2025-05-31 22:56:34] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:56:34] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:56:34] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2025-05-31 22:56:34] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2025-05-31 22:56:34] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2025-05-31 22:56:34] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:56:34] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:56:34] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 19/88 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:35] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:56:35] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2025-05-31 22:56:35] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 0 ms to minimize.
[2025-05-31 22:56:35] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:56:35] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:56:35] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:56:35] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2025-05-31 22:56:35] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2025-05-31 22:56:35] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:56:35] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:56:36] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2025-05-31 22:56:36] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:56:36] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:56:36] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:56:36] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:56:36] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:56:36] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:56:36] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:56:36] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:56:36] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:37] [INFO ] Deduced a trap composed of 63 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:56:37] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:37] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 0 ms to minimize.
[2025-05-31 22:56:37] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 0 ms to minimize.
[2025-05-31 22:56:37] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:56:38] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:38] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:56:38] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:56:38] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:56:38] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:39] [INFO ] Deduced a trap composed of 67 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:56:39] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:56:39] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:40] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:56:40] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2025-05-31 22:56:40] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:56:40] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:56:40] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 0 ms to minimize.
[2025-05-31 22:56:40] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:56:40] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:56:40] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 0 ms to minimize.
[2025-05-31 22:56:41] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:56:41] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2025-05-31 22:56:41] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:56:41] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:56:41] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:56:41] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:56:41] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:56:41] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:56:41] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2025-05-31 22:56:41] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:56:41] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:56:41] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:42] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:56:42] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 0 ms to minimize.
[2025-05-31 22:56:42] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:56:42] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:56:42] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:43] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2025-05-31 22:56:43] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/149 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:44] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/149 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/149 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 19 (OVERLAPS) 152/301 variables, 149/298 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/301 variables, 32/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :4.84081e+07 after 1.36601e+08
At refinement iteration 21 (INCLUDED_ONLY) 0/301 variables, 151/481 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 481 constraints, problems are : Problem set: 0 solved, 151 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 149/149 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 126/126 constraints]
After SMT, in 28096ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 28111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28123 ms. Remains : 149/149 places, 152/152 transitions.
RANDOM walk for 40000 steps (5650 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3640 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3673 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 554785 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 2
Probabilistic random walk after 554785 steps, saw 277651 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2025-05-31 22:56:52] [INFO ] Invariant cache hit.
[2025-05-31 22:56:52] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 42/144 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 22:56:52] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:56:53] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:56:53] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:56:53] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:56:53] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:56:53] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 151/295 variables, 144/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 31/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/301 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/301 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 149/149 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 22:56:53] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 42/144 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 151/295 variables, 144/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 31/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/301 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/301 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 149/149 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 821ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1485 ms.
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 152/152 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 149/149 places, 152/152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 152/152 transitions.
Applied a total of 0 rules in 20 ms. Remains 149 /149 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2025-05-31 22:56:55] [INFO ] Invariant cache hit.
[2025-05-31 22:56:55] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-05-31 22:56:55] [INFO ] Invariant cache hit.
[2025-05-31 22:56:55] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-31 22:56:55] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2025-05-31 22:56:55] [INFO ] Redundant transitions in 2 ms returned []
Running 151 sub problems to find dead transitions.
[2025-05-31 22:56:55] [INFO ] Invariant cache hit.
[2025-05-31 22:56:55] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 2/149 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:57] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2025-05-31 22:56:57] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:56:57] [INFO ] Deduced a trap composed of 62 places in 45 ms of which 0 ms to minimize.
[2025-05-31 22:56:57] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:56:57] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:56:57] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:56:57] [INFO ] Deduced a trap composed of 62 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:56:57] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:56:57] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:56:57] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:56:57] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:56:58] [INFO ] Deduced a trap composed of 68 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:56:58] [INFO ] Deduced a trap composed of 62 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:56:58] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 0 ms to minimize.
[2025-05-31 22:56:58] [INFO ] Deduced a trap composed of 62 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:56:58] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:56:58] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:56:58] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:56:58] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:56:58] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:56:58] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:56:59] [INFO ] Deduced a trap composed of 69 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:56:59] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 152/301 variables, 149/195 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 32/227 constraints. Problems are: Problem set: 0 solved, 151 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/301 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 227 constraints, problems are : Problem set: 0 solved, 151 unsolved in 7600 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 149/149 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 2/149 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:57:04] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:57:04] [INFO ] Deduced a trap composed of 62 places in 45 ms of which 0 ms to minimize.
[2025-05-31 22:57:04] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:57:04] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:57:04] [INFO ] Deduced a trap composed of 70 places in 47 ms of which 0 ms to minimize.
[2025-05-31 22:57:04] [INFO ] Deduced a trap composed of 62 places in 37 ms of which 1 ms to minimize.
[2025-05-31 22:57:04] [INFO ] Deduced a trap composed of 63 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:57:04] [INFO ] Deduced a trap composed of 69 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:57:04] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:57:05] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:57:05] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 1 ms to minimize.
[2025-05-31 22:57:05] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:57:05] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:57:05] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:57:05] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:57:05] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:57:05] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:57:05] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:57:06] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:57:06] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:57:06] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2025-05-31 22:57:06] [INFO ] Deduced a trap composed of 65 places in 37 ms of which 1 ms to minimize.
[2025-05-31 22:57:06] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 0 ms to minimize.
Detected timeout of ITS tools.
[2025-05-31 22:57:06] [INFO ] Flatten gal took : 12 ms
[2025-05-31 22:57:06] [INFO ] Applying decomposition
[2025-05-31 22:57:06] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10457714821333996686.txt' '-o' '/tmp/graph10457714821333996686.bin' '-w' '/tmp/graph10457714821333996686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10457714821333996686.bin' '-l' '-1' '-v' '-w' '/tmp/graph10457714821333996686.weights' '-q' '0' '-e' '0.001'
[2025-05-31 22:57:06] [INFO ] Decomposing Gal with order
[2025-05-31 22:57:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 22:57:06] [INFO ] Removed a total of 82 redundant transitions.
[2025-05-31 22:57:06] [INFO ] Flatten gal took : 28 ms
[2025-05-31 22:57:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 8 ms.
[2025-05-31 22:57:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16296165730227710658.gal : 6 ms
[2025-05-31 22:57:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13770620452917803828.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16296165730227710658.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13770620452917803828.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13770620452917803828.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :17 after 23
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:57:07] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2025-05-31 22:57:07] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1142 after 1146
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1146 after 1173
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1173 after 1302
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1302 after 1898
[2025-05-31 22:57:07] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:57:07] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:57:07] [INFO ] Deduced a trap composed of 69 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:57:07] [INFO ] Deduced a trap composed of 69 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:57:07] [INFO ] Deduced a trap composed of 67 places in 39 ms of which 0 ms to minimize.
[2025-05-31 22:57:07] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:57:07] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 0 ms to minimize.
[2025-05-31 22:57:07] [INFO ] Deduced a trap composed of 65 places in 38 ms of which 0 ms to minimize.
[2025-05-31 22:57:07] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :45005 after 45023
[2025-05-31 22:57:07] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:57:07] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:57:08] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2025-05-31 22:57:08] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:57:08] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2025-05-31 22:57:08] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 0 ms to minimize.
[2025-05-31 22:57:08] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:57:08] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 19/88 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:57:08] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :88886 after 89055
[2025-05-31 22:57:08] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 0 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:57:09] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:57:10] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:57:10] [INFO ] Deduced a trap composed of 61 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 151 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :176869 after 177677
[2025-05-31 22:57:11] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:57:11] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2025-05-31 22:57:11] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:57:11] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:57:11] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2025-05-31 22:57:12] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:57:12] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:57:12] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:57:12] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 0 ms to minimize.
[2025-05-31 22:57:13] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:57:13] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:57:13] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 0 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2025-05-31 22:57:15] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:57:15] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:57:15] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:57:15] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:57:15] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:57:15] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:57:15] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 3 ms to minimize.
[2025-05-31 22:57:15] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:57:16] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:57:16] [INFO ] Deduced a trap composed of 62 places in 44 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/149 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2025-05-31 22:57:17] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :355690 after 357637
At refinement iteration 17 (INCLUDED_ONLY) 0/149 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/149 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 19 (OVERLAPS) 152/301 variables, 149/298 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/301 variables, 32/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/301 variables, 151/481 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/301 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 23 (OVERLAPS) 0/301 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 481 constraints, problems are : Problem set: 0 solved, 151 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 149/149 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 126/126 constraints]
After SMT, in 37668ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 37671ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38324 ms. Remains : 149/149 places, 152/152 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 149 transition count 139
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 136 transition count 139
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 129 transition count 132
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 129 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 128 transition count 131
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 128 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 44 place count 127 transition count 130
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 127 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 126 transition count 129
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 126 transition count 129
Applied a total of 47 rules in 19 ms. Remains 126 /149 variables (removed 23) and now considering 129/152 (removed 23) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 129 rows 126 cols
[2025-05-31 22:57:33] [INFO ] Computed 23 invariants in 2 ms
[2025-05-31 22:57:33] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-05-31 22:57:33] [INFO ] [Real]Absence check using 3 positive and 20 generalized place invariants in 5 ms returned sat
[2025-05-31 22:57:33] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-31 22:57:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 22:57:33] [INFO ] After 10ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 22:57:33] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 22:57:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 22:57:33] [INFO ] [Nat]Absence check using 3 positive and 20 generalized place invariants in 5 ms returned sat
[2025-05-31 22:57:33] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-31 22:57:33] [INFO ] After 9ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 22:57:33] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2025-05-31 22:57:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 1
[2025-05-31 22:57:33] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 22:57:33] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 22:57:33] [INFO ] Flatten gal took : 10 ms
[2025-05-31 22:57:33] [INFO ] Flatten gal took : 8 ms
[2025-05-31 22:57:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality434528842066254119.gal : 2 ms
[2025-05-31 22:57:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9149431867999677090.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality434528842066254119.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9149431867999677090.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality9149431867999677090.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :370 after 1262
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1262 after 3495
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3495 after 10150
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10150 after 21830
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :21830 after 49483
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :49483 after 106028
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :106028 after 224315
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :224315 after 465055
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :465055 after 953959
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :953959 after 1.94662e+06
Detected timeout of ITS tools.
[2025-05-31 22:57:48] [INFO ] Flatten gal took : 15 ms
[2025-05-31 22:57:48] [INFO ] Applying decomposition
[2025-05-31 22:57:48] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14827274319719742065.txt' '-o' '/tmp/graph14827274319719742065.bin' '-w' '/tmp/graph14827274319719742065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14827274319719742065.bin' '-l' '-1' '-v' '-w' '/tmp/graph14827274319719742065.weights' '-q' '0' '-e' '0.001'
[2025-05-31 22:57:48] [INFO ] Decomposing Gal with order
[2025-05-31 22:57:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 22:57:48] [INFO ] Removed a total of 81 redundant transitions.
[2025-05-31 22:57:48] [INFO ] Flatten gal took : 16 ms
[2025-05-31 22:57:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4 ms.
[2025-05-31 22:57:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13189761748447535906.gal : 2 ms
[2025-05-31 22:57:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4236518348488952385.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13189761748447535906.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4236518348488952385.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality4236518348488952385.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 21950
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :746796 after 760046
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30483 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-01 in 162432 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 233 rows 232 cols
[2025-05-31 22:58:04] [INFO ] Computed 35 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1467 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (883 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 22:58:04] [INFO ] Invariant cache hit.
[2025-05-31 22:58:04] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:58:04] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:58:04] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2025-05-31 22:58:04] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-31 22:58:04] [INFO ] [Real]Added 31 Read/Feed constraints in 119 ms returned sat
[2025-05-31 22:58:04] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 13 ms.
[2025-05-31 22:58:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:58:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 22:58:04] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 22:58:04] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-05-31 22:58:04] [INFO ] [Nat]Added 31 Read/Feed constraints in 149 ms returned sat
[2025-05-31 22:58:04] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 14 ms.
[2025-05-31 22:58:06] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:58:06] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2025-05-31 22:58:06] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:58:06] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2025-05-31 22:58:06] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:58:06] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:58:07] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:58:07] [INFO ] Deduced a trap composed of 97 places in 69 ms of which 2 ms to minimize.
[2025-05-31 22:58:07] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:58:07] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:58:07] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 2 ms to minimize.
[2025-05-31 22:58:07] [INFO ] Deduced a trap composed of 92 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:58:07] [INFO ] Deduced a trap composed of 95 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:58:07] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:58:07] [INFO ] Deduced a trap composed of 96 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:58:07] [INFO ] Deduced a trap composed of 94 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:58:07] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:58:08] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:58:08] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:58:08] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:58:08] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:58:08] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:58:08] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2025-05-31 22:58:08] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:58:08] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:58:08] [INFO ] Deduced a trap composed of 89 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:58:08] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 2 ms to minimize.
[2025-05-31 22:58:09] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:58:09] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:58:09] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
[2025-05-31 22:58:09] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:58:09] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
[2025-05-31 22:58:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 232 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p304) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 232/232 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 230 transition count 229
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 17 place count 223 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 222 transition count 222
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 222 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 221 transition count 221
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 31 place count 221 transition count 211
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 41 place count 211 transition count 211
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 211 transition count 211
Applied a total of 43 rules in 26 ms. Remains 211 /232 variables (removed 21) and now considering 211/232 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 211/232 places, 211/232 transitions.
// Phase 1: matrix 211 rows 211 cols
[2025-05-31 22:58:09] [INFO ] Computed 35 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144399 resets) in 689 ms. (1449 steps per ms)
BEST_FIRST walk for 1000000 steps (91294 resets) in 481 ms. (2074 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 22:58:10] [INFO ] Invariant cache hit.
[2025-05-31 22:58:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:58:10] [INFO ] [Real]Absence check using 4 positive and 31 generalized place invariants in 6 ms returned sat
[2025-05-31 22:58:10] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-05-31 22:58:10] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 22:58:10] [INFO ] [Real]Added 39 Read/Feed constraints in 30 ms returned sat
[2025-05-31 22:58:10] [INFO ] Computed and/alt/rep : 167/1038/167 causal constraints (skipped 43 transitions) in 12 ms.
[2025-05-31 22:58:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:58:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:58:10] [INFO ] [Nat]Absence check using 4 positive and 31 generalized place invariants in 6 ms returned sat
[2025-05-31 22:58:10] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-05-31 22:58:11] [INFO ] [Nat]Added 39 Read/Feed constraints in 100 ms returned sat
[2025-05-31 22:58:11] [INFO ] Computed and/alt/rep : 167/1038/167 causal constraints (skipped 43 transitions) in 11 ms.
[2025-05-31 22:58:11] [INFO ] Added : 68 causal constraints over 14 iterations in 390 ms. Result :sat
Minimization took 256 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 211/211 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 211/211 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 211/211 transitions.
Applied a total of 0 rules in 6 ms. Remains 211 /211 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2025-05-31 22:58:12] [INFO ] Invariant cache hit.
[2025-05-31 22:58:12] [INFO ] Implicit Places using invariants in 181 ms returned [42, 47, 136, 208]
[2025-05-31 22:58:12] [INFO ] Actually due to overlaps returned [208]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 210/211 places, 211/211 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 210
Applied a total of 2 rules in 9 ms. Remains 209 /210 variables (removed 1) and now considering 210/211 (removed 1) transitions.
// Phase 1: matrix 210 rows 209 cols
[2025-05-31 22:58:12] [INFO ] Computed 34 invariants in 9 ms
[2025-05-31 22:58:12] [INFO ] Implicit Places using invariants in 150 ms returned [42, 47, 136]
[2025-05-31 22:58:12] [INFO ] Actually due to overlaps returned [47, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 169 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/211 places, 210/211 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 209
Applied a total of 2 rules in 10 ms. Remains 206 /207 variables (removed 1) and now considering 209/210 (removed 1) transitions.
// Phase 1: matrix 209 rows 206 cols
[2025-05-31 22:58:12] [INFO ] Computed 32 invariants in 11 ms
[2025-05-31 22:58:12] [INFO ] Implicit Places using invariants in 144 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 157 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 205/211 places, 209/211 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 205 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 204 transition count 208
Applied a total of 2 rules in 8 ms. Remains 204 /205 variables (removed 1) and now considering 208/209 (removed 1) transitions.
// Phase 1: matrix 208 rows 204 cols
[2025-05-31 22:58:12] [INFO ] Computed 31 invariants in 12 ms
[2025-05-31 22:58:12] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-05-31 22:58:12] [INFO ] Invariant cache hit.
[2025-05-31 22:58:12] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 22:58:15] [INFO ] Implicit Places using invariants and state equation in 2249 ms returned [76, 81]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2441 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 202/211 places, 208/211 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 202 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 208
Applied a total of 4 rules in 10 ms. Remains 200 /202 variables (removed 2) and now considering 208/208 (removed 0) transitions.
// Phase 1: matrix 208 rows 200 cols
[2025-05-31 22:58:15] [INFO ] Computed 29 invariants in 11 ms
[2025-05-31 22:58:15] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-05-31 22:58:15] [INFO ] Invariant cache hit.
[2025-05-31 22:58:15] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 22:58:16] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 200/211 places, 208/211 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 4838 ms. Remains : 200/211 places, 208/211 transitions.
[2025-05-31 22:58:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143884 resets) in 672 ms. (1485 steps per ms)
BEST_FIRST walk for 1000000 steps (91804 resets) in 477 ms. (2092 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 22:58:18] [INFO ] Invariant cache hit.
[2025-05-31 22:58:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:58:18] [INFO ] [Real]Absence check using 2 positive and 27 generalized place invariants in 6 ms returned sat
[2025-05-31 22:58:18] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-05-31 22:58:18] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 22:58:18] [INFO ] [Real]Added 39 Read/Feed constraints in 68 ms returned sat
[2025-05-31 22:58:18] [INFO ] Computed and/alt/rep : 147/911/147 causal constraints (skipped 60 transitions) in 11 ms.
[2025-05-31 22:58:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:58:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:58:18] [INFO ] [Nat]Absence check using 2 positive and 27 generalized place invariants in 5 ms returned sat
[2025-05-31 22:58:18] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-05-31 22:58:18] [INFO ] [Nat]Added 39 Read/Feed constraints in 56 ms returned sat
[2025-05-31 22:58:18] [INFO ] Computed and/alt/rep : 147/911/147 causal constraints (skipped 60 transitions) in 10 ms.
[2025-05-31 22:58:19] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:58:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2025-05-31 22:58:19] [INFO ] Added : 86 causal constraints over 19 iterations in 668 ms. Result :sat
Minimization took 254 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 200/200 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-05-31 22:58:19] [INFO ] Invariant cache hit.
[2025-05-31 22:58:19] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-05-31 22:58:19] [INFO ] Invariant cache hit.
[2025-05-31 22:58:19] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 22:58:21] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 1818 ms to find 0 implicit places.
[2025-05-31 22:58:21] [INFO ] Redundant transitions in 2 ms returned []
Running 207 sub problems to find dead transitions.
[2025-05-31 22:58:21] [INFO ] Invariant cache hit.
[2025-05-31 22:58:21] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 2/200 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 22:58:23] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:58:23] [INFO ] Deduced a trap composed of 92 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:58:23] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 1 ms to minimize.
[2025-05-31 22:58:24] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:58:24] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2025-05-31 22:58:24] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:58:24] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 1 ms to minimize.
[2025-05-31 22:58:24] [INFO ] Deduced a trap composed of 92 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:58:24] [INFO ] Deduced a trap composed of 92 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:58:24] [INFO ] Deduced a trap composed of 94 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:58:24] [INFO ] Deduced a trap composed of 96 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:58:25] [INFO ] Deduced a trap composed of 98 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 22:58:25] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 0 ms to minimize.
[2025-05-31 22:58:25] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:58:25] [INFO ] Deduced a trap composed of 94 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 22:58:26] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:58:26] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:58:26] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:58:26] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:58:27] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:58:27] [INFO ] Deduced a trap composed of 99 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:58:27] [INFO ] Deduced a trap composed of 99 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:58:27] [INFO ] Deduced a trap composed of 93 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:58:27] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:58:27] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:58:27] [INFO ] Deduced a trap composed of 92 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:58:27] [INFO ] Deduced a trap composed of 93 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:58:27] [INFO ] Deduced a trap composed of 92 places in 49 ms of which 1 ms to minimize.
[2025-05-31 22:58:27] [INFO ] Deduced a trap composed of 91 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:58:27] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:58:27] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 22:58:29] [INFO ] Deduced a trap composed of 95 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:58:29] [INFO ] Deduced a trap composed of 93 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 22:58:30] [INFO ] Deduced a trap composed of 93 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:58:30] [INFO ] Deduced a trap composed of 98 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:58:30] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2025-05-31 22:58:30] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:58:30] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:58:30] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:58:31] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:58:31] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 22:58:31] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 22:58:33] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
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 TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 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 TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 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 TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 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 TDEAD198 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 12 (OVERLAPS) 208/408 variables, 200/272 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 39/311 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/311 constraints. Problems are: Problem set: 84 solved, 123 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/311 constraints. Problems are: Problem set: 84 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 311 constraints, problems are : Problem set: 84 solved, 123 unsolved in 19420 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 200/200 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 84 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 9/11 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/11 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 23/142 variables, 7/18 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/19 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/19 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 51/193 variables, 9/28 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 42/70 constraints. Problems are: Problem set: 84 solved, 123 unsolved
[2025-05-31 22:58:42] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:58:42] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 2/72 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/72 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 6/199 variables, 2/74 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/74 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 208/407 variables, 199/273 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 39/312 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 123/435 constraints. Problems are: Problem set: 84 solved, 123 unsolved
[2025-05-31 22:58:46] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:58:46] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:58:47] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:58:47] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:58:47] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 5/440 constraints. Problems are: Problem set: 84 solved, 123 unsolved
[2025-05-31 22:58:51] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/407 variables, 1/441 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/407 variables, 0/441 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 18 (OVERLAPS) 1/408 variables, 1/442 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/408 variables, 0/442 constraints. Problems are: Problem set: 84 solved, 123 unsolved
[2025-05-31 22:59:03] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:59:03] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/408 variables, 2/444 constraints. Problems are: Problem set: 84 solved, 123 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/408 variables, 0/444 constraints. Problems are: Problem set: 84 solved, 123 unsolved
[2025-05-31 22:59:09] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:59:09] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:59:09] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2025-05-31 22:59:09] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:59:10] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:59:10] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:59:10] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:59:10] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:59:10] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:59:10] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/408 variables, and 454 constraints, problems are : Problem set: 84 solved, 123 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 200/200 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 123/207 constraints, Known Traps: 63/63 constraints]
After SMT, in 49523ms problems are : Problem set: 84 solved, 123 unsolved
Search for dead transitions found 84 dead transitions in 49525ms
Found 84 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 84 transitions
Dead transitions reduction (with SMT) removed 84 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 200/200 places, 124/208 transitions.
Graph (complete) has 580 edges and 200 vertex of which 121 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.0 ms
Discarding 79 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 121 /200 variables (removed 79) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 121 cols
[2025-05-31 22:59:10] [INFO ] Computed 19 invariants in 5 ms
[2025-05-31 22:59:10] [INFO ] Implicit Places using invariants in 85 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 120/200 places, 124/208 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 120 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 122
Applied a total of 4 rules in 3 ms. Remains 118 /120 variables (removed 2) and now considering 122/124 (removed 2) transitions.
// Phase 1: matrix 122 rows 118 cols
[2025-05-31 22:59:11] [INFO ] Computed 18 invariants in 8 ms
[2025-05-31 22:59:11] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-05-31 22:59:11] [INFO ] Invariant cache hit.
[2025-05-31 22:59:11] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-31 22:59:11] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 118/200 places, 122/208 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 51913 ms. Remains : 118/200 places, 122/208 transitions.
[2025-05-31 22:59:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144245 resets) in 588 ms. (1697 steps per ms)
BEST_FIRST walk for 1000000 steps (91465 resets) in 425 ms. (2347 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 22:59:12] [INFO ] Invariant cache hit.
[2025-05-31 22:59:12] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-05-31 22:59:12] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:59:12] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-05-31 22:59:12] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-31 22:59:12] [INFO ] [Real]Added 23 Read/Feed constraints in 10 ms returned sat
[2025-05-31 22:59:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:59:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-31 22:59:12] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:59:12] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-05-31 22:59:12] [INFO ] [Nat]Added 23 Read/Feed constraints in 20 ms returned sat
[2025-05-31 22:59:12] [INFO ] Computed and/alt/rep : 101/626/101 causal constraints (skipped 20 transitions) in 8 ms.
[2025-05-31 22:59:13] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:59:13] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:59:13] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2025-05-31 22:59:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 180 ms
[2025-05-31 22:59:13] [INFO ] Added : 84 causal constraints over 18 iterations in 543 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 118/118 places, 122/122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2025-05-31 22:59:13] [INFO ] Invariant cache hit.
[2025-05-31 22:59:13] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-05-31 22:59:13] [INFO ] Invariant cache hit.
[2025-05-31 22:59:13] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-31 22:59:14] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2025-05-31 22:59:14] [INFO ] Redundant transitions in 1 ms returned []
Running 121 sub problems to find dead transitions.
[2025-05-31 22:59:14] [INFO ] Invariant cache hit.
[2025-05-31 22:59:14] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 2/118 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 22:59:14] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2025-05-31 22:59:14] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2025-05-31 22:59:15] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:59:15] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:59:15] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:59:15] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:59:15] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:59:15] [INFO ] Deduced a trap composed of 55 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:59:15] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 22:59:15] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 22:59:16] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:59:16] [INFO ] Deduced a trap composed of 53 places in 34 ms of which 1 ms to minimize.
[2025-05-31 22:59:16] [INFO ] Deduced a trap composed of 54 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:59:16] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 122/240 variables, 118/150 constraints. Problems are: Problem set: 0 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 23/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 173 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4684 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 118/118 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 2/118 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 22:59:19] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2025-05-31 22:59:19] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 122/240 variables, 118/152 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 23/175 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 121/296 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 22:59:21] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:59:21] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/240 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 298 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7164 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 118/118 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
After SMT, in 11883ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 11884ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12359 ms. Remains : 118/118 places, 122/122 transitions.
[2025-05-31 22:59:25] [INFO ] Flatten gal took : 12 ms
[2025-05-31 22:59:25] [INFO ] Flatten gal took : 7 ms
[2025-05-31 22:59:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7311134495674484803.gal : 1 ms
[2025-05-31 22:59:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13418389704197687387.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7311134495674484803.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13418389704197687387.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13418389704197687387.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :27 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 137
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :137 after 261
RANDOM walk for 40000 steps (5809 resets) in 112 ms. (353 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :261 after 743
BEST_FIRST walk for 40001 steps (3653 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :743 after 2521
BEST_FIRST walk for 40000 steps (3637 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2521 after 13677
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :13677 after 42861
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :42861 after 117084
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :117084 after 272109
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :272109 after 594810
Interrupted probabilistic random walk after 482973 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 2
Probabilistic random walk after 482973 steps, saw 241739 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2025-05-31 22:59:29] [INFO ] Invariant cache hit.
[2025-05-31 22:59:29] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/113 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 22:59:29] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2025-05-31 22:59:29] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2025-05-31 22:59:29] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2025-05-31 22:59:29] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2025-05-31 22:59:29] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 122/235 variables, 113/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 23/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/240 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/240 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 164 constraints, problems are : Problem set: 0 solved, 2 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 118/118 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/113 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 122/235 variables, 113/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 23/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/240 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 166 constraints, problems are : Problem set: 0 solved, 2 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 118/118 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 468ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 690 ms.
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 118/118 places, 122/122 transitions.
RANDOM walk for 40000 steps (5769 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3605 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3667 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :594810 after 5.71235e+07
Interrupted probabilistic random walk after 638805 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 2
Probabilistic random walk after 638805 steps, saw 319665 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
[2025-05-31 22:59:33] [INFO ] Invariant cache hit.
[2025-05-31 22:59:33] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/113 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 22:59:33] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:59:33] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2025-05-31 22:59:33] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2025-05-31 22:59:33] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2025-05-31 22:59:33] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 122/235 variables, 113/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 23/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/240 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/240 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 164 constraints, problems are : Problem set: 0 solved, 2 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 118/118 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/113 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 122/235 variables, 113/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 23/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/240 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 166 constraints, problems are : Problem set: 0 solved, 2 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 118/118 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 488ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 577 ms.
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 118/118 places, 122/122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2025-05-31 22:59:34] [INFO ] Invariant cache hit.
[2025-05-31 22:59:34] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-31 22:59:34] [INFO ] Invariant cache hit.
[2025-05-31 22:59:34] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-31 22:59:34] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2025-05-31 22:59:34] [INFO ] Redundant transitions in 0 ms returned []
Running 121 sub problems to find dead transitions.
[2025-05-31 22:59:34] [INFO ] Invariant cache hit.
[2025-05-31 22:59:34] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 2/118 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 22:59:35] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:59:35] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:59:35] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
[2025-05-31 22:59:35] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:59:36] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2025-05-31 22:59:36] [INFO ] Deduced a trap composed of 53 places in 34 ms of which 1 ms to minimize.
[2025-05-31 22:59:36] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:59:36] [INFO ] Deduced a trap composed of 55 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:59:36] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 22:59:36] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 22:59:36] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:59:36] [INFO ] Deduced a trap composed of 53 places in 32 ms of which 1 ms to minimize.
[2025-05-31 22:59:36] [INFO ] Deduced a trap composed of 54 places in 34 ms of which 1 ms to minimize.
[2025-05-31 22:59:37] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 122/240 variables, 118/150 constraints. Problems are: Problem set: 0 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 23/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 173 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4604 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 118/118 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :5.71235e+07 after 3.69692e+08
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 2/118 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 22:59:40] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2025-05-31 22:59:40] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 122/240 variables, 118/152 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 23/175 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 121/296 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2025-05-31 22:59:41] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2025-05-31 22:59:42] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/240 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 298 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7053 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 118/118 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
After SMT, in 11697ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 11699ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12152 ms. Remains : 118/118 places, 122/122 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 118 transition count 112
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 108 transition count 112
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 103 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 103 transition count 107
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 103 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 32 place count 102 transition count 106
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 102 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 100 transition count 104
Applied a total of 36 rules in 10 ms. Remains 100 /118 variables (removed 18) and now considering 104/122 (removed 18) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 104 rows 100 cols
[2025-05-31 22:59:46] [INFO ] Computed 18 invariants in 3 ms
[2025-05-31 22:59:46] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-05-31 22:59:46] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:59:46] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-31 22:59:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 22:59:46] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 22:59:46] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 22:59:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-31 22:59:46] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:59:46] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-31 22:59:46] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 22:59:46] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 22:59:46] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 22:59:46] [INFO ] Flatten gal took : 9 ms
[2025-05-31 22:59:46] [INFO ] Flatten gal took : 5 ms
[2025-05-31 22:59:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2629144109906531934.gal : 1 ms
[2025-05-31 22:59:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5738363492473690177.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2629144109906531934.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5738363492473690177.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5738363492473690177.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 162
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :162 after 296
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :296 after 1828
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1828 after 3860
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3860 after 16881
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :16881 after 54516
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :54516 after 138783
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :138783 after 403221
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :403221 after 1.04165e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.04165e+06 after 2.4089e+06
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :3.69692e+08 after 1.27566e+09
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.4089e+06 after 5.58821e+06
Detected timeout of ITS tools.
[2025-05-31 23:00:01] [INFO ] Flatten gal took : 5 ms
[2025-05-31 23:00:01] [INFO ] Applying decomposition
[2025-05-31 23:00:01] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14180389434685986619.txt' '-o' '/tmp/graph14180389434685986619.bin' '-w' '/tmp/graph14180389434685986619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14180389434685986619.bin' '-l' '-1' '-v' '-w' '/tmp/graph14180389434685986619.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:00:01] [INFO ] Decomposing Gal with order
[2025-05-31 23:00:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:00:01] [INFO ] Removed a total of 65 redundant transitions.
[2025-05-31 23:00:01] [INFO ] Flatten gal took : 10 ms
[2025-05-31 23:00:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 3 ms.
[2025-05-31 23:00:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17169617367705700440.gal : 1 ms
[2025-05-31 23:00:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4508525737970635423.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17169617367705700440.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4508525737970635423.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality4508525737970635423.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5096
Detected timeout of ITS tools.
[2025-05-31 23:00:16] [INFO ] Flatten gal took : 10 ms
[2025-05-31 23:00:16] [INFO ] Applying decomposition
[2025-05-31 23:00:16] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16254328609771916046.txt' '-o' '/tmp/graph16254328609771916046.bin' '-w' '/tmp/graph16254328609771916046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16254328609771916046.bin' '-l' '-1' '-v' '-w' '/tmp/graph16254328609771916046.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:00:16] [INFO ] Decomposing Gal with order
[2025-05-31 23:00:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:00:16] [INFO ] Removed a total of 60 redundant transitions.
[2025-05-31 23:00:16] [INFO ] Flatten gal took : 10 ms
[2025-05-31 23:00:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 4 ms.
[2025-05-31 23:00:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12059688645011815541.gal : 1 ms
[2025-05-31 23:00:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5347395200038782689.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12059688645011815541.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5347395200038782689.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5347395200038782689.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 40
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :40 after 1146
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1146 after 3485
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3485 after 52797
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30377 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-04 in 132988 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 233 rows 232 cols
[2025-05-31 23:00:17] [INFO ] Computed 35 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1462 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (926 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:00:17] [INFO ] Invariant cache hit.
[2025-05-31 23:00:17] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 23:00:17] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 23:00:17] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2025-05-31 23:00:17] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-31 23:00:17] [INFO ] [Real]Added 31 Read/Feed constraints in 57 ms returned sat
[2025-05-31 23:00:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:00:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 23:00:17] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 3 ms returned sat
[2025-05-31 23:00:17] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2025-05-31 23:00:17] [INFO ] [Nat]Added 31 Read/Feed constraints in 205 ms returned sat
[2025-05-31 23:00:17] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 12 ms.
[2025-05-31 23:00:19] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:00:19] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:00:19] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:00:20] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:00:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 354 ms
[2025-05-31 23:00:20] [INFO ] Added : 191 causal constraints over 39 iterations in 2380 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 232 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p502) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 232/232 transitions.
Graph (complete) has 925 edges and 232 vertex of which 231 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 230 transition count 229
Reduce places removed 3 places and 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 227 transition count 226
Reduce places removed 2 places and 3 transitions.
Graph (complete) has 867 edges and 225 vertex of which 223 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 9 place count 223 transition count 223
Reduce places removed 1 places and 2 transitions.
Graph (complete) has 849 edges and 222 vertex of which 221 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 11 place count 221 transition count 221
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 12 place count 220 transition count 218
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 13 place count 219 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 14 place count 218 transition count 216
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 30 place count 210 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 32 place count 209 transition count 208
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 33 place count 209 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 34 place count 208 transition count 207
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 44 place count 208 transition count 197
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 54 place count 198 transition count 197
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 55 place count 198 transition count 197
Applied a total of 55 rules in 27 ms. Remains 198 /232 variables (removed 34) and now considering 197/232 (removed 35) transitions.
Running 196 sub problems to find dead transitions.
// Phase 1: matrix 197 rows 198 cols
[2025-05-31 23:00:20] [INFO ] Computed 33 invariants in 14 ms
[2025-05-31 23:00:20] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 2/198 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2025-05-31 23:00:22] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:00:22] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:00:23] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:00:23] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:00:23] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:00:23] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:00:23] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:00:23] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:00:23] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:00:23] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:00:23] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:00:23] [INFO ] Deduced a trap composed of 91 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:00:23] [INFO ] Deduced a trap composed of 87 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:00:24] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:00:24] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:00:24] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2025-05-31 23:00:25] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:00:25] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:00:25] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:00:25] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:00:25] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:00:25] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:00:25] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2025-05-31 23:00:27] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:00:27] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:00:27] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:00:27] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:00:27] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:00:28] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:00:28] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:00:28] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2025-05-31 23:00:28] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:00:28] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:00:28] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:00:29] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2025-05-31 23:00:29] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2025-05-31 23:00:29] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2025-05-31 23:00:29] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2025-05-31 23:00:30] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:00:30] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2025-05-31 23:00:30] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:00:30] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:00:30] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:00:30] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:00:30] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:00:30] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:00:30] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:00:30] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:00:30] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:00:30] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:00:30] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:00:31] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:00:31] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:00:31] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:00:31] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:00:31] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:00:31] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:00:31] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2025-05-31 23:00:32] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:00:32] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:00:32] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:00:33] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:00:33] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:00:33] [INFO ] Deduced a trap composed of 89 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:00:33] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2025-05-31 23:00:34] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:00:34] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:00:34] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:00:34] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:00:35] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:00:35] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:00:35] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2025-05-31 23:00:35] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:00:35] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2025-05-31 23:00:36] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:00:36] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2025-05-31 23:00:38] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2025-05-31 23:00:39] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:00:39] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2025-05-31 23:00:39] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:00:39] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:00:40] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 198/395 variables, and 115 constraints, problems are : Problem set: 0 solved, 196 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/198 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 2/198 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 82/115 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 197/395 variables, 198/313 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 37/350 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 196/546 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2025-05-31 23:00:49] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:00:51] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:00:51] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:00:51] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:00:52] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:00:52] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 6/552 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2025-05-31 23:00:57] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:00:57] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 554 constraints, problems are : Problem set: 0 solved, 196 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 198/198 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 90/90 constraints]
After SMT, in 40113ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 40115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40142 ms. Remains : 198/232 places, 197/232 transitions.
[2025-05-31 23:01:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144266 resets) in 661 ms. (1510 steps per ms)
BEST_FIRST walk for 1000000 steps (91620 resets) in 478 ms. (2087 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:01:01] [INFO ] Invariant cache hit.
[2025-05-31 23:01:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:01:01] [INFO ] [Real]Absence check using 3 positive and 30 generalized place invariants in 5 ms returned sat
[2025-05-31 23:01:02] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-05-31 23:01:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-31 23:01:02] [INFO ] [Real]Added 37 Read/Feed constraints in 67 ms returned sat
[2025-05-31 23:01:02] [INFO ] Computed and/alt/rep : 156/967/156 causal constraints (skipped 40 transitions) in 11 ms.
[2025-05-31 23:01:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:01:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:01:02] [INFO ] [Nat]Absence check using 3 positive and 30 generalized place invariants in 5 ms returned sat
[2025-05-31 23:01:02] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-05-31 23:01:02] [INFO ] [Nat]Added 37 Read/Feed constraints in 125 ms returned sat
[2025-05-31 23:01:02] [INFO ] Computed and/alt/rep : 156/967/156 causal constraints (skipped 40 transitions) in 11 ms.
[2025-05-31 23:01:03] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:01:03] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:01:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2025-05-31 23:01:03] [INFO ] Added : 132 causal constraints over 27 iterations in 1170 ms. Result :sat
Minimization took 300 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 198/198 places, 197/197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2025-05-31 23:01:07] [INFO ] Invariant cache hit.
[2025-05-31 23:01:07] [INFO ] Implicit Places using invariants in 152 ms returned [42, 47, 136, 195]
[2025-05-31 23:01:07] [INFO ] Actually due to overlaps returned [195]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 197/198 places, 197/197 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 197 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 196 transition count 196
Applied a total of 2 rules in 5 ms. Remains 196 /197 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 196 cols
[2025-05-31 23:01:07] [INFO ] Computed 32 invariants in 10 ms
[2025-05-31 23:01:07] [INFO ] Implicit Places using invariants in 147 ms returned [42, 47, 136]
[2025-05-31 23:01:07] [INFO ] Actually due to overlaps returned [47, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 148 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 194/198 places, 196/197 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 194 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 195
Applied a total of 2 rules in 5 ms. Remains 193 /194 variables (removed 1) and now considering 195/196 (removed 1) transitions.
// Phase 1: matrix 195 rows 193 cols
[2025-05-31 23:01:07] [INFO ] Computed 30 invariants in 8 ms
[2025-05-31 23:01:07] [INFO ] Implicit Places using invariants in 140 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 192/198 places, 195/197 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 191 transition count 194
Applied a total of 2 rules in 6 ms. Remains 191 /192 variables (removed 1) and now considering 194/195 (removed 1) transitions.
// Phase 1: matrix 194 rows 191 cols
[2025-05-31 23:01:07] [INFO ] Computed 29 invariants in 7 ms
[2025-05-31 23:01:08] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-31 23:01:08] [INFO ] Invariant cache hit.
[2025-05-31 23:01:08] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-31 23:01:09] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned [165]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1606 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 190/198 places, 194/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 190 /190 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 2073 ms. Remains : 190/198 places, 194/197 transitions.
// Phase 1: matrix 194 rows 190 cols
[2025-05-31 23:01:09] [INFO ] Computed 29 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144632 resets) in 662 ms. (1508 steps per ms)
BEST_FIRST walk for 1000000 steps (91552 resets) in 467 ms. (2136 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:01:10] [INFO ] Invariant cache hit.
[2025-05-31 23:01:10] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-31 23:01:10] [INFO ] [Real]Absence check using 11 positive and 18 generalized place invariants in 3 ms returned sat
[2025-05-31 23:01:10] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-05-31 23:01:10] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-31 23:01:10] [INFO ] [Real]Added 37 Read/Feed constraints in 55 ms returned sat
[2025-05-31 23:01:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:01:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-05-31 23:01:10] [INFO ] [Nat]Absence check using 11 positive and 18 generalized place invariants in 2 ms returned sat
[2025-05-31 23:01:11] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-05-31 23:01:11] [INFO ] [Nat]Added 37 Read/Feed constraints in 160 ms returned sat
[2025-05-31 23:01:11] [INFO ] Computed and/alt/rep : 155/977/155 causal constraints (skipped 38 transitions) in 10 ms.
[2025-05-31 23:01:11] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:01:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2025-05-31 23:01:11] [INFO ] Added : 88 causal constraints over 19 iterations in 711 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 190/190 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2025-05-31 23:01:15] [INFO ] Invariant cache hit.
[2025-05-31 23:01:15] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-05-31 23:01:15] [INFO ] Invariant cache hit.
[2025-05-31 23:01:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-31 23:01:16] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
[2025-05-31 23:01:16] [INFO ] Redundant transitions in 1 ms returned []
Running 193 sub problems to find dead transitions.
[2025-05-31 23:01:16] [INFO ] Invariant cache hit.
[2025-05-31 23:01:16] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 2/190 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:18] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:01:18] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:01:18] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:01:18] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:01:18] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:01:18] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:01:18] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:01:19] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:01:19] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:01:19] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:01:19] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:01:19] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:01:19] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:19] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:01:19] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2025-05-31 23:01:20] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2025-05-31 23:01:20] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2025-05-31 23:01:20] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2025-05-31 23:01:20] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:01:20] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:20] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:01:20] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:01:20] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:01:20] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:01:21] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:01:21] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:01:21] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:01:21] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:21] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:01:21] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:22] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:01:22] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:01:22] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:01:22] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:01:22] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:22] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:01:23] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:01:23] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:01:23] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:01:23] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:01:23] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:23] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 0 ms to minimize.
[2025-05-31 23:01:23] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 194/384 variables, 190/262 constraints. Problems are: Problem set: 0 solved, 193 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 37/299 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (OVERLAPS) 0/384 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 299 constraints, problems are : Problem set: 0 solved, 193 unsolved in 15532 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 190/190 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 2/190 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 43/72 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:32] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:01:33] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:01:33] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:01:33] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:01:33] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
[2025-05-31 23:01:33] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:01:33] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:01:33] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:01:33] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:01:33] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:01:33] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:01:33] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:01:33] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:01:33] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:01:33] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:01:34] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:01:34] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:01:34] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:01:34] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:01:34] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:34] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:01:34] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:01:34] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:01:34] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:01:34] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 2 ms to minimize.
[2025-05-31 23:01:34] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 2 ms to minimize.
[2025-05-31 23:01:34] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:01:34] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:01:35] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:01:35] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:01:35] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 2 ms to minimize.
[2025-05-31 23:01:35] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:01:35] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:01:35] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:01:35] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:01:35] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:01:35] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
[2025-05-31 23:01:35] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:01:35] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:01:35] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:36] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:01:36] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:01:36] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:01:36] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:01:36] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:01:36] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:01:37] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:01:37] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:01:37] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:37] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:01:37] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:01:37] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:01:37] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:01:37] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:01:37] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:01:38] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:38] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 2 ms to minimize.
[2025-05-31 23:01:38] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:01:38] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:38] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:01:38] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:38] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:01:38] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:38] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:38] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:01:38] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:01:38] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:01:38] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:38] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 2 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 2 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 2 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:01:39] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:01:40] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:01:40] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:01:40] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:40] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:01:40] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:01:40] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:01:40] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:01:40] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:01:40] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 14 ms to minimize.
[2025-05-31 23:01:40] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:01:40] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:40] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:01:40] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:01:41] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:41] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:01:41] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:01:41] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:01:41] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:01:41] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:01:41] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:01:41] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:41] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:41] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:41] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 2 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:42] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:01:43] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:01:43] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:43] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:01:43] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:01:43] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:01:43] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:01:43] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:01:43] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:01:43] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:01:43] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:01:43] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:01:44] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:01:44] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:01:44] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:01:44] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:01:44] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:01:44] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:01:44] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 2 ms to minimize.
[2025-05-31 23:01:44] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:01:44] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:01:44] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:01:44] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:45] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:01:45] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:01:45] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:01:45] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:01:45] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:01:45] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:45] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:01:45] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:01:45] [INFO ] Deduced a trap composed of 82 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:01:45] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:01:45] [INFO ] Deduced a trap composed of 82 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:01:46] [INFO ] Deduced a trap composed of 84 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:01:46] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:01:46] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:01:46] [INFO ] Deduced a trap composed of 84 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:01:46] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 16/237 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:47] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:01:47] [INFO ] Deduced a trap composed of 83 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:47] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:01:48] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:49] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:01:50] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:01:50] [INFO ] Deduced a trap composed of 88 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:01:50] [INFO ] Deduced a trap composed of 90 places in 51 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:51] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 0 ms to minimize.
[2025-05-31 23:01:51] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:01:51] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:01:52] [INFO ] Deduced a trap composed of 84 places in 57 ms of which 0 ms to minimize.
[2025-05-31 23:01:52] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:01:52] [INFO ] Deduced a trap composed of 82 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:01:52] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 7/252 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:53] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:01:53] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:01:53] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:01:54] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:01:54] [INFO ] Deduced a trap composed of 81 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:01:54] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:01:54] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/190 variables, 7/259 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:55] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:01:55] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:01:56] [INFO ] Deduced a trap composed of 84 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:01:56] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 0 ms to minimize.
[2025-05-31 23:01:56] [INFO ] Deduced a trap composed of 88 places in 51 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/190 variables, 5/264 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:58] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:01:58] [INFO ] Deduced a trap composed of 83 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:01:58] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/190 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:01:59] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:01:59] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:01:59] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:00] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:02:00] [INFO ] Deduced a trap composed of 80 places in 45 ms of which 0 ms to minimize.
[2025-05-31 23:02:00] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:02:00] [INFO ] Deduced a trap composed of 82 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:02:00] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:02:00] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:02:00] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:02:00] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:02:00] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:02:00] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:00] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:00] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 2 ms to minimize.
[2025-05-31 23:02:00] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:02:01] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:02:01] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:01] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:02:01] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/190 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/384 variables, and 287 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/190 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 0/193 constraints, Known Traps: 258/258 constraints]
After SMT, in 45614ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 45617ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46855 ms. Remains : 190/190 places, 194/194 transitions.
[2025-05-31 23:02:02] [INFO ] Flatten gal took : 9 ms
[2025-05-31 23:02:02] [INFO ] Flatten gal took : 16 ms
[2025-05-31 23:02:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2933985381573177764.gal : 5 ms
[2025-05-31 23:02:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4273971947254760353.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2933985381573177764.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4273971947254760353.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (5783 resets) in 102 ms. (388 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40001 steps (3648 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality4273971947254760353.prop.
BEST_FIRST walk for 40003 steps (3561 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 124
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :124 after 242
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :242 after 536
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :536 after 1223
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1223 after 23429
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :23429 after 43142
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :43142 after 120992
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :120992 after 263204
Interrupted probabilistic random walk after 430812 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 2
Probabilistic random walk after 430812 steps, saw 215611 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2025-05-31 23:02:05] [INFO ] Invariant cache hit.
[2025-05-31 23:02:05] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 132/133 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:02:05] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 52/185 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:02:05] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 193/378 variables, 185/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 36/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/384 variables, 5/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/384 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 258 constraints, problems are : Problem set: 0 solved, 2 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 190/190 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 132/133 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 52/185 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :263204 after 566686
[2025-05-31 23:02:05] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:02:05] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:02:05] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2025-05-31 23:02:05] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2025-05-31 23:02:06] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2025-05-31 23:02:07] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2025-05-31 23:02:07] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2025-05-31 23:02:07] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 193/378 variables, 185/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 36/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/384 variables, 5/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/384 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/384 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1859 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 190/190 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 27/27 constraints]
After SMT, in 2213ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :566686 after 1.15222e+07
Parikh walk visited 0 properties in 9519 ms.
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Running 193 sub problems to find dead transitions.
[2025-05-31 23:02:16] [INFO ] Invariant cache hit.
[2025-05-31 23:02:16] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 2/190 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:02:18] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:02:18] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:19] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:19] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:02:19] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:19] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:19] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:02:19] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:02:19] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:02:19] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 2 ms to minimize.
[2025-05-31 23:02:20] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:02:20] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:02:20] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.15222e+07 after 7.69466e+07
[2025-05-31 23:02:20] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:02:20] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2025-05-31 23:02:20] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2025-05-31 23:02:20] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2025-05-31 23:02:20] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:02:20] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:20] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:02:21] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:02:21] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:02:21] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:02:21] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:02:21] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:21] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:02:21] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:02:22] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:02:22] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:02:22] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:02:22] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:22] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:02:22] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:02:23] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:02:23] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:02:23] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:02:23] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:02:23] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:02:23] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:02:23] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 0 ms to minimize.
[2025-05-31 23:02:23] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:02:24] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:02:24] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 194/384 variables, 190/262 constraints. Problems are: Problem set: 0 solved, 193 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 37/299 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (OVERLAPS) 0/384 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 299 constraints, problems are : Problem set: 0 solved, 193 unsolved in 15569 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 190/190 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 2/190 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 43/72 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:02:33] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:02:33] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:02:33] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:02:33] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:02:33] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:02:33] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:02:33] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 2 ms to minimize.
[2025-05-31 23:02:34] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:02:34] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:02:34] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:02:34] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:02:34] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:02:34] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:02:34] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
[2025-05-31 23:02:34] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:02:34] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 2 ms to minimize.
[2025-05-31 23:02:34] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:02:34] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:02:34] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:02:34] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:02:35] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:02:35] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:02:35] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:02:35] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:02:35] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:02:35] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:02:35] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:02:35] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:02:35] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2025-05-31 23:02:35] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:02:35] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2025-05-31 23:02:35] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:02:36] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:02:36] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:02:36] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2025-05-31 23:02:36] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:02:36] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:02:36] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:02:36] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 2 ms to minimize.
[2025-05-31 23:02:36] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:02:36] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:02:36] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:02:37] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:02:37] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:02:37] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:02:37] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:02:38] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:02:38] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:02:38] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:02:38] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2025-05-31 23:02:38] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:02:38] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:02:38] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:38] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:02:38] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2025-05-31 23:02:38] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:39] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:39] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:39] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:39] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:02:39] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:02:39] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:39] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:39] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:39] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:02:39] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:02:39] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:39] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:02:39] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:02:40] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:02:40] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:02:40] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:02:40] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 2 ms to minimize.
[2025-05-31 23:02:40] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:40] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:02:40] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:02:40] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:02:40] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 2 ms to minimize.
[2025-05-31 23:02:40] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:02:40] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:02:40] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:40] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:41] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:41] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:02:41] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:02:41] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:02:41] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:02:41] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:41] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:02:41] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 2 ms to minimize.
[2025-05-31 23:02:41] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:02:41] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:02:41] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:02:41] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:02:42] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:02:42] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:02:42] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:02:42] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:02:42] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:02:42] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:02:42] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 2 ms to minimize.
[2025-05-31 23:02:42] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:02:42] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:02:42] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2025-05-31 23:02:42] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:02:42] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:02:42] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:02:42] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:02:43] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 524288
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 193 unsolved
SDD size :7.69466e+07 after 2.37926e+08
[2025-05-31 23:02:47] [INFO ] Deduced a trap composed of 58 places in 4381 ms of which 32 ms to minimize.
[2025-05-31 23:02:47] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 1 ms to minimize.
[2025-05-31 23:02:47] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2025-05-31 23:02:48] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2025-05-31 23:02:48] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2025-05-31 23:02:48] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 1 ms to minimize.
[2025-05-31 23:02:48] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2025-05-31 23:02:48] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2025-05-31 23:02:50] [INFO ] Deduced a trap composed of 64 places in 1719 ms of which 1 ms to minimize.
[2025-05-31 23:02:50] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:50] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:02:50] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:50] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:50] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:02:50] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:02:50] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:02:50] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:02:50] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:02:50] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:02:50] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:02:51] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:02:51] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:02:51] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:02:51] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:02:51] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:02:51] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:51] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 2 ms to minimize.
[2025-05-31 23:02:51] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:51] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:02:51] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:02:52] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:02:52] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:02:52] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-05-31 23:02:52] [INFO ] Flatten gal took : 8 ms
[2025-05-31 23:02:52] [INFO ] Applying decomposition
[2025-05-31 23:02:52] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4131376213642211208.txt' '-o' '/tmp/graph4131376213642211208.bin' '-w' '/tmp/graph4131376213642211208.weights'
[2025-05-31 23:02:52] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4131376213642211208.bin' '-l' '-1' '-v' '-w' '/tmp/graph4131376213642211208.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:02:52] [INFO ] Decomposing Gal with order
[2025-05-31 23:02:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:02:52] [INFO ] Removed a total of 99 redundant transitions.
[2025-05-31 23:02:52] [INFO ] Flatten gal took : 18 ms
[2025-05-31 23:02:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 5 ms.
[2025-05-31 23:02:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5673048402699409201.gal : 3 ms
[2025-05-31 23:02:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12938500100879203222.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5673048402699409201.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12938500100879203222.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12938500100879203222.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :17 after 23
[2025-05-31 23:02:52] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 1 ms to minimize.
[2025-05-31 23:02:52] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1142 after 1146
[2025-05-31 23:02:52] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :7292 after 7292
[2025-05-31 23:02:52] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
SMT process timed out in 35655ms, After SMT, problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 35657ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35660 ms. Remains : 190/190 places, 194/194 transitions.
RANDOM walk for 40000 steps (5793 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3608 resets) in 252 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3666 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :132819 after 132852
Interrupted probabilistic random walk after 411436 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 2
Probabilistic random walk after 411436 steps, saw 205901 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2025-05-31 23:02:55] [INFO ] Invariant cache hit.
[2025-05-31 23:02:55] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 132/133 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:02:55] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 52/185 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:02:56] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 193/378 variables, 185/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 36/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/384 variables, 5/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/384 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 258 constraints, problems are : Problem set: 0 solved, 2 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 190/190 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 132/133 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 52/185 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:02:56] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:02:56] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:02:56] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:02:56] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
[2025-05-31 23:02:56] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:02:56] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:02:56] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:02:56] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:02:56] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:02:56] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:02:56] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:02:57] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:02:57] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:02:57] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:02:57] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:02:57] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:02:57] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:02:57] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2025-05-31 23:02:57] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:02:57] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:02:57] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2025-05-31 23:02:57] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2025-05-31 23:02:57] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2025-05-31 23:02:57] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2025-05-31 23:02:57] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 193/378 variables, 185/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 36/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/384 variables, 5/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/384 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/384 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1714 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 190/190 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 27/27 constraints]
After SMT, in 2092ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :401358 after 401361
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :746796 after 747595
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :747595 after 764148
Parikh walk visited 0 properties in 11479 ms.
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 194/194 transitions.
Applied a total of 0 rules in 4 ms. Remains 190 /190 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 190/190 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2025-05-31 23:03:09] [INFO ] Invariant cache hit.
[2025-05-31 23:03:09] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-05-31 23:03:09] [INFO ] Invariant cache hit.
[2025-05-31 23:03:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-31 23:03:10] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
[2025-05-31 23:03:10] [INFO ] Redundant transitions in 1 ms returned []
Running 193 sub problems to find dead transitions.
[2025-05-31 23:03:10] [INFO ] Invariant cache hit.
[2025-05-31 23:03:10] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 2/190 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:12] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:03:12] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:03:13] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:03:13] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:03:13] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:13] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:03:13] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:13] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:03:13] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 0 ms to minimize.
[2025-05-31 23:03:13] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:14] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:03:14] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:03:14] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:03:14] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:03:14] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2025-05-31 23:03:14] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2025-05-31 23:03:14] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2025-05-31 23:03:14] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2025-05-31 23:03:14] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :764148 after 870975
[2025-05-31 23:03:14] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:15] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 2 ms to minimize.
[2025-05-31 23:03:15] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:03:15] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 2 ms to minimize.
[2025-05-31 23:03:15] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:03:15] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:03:15] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:03:15] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:03:16] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:03:16] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:03:16] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:16] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:03:16] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:03:16] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:17] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:03:17] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:03:17] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:03:17] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:03:17] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:03:17] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 0 ms to minimize.
[2025-05-31 23:03:17] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:03:17] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:03:18] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:03:18] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 194/384 variables, 190/262 constraints. Problems are: Problem set: 0 solved, 193 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 37/299 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (OVERLAPS) 0/384 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 299 constraints, problems are : Problem set: 0 solved, 193 unsolved in 15606 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 190/190 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 2/190 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 43/72 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:27] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2025-05-31 23:03:27] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:03:27] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:03:27] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:03:27] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:03:27] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:03:27] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:03:27] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2025-05-31 23:03:27] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:03:27] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:03:28] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:03:28] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:03:28] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:03:28] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:03:28] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:03:28] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:03:28] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:03:28] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:03:28] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:03:28] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:28] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:03:29] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2025-05-31 23:03:29] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2025-05-31 23:03:29] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 2 ms to minimize.
[2025-05-31 23:03:29] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:03:29] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
[2025-05-31 23:03:29] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:03:29] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 2 ms to minimize.
[2025-05-31 23:03:29] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2025-05-31 23:03:29] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:03:29] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 1 ms to minimize.
[2025-05-31 23:03:29] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:03:29] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:03:30] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:03:30] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:03:30] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:03:30] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:03:30] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:03:30] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:03:30] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:30] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:03:30] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:03:30] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:03:31] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 1 ms to minimize.
[2025-05-31 23:03:31] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:03:31] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:03:32] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:03:32] [INFO ] Deduced a trap composed of 84 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:32] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:32] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:32] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:03:32] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:32] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:03:32] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:03:32] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:03:32] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:03:32] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:03:32] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:03:33] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:03:33] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:03:33] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:03:33] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:03:33] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:03:33] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:03:33] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:03:33] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:03:33] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2025-05-31 23:03:33] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:03:33] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:33] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 2 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:03:34] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 4 ms to minimize.
[2025-05-31 23:03:35] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:35] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:35] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:35] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:35] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:03:35] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:35] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:03:35] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:03:35] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:03:35] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:03:35] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:03:35] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:03:35] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:03:36] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:03:36] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:03:36] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:03:36] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:03:36] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:03:36] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:36] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:03:36] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:03:36] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:03:36] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:03:36] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:37] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:03:37] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:37] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:03:37] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:03:37] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:03:37] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:37] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:03:37] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:03:37] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:03:37] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:37] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 2 ms to minimize.
[2025-05-31 23:03:37] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:37] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:38] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:38] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:38] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:03:38] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:03:38] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 2 ms to minimize.
[2025-05-31 23:03:38] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 2 ms to minimize.
[2025-05-31 23:03:38] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:38] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:03:38] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:03:38] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:03:38] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 2 ms to minimize.
[2025-05-31 23:03:39] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:03:39] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:03:39] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 2 ms to minimize.
[2025-05-31 23:03:39] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:03:39] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:03:39] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:03:39] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:03:39] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:03:39] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:03:39] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:03:39] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:03:39] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:03:39] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:03:40] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:03:40] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:03:40] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:40] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:40] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:03:40] [INFO ] Deduced a trap composed of 83 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:03:40] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:03:41] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:41] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:03:41] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:03:41] [INFO ] Deduced a trap composed of 84 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:03:41] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:03:41] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:03:41] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:03:41] [INFO ] Deduced a trap composed of 84 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:41] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:41] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:03:41] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-05-31 23:03:42] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 16/237 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:43] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:43] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:03:43] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:03:44] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:45] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:03:46] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:46] [INFO ] Deduced a trap composed of 88 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:03:46] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:47] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:03:47] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:03:47] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:03:48] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:03:48] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:03:48] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 0 ms to minimize.
[2025-05-31 23:03:48] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 7/252 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:49] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:03:49] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:03:49] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:03:50] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:03:50] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:03:50] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:03:50] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/190 variables, 7/259 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:51] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:03:51] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:03:52] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 0 ms to minimize.
[2025-05-31 23:03:52] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:03:52] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/190 variables, 5/264 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:54] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:03:54] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:03:54] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/190 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2025-05-31 23:03:55] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:03:55] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:03:55] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:03:55] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:03:55] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:03:56] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:03:56] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:03:56] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:03:56] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
SMT process timed out in 45722ms, After SMT, problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 45726ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46959 ms. Remains : 190/190 places, 194/194 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-05 in 219390 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 233 rows 232 cols
[2025-05-31 23:03:56] [INFO ] Computed 35 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1450 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10001 steps (899 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 23:03:56] [INFO ] Invariant cache hit.
[2025-05-31 23:03:56] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 23:03:56] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 23:03:56] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2025-05-31 23:03:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:03:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 23:03:56] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 23:03:56] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-05-31 23:03:56] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-31 23:03:57] [INFO ] [Nat]Added 31 Read/Feed constraints in 443 ms returned sat
[2025-05-31 23:03:57] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 13 ms.
[2025-05-31 23:04:00] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:04:00] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:04:00] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 2 ms to minimize.
[2025-05-31 23:04:00] [INFO ] Deduced a trap composed of 94 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:04:00] [INFO ] Deduced a trap composed of 88 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:04:00] [INFO ] Deduced a trap composed of 98 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:04:00] [INFO ] Deduced a trap composed of 99 places in 70 ms of which 2 ms to minimize.
[2025-05-31 23:04:01] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:04:01] [INFO ] Deduced a trap composed of 94 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:04:01] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:04:01] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:04:01] [INFO ] Deduced a trap composed of 91 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:04:01] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 2 ms to minimize.
[2025-05-31 23:04:01] [INFO ] Deduced a trap composed of 96 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:04:01] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:04:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 233/233 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 231 transition count 232
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 225 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 224 transition count 226
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 224 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 223 transition count 225
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 28 place count 223 transition count 215
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 38 place count 213 transition count 215
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 213 transition count 215
Applied a total of 40 rules in 20 ms. Remains 213 /232 variables (removed 19) and now considering 215/233 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 213/232 places, 215/233 transitions.
Found an invariant !
This invariant on transitions {21=1, 34=1, 51=1, 73=1, 102=1, 127=1, 140=1, 151=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {21=1, 34=1, 51=1, 73=1, 102=1, 127=1, 140=1, 151=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1468 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 215 rows 213 cols
[2025-05-31 23:04:02] [INFO ] Computed 35 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144228 resets) in 717 ms. (1392 steps per ms)
BEST_FIRST walk for 1000000 steps (91638 resets) in 508 ms. (1964 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 23:04:03] [INFO ] Invariant cache hit.
[2025-05-31 23:04:03] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-31 23:04:03] [INFO ] [Real]Absence check using 9 positive and 26 generalized place invariants in 3 ms returned sat
[2025-05-31 23:04:03] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2025-05-31 23:04:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:04:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-05-31 23:04:03] [INFO ] [Nat]Absence check using 9 positive and 26 generalized place invariants in 5 ms returned sat
[2025-05-31 23:04:03] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-05-31 23:04:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-31 23:04:04] [INFO ] [Nat]Added 38 Read/Feed constraints in 397 ms returned sat
[2025-05-31 23:04:04] [INFO ] Computed and/alt/rep : 169/1049/169 causal constraints (skipped 45 transitions) in 11 ms.
[2025-05-31 23:04:05] [INFO ] Added : 124 causal constraints over 25 iterations in 1054 ms. Result :sat
Minimization took 346 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 213/213 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2025-05-31 23:04:08] [INFO ] Invariant cache hit.
[2025-05-31 23:04:08] [INFO ] Implicit Places using invariants in 179 ms returned [42, 47, 136, 210]
[2025-05-31 23:04:08] [INFO ] Actually due to overlaps returned [210]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 212/213 places, 215/215 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 214
Applied a total of 2 rules in 7 ms. Remains 211 /212 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 211 cols
[2025-05-31 23:04:09] [INFO ] Computed 34 invariants in 21 ms
[2025-05-31 23:04:09] [INFO ] Implicit Places using invariants in 162 ms returned [42, 47, 136]
[2025-05-31 23:04:09] [INFO ] Actually due to overlaps returned [47, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 163 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/213 places, 214/215 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 213
Applied a total of 2 rules in 11 ms. Remains 208 /209 variables (removed 1) and now considering 213/214 (removed 1) transitions.
// Phase 1: matrix 213 rows 208 cols
[2025-05-31 23:04:09] [INFO ] Computed 32 invariants in 11 ms
[2025-05-31 23:04:09] [INFO ] Implicit Places using invariants in 139 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 207/213 places, 213/215 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 212
Applied a total of 2 rules in 6 ms. Remains 206 /207 variables (removed 1) and now considering 212/213 (removed 1) transitions.
// Phase 1: matrix 212 rows 206 cols
[2025-05-31 23:04:09] [INFO ] Computed 31 invariants in 13 ms
[2025-05-31 23:04:09] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-05-31 23:04:09] [INFO ] Invariant cache hit.
[2025-05-31 23:04:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-31 23:04:10] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1375 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 206/213 places, 212/215 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1885 ms. Remains : 206/213 places, 212/215 transitions.
Found an invariant !
This invariant on transitions {20=1, 32=1, 46=1, 67=1, 96=1, 121=1, 134=1, 145=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {20=1, 32=1, 46=1, 67=1, 96=1, 121=1, 134=1, 145=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1450 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 23:04:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144324 resets) in 708 ms. (1410 steps per ms)
BEST_FIRST walk for 1000000 steps (91592 resets) in 503 ms. (1984 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 23:04:15] [INFO ] Invariant cache hit.
[2025-05-31 23:04:15] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-31 23:04:15] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2025-05-31 23:04:15] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2025-05-31 23:04:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:04:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-31 23:04:15] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2025-05-31 23:04:15] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-05-31 23:04:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-31 23:04:15] [INFO ] [Nat]Added 38 Read/Feed constraints in 187 ms returned sat
[2025-05-31 23:04:15] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:04:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2025-05-31 23:04:15] [INFO ] Computed and/alt/rep : 168/1059/168 causal constraints (skipped 43 transitions) in 12 ms.
[2025-05-31 23:04:17] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:04:17] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:04:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:04:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 284 ms
[2025-05-31 23:04:17] [INFO ] Added : 117 causal constraints over 25 iterations in 1689 ms. Result :sat
Minimization took 368 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2025-05-31 23:04:21] [INFO ] Invariant cache hit.
[2025-05-31 23:04:21] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-05-31 23:04:21] [INFO ] Invariant cache hit.
[2025-05-31 23:04:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-31 23:04:22] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2025-05-31 23:04:22] [INFO ] Redundant transitions in 0 ms returned []
Running 211 sub problems to find dead transitions.
[2025-05-31 23:04:22] [INFO ] Invariant cache hit.
[2025-05-31 23:04:22] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:04:24] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:04:24] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:04:24] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 2 ms to minimize.
[2025-05-31 23:04:25] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:04:25] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:04:25] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:04:25] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:04:25] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:04:25] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:04:26] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:04:26] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:04:26] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:04:26] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:04:26] [INFO ] Deduced a trap composed of 89 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:04:26] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:04:26] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:04:26] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2025-05-31 23:04:26] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2025-05-31 23:04:26] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:04:27] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:04:27] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:04:27] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:04:27] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:04:27] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:04:27] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:04:27] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:04:27] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2025-05-31 23:04:27] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:04:27] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 2 ms to minimize.
[2025-05-31 23:04:28] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:04:28] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:04:28] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:04:28] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:04:28] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:04:28] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:04:28] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:04:28] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:04:29] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:04:29] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:04:29] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:04:29] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:04:29] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:04:29] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:04:29] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:04:29] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:04:29] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:04:29] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:04:30] [INFO ] Deduced a trap composed of 95 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:04:30] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:04:30] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:04:30] [INFO ] Deduced a trap composed of 96 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:04:30] [INFO ] Deduced a trap composed of 94 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:04:30] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:04:30] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:04:32] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:04:32] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:04:32] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:04:32] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:04:32] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:04:32] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:04:32] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:04:32] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:04:33] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:04:33] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:04:33] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:04:33] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:04:33] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:04:33] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2025-05-31 23:04:33] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:04:33] [INFO ] Deduced a trap composed of 89 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:04:33] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:04:33] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:04:34] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:04:34] [INFO ] Deduced a trap composed of 90 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:04:34] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:04:35] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:04:35] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:04:35] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:04:35] [INFO ] Deduced a trap composed of 95 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:04:35] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:04:36] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:04:36] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:04:36] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:04:36] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:04:36] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:04:36] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:04:37] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (OVERLAPS) 212/418 variables, 206/324 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 38/362 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 14 (OVERLAPS) 0/418 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 362 constraints, problems are : Problem set: 0 solved, 211 unsolved in 25642 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 87/118 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:04:49] [INFO ] Deduced a trap composed of 101 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:04:49] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 0 ms to minimize.
[2025-05-31 23:04:50] [INFO ] Deduced a trap composed of 98 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:04:51] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:04:51] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:04:51] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:04:52] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:04:52] [INFO ] Deduced a trap composed of 99 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:04:52] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2025-05-31 23:04:52] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:04:52] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:04:52] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:04:52] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:04:52] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:04:52] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:04:52] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2025-05-31 23:04:52] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:04:53] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:04:53] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:04:53] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:04:53] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:04:53] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:04:53] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:04:53] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:04:53] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:04:53] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:04:53] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:04:53] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:04:53] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:04:53] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:04:53] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:04:54] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:04:54] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:04:54] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:04:54] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:04:54] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:04:54] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:04:54] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:04:54] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:04:54] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:04:54] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 2 ms to minimize.
[2025-05-31 23:04:54] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:04:54] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:04:55] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:04:55] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:04:55] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:04:55] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:04:55] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:04:55] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:04:55] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:04:55] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:04:55] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:04:55] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:04:55] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:04:55] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:04:55] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 2 ms to minimize.
[2025-05-31 23:04:55] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:04:56] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 2 ms to minimize.
[2025-05-31 23:04:56] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:04:56] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:04:56] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:04:56] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:04:56] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:04:56] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 2 ms to minimize.
[2025-05-31 23:04:56] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:04:56] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2025-05-31 23:04:56] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:04:56] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:04:57] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:04:57] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:04:57] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:04:57] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:04:57] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:04:57] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 2 ms to minimize.
[2025-05-31 23:04:57] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:04:57] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 2 ms to minimize.
[2025-05-31 23:04:57] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 2 ms to minimize.
[2025-05-31 23:04:57] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2025-05-31 23:04:57] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2025-05-31 23:04:57] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:04:57] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:04:58] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:04:58] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:04:58] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:04:58] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:04:58] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:04:58] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:04:58] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:04:58] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 2 ms to minimize.
[2025-05-31 23:04:58] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:04:59] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:04:59] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:04:59] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:04:59] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:04:59] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 2 ms to minimize.
[2025-05-31 23:04:59] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:04:59] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:04:59] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:04:59] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:04:59] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:04:59] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:04:59] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:04:59] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:00] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:05:00] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:00] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:00] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:00] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:00] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:00] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:00] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:00] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:00] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:00] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:00] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:01] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:05:01] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:05:01] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:01] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:01] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:01] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:01] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:01] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:01] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:05:01] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 2 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:05:02] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:03] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:03] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 2 ms to minimize.
[2025-05-31 23:05:03] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:05:03] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:05:03] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:03] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:03] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:03] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:05:03] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:04] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:04] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:04] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:04] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:05:04] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 2 ms to minimize.
[2025-05-31 23:05:04] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:04] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 2 ms to minimize.
[2025-05-31 23:05:04] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 2 ms to minimize.
[2025-05-31 23:05:04] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:04] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:04] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 2 ms to minimize.
[2025-05-31 23:05:04] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:05] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:05:05] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:05:05] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:05:05] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:05:05] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:05:05] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:05:05] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:05:05] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:05] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:05:05] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:05:05] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:05:06] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:05:06] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:05:06] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:05:06] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:05:06] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:06] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:05:06] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2025-05-31 23:05:06] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:05:06] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:07] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:05:07] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:05:07] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:07] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:07] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:07] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:07] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 2 ms to minimize.
[2025-05-31 23:05:07] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:07] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:07] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 2 ms to minimize.
[2025-05-31 23:05:07] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:05:07] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:07] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:07] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:08] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-05-31 23:05:08] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:08] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:08] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:08] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:08] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:08] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 2 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 2 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:09] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:05:10] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:05:10] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:05:10] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/206 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:10] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:10] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 2 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:11] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:12] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:12] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/206 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:12] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:05:12] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:05:12] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:05:12] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:05:13] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:05:14] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/206 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:14] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:05:14] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:14] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:05:14] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 2 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:15] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/206 variables, 20/401 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:16] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:17] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:05:18] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2025-05-31 23:05:18] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:05:18] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:05:18] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
SMT process timed out in 55764ms, After SMT, problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 55766ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57162 ms. Remains : 206/206 places, 212/212 transitions.
Found an invariant !
This invariant on transitions {20=1, 32=1, 46=1, 67=1, 96=1, 121=1, 134=1, 145=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {20=1, 32=1, 46=1, 67=1, 96=1, 121=1, 134=1, 145=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1450 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 40000 steps (5810 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
[2025-05-31 23:05:21] [INFO ] Flatten gal took : 10 ms
BEST_FIRST walk for 40002 steps (3638 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2025-05-31 23:05:21] [INFO ] Flatten gal took : 15 ms
[2025-05-31 23:05:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12374924461465161018.gal : 3 ms
[2025-05-31 23:05:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14441485885547484882.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12374924461465161018.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14441485885547484882.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14441485885547484882.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :40 after 117
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :117 after 230
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :230 after 487
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :487 after 1092
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1092 after 23429
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :23429 after 42516
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :42516 after 107767
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :107767 after 222552
Interrupted probabilistic random walk after 837118 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 1
Probabilistic random walk after 837118 steps, saw 418813 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
[2025-05-31 23:05:24] [INFO ] Invariant cache hit.
[2025-05-31 23:05:24] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 65536
At refinement iteration 3 (OVERLAPS) 141/149 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/153 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :222552 after 481973
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 48/201 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 212/413 variables, 201/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 38/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/418 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/149 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 23:05:24] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:05:24] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:05:24] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:05:25] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/153 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 48/201 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 212/413 variables, 201/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 38/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 23:05:25] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:05:25] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:05:25] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2025-05-31 23:05:26] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2025-05-31 23:05:26] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:05:26] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:05:26] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:05:26] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:05:26] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:05:26] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:05:26] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:05:26] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:05:26] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:05:27] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/418 variables, 5/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/418 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2297 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints]
After SMT, in 2468ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 674 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 206/206 places, 212/212 transitions.
RANDOM walk for 40000 steps (5721 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3682 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :481973 after 2.10253e+07
Interrupted probabilistic random walk after 798664 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 1
Probabilistic random walk after 798664 steps, saw 399590 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2025-05-31 23:05:30] [INFO ] Invariant cache hit.
[2025-05-31 23:05:30] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/149 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/153 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 48/201 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 212/413 variables, 201/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 38/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/418 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/418 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/149 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 23:05:31] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:05:31] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:05:31] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:05:31] [INFO ] Deduced a trap composed of 92 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/153 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 48/201 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 212/413 variables, 201/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 38/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 23:05:31] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:05:31] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:05:32] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:05:32] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:05:32] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:05:32] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:05:32] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2025-05-31 23:05:32] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:05:32] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:05:32] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:05:32] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:05:32] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:05:33] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:05:33] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/418 variables, 5/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/418 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2247 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints]
After SMT, in 2409ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 603 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 9 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2025-05-31 23:05:33] [INFO ] Invariant cache hit.
[2025-05-31 23:05:33] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-31 23:05:33] [INFO ] Invariant cache hit.
[2025-05-31 23:05:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-31 23:05:35] [INFO ] Implicit Places using invariants and state equation in 1264 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
[2025-05-31 23:05:35] [INFO ] Redundant transitions in 1 ms returned []
Running 211 sub problems to find dead transitions.
[2025-05-31 23:05:35] [INFO ] Invariant cache hit.
[2025-05-31 23:05:35] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:37] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:05:37] [INFO ] Deduced a trap composed of 91 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:05:37] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:05:37] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:05:37] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:05:38] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:05:38] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:05:38] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:05:38] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:05:39] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:05:39] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:05:39] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 262144
[2025-05-31 23:05:39] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:05:39] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:05:39] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 1 ms to minimize.
SDD size :2.10253e+07 after 2.35797e+08
[2025-05-31 23:05:39] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:39] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2025-05-31 23:05:39] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2025-05-31 23:05:39] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:05:39] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:05:40] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2025-05-31 23:05:40] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:05:40] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:05:40] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 2 ms to minimize.
[2025-05-31 23:05:40] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:05:40] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:05:40] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2025-05-31 23:05:40] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2025-05-31 23:05:40] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:05:40] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:05:41] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:05:41] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:05:41] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 2 ms to minimize.
[2025-05-31 23:05:41] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:05:41] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:05:41] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:41] [INFO ] Deduced a trap composed of 86 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:05:42] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:05:42] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:05:42] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:05:42] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:05:42] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:05:42] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:05:42] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:05:42] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:05:42] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:05:42] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:05:43] [INFO ] Deduced a trap composed of 95 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:05:43] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 1 ms to minimize.
[2025-05-31 23:05:43] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:05:43] [INFO ] Deduced a trap composed of 96 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:05:43] [INFO ] Deduced a trap composed of 94 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:05:43] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:05:43] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:45] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:05:45] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:05:45] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:05:45] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:05:45] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:05:45] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:05:45] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:05:45] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:05:46] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:05:46] [INFO ] Deduced a trap composed of 91 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:05:46] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:05:46] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 21 ms to minimize.
[2025-05-31 23:05:46] [INFO ] Deduced a trap composed of 90 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:05:46] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2025-05-31 23:05:46] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:05:46] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:05:46] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:05:46] [INFO ] Deduced a trap composed of 91 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:47] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:05:47] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:48] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:05:48] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:48] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:05:48] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:05:48] [INFO ] Deduced a trap composed of 95 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:05:49] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:05:49] [INFO ] Deduced a trap composed of 94 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:05:49] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:49] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:05:49] [INFO ] Deduced a trap composed of 89 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:05:49] [INFO ] Deduced a trap composed of 91 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:05:50] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:05:50] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (OVERLAPS) 212/418 variables, 206/324 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 38/362 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 14 (OVERLAPS) 0/418 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 362 constraints, problems are : Problem set: 0 solved, 211 unsolved in 26248 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 87/118 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:02] [INFO ] Deduced a trap composed of 101 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:06:03] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2025-05-31 23:06:03] [INFO ] Deduced a trap composed of 98 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:04] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 1 ms to minimize.
[2025-05-31 23:06:04] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:05] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:06:05] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:06:05] [INFO ] Deduced a trap composed of 99 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:06:05] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2025-05-31 23:06:05] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2025-05-31 23:06:05] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:06:05] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:06:06] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2025-05-31 23:06:06] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2025-05-31 23:06:06] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:06:06] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2025-05-31 23:06:06] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:06:06] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:06:06] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:06:06] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2025-05-31 23:06:06] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:06] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2025-05-31 23:06:06] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:07] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:06:07] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:06:07] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:06:07] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:07] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:06:07] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:07] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 1 ms to minimize.
[2025-05-31 23:06:07] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:06:07] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:06:07] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:06:07] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:06:07] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:06:07] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:08] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:06:08] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:06:08] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:06:08] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:06:08] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2025-05-31 23:06:08] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:06:08] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:08] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:06:08] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:09] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2025-05-31 23:06:09] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 2 ms to minimize.
[2025-05-31 23:06:09] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 524288
[2025-05-31 23:06:09] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 1 ms to minimize.
[2025-05-31 23:06:09] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2025-05-31 23:06:09] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2025-05-31 23:06:09] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2025-05-31 23:06:09] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:09] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:06:09] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
SDD size :2.35797e+08 after 7.29731e+08
[2025-05-31 23:06:09] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:06:09] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:06:10] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:06:10] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2025-05-31 23:06:10] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2025-05-31 23:06:10] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2025-05-31 23:06:10] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:06:10] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:10] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 2 ms to minimize.
[2025-05-31 23:06:10] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:06:10] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:06:11] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:06:11] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 1 ms to minimize.
[2025-05-31 23:06:11] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:06:11] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2025-05-31 23:06:11] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:06:11] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2025-05-31 23:06:11] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:06:11] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2025-05-31 23:06:11] [INFO ] Flatten gal took : 9 ms
[2025-05-31 23:06:11] [INFO ] Applying decomposition
[2025-05-31 23:06:11] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9732200986742230156.txt' '-o' '/tmp/graph9732200986742230156.bin' '-w' '/tmp/graph9732200986742230156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9732200986742230156.bin' '-l' '-1' '-v' '-w' '/tmp/graph9732200986742230156.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:06:11] [INFO ] Decomposing Gal with order
[2025-05-31 23:06:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:06:11] [INFO ] Removed a total of 108 redundant transitions.
[2025-05-31 23:06:11] [INFO ] Flatten gal took : 28 ms
[2025-05-31 23:06:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 7 ms.
[2025-05-31 23:06:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17810379334532134390.gal : 11 ms
[2025-05-31 23:06:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10936485062345670108.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17810379334532134390.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10936485062345670108.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
[2025-05-31 23:06:11] [INFO ] Deduced a trap composed of 58 places in 218 ms of which 1 ms to minimize.
Loading property file /tmp/ReachabilityCardinality10936485062345670108.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 182
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :182 after 1158
[2025-05-31 23:06:11] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:06:12] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1158 after 45023
[2025-05-31 23:06:12] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 1 ms to minimize.
[2025-05-31 23:06:12] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2025-05-31 23:06:12] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2025-05-31 23:06:12] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:06:12] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 1 ms to minimize.
[2025-05-31 23:06:12] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :45023 after 132864
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:12] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2025-05-31 23:06:13] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:06:13] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:13] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2025-05-31 23:06:13] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 3 ms to minimize.
[2025-05-31 23:06:13] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:06:13] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:13] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2025-05-31 23:06:13] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2025-05-31 23:06:13] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:06:13] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2025-05-31 23:06:13] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:06:13] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:14] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 3 ms to minimize.
[2025-05-31 23:06:14] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2025-05-31 23:06:14] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:06:14] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
[2025-05-31 23:06:14] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 1 ms to minimize.
[2025-05-31 23:06:14] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2025-05-31 23:06:14] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:14] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2025-05-31 23:06:15] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:15] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:15] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:15] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:06:15] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:06:15] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:06:15] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:15] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:15] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:06:15] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:06:15] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:06:15] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:06:15] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:06:16] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:06:16] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 2 ms to minimize.
[2025-05-31 23:06:16] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:06:16] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:16] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:06:16] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:16] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2025-05-31 23:06:16] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:16] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:17] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:06:17] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:06:17] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:17] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:06:17] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:06:17] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:17] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:06:17] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:06:17] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:17] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:17] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 2 ms to minimize.
[2025-05-31 23:06:17] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:06:18] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 2 ms to minimize.
[2025-05-31 23:06:18] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:18] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:06:18] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2025-05-31 23:06:18] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :132864 after 355738
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:18] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 1 ms to minimize.
[2025-05-31 23:06:18] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2025-05-31 23:06:19] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2025-05-31 23:06:19] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:06:19] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:06:19] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:06:19] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:19] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:19] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:06:19] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:06:19] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:19] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:06:19] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:06:19] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:06:19] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:06:19] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:06:20] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:06:20] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:06:20] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:06:20] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:20] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:06:20] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 2 ms to minimize.
[2025-05-31 23:06:20] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:06:21] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:06:21] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:06:21] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:06:21] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:06:21] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:06:21] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:06:21] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:06:21] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:06:21] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:06:21] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:06:21] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2025-05-31 23:06:21] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:06:21] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:06:22] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:06:22] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:06:22] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:06:22] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:22] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:06:22] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:06:22] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:06:23] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:06:23] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:23] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:23] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:23] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:06:23] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:06:23] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2025-05-31 23:06:23] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:06:23] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:06:23] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2025-05-31 23:06:23] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2025-05-31 23:06:23] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:06:23] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:06:24] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2025-05-31 23:06:24] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:06:24] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:06:24] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:24] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:06:24] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 2 ms to minimize.
[2025-05-31 23:06:25] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:06:25] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:06:25] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:06:25] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:25] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:06:25] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:06:25] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 2 ms to minimize.
[2025-05-31 23:06:25] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:25] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:06:25] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:06:25] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:06:25] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:25] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:06:25] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:06:26] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:06:26] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:06:26] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:06:26] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/206 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:26] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:06:27] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:06:27] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:06:27] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2025-05-31 23:06:27] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:27] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:06:27] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:06:27] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:06:27] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:06:27] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:06:27] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:06:27] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:06:27] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:06:27] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:06:27] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:06:28] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:06:28] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:06:28] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:06:28] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:06:28] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/206 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:29] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:06:29] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
[2025-05-31 23:06:29] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:06:29] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:06:29] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:06:29] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:06:29] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:06:29] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:06:29] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:06:29] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:06:29] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:06:29] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:06:29] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 2 ms to minimize.
[2025-05-31 23:06:30] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:06:30] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:30] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:06:30] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:06:30] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:06:30] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:06:30] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/206 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2025-05-31 23:06:31] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:06:31] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:06:31] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:06:31] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:06:31] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
SMT process timed out in 56345ms, After SMT, problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 56349ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57774 ms. Remains : 206/206 places, 212/212 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 181 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 181 transition count 187
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 181 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 52 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 178 transition count 184
Applied a total of 57 rules in 15 ms. Remains 178 /206 variables (removed 28) and now considering 184/212 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2025-05-31 23:06:31] [INFO ] Computed 31 invariants in 12 ms
[2025-05-31 23:06:31] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 23:06:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:31] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2025-05-31 23:06:31] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 23:06:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 23:06:31] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 23:06:31] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2025-05-31 23:06:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
TRAPS : Iteration 1
[2025-05-31 23:06:31] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:06:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
TRAPS : Iteration 2
[2025-05-31 23:06:32] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:06:32] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:06:32] [INFO ] Flatten gal took : 11 ms
[2025-05-31 23:06:32] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:06:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7250560271683494391.gal : 2 ms
[2025-05-31 23:06:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10307572018007758147.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7250560271683494391.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10307572018007758147.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10307572018007758147.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :370 after 1321
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1321 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 10385
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10385 after 22358
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :22358 after 49913
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :49913 after 105979
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :105979 after 222990
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :222990 after 458153
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :458153 after 937334
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :937334 after 1.90261e+06
Detected timeout of ITS tools.
[2025-05-31 23:06:47] [INFO ] Flatten gal took : 13 ms
[2025-05-31 23:06:47] [INFO ] Applying decomposition
[2025-05-31 23:06:47] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14628939380019223665.txt' '-o' '/tmp/graph14628939380019223665.bin' '-w' '/tmp/graph14628939380019223665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14628939380019223665.bin' '-l' '-1' '-v' '-w' '/tmp/graph14628939380019223665.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:06:47] [INFO ] Decomposing Gal with order
[2025-05-31 23:06:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:06:47] [INFO ] Removed a total of 106 redundant transitions.
[2025-05-31 23:06:47] [INFO ] Flatten gal took : 15 ms
[2025-05-31 23:06:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 3 ms.
[2025-05-31 23:06:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12592831787410161245.gal : 3 ms
[2025-05-31 23:06:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16159608433543328315.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12592831787410161245.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16159608433543328315.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16159608433543328315.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2837
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2837 after 34890
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :34890 after 34890
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :34890 after 35064
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :35064 after 35186
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :35186 after 35400
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35400 after 80976
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :80976 after 245824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :245824 after 250030
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :250030 after 965794
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30639 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-08 in 185826 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 233 rows 232 cols
[2025-05-31 23:07:02] [INFO ] Computed 35 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1445 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (954 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:07:02] [INFO ] Invariant cache hit.
[2025-05-31 23:07:02] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 23:07:02] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 23:07:02] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-05-31 23:07:02] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-31 23:07:02] [INFO ] [Real]Added 31 Read/Feed constraints in 99 ms returned sat
[2025-05-31 23:07:02] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 14 ms.
[2025-05-31 23:07:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 23:07:02] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 23:07:02] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-05-31 23:07:02] [INFO ] [Nat]Added 31 Read/Feed constraints in 138 ms returned sat
[2025-05-31 23:07:02] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 14 ms.
[2025-05-31 23:07:03] [INFO ] Added : 102 causal constraints over 22 iterations in 552 ms. Result :sat
Minimization took 351 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 232 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p253) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 231/231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 230 transition count 229
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 17 place count 223 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 222 transition count 222
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 222 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 221 transition count 221
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 30 place count 221 transition count 212
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 39 place count 212 transition count 212
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 212 transition count 212
Applied a total of 40 rules in 20 ms. Remains 212 /232 variables (removed 20) and now considering 212/231 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 212/232 places, 212/231 transitions.
// Phase 1: matrix 212 rows 212 cols
[2025-05-31 23:07:03] [INFO ] Computed 35 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144047 resets) in 795 ms. (1256 steps per ms)
BEST_FIRST walk for 1000000 steps (91638 resets) in 551 ms. (1811 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:07:05] [INFO ] Invariant cache hit.
[2025-05-31 23:07:05] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-05-31 23:07:05] [INFO ] [Real]Absence check using 9 positive and 26 generalized place invariants in 4 ms returned sat
[2025-05-31 23:07:05] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-05-31 23:07:05] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:07:05] [INFO ] [Real]Added 39 Read/Feed constraints in 51 ms returned sat
[2025-05-31 23:07:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-05-31 23:07:05] [INFO ] [Nat]Absence check using 9 positive and 26 generalized place invariants in 4 ms returned sat
[2025-05-31 23:07:05] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-05-31 23:07:05] [INFO ] [Nat]Added 39 Read/Feed constraints in 57 ms returned sat
[2025-05-31 23:07:05] [INFO ] Computed and/alt/rep : 168/1045/168 causal constraints (skipped 43 transitions) in 13 ms.
[2025-05-31 23:07:06] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2025-05-31 23:07:06] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:07:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2025-05-31 23:07:06] [INFO ] Added : 95 causal constraints over 20 iterations in 879 ms. Result :sat
Minimization took 280 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 212/212 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2025-05-31 23:07:06] [INFO ] Invariant cache hit.
[2025-05-31 23:07:07] [INFO ] Implicit Places using invariants in 164 ms returned [42, 47, 137, 209]
[2025-05-31 23:07:07] [INFO ] Actually due to overlaps returned [209]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 211/212 places, 212/212 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 211
Applied a total of 2 rules in 13 ms. Remains 210 /211 variables (removed 1) and now considering 211/212 (removed 1) transitions.
// Phase 1: matrix 211 rows 210 cols
[2025-05-31 23:07:07] [INFO ] Computed 34 invariants in 12 ms
[2025-05-31 23:07:07] [INFO ] Implicit Places using invariants in 171 ms returned [42, 47, 137]
[2025-05-31 23:07:07] [INFO ] Actually due to overlaps returned [47, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 171 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/212 places, 211/212 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 208 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 207 transition count 210
Applied a total of 2 rules in 5 ms. Remains 207 /208 variables (removed 1) and now considering 210/211 (removed 1) transitions.
// Phase 1: matrix 210 rows 207 cols
[2025-05-31 23:07:07] [INFO ] Computed 32 invariants in 10 ms
[2025-05-31 23:07:07] [INFO ] Implicit Places using invariants in 140 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 206/212 places, 210/212 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 206 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 205 transition count 209
Applied a total of 2 rules in 13 ms. Remains 205 /206 variables (removed 1) and now considering 209/210 (removed 1) transitions.
// Phase 1: matrix 209 rows 205 cols
[2025-05-31 23:07:07] [INFO ] Computed 31 invariants in 11 ms
[2025-05-31 23:07:07] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-05-31 23:07:07] [INFO ] Invariant cache hit.
[2025-05-31 23:07:07] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:07:10] [INFO ] Implicit Places using invariants and state equation in 2505 ms returned [53, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2647 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 203/212 places, 209/212 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 202 transition count 208
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 202 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 200 transition count 208
Applied a total of 6 rules in 12 ms. Remains 200 /203 variables (removed 3) and now considering 208/209 (removed 1) transitions.
// Phase 1: matrix 208 rows 200 cols
[2025-05-31 23:07:10] [INFO ] Computed 29 invariants in 10 ms
[2025-05-31 23:07:10] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-05-31 23:07:10] [INFO ] Invariant cache hit.
[2025-05-31 23:07:10] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:07:12] [INFO ] Implicit Places using invariants and state equation in 2127 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 200/212 places, 208/212 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 5433 ms. Remains : 200/212 places, 208/212 transitions.
[2025-05-31 23:07:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144494 resets) in 676 ms. (1477 steps per ms)
BEST_FIRST walk for 1000001 steps (91199 resets) in 476 ms. (2096 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:07:13] [INFO ] Invariant cache hit.
[2025-05-31 23:07:13] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Real]Absence check using 8 positive and 21 generalized place invariants in 3 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-05-31 23:07:13] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:07:13] [INFO ] [Real]Added 39 Read/Feed constraints in 42 ms returned sat
[2025-05-31 23:07:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Nat]Absence check using 8 positive and 21 generalized place invariants in 3 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Nat]Added 39 Read/Feed constraints in 65 ms returned sat
[2025-05-31 23:07:13] [INFO ] Computed and/alt/rep : 149/936/149 causal constraints (skipped 58 transitions) in 15 ms.
[2025-05-31 23:07:14] [INFO ] Added : 69 causal constraints over 14 iterations in 395 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 200/200 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-05-31 23:07:14] [INFO ] Invariant cache hit.
[2025-05-31 23:07:14] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-05-31 23:07:14] [INFO ] Invariant cache hit.
[2025-05-31 23:07:14] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:07:16] [INFO ] Implicit Places using invariants and state equation in 2128 ms returned []
Implicit Place search using SMT with State Equation took 2248 ms to find 0 implicit places.
[2025-05-31 23:07:16] [INFO ] Redundant transitions in 1 ms returned []
Running 207 sub problems to find dead transitions.
[2025-05-31 23:07:16] [INFO ] Invariant cache hit.
[2025-05-31 23:07:16] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 2/200 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:07:19] [INFO ] Deduced a trap composed of 98 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:07:19] [INFO ] Deduced a trap composed of 94 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:07:19] [INFO ] Deduced a trap composed of 92 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:07:19] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:07:19] [INFO ] Deduced a trap composed of 96 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:07:20] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 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 TDEAD81 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD126 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 TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 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 TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 6 (OVERLAPS) 208/408 variables, 200/235 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 39/274 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/274 constraints. Problems are: Problem set: 106 solved, 101 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/274 constraints. Problems are: Problem set: 106 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 274 constraints, problems are : Problem set: 106 solved, 101 unsolved in 8191 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 200/200 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 106 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 2/2 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 7/9 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 53/151 variables, 6/15 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 6/21 constraints. Problems are: Problem set: 106 solved, 101 unsolved
[2025-05-31 23:07:25] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:07:25] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2025-05-31 23:07:25] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 3/24 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/24 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 48/199 variables, 14/38 constraints. Problems are: Problem set: 106 solved, 101 unsolved
[2025-05-31 23:07:26] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2025-05-31 23:07:26] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 2/40 constraints. Problems are: Problem set: 106 solved, 101 unsolved
[2025-05-31 23:07:27] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 2 ms to minimize.
[2025-05-31 23:07:27] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:07:27] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:07:27] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:07:27] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:07:27] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:07:27] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:07:27] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:07:28] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:07:28] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:07:28] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:07:28] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:07:28] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:07:28] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:07:28] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:07:28] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 16/56 constraints. Problems are: Problem set: 106 solved, 101 unsolved
[2025-05-31 23:07:28] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:07:28] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:07:28] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:07:29] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:07:29] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:07:29] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:07:29] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:07:29] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:07:29] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 9/65 constraints. Problems are: Problem set: 106 solved, 101 unsolved
[2025-05-31 23:07:29] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:07:29] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:07:30] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:07:30] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:07:30] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:07:30] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:07:30] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 2 ms to minimize.
[2025-05-31 23:07:30] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:07:30] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 3 ms to minimize.
[2025-05-31 23:07:30] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:07:30] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:07:30] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:07:30] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:07:30] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:07:30] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:07:30] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:07:31] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:07:31] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:07:31] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 19/84 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/84 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 208/407 variables, 199/283 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 39/322 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 101/423 constraints. Problems are: Problem set: 106 solved, 101 unsolved
[2025-05-31 23:07:34] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:07:34] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
[2025-05-31 23:07:34] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:07:34] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:07:34] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:07:35] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:07:35] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/407 variables, 7/430 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/407 variables, 0/430 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 18 (OVERLAPS) 1/408 variables, 1/431 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/408 variables, 0/431 constraints. Problems are: Problem set: 106 solved, 101 unsolved
At refinement iteration 20 (OVERLAPS) 0/408 variables, 0/431 constraints. Problems are: Problem set: 106 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 431 constraints, problems are : Problem set: 106 solved, 101 unsolved in 21136 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 200/200 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 101/207 constraints, Known Traps: 62/62 constraints]
After SMT, in 29411ms problems are : Problem set: 106 solved, 101 unsolved
Search for dead transitions found 106 dead transitions in 29416ms
Found 106 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 106 transitions
Dead transitions reduction (with SMT) removed 106 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 200/200 places, 102/208 transitions.
Graph (complete) has 475 edges and 200 vertex of which 100 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.1 ms
Discarding 100 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 100 /200 variables (removed 100) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 100 cols
[2025-05-31 23:07:46] [INFO ] Computed 16 invariants in 1 ms
[2025-05-31 23:07:46] [INFO ] Implicit Places using invariants in 71 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 99/200 places, 102/208 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 101
Applied a total of 2 rules in 3 ms. Remains 98 /99 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 98 cols
[2025-05-31 23:07:46] [INFO ] Computed 15 invariants in 4 ms
[2025-05-31 23:07:46] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-31 23:07:46] [INFO ] Invariant cache hit.
[2025-05-31 23:07:46] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-05-31 23:07:46] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 98/200 places, 101/208 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 32055 ms. Remains : 98/200 places, 101/208 transitions.
[2025-05-31 23:07:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144296 resets) in 584 ms. (1709 steps per ms)
BEST_FIRST walk for 1000001 steps (91561 resets) in 417 ms. (2392 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:07:47] [INFO ] Invariant cache hit.
[2025-05-31 23:07:47] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-31 23:07:47] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:07:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-05-31 23:07:47] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-05-31 23:07:47] [INFO ] [Real]Added 19 Read/Feed constraints in 7 ms returned sat
[2025-05-31 23:07:47] [INFO ] Computed and/alt/rep : 87/532/87 causal constraints (skipped 13 transitions) in 7 ms.
[2025-05-31 23:07:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-31 23:07:47] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 23:07:47] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-05-31 23:07:47] [INFO ] [Nat]Added 19 Read/Feed constraints in 11 ms returned sat
[2025-05-31 23:07:47] [INFO ] Computed and/alt/rep : 87/532/87 causal constraints (skipped 13 transitions) in 6 ms.
[2025-05-31 23:07:48] [INFO ] Added : 76 causal constraints over 16 iterations in 272 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 98/98 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 23:07:48] [INFO ] Invariant cache hit.
[2025-05-31 23:07:48] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-31 23:07:48] [INFO ] Invariant cache hit.
[2025-05-31 23:07:48] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-05-31 23:07:48] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2025-05-31 23:07:48] [INFO ] Redundant transitions in 0 ms returned []
Running 100 sub problems to find dead transitions.
[2025-05-31 23:07:48] [INFO ] Invariant cache hit.
[2025-05-31 23:07:48] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 2/98 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-31 23:07:49] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2025-05-31 23:07:49] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2025-05-31 23:07:49] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 0 ms to minimize.
[2025-05-31 23:07:49] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
[2025-05-31 23:07:49] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 101/199 variables, 98/118 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 19/137 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 100 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/199 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 137 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2980 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 2/98 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-31 23:07:52] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2025-05-31 23:07:52] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 0 ms to minimize.
[2025-05-31 23:07:52] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-31 23:07:52] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2025-05-31 23:07:52] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 101/199 variables, 98/123 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 19/142 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 100/242 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-31 23:07:53] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 0 ms to minimize.
[2025-05-31 23:07:53] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2025-05-31 23:07:54] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:07:54] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2025-05-31 23:07:54] [INFO ] Deduced a trap composed of 49 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 0/199 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 247 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5208 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 15/15 constraints]
After SMT, in 8215ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 8217ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8501 ms. Remains : 98/98 places, 101/101 transitions.
[2025-05-31 23:07:56] [INFO ] Flatten gal took : 3 ms
[2025-05-31 23:07:56] [INFO ] Flatten gal took : 4 ms
[2025-05-31 23:07:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13947280694692018827.gal : 1 ms
[2025-05-31 23:07:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5169145618939342587.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13947280694692018827.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5169145618939342587.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5169145618939342587.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :27 after 42
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :42 after 131
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :131 after 267
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :267 after 743
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :743 after 2681
RANDOM walk for 40000 steps (5759 resets) in 259 ms. (153 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2681 after 14572
BEST_FIRST walk for 40001 steps (3663 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3697 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :14572 after 43991
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :43991 after 124954
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :124954 after 292797
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :292797 after 644320
Interrupted probabilistic random walk after 586857 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 2
Probabilistic random walk after 586857 steps, saw 293686 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
[2025-05-31 23:08:00] [INFO ] Invariant cache hit.
[2025-05-31 23:08:00] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/93 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 101/194 variables, 93/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 19/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/199 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/199 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/93 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:08:00] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 101/194 variables, 93/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 19/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:08:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/199 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/199 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
After SMT, in 1022ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 307 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 101/101 transitions.
RANDOM walk for 40000 steps (5779 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3646 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3665 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :644320 after 3.82848e+08
Interrupted probabilistic random walk after 541635 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 2
Probabilistic random walk after 541635 steps, saw 271077 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2025-05-31 23:08:04] [INFO ] Invariant cache hit.
[2025-05-31 23:08:04] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/93 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:08:04] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2025-05-31 23:08:04] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2025-05-31 23:08:04] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2025-05-31 23:08:04] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:08:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:08:04] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2025-05-31 23:08:04] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:08:04] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2025-05-31 23:08:04] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2025-05-31 23:08:05] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2025-05-31 23:08:05] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-05-31 23:08:05] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2025-05-31 23:08:05] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2025-05-31 23:08:05] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:08:05] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2025-05-31 23:08:05] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 101/194 variables, 93/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 19/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/199 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/199 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 752 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/93 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:08:05] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:08:05] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 101/194 variables, 93/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 19/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:08:05] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/199 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/199 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
After SMT, in 997ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 388 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 98/98 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 23:08:05] [INFO ] Invariant cache hit.
[2025-05-31 23:08:06] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-31 23:08:06] [INFO ] Invariant cache hit.
[2025-05-31 23:08:06] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-05-31 23:08:06] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2025-05-31 23:08:06] [INFO ] Redundant transitions in 0 ms returned []
Running 100 sub problems to find dead transitions.
[2025-05-31 23:08:06] [INFO ] Invariant cache hit.
[2025-05-31 23:08:06] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 2/98 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-31 23:08:06] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2025-05-31 23:08:06] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:08:06] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:08:07] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
[2025-05-31 23:08:07] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 101/199 variables, 98/118 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 19/137 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 100 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/199 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 137 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2979 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 2/98 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-31 23:08:09] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2025-05-31 23:08:09] [INFO ] Deduced a trap composed of 45 places in 28 ms of which 1 ms to minimize.
[2025-05-31 23:08:09] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-31 23:08:09] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:08:09] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 101/199 variables, 98/123 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 19/142 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 100/242 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-31 23:08:11] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2025-05-31 23:08:11] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2025-05-31 23:08:11] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:08:11] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:08:11] [INFO ] Deduced a trap composed of 49 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 0/199 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 247 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5091 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 15/15 constraints]
After SMT, in 8104ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 8106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8390 ms. Remains : 98/98 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 98 transition count 93
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 90 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 86 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 86 transition count 89
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 86 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 26 place count 85 transition count 88
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 85 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 83 transition count 86
Applied a total of 30 rules in 7 ms. Remains 83 /98 variables (removed 15) and now considering 86/101 (removed 15) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 86 rows 83 cols
[2025-05-31 23:08:14] [INFO ] Computed 15 invariants in 2 ms
[2025-05-31 23:08:14] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 23:08:14] [INFO ] [Real]Absence check using 5 positive and 10 generalized place invariants in 2 ms returned sat
[2025-05-31 23:08:14] [INFO ] After 30ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-31 23:08:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 23:08:14] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 23:08:14] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2025-05-31 23:08:14] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2025-05-31 23:08:14] [INFO ] Flatten gal took : 6 ms
[2025-05-31 23:08:14] [INFO ] Flatten gal took : 4 ms
[2025-05-31 23:08:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13084267290833239366.gal : 1 ms
[2025-05-31 23:08:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5629841106902441596.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13084267290833239366.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5629841106902441596.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5629841106902441596.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 86
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :86 after 165
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :165 after 314
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :314 after 653
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :653 after 1661
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1661 after 3685
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3685 after 7742
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7742 after 15864
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :15864 after 32077
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :3.82848e+08 after 2.55683e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :32077 after 64493
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :64493 after 129251
Detected timeout of ITS tools.
[2025-05-31 23:08:29] [INFO ] Flatten gal took : 3 ms
[2025-05-31 23:08:29] [INFO ] Applying decomposition
[2025-05-31 23:08:29] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2897445497924610319.txt' '-o' '/tmp/graph2897445497924610319.bin' '-w' '/tmp/graph2897445497924610319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2897445497924610319.bin' '-l' '-1' '-v' '-w' '/tmp/graph2897445497924610319.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:08:29] [INFO ] Decomposing Gal with order
[2025-05-31 23:08:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:08:29] [INFO ] Removed a total of 51 redundant transitions.
[2025-05-31 23:08:29] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:08:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 1 ms.
[2025-05-31 23:08:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13663242388571027587.gal : 4 ms
[2025-05-31 23:08:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8763238058109041686.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13663242388571027587.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8763238058109041686.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8763238058109041686.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :3746 after 3775
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30211 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 23:08:44] [INFO ] Flatten gal took : 4 ms
[2025-05-31 23:08:44] [INFO ] Applying decomposition
[2025-05-31 23:08:44] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17964335950570537043.txt' '-o' '/tmp/graph17964335950570537043.bin' '-w' '/tmp/graph17964335950570537043.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17964335950570537043.bin' '-l' '-1' '-v' '-w' '/tmp/graph17964335950570537043.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:08:44] [INFO ] Decomposing Gal with order
[2025-05-31 23:08:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:08:44] [INFO ] Removed a total of 51 redundant transitions.
[2025-05-31 23:08:44] [INFO ] Flatten gal took : 8 ms
[2025-05-31 23:08:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 3 ms.
[2025-05-31 23:08:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13661060661911936418.gal : 3 ms
[2025-05-31 23:08:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality125187012632978959.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13661060661911936418.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality125187012632978959.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality125187012632978959.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 40
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :40 after 64
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :64 after 1158
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1158 after 29264
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :29264 after 132858
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-09 in 152489 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 233 rows 232 cols
[2025-05-31 23:09:34] [INFO ] Computed 35 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1476 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (927 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:09:34] [INFO ] Invariant cache hit.
[2025-05-31 23:09:34] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 23:09:34] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 3 ms returned sat
[2025-05-31 23:09:35] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2025-05-31 23:09:35] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-31 23:09:35] [INFO ] [Real]Added 31 Read/Feed constraints in 87 ms returned sat
[2025-05-31 23:09:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:09:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 23:09:35] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 23:09:35] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2025-05-31 23:09:35] [INFO ] [Nat]Added 31 Read/Feed constraints in 168 ms returned sat
[2025-05-31 23:09:35] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 12 ms.
[2025-05-31 23:09:38] [INFO ] Added : 210 causal constraints over 42 iterations in 3212 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 232 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p448) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 231/231 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 231 transition count 230
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 223 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 222 transition count 222
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 222 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 221 transition count 221
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 32 place count 221 transition count 211
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 42 place count 211 transition count 211
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 211 transition count 211
Applied a total of 43 rules in 22 ms. Remains 211 /232 variables (removed 21) and now considering 211/231 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 211/232 places, 211/231 transitions.
// Phase 1: matrix 211 rows 211 cols
[2025-05-31 23:09:39] [INFO ] Computed 35 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144214 resets) in 705 ms. (1416 steps per ms)
BEST_FIRST walk for 1000001 steps (91432 resets) in 484 ms. (2061 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:09:40] [INFO ] Invariant cache hit.
[2025-05-31 23:09:40] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:09:40] [INFO ] [Real]Absence check using 3 positive and 32 generalized place invariants in 5 ms returned sat
[2025-05-31 23:09:40] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-05-31 23:09:40] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 23:09:40] [INFO ] [Real]Added 40 Read/Feed constraints in 71 ms returned sat
[2025-05-31 23:09:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:09:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:09:40] [INFO ] [Nat]Absence check using 3 positive and 32 generalized place invariants in 7 ms returned sat
[2025-05-31 23:09:40] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-05-31 23:09:41] [INFO ] [Nat]Added 40 Read/Feed constraints in 104 ms returned sat
[2025-05-31 23:09:41] [INFO ] Computed and/alt/rep : 165/1033/165 causal constraints (skipped 45 transitions) in 13 ms.
[2025-05-31 23:09:41] [INFO ] Added : 84 causal constraints over 17 iterations in 579 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 211/211 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 211/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 211 /211 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2025-05-31 23:09:43] [INFO ] Invariant cache hit.
[2025-05-31 23:09:43] [INFO ] Implicit Places using invariants in 162 ms returned [42, 47, 136, 208]
[2025-05-31 23:09:43] [INFO ] Actually due to overlaps returned [208]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 210/211 places, 211/211 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 210
Applied a total of 2 rules in 10 ms. Remains 209 /210 variables (removed 1) and now considering 210/211 (removed 1) transitions.
// Phase 1: matrix 210 rows 209 cols
[2025-05-31 23:09:43] [INFO ] Computed 34 invariants in 11 ms
[2025-05-31 23:09:44] [INFO ] Implicit Places using invariants in 153 ms returned [42, 47, 136]
[2025-05-31 23:09:44] [INFO ] Actually due to overlaps returned [47, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 154 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/211 places, 210/211 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 209
Applied a total of 2 rules in 6 ms. Remains 206 /207 variables (removed 1) and now considering 209/210 (removed 1) transitions.
// Phase 1: matrix 209 rows 206 cols
[2025-05-31 23:09:44] [INFO ] Computed 32 invariants in 10 ms
[2025-05-31 23:09:44] [INFO ] Implicit Places using invariants in 132 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 205/211 places, 209/211 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 205 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 204 transition count 208
Applied a total of 2 rules in 6 ms. Remains 204 /205 variables (removed 1) and now considering 208/209 (removed 1) transitions.
// Phase 1: matrix 208 rows 204 cols
[2025-05-31 23:09:44] [INFO ] Computed 31 invariants in 8 ms
[2025-05-31 23:09:44] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-05-31 23:09:44] [INFO ] Invariant cache hit.
[2025-05-31 23:09:44] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 23:09:45] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 1759 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 204/211 places, 208/211 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2233 ms. Remains : 204/211 places, 208/211 transitions.
[2025-05-31 23:09:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144595 resets) in 686 ms. (1455 steps per ms)
BEST_FIRST walk for 1000000 steps (91499 resets) in 479 ms. (2083 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:09:47] [INFO ] Invariant cache hit.
[2025-05-31 23:09:47] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-05-31 23:09:47] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2025-05-31 23:09:47] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2025-05-31 23:09:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 23:09:47] [INFO ] [Real]Added 40 Read/Feed constraints in 92 ms returned sat
[2025-05-31 23:09:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:09:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-05-31 23:09:47] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2025-05-31 23:09:47] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2025-05-31 23:09:47] [INFO ] [Nat]Added 40 Read/Feed constraints in 102 ms returned sat
[2025-05-31 23:09:47] [INFO ] Computed and/alt/rep : 164/1043/164 causal constraints (skipped 43 transitions) in 12 ms.
[2025-05-31 23:09:48] [INFO ] Added : 108 causal constraints over 22 iterations in 697 ms. Result :sat
Minimization took 373 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 204 /204 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 204/204 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 204 /204 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-05-31 23:09:50] [INFO ] Invariant cache hit.
[2025-05-31 23:09:50] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-31 23:09:50] [INFO ] Invariant cache hit.
[2025-05-31 23:09:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 23:09:52] [INFO ] Implicit Places using invariants and state equation in 1620 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
[2025-05-31 23:09:52] [INFO ] Redundant transitions in 1 ms returned []
Running 207 sub problems to find dead transitions.
[2025-05-31 23:09:52] [INFO ] Invariant cache hit.
[2025-05-31 23:09:52] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 2/204 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:09:54] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:09:54] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:09:54] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:09:55] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:09:55] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:09:55] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:09:55] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:09:55] [INFO ] Deduced a trap composed of 90 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:09:55] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 2 ms to minimize.
[2025-05-31 23:09:55] [INFO ] Deduced a trap composed of 92 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:09:55] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:09:55] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:09:55] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:09:56] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:09:56] [INFO ] Deduced a trap composed of 94 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:09:56] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:09:56] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:09:56] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:09:56] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:09:56] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:09:56] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2025-05-31 23:09:56] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2025-05-31 23:09:57] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:09:57] [INFO ] Deduced a trap composed of 94 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:09:57] [INFO ] Deduced a trap composed of 94 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:09:57] [INFO ] Deduced a trap composed of 94 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:09:57] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:09:57] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:09:57] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:09:57] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:09:57] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:09:57] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:09:57] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:09:58] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:09:58] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:09:58] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2025-05-31 23:09:58] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:09:58] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:09:58] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:09:58] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:09:58] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2025-05-31 23:09:58] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2025-05-31 23:09:59] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:09:59] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:09:59] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 2 ms to minimize.
[2025-05-31 23:09:59] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:09:59] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:09:59] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
[2025-05-31 23:09:59] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:09:59] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:09:59] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:10:00] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:10:00] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:10:00] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:10:00] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:10:00] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:10:00] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:10:00] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:10:00] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:10:00] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:10:01] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:10:02] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:10:02] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:10:02] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2025-05-31 23:10:02] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:10:02] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:10:02] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:10:03] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 2 ms to minimize.
[2025-05-31 23:10:03] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:10:03] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:10:03] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:10:03] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:10:03] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:10:03] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:10:03] [INFO ] Deduced a trap composed of 91 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:10:04] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:10:04] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:10:04] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:10:04] [INFO ] Deduced a trap composed of 94 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:10:04] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:10:04] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:10:04] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 15/113 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:10:05] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 0 ms to minimize.
[2025-05-31 23:10:05] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:10:06] [INFO ] Deduced a trap composed of 91 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:10:07] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:10:07] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:10:08] [INFO ] Deduced a trap composed of 91 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:10:08] [INFO ] Deduced a trap composed of 89 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:10:08] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:10:08] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:10:08] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:10:08] [INFO ] Deduced a trap composed of 93 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Problem TDEAD155 is UNSAT
At refinement iteration 12 (OVERLAPS) 208/412 variables, 204/328 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 40/368 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 15 (OVERLAPS) 0/412 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 368 constraints, problems are : Problem set: 1 solved, 206 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 204/204 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 93/93 constraints]
Escalating to Integer solving :Problem set: 1 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 18/20 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 3 (OVERLAPS) 2/204 variables, 11/31 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 93/124 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/124 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 208/412 variables, 204/328 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 40/368 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 206/574 constraints. Problems are: Problem set: 1 solved, 206 unsolved
[2025-05-31 23:10:35] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:10:36] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:10:36] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:10:37] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:10:37] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:10:37] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:10:37] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:10:37] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 8/582 constraints. Problems are: Problem set: 1 solved, 206 unsolved
[2025-05-31 23:10:44] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:10:46] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:10:46] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:10:47] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 4/586 constraints. Problems are: Problem set: 1 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/412 variables, and 586 constraints, problems are : Problem set: 1 solved, 206 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 204/204 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 206/207 constraints, Known Traps: 105/105 constraints]
After SMT, in 60105ms problems are : Problem set: 1 solved, 206 unsolved
Search for dead transitions found 1 dead transitions in 60111ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 204/204 places, 207/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2025-05-31 23:10:52] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61877 ms. Remains : 204/204 places, 207/208 transitions.
// Phase 1: matrix 207 rows 204 cols
[2025-05-31 23:10:52] [INFO ] Computed 32 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144187 resets) in 684 ms. (1459 steps per ms)
BEST_FIRST walk for 1000000 steps (91489 resets) in 492 ms. (2028 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:10:53] [INFO ] Invariant cache hit.
[2025-05-31 23:10:53] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-31 23:10:53] [INFO ] [Real]Absence check using 13 positive and 19 generalized place invariants in 2 ms returned sat
[2025-05-31 23:10:53] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2025-05-31 23:10:53] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:10:53] [INFO ] [Real]Added 39 Read/Feed constraints in 66 ms returned sat
[2025-05-31 23:10:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:10:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-31 23:10:54] [INFO ] [Nat]Absence check using 13 positive and 19 generalized place invariants in 3 ms returned sat
[2025-05-31 23:10:54] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-05-31 23:10:54] [INFO ] [Nat]Added 39 Read/Feed constraints in 173 ms returned sat
[2025-05-31 23:10:54] [INFO ] Computed and/alt/rep : 163/1029/163 causal constraints (skipped 43 transitions) in 13 ms.
[2025-05-31 23:10:55] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:10:55] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:10:55] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:10:55] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:10:55] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:10:55] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:10:55] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:10:55] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:10:56] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:10:56] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:10:56] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:10:56] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:10:56] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:10:56] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:10:56] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:10:56] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:10:56] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:10:56] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1591 ms
[2025-05-31 23:10:56] [INFO ] Added : 107 causal constraints over 22 iterations in 2593 ms. Result :sat
Minimization took 347 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 207/207 transitions.
Applied a total of 0 rules in 2 ms. Remains 204 /204 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 204/204 places, 207/207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 207/207 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2025-05-31 23:11:04] [INFO ] Invariant cache hit.
[2025-05-31 23:11:04] [INFO ] Implicit Places using invariants in 123 ms returned [147]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 203/204 places, 207/207 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 202 transition count 206
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 202 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 201 transition count 205
Applied a total of 4 rules in 7 ms. Remains 201 /203 variables (removed 2) and now considering 205/207 (removed 2) transitions.
// Phase 1: matrix 205 rows 201 cols
[2025-05-31 23:11:04] [INFO ] Computed 31 invariants in 10 ms
[2025-05-31 23:11:04] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-05-31 23:11:04] [INFO ] Invariant cache hit.
[2025-05-31 23:11:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-31 23:11:06] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 201/204 places, 205/207 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1516 ms. Remains : 201/204 places, 205/207 transitions.
[2025-05-31 23:11:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144052 resets) in 676 ms. (1477 steps per ms)
BEST_FIRST walk for 1000000 steps (91322 resets) in 484 ms. (2061 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:11:07] [INFO ] Invariant cache hit.
[2025-05-31 23:11:07] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-31 23:11:07] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2025-05-31 23:11:07] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-05-31 23:11:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-31 23:11:07] [INFO ] [Real]Added 41 Read/Feed constraints in 79 ms returned sat
[2025-05-31 23:11:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:11:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-31 23:11:07] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2025-05-31 23:11:07] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2025-05-31 23:11:07] [INFO ] [Nat]Added 41 Read/Feed constraints in 123 ms returned sat
[2025-05-31 23:11:07] [INFO ] Computed and/alt/rep : 160/1016/160 causal constraints (skipped 44 transitions) in 11 ms.
[2025-05-31 23:11:08] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:11:08] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:11:08] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:11:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 302 ms
[2025-05-31 23:11:08] [INFO ] Added : 118 causal constraints over 24 iterations in 987 ms. Result :sat
Minimization took 353 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 205/205 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 201/201 places, 205/205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 205/205 transitions.
Applied a total of 0 rules in 3 ms. Remains 201 /201 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2025-05-31 23:11:11] [INFO ] Invariant cache hit.
[2025-05-31 23:11:11] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-05-31 23:11:11] [INFO ] Invariant cache hit.
[2025-05-31 23:11:11] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-31 23:11:12] [INFO ] Implicit Places using invariants and state equation in 1262 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
[2025-05-31 23:11:12] [INFO ] Redundant transitions in 1 ms returned []
Running 204 sub problems to find dead transitions.
[2025-05-31 23:11:12] [INFO ] Invariant cache hit.
[2025-05-31 23:11:12] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 2/201 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:11:15] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:11:15] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:11:15] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:11:15] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:11:15] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:11:15] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:11:15] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:11:15] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:11:16] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:11:16] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:11:16] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:11:16] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:11:16] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:11:16] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:11:16] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 0 ms to minimize.
[2025-05-31 23:11:16] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:11:16] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2025-05-31 23:11:16] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2025-05-31 23:11:16] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:11:17] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:11:17] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2025-05-31 23:11:17] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:11:17] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:11:18] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:11:18] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:11:18] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:11:18] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:11:18] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:11:19] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:11:19] [INFO ] Deduced a trap composed of 92 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:11:19] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:11:19] [INFO ] Deduced a trap composed of 92 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:11:20] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:11:20] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:11:20] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:11:20] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:11:20] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:11:20] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:11:20] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:11:20] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:11:20] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:11:21] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:11:21] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2025-05-31 23:11:21] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:11:21] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:11:21] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:11:21] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:11:21] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:11:21] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:11:21] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:11:21] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:11:21] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:11:22] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:11:22] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 13/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:11:23] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:11:23] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:11:23] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:11:23] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:11:23] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2025-05-31 23:11:23] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:11:23] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:11:23] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:11:23] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:11:23] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:11:23] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:11:23] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:11:24] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:11:24] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:11:24] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:11:24] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 16/101 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:11:25] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:11:26] [INFO ] Deduced a trap composed of 91 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:11:26] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:11:26] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:11:26] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:11:26] [INFO ] Deduced a trap composed of 81 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:11:27] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:11:27] [INFO ] Deduced a trap composed of 81 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:11:27] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:11:27] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:11:27] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:11:27] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:11:27] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:11:27] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:11:27] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 0 ms to minimize.
[2025-05-31 23:11:27] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:11:27] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 17/118 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:11:28] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:11:28] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:11:28] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:11:28] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:11:29] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:11:29] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:11:29] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:11:29] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 13 (OVERLAPS) 205/406 variables, 201/327 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 41/368 constraints. Problems are: Problem set: 0 solved, 204 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 16 (OVERLAPS) 0/406 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 368 constraints, problems are : Problem set: 0 solved, 204 unsolved in 27778 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 201/201 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 2/201 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 95/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:11:41] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:11:42] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:11:42] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:11:42] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:11:42] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:11:42] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:11:42] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2025-05-31 23:11:42] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2025-05-31 23:11:42] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 205/406 variables, 201/336 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 41/377 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 204/581 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:11:52] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:11:53] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2025-05-31 23:11:54] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:11:55] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:11:55] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:11:56] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:11:56] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:11:57] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:11:57] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2025-05-31 23:11:58] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:11:58] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:11:58] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:11:58] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:11:58] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:11:58] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:11:58] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:11:59] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:11:59] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:12:00] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:12:01] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 20/601 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 601 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 201/201 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 124/124 constraints]
After SMT, in 57875ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 57879ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59285 ms. Remains : 201/201 places, 205/205 transitions.
[2025-05-31 23:12:10] [INFO ] Flatten gal took : 13 ms
[2025-05-31 23:12:10] [INFO ] Flatten gal took : 8 ms
[2025-05-31 23:12:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15175040743268046286.gal : 2 ms
[2025-05-31 23:12:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12751610117375736118.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15175040743268046286.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12751610117375736118.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (5782 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12751610117375736118.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 117
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :117 after 230
BEST_FIRST walk for 40002 steps (3652 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :230 after 487
BEST_FIRST walk for 40001 steps (3690 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :487 after 1092
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1092 after 23429
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :23429 after 42516
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :42516 after 107767
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :107767 after 222552
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :222552 after 481973
Interrupted probabilistic random walk after 413059 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 2
Probabilistic random walk after 413059 steps, saw 206714 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2025-05-31 23:12:13] [INFO ] Invariant cache hit.
[2025-05-31 23:12:13] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 138/139 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/143 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 51/194 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:14] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2025-05-31 23:12:14] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2025-05-31 23:12:14] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:12:14] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:12:14] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:12:14] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:14] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:14] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:12:14] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:12:14] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2025-05-31 23:12:14] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/196 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 205/401 variables, 196/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 41/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/406 variables, 5/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/406 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 284 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1182 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 201/201 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 138/139 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/143 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:15] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/194 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:15] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:12:15] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2025-05-31 23:12:15] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:15] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:12:15] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2025-05-31 23:12:15] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:12:15] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:15] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:15] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
[2025-05-31 23:12:15] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 2 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 131072
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
SDD size :481973 after 2.10253e+07
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 2 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:12:20] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:12:20] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
SMT process timed out in 6238ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 205/205 transitions.
Applied a total of 0 rules in 3 ms. Remains 201 /201 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 201/201 places, 205/205 transitions.
RANDOM walk for 40000 steps (5812 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3682 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3676 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 413105 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 2
Probabilistic random walk after 413105 steps, saw 206738 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2025-05-31 23:12:23] [INFO ] Invariant cache hit.
[2025-05-31 23:12:23] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 138/139 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/143 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 51/194 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:23] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2025-05-31 23:12:23] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:12:23] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:12:23] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:12:23] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:12:23] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:12:24] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:12:24] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:12:24] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2025-05-31 23:12:24] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:12:24] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/196 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 205/401 variables, 196/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 41/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/406 variables, 5/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/406 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 284 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 201/201 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 138/139 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/143 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:24] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/194 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:24] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:12:24] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:24] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:12:25] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:12:25] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:25] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:25] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:25] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:25] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:25] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:25] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:25] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:25] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2025-05-31 23:12:25] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2025-05-31 23:12:25] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:12:25] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:12:26] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:12:26] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:12:26] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:12:26] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:26] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:12:26] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2025-05-31 23:12:26] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:12:26] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:12:26] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:12:26] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:12:26] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:12:26] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:12:26] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:12:27] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:12:27] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:27] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:12:27] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:12:27] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:12:27] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:12:27] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2025-05-31 23:12:27] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:12:27] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:12:27] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:27] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:27] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:12:27] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:12:28] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:12:28] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:28] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:12:28] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:12:28] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:28] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:12:28] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 262144
[2025-05-31 23:12:28] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:12:28] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
SDD size :2.10253e+07 after 2.35797e+08
[2025-05-31 23:12:28] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:12:28] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:12:28] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:12:28] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:12:29] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:29] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:12:29] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:12:29] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:29] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:29] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2025-05-31 23:12:29] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:12:29] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2025-05-31 23:12:29] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:12:29] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:29] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:29] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:29] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:30] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:30] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:30] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:30] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:30] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:30] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:30] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:30] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:30] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:30] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2025-05-31 23:12:30] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:30] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:30] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:31] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:31] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:31] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:31] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:31] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:31] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2025-05-31 23:12:31] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:31] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:31] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:31] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2025-05-31 23:12:31] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:31] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:12:31] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:31] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:32] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:32] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:32] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:12:32] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:32] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:32] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:32] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 2 ms to minimize.
[2025-05-31 23:12:32] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:32] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:12:32] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:32] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:12:32] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:32] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:32] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:33] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:33] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:33] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:33] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:33] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:12:33] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:33] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:33] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:12:33] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:33] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:33] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:33] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:33] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:33] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:12:34] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:34] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:12:34] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:12:34] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:34] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:34] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:34] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:34] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:34] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:12:34] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:34] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:12:34] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:34] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2025-05-31 23:12:35] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:12:35] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:35] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:35] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:35] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:35] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:35] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2025-05-31 23:12:35] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:35] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:12:35] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:35] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:35] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 2 ms to minimize.
[2025-05-31 23:12:35] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:12:35] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:36] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:36] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:36] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:12:36] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:12:36] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:12:36] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:36] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:36] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:36] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/194 variables, 19/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/194 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/196 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/196 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 205/401 variables, 196/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/401 variables, 41/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/401 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:12:37] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:12:37] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/401 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/401 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 5/406 variables, 5/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/406 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/406 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/406 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 448 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12789 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 201/201 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 173/173 constraints]
After SMT, in 13961ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6713 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 205/205 transitions.
Applied a total of 0 rules in 14 ms. Remains 201 /201 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 201/201 places, 205/205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 205/205 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2025-05-31 23:12:44] [INFO ] Invariant cache hit.
[2025-05-31 23:12:44] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-05-31 23:12:44] [INFO ] Invariant cache hit.
[2025-05-31 23:12:44] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-31 23:12:45] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
[2025-05-31 23:12:45] [INFO ] Redundant transitions in 1 ms returned []
Running 204 sub problems to find dead transitions.
[2025-05-31 23:12:45] [INFO ] Invariant cache hit.
[2025-05-31 23:12:45] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 2/201 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:12:47] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:12:47] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:12:47] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:12:48] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:12:48] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:12:48] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:12:48] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:48] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:12:48] [INFO ] Deduced a trap composed of 97 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:12:48] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:12:49] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:12:49] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:12:49] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:12:49] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:12:49] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:12:49] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:12:49] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2025-05-31 23:12:49] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2025-05-31 23:12:49] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:12:49] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:12:50] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:12:50] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:12:50] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:12:51] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:12:51] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:12:51] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:12:51] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:12:51] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:12:52] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:12:52] [INFO ] Deduced a trap composed of 92 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:12:52] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:12:52] [INFO ] Deduced a trap composed of 92 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:12:53] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:12:53] [INFO ] Deduced a trap composed of 87 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:12:53] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:12:53] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:12:53] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:12:53] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:12:53] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:12:53] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:12:53] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:12:54] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:12:54] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2025-05-31 23:12:54] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:12:54] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:12:54] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:12:54] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:12:54] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:12:54] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:12:54] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:12:54] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:12:54] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:12:54] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:12:55] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 13/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:12:56] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:12:56] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:12:56] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:12:56] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:12:56] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2025-05-31 23:12:56] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:12:56] [INFO ] Deduced a trap composed of 89 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:12:56] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:12:56] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:12:56] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:12:56] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:12:56] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 524288
[2025-05-31 23:12:57] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:12:57] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:12:57] [INFO ] Deduced a trap composed of 84 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:12:57] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 1 ms to minimize.
SDD size :2.35797e+08 after 7.29731e+08
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 16/101 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:12:59] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:12:59] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:12:59] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:12:59] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:12:59] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:13:00] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:13:00] [INFO ] Deduced a trap composed of 87 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:13:00] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:13:00] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:13:00] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:13:00] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:13:00] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:13:00] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 2 ms to minimize.
[2025-05-31 23:13:00] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:13:00] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-05-31 23:13:00] [INFO ] Flatten gal took : 9 ms
[2025-05-31 23:13:00] [INFO ] Applying decomposition
[2025-05-31 23:13:00] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11264204780380798072.txt' '-o' '/tmp/graph11264204780380798072.bin' '-w' '/tmp/graph11264204780380798072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11264204780380798072.bin' '-l' '-1' '-v' '-w' '/tmp/graph11264204780380798072.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:13:00] [INFO ] Decomposing Gal with order
[2025-05-31 23:13:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:13:00] [INFO ] Removed a total of 106 redundant transitions.
[2025-05-31 23:13:00] [INFO ] Flatten gal took : 29 ms
[2025-05-31 23:13:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 3 ms.
[2025-05-31 23:13:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11996397513951291781.gal : 3 ms
[2025-05-31 23:13:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10190666144295885568.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11996397513951291781.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10190666144295885568.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality10190666144295885568.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 126
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :126 after 1158
[2025-05-31 23:13:01] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:13:01] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1158 after 45042
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 17/118 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:13:01] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:13:02] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45042 after 133047
[2025-05-31 23:13:02] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:13:02] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:13:02] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:13:02] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:13:02] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:13:02] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 13 (OVERLAPS) 205/406 variables, 201/327 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 41/368 constraints. Problems are: Problem set: 0 solved, 204 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :133047 after 402375
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 16 (OVERLAPS) 0/406 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 368 constraints, problems are : Problem set: 0 solved, 204 unsolved in 28024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 201/201 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 2/201 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 95/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:13:14] [INFO ] Deduced a trap composed of 92 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:13:14] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:13:14] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:13:15] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:13:15] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:13:15] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:13:15] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2025-05-31 23:13:15] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:13:15] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 205/406 variables, 201/336 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 41/377 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 204/581 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-05-31 23:13:25] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:13:26] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2025-05-31 23:13:27] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:13:27] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2025-05-31 23:13:28] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:13:29] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:13:29] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:13:30] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2025-05-31 23:13:30] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2025-05-31 23:13:31] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:13:31] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:13:31] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:13:31] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2025-05-31 23:13:31] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:13:31] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:13:31] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2025-05-31 23:13:32] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:13:32] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:13:33] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:13:34] [INFO ] Deduced a trap composed of 95 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 20/601 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 601 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 201/201 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 124/124 constraints]
After SMT, in 58118ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 58121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59493 ms. Remains : 201/201 places, 205/205 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 201 transition count 189
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 185 transition count 189
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 176 transition count 180
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 176 transition count 180
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 176 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 52 place count 175 transition count 179
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 175 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 173 transition count 177
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 173 transition count 177
Applied a total of 57 rules in 20 ms. Remains 173 /201 variables (removed 28) and now considering 177/205 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 177 rows 173 cols
[2025-05-31 23:13:43] [INFO ] Computed 31 invariants in 10 ms
[2025-05-31 23:13:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 23:13:43] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2025-05-31 23:13:43] [INFO ] After 108ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-31 23:13:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 23:13:43] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 23:13:43] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2025-05-31 23:13:43] [INFO ] After 76ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 23:13:43] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 23:13:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 23:13:43] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2025-05-31 23:13:44] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-31 23:13:44] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 23:13:44] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2025-05-31 23:13:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 1
[2025-05-31 23:13:44] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 23:13:44] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 23:13:44] [INFO ] Flatten gal took : 8 ms
[2025-05-31 23:13:44] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:13:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3278801628563172080.gal : 2 ms
[2025-05-31 23:13:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5379200002530516189.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3278801628563172080.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5379200002530516189.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5379200002530516189.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :370 after 1321
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1321 after 3495
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3495 after 10385
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10385 after 22358
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :22358 after 49913
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :49913 after 105979
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :105979 after 222990
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :222990 after 458153
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :402375 after 753561
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :458153 after 937334
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :753561 after 3.01254e+06
Detected timeout of ITS tools.
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :937334 after 1.90261e+06
Detected timeout of ITS tools.
[2025-05-31 23:13:59] [INFO ] Flatten gal took : 13 ms
[2025-05-31 23:13:59] [INFO ] Applying decomposition
[2025-05-31 23:13:59] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3302216218435889929.txt' '-o' '/tmp/graph3302216218435889929.bin' '-w' '/tmp/graph3302216218435889929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3302216218435889929.bin' '-l' '-1' '-v' '-w' '/tmp/graph3302216218435889929.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:13:59] [INFO ] Decomposing Gal with order
[2025-05-31 23:13:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:13:59] [INFO ] Removed a total of 99 redundant transitions.
[2025-05-31 23:13:59] [INFO ] Flatten gal took : 18 ms
[2025-05-31 23:13:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 2 ms.
[2025-05-31 23:13:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8369639254404217755.gal : 3 ms
[2025-05-31 23:13:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8869867808153031035.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8369639254404217755.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8869867808153031035.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8869867808153031035.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 25789
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30721 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-11 in 279621 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 233 rows 232 cols
[2025-05-31 23:14:14] [INFO ] Computed 35 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1433 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10000 steps (909 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:14:14] [INFO ] Invariant cache hit.
[2025-05-31 23:14:14] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 23:14:14] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 23:14:14] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-05-31 23:14:14] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-31 23:14:14] [INFO ] [Real]Added 31 Read/Feed constraints in 49 ms returned sat
[2025-05-31 23:14:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:14:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 23:14:14] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 23:14:14] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-05-31 23:14:14] [INFO ] [Nat]Added 31 Read/Feed constraints in 177 ms returned sat
[2025-05-31 23:14:14] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 14 ms.
[2025-05-31 23:14:16] [INFO ] Added : 156 causal constraints over 32 iterations in 1684 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 232 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p247) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 232/232 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 230
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 17 place count 223 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 222 transition count 222
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 222 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 221 transition count 221
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 31 place count 221 transition count 211
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 41 place count 211 transition count 211
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 211 transition count 211
Applied a total of 43 rules in 26 ms. Remains 211 /232 variables (removed 21) and now considering 211/232 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 211/232 places, 211/232 transitions.
// Phase 1: matrix 211 rows 211 cols
[2025-05-31 23:14:17] [INFO ] Computed 35 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144329 resets) in 765 ms. (1305 steps per ms)
BEST_FIRST walk for 1000001 steps (91329 resets) in 518 ms. (1926 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:14:18] [INFO ] Invariant cache hit.
[2025-05-31 23:14:18] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 23:14:18] [INFO ] [Real]Absence check using 4 positive and 31 generalized place invariants in 6 ms returned sat
[2025-05-31 23:14:18] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2025-05-31 23:14:18] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:14:18] [INFO ] [Real]Added 39 Read/Feed constraints in 58 ms returned sat
[2025-05-31 23:14:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:14:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 23:14:18] [INFO ] [Nat]Absence check using 4 positive and 31 generalized place invariants in 5 ms returned sat
[2025-05-31 23:14:18] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-05-31 23:14:18] [INFO ] [Nat]Added 39 Read/Feed constraints in 99 ms returned sat
[2025-05-31 23:14:18] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:14:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2025-05-31 23:14:18] [INFO ] Computed and/alt/rep : 166/1038/166 causal constraints (skipped 44 transitions) in 12 ms.
[2025-05-31 23:14:19] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:14:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2025-05-31 23:14:19] [INFO ] Added : 57 causal constraints over 12 iterations in 410 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 211/211 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2025-05-31 23:14:19] [INFO ] Invariant cache hit.
[2025-05-31 23:14:19] [INFO ] Implicit Places using invariants in 176 ms returned [42, 47, 136, 208]
[2025-05-31 23:14:19] [INFO ] Actually due to overlaps returned [208]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 177 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 210/211 places, 211/211 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 210
Applied a total of 2 rules in 5 ms. Remains 209 /210 variables (removed 1) and now considering 210/211 (removed 1) transitions.
// Phase 1: matrix 210 rows 209 cols
[2025-05-31 23:14:19] [INFO ] Computed 34 invariants in 11 ms
[2025-05-31 23:14:20] [INFO ] Implicit Places using invariants in 153 ms returned [42, 47, 136]
[2025-05-31 23:14:20] [INFO ] Actually due to overlaps returned [47, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 153 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/211 places, 210/211 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 209
Applied a total of 2 rules in 6 ms. Remains 206 /207 variables (removed 1) and now considering 209/210 (removed 1) transitions.
// Phase 1: matrix 209 rows 206 cols
[2025-05-31 23:14:20] [INFO ] Computed 32 invariants in 12 ms
[2025-05-31 23:14:20] [INFO ] Implicit Places using invariants in 153 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 154 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 205/211 places, 209/211 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 205 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 204 transition count 208
Applied a total of 2 rules in 6 ms. Remains 204 /205 variables (removed 1) and now considering 208/209 (removed 1) transitions.
// Phase 1: matrix 208 rows 204 cols
[2025-05-31 23:14:20] [INFO ] Computed 31 invariants in 10 ms
[2025-05-31 23:14:20] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-05-31 23:14:20] [INFO ] Invariant cache hit.
[2025-05-31 23:14:20] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:14:21] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 204/211 places, 208/211 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1853 ms. Remains : 204/211 places, 208/211 transitions.
[2025-05-31 23:14:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144003 resets) in 694 ms. (1438 steps per ms)
BEST_FIRST walk for 1000001 steps (91164 resets) in 501 ms. (1992 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:14:22] [INFO ] Invariant cache hit.
[2025-05-31 23:14:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 23:14:22] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2025-05-31 23:14:22] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2025-05-31 23:14:22] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:14:22] [INFO ] [Real]Added 39 Read/Feed constraints in 39 ms returned sat
[2025-05-31 23:14:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:14:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 23:14:23] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2025-05-31 23:14:23] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-05-31 23:14:23] [INFO ] [Nat]Added 39 Read/Feed constraints in 59 ms returned sat
[2025-05-31 23:14:23] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:14:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2025-05-31 23:14:23] [INFO ] Computed and/alt/rep : 165/1048/165 causal constraints (skipped 42 transitions) in 12 ms.
[2025-05-31 23:14:24] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:14:24] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:14:24] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:14:24] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:14:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 345 ms
[2025-05-31 23:14:24] [INFO ] Added : 88 causal constraints over 19 iterations in 1153 ms. Result :sat
Minimization took 325 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 204 /204 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 204/204 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-05-31 23:14:24] [INFO ] Invariant cache hit.
[2025-05-31 23:14:24] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-05-31 23:14:24] [INFO ] Invariant cache hit.
[2025-05-31 23:14:25] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:14:26] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2025-05-31 23:14:26] [INFO ] Redundant transitions in 0 ms returned []
Running 207 sub problems to find dead transitions.
[2025-05-31 23:14:26] [INFO ] Invariant cache hit.
[2025-05-31 23:14:26] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 1/203 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 1/204 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:14:29] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:14:29] [INFO ] Deduced a trap composed of 93 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:14:29] [INFO ] Deduced a trap composed of 90 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:14:29] [INFO ] Deduced a trap composed of 87 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:14:29] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:14:29] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:14:30] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:14:30] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:14:30] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:14:30] [INFO ] Deduced a trap composed of 90 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:14:30] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 11/42 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:14:31] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:14:31] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2025-05-31 23:14:31] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:14:32] [INFO ] Deduced a trap composed of 81 places in 56 ms of which 2 ms to minimize.
[2025-05-31 23:14:32] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:14:32] [INFO ] Deduced a trap composed of 97 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:14:32] [INFO ] Deduced a trap composed of 95 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:14:32] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 2 ms to minimize.
[2025-05-31 23:14:32] [INFO ] Deduced a trap composed of 100 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:14:32] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:14:32] [INFO ] Deduced a trap composed of 98 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:14:33] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:14:33] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:14:34] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:14:34] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2025-05-31 23:14:34] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2025-05-31 23:14:34] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:14:34] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:14:34] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:14:35] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:14:35] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:14:35] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 2 ms to minimize.
[2025-05-31 23:14:35] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:14:35] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:14:35] [INFO ] Deduced a trap composed of 83 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:14:35] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:14:35] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:14:35] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:14:36] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:14:36] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:14:36] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:14:36] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:14:36] [INFO ] Deduced a trap composed of 97 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:14:36] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:14:37] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:14:37] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:14:37] [INFO ] Deduced a trap composed of 90 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:14:38] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:14:38] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:14:38] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:14:38] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:14:38] [INFO ] Deduced a trap composed of 89 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:14:38] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:14:38] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:14:38] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:14:39] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:14:39] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2025-05-31 23:14:39] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:14:39] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:14:39] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:14:39] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:14:40] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:14:40] [INFO ] Deduced a trap composed of 90 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:14:40] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:14:40] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:14:40] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:14:40] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:14:40] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:14:41] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 2 ms to minimize.
[2025-05-31 23:14:41] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:14:41] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:14:41] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:14:41] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:14:41] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:14:41] [INFO ] Deduced a trap composed of 89 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:14:41] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:14:41] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:14:41] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 17/110 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:14:42] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:14:42] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2025-05-31 23:14:42] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:14:43] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:14:43] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:14:43] [INFO ] Deduced a trap composed of 93 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:14:43] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 7/117 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:14:44] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:14:45] [INFO ] Deduced a trap composed of 89 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:14:45] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:14:45] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:14:45] [INFO ] Deduced a trap composed of 93 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:14:45] [INFO ] Deduced a trap composed of 97 places in 62 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:14:46] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:14:46] [INFO ] Deduced a trap composed of 94 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:14:46] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:14:48] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:14:48] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:14:48] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:14:48] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:14:50] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:14:50] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:14:51] [INFO ] Deduced a trap composed of 96 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:14:51] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/204 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:14:52] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:14:52] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:14:52] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:14:52] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/204 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/204 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 207 unsolved
SMT process timed out in 30093ms, After SMT, problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 30095ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31438 ms. Remains : 204/204 places, 208/208 transitions.
[2025-05-31 23:14:56] [INFO ] Flatten gal took : 19 ms
[2025-05-31 23:14:56] [INFO ] Flatten gal took : 26 ms
[2025-05-31 23:14:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4889640049629782353.gal : 7 ms
[2025-05-31 23:14:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality647746050544542275.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4889640049629782353.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality647746050544542275.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
RANDOM walk for 40000 steps (5730 resets) in 180 ms. (220 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality647746050544542275.prop.
BEST_FIRST walk for 40000 steps (3616 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 117
BEST_FIRST walk for 40002 steps (3649 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :117 after 230
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :230 after 487
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :487 after 1080
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1080 after 23429
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :23429 after 42516
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :42516 after 107767
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :107767 after 221976
Interrupted probabilistic random walk after 424024 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 2
Probabilistic random walk after 424024 steps, saw 212214 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
[2025-05-31 23:14:59] [INFO ] Invariant cache hit.
[2025-05-31 23:14:59] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:14:59] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 32/143 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :221976 after 480713
[2025-05-31 23:14:59] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 54/197 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:14:59] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-31 23:14:59] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:14:59] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
[2025-05-31 23:14:59] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:15:00] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:00] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2025-05-31 23:15:00] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:15:00] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2025-05-31 23:15:00] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:15:00] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 2 ms to minimize.
[2025-05-31 23:15:00] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:15:00] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
[2025-05-31 23:15:00] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 1 ms to minimize.
[2025-05-31 23:15:00] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/199 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 208/407 variables, 199/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 39/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/412 variables, 5/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/412 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 290 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1535 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 204/204 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 32/143 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 54/197 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:15:01] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:15:01] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:15:01] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:15:01] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:15:01] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:15:01] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:15:01] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:15:01] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 2 ms to minimize.
[2025-05-31 23:15:01] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:15:01] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/199 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 208/407 variables, 199/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 39/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/407 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 5/412 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/412 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/412 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1182 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 204/204 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 26/26 constraints]
After SMT, in 2747ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 631 ms.
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 208/208 transitions.
Applied a total of 0 rules in 13 ms. Remains 204 /204 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 204/204 places, 208/208 transitions.
RANDOM walk for 40000 steps (5898 resets) in 455 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3658 resets) in 320 ms. (124 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3608 resets) in 312 ms. (127 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :480713 after 2.08562e+07
Interrupted probabilistic random walk after 415825 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 2
Probabilistic random walk after 415825 steps, saw 208100 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
[2025-05-31 23:15:06] [INFO ] Invariant cache hit.
[2025-05-31 23:15:06] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:15:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 32/143 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:15:06] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 54/197 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:15:06] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:15:06] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:15:06] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 1 ms to minimize.
[2025-05-31 23:15:06] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:15:06] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:15:06] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2025-05-31 23:15:06] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:15:07] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:15:07] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:15:07] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2025-05-31 23:15:07] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:15:07] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:15:07] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:15:07] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/199 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 208/407 variables, 199/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 39/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/412 variables, 5/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/412 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 290 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1542 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 204/204 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 32/143 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 54/197 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:15:07] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:15:08] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:15:08] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:15:08] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2025-05-31 23:15:08] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2025-05-31 23:15:08] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:15:08] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:15:08] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 2 ms to minimize.
[2025-05-31 23:15:08] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:15:08] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/199 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 208/407 variables, 199/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 39/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/407 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 5/412 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/412 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/412 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 204/204 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 26/26 constraints]
After SMT, in 2779ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 623 ms.
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 204/204 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-05-31 23:15:09] [INFO ] Invariant cache hit.
[2025-05-31 23:15:09] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-05-31 23:15:09] [INFO ] Invariant cache hit.
[2025-05-31 23:15:09] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:15:11] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2025-05-31 23:15:11] [INFO ] Redundant transitions in 1 ms returned []
Running 207 sub problems to find dead transitions.
[2025-05-31 23:15:11] [INFO ] Invariant cache hit.
[2025-05-31 23:15:11] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 1/203 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 1/204 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:14] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:14] [INFO ] Deduced a trap composed of 93 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:14] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:15:14] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 262144
[2025-05-31 23:15:14] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
[2025-05-31 23:15:14] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
SDD size :2.08562e+07 after 2.35213e+08
[2025-05-31 23:15:15] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:15:15] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:15:15] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:16] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:15:16] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 11/42 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:16] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2025-05-31 23:15:17] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2025-05-31 23:15:17] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:15:17] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:15:17] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:17] [INFO ] Deduced a trap composed of 97 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:15:18] [INFO ] Deduced a trap composed of 95 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:15:18] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:15:18] [INFO ] Deduced a trap composed of 100 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:15:18] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:15:18] [INFO ] Deduced a trap composed of 98 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:18] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:15:18] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:19] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:20] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2025-05-31 23:15:20] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:15:20] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:20] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:15:20] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:15:20] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:15:20] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:15:20] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:15:20] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:15:21] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:21] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:21] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:21] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:21] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:21] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:15:21] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:15:22] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:15:22] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:15:22] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:15:22] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:23] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:15:23] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:15:23] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:15:24] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:15:24] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:15:24] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:15:24] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:15:24] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 5 ms to minimize.
[2025-05-31 23:15:24] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:15:24] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 0 ms to minimize.
[2025-05-31 23:15:24] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:15:24] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:15:24] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2025-05-31 23:15:24] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:25] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2025-05-31 23:15:25] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:15:25] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:26] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:15:26] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:15:26] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:26] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:15:26] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:15:26] [INFO ] Deduced a trap composed of 91 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:26] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:15:26] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:15:26] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:15:27] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:15:27] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:15:27] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:15:27] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:15:27] [INFO ] Deduced a trap composed of 89 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:15:27] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:15:27] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:15:27] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 17/110 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:28] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:28] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2025-05-31 23:15:28] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:15:29] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:15:29] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:15:29] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:15:29] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 7/117 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:30] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:15:31] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:15:31] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:15:31] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:15:31] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:15:31] [INFO ] Deduced a trap composed of 97 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:32] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:15:32] [INFO ] Deduced a trap composed of 94 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:15:33] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:34] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2025-05-31 23:15:34] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:34] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:15:34] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:36] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:15:36] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:15:37] [INFO ] Deduced a trap composed of 96 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:15:37] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/204 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:38] [INFO ] Deduced a trap composed of 91 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:38] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:15:38] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:15:38] [INFO ] Deduced a trap composed of 93 places in 54 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/204 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 204/412 variables, and 138 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/204 constraints, ReadFeed: 0/39 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 107/107 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 1/203 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 56/80 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 1/204 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 207 unsolved
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :2.35213e+08 after 7.29731e+08
[2025-05-31 23:15:44] [INFO ] Deduced a trap composed of 93 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:15:44] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:15:44] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:15:44] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:15:44] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
[2025-05-31 23:15:44] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:44] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:15:44] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:15:44] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:44] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2025-05-31 23:15:44] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:44] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:15:44] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:44] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:15:45] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2025-05-31 23:15:45] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:15:45] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:45] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:15:45] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:45] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:45] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2025-05-31 23:15:45] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:15:45] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:15:45] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:15:45] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:15:46] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:46] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:15:46] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:46] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:46] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-05-31 23:15:46] [INFO ] Flatten gal took : 8 ms
[2025-05-31 23:15:46] [INFO ] Applying decomposition
[2025-05-31 23:15:46] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1511068711210694598.txt' '-o' '/tmp/graph1511068711210694598.bin' '-w' '/tmp/graph1511068711210694598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1511068711210694598.bin' '-l' '-1' '-v' '-w' '/tmp/graph1511068711210694598.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:15:46] [INFO ] Decomposing Gal with order
[2025-05-31 23:15:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:15:46] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:15:46] [INFO ] Removed a total of 107 redundant transitions.
[2025-05-31 23:15:46] [INFO ] Flatten gal took : 15 ms
[2025-05-31 23:15:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 2 ms.
[2025-05-31 23:15:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality212189733799155738.gal : 2 ms
[2025-05-31 23:15:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11986520260924367918.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality212189733799155738.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11986520260924367918.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality11986520260924367918.prop.
[2025-05-31 23:15:46] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :17 after 27
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :27 after 140
[2025-05-31 23:15:46] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :140 after 1182
[2025-05-31 23:15:46] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:15:46] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:15:46] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:15:46] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:15:46] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2025-05-31 23:15:47] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:15:47] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:47] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 1 ms to minimize.
[2025-05-31 23:15:47] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:15:47] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:47] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 2 ms to minimize.
[2025-05-31 23:15:47] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:47] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:47] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:15:47] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:15:48] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:15:48] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:15:48] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:48] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1182 after 132864
[2025-05-31 23:15:48] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:48] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:15:48] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:15:48] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:48] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:48] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:15:48] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:15:48] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:49] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 1 ms to minimize.
[2025-05-31 23:15:50] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:15:50] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:50] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:15:50] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 1 ms to minimize.
[2025-05-31 23:15:50] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:50] [INFO ] Deduced a trap composed of 95 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:15:50] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2025-05-31 23:15:50] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2025-05-31 23:15:50] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 1 ms to minimize.
[2025-05-31 23:15:50] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:50] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:15:51] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:51] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:15:51] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 2 ms to minimize.
[2025-05-31 23:15:51] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:15:51] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:15:51] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2025-05-31 23:15:51] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2025-05-31 23:15:51] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:52] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:15:52] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 1 ms to minimize.
[2025-05-31 23:15:52] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:15:52] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 2 ms to minimize.
[2025-05-31 23:15:52] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:52] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 2 ms to minimize.
[2025-05-31 23:15:52] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:15:52] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:52] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 1 ms to minimize.
[2025-05-31 23:15:52] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:15:52] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:15:52] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:53] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:15:53] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:15:53] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:15:53] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:15:53] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:53] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:53] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:53] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:53] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:15:54] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:15:54] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:15:54] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:54] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:54] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:15:54] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:54] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:15:54] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:15:54] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:15:54] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:15:54] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:15:54] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:15:54] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:54] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:15:55] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:15:55] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:15:55] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:55] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:15:55] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:56] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:15:56] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:15:56] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:15:56] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2025-05-31 23:15:56] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:15:57] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2025-05-31 23:15:57] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:15:57] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:15:57] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 2 ms to minimize.
[2025-05-31 23:15:57] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:15:57] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:15:57] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:15:57] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:57] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:15:57] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:15:57] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:15:57] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:15:58] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:15:58] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:15:58] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 20/278 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:15:58] [INFO ] Deduced a trap composed of 86 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:15:58] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:15:59] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:15:59] [INFO ] Deduced a trap composed of 94 places in 62 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 207 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :132864 after 355847
At refinement iteration 16 (INCLUDED_ONLY) 0/204 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 17 (OVERLAPS) 208/412 variables, 204/486 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 39/525 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/412 variables, 207/732 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/412 variables, and 732 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 204/204 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 251/251 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61500 ms. Remains : 204/204 places, 208/208 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 204 transition count 192
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 188 transition count 192
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 179 transition count 183
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 179 transition count 183
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 179 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 52 place count 178 transition count 182
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 178 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 176 transition count 180
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 176 transition count 180
Applied a total of 57 rules in 28 ms. Remains 176 /204 variables (removed 28) and now considering 180/208 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 180 rows 176 cols
[2025-05-31 23:16:11] [INFO ] Computed 31 invariants in 14 ms
[2025-05-31 23:16:11] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-05-31 23:16:11] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2025-05-31 23:16:11] [INFO ] After 84ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-31 23:16:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 23:16:11] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 23:16:11] [INFO ] After 36ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2025-05-31 23:16:11] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2025-05-31 23:16:11] [INFO ] Flatten gal took : 8 ms
[2025-05-31 23:16:11] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:16:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6053287532367415999.gal : 2 ms
[2025-05-31 23:16:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16892946607502409119.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6053287532367415999.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16892946607502409119.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16892946607502409119.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :370 after 1310
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1310 after 3495
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3495 after 10364
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10364 after 22544
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :22544 after 50007
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :50007 after 107060
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :107060 after 226915
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :226915 after 471715
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :471715 after 971384
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :971384 after 1.98763e+06
Detected timeout of ITS tools.
[2025-05-31 23:16:26] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:16:26] [INFO ] Applying decomposition
[2025-05-31 23:16:26] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1617780345083431139.txt' '-o' '/tmp/graph1617780345083431139.bin' '-w' '/tmp/graph1617780345083431139.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1617780345083431139.bin' '-l' '-1' '-v' '-w' '/tmp/graph1617780345083431139.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:16:26] [INFO ] Decomposing Gal with order
[2025-05-31 23:16:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:16:26] [INFO ] Removed a total of 106 redundant transitions.
[2025-05-31 23:16:26] [INFO ] Flatten gal took : 30 ms
[2025-05-31 23:16:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 3 ms.
[2025-05-31 23:16:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2761133182398586457.gal : 6 ms
[2025-05-31 23:16:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5554009399814441950.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2761133182398586457.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5554009399814441950.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5554009399814441950.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 89528
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30439 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-12 in 147268 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 233 rows 232 cols
[2025-05-31 23:16:41] [INFO ] Computed 35 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1460 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (883 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:16:41] [INFO ] Invariant cache hit.
[2025-05-31 23:16:41] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 23:16:41] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 23:16:41] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2025-05-31 23:16:41] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-31 23:16:41] [INFO ] [Real]Added 31 Read/Feed constraints in 95 ms returned sat
[2025-05-31 23:16:41] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 12 ms.
[2025-05-31 23:16:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:16:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 23:16:42] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 23:16:42] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2025-05-31 23:16:42] [INFO ] [Nat]Added 31 Read/Feed constraints in 123 ms returned sat
[2025-05-31 23:16:42] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 11 ms.
[2025-05-31 23:16:44] [INFO ] Added : 175 causal constraints over 35 iterations in 1856 ms. Result :sat
Minimization took 460 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 232 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p462) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 232/232 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 230
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 229 transition count 228
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 223 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 222 transition count 222
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 222 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 221 transition count 221
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 30 place count 221 transition count 211
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 40 place count 211 transition count 211
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 211 transition count 211
Applied a total of 42 rules in 16 ms. Remains 211 /232 variables (removed 21) and now considering 211/232 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 211/232 places, 211/232 transitions.
// Phase 1: matrix 211 rows 211 cols
[2025-05-31 23:16:53] [INFO ] Computed 35 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144091 resets) in 720 ms. (1386 steps per ms)
BEST_FIRST walk for 1000000 steps (91747 resets) in 507 ms. (1968 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:16:54] [INFO ] Invariant cache hit.
[2025-05-31 23:16:54] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 23:16:54] [INFO ] [Real]Absence check using 7 positive and 28 generalized place invariants in 4 ms returned sat
[2025-05-31 23:16:54] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-05-31 23:16:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:16:54] [INFO ] [Real]Added 39 Read/Feed constraints in 57 ms returned sat
[2025-05-31 23:16:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:16:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 23:16:54] [INFO ] [Nat]Absence check using 7 positive and 28 generalized place invariants in 4 ms returned sat
[2025-05-31 23:16:55] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2025-05-31 23:16:55] [INFO ] [Nat]Added 39 Read/Feed constraints in 181 ms returned sat
[2025-05-31 23:16:55] [INFO ] Computed and/alt/rep : 167/1033/167 causal constraints (skipped 43 transitions) in 12 ms.
[2025-05-31 23:16:56] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:16:56] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2025-05-31 23:16:56] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2025-05-31 23:16:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 227 ms
[2025-05-31 23:16:56] [INFO ] Added : 122 causal constraints over 26 iterations in 1152 ms. Result :sat
Minimization took 345 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 211/211 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2025-05-31 23:16:59] [INFO ] Invariant cache hit.
[2025-05-31 23:16:59] [INFO ] Implicit Places using invariants in 162 ms returned [42, 47, 136, 208]
[2025-05-31 23:16:59] [INFO ] Actually due to overlaps returned [208]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 210/211 places, 211/211 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 210
Applied a total of 2 rules in 5 ms. Remains 209 /210 variables (removed 1) and now considering 210/211 (removed 1) transitions.
// Phase 1: matrix 210 rows 209 cols
[2025-05-31 23:16:59] [INFO ] Computed 34 invariants in 14 ms
[2025-05-31 23:16:59] [INFO ] Implicit Places using invariants in 157 ms returned [42, 47, 136]
[2025-05-31 23:16:59] [INFO ] Actually due to overlaps returned [47, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 158 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/211 places, 210/211 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 209
Applied a total of 2 rules in 5 ms. Remains 206 /207 variables (removed 1) and now considering 209/210 (removed 1) transitions.
// Phase 1: matrix 209 rows 206 cols
[2025-05-31 23:16:59] [INFO ] Computed 32 invariants in 10 ms
[2025-05-31 23:16:59] [INFO ] Implicit Places using invariants in 155 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 155 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 205/211 places, 209/211 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 205 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 204 transition count 208
Applied a total of 2 rules in 6 ms. Remains 204 /205 variables (removed 1) and now considering 208/209 (removed 1) transitions.
// Phase 1: matrix 208 rows 204 cols
[2025-05-31 23:16:59] [INFO ] Computed 31 invariants in 9 ms
[2025-05-31 23:16:59] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-05-31 23:16:59] [INFO ] Invariant cache hit.
[2025-05-31 23:16:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:17:00] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned [145, 150]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1206 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 202/211 places, 208/211 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 202 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 208
Applied a total of 4 rules in 9 ms. Remains 200 /202 variables (removed 2) and now considering 208/208 (removed 0) transitions.
// Phase 1: matrix 208 rows 200 cols
[2025-05-31 23:17:00] [INFO ] Computed 29 invariants in 10 ms
[2025-05-31 23:17:01] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-05-31 23:17:01] [INFO ] Invariant cache hit.
[2025-05-31 23:17:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:17:02] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned []
Implicit Place search using SMT with State Equation took 1250 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 200/211 places, 208/211 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 2960 ms. Remains : 200/211 places, 208/211 transitions.
[2025-05-31 23:17:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144210 resets) in 698 ms. (1430 steps per ms)
BEST_FIRST walk for 1000000 steps (91265 resets) in 490 ms. (2036 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:17:03] [INFO ] Invariant cache hit.
[2025-05-31 23:17:03] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 23:17:03] [INFO ] [Real]Absence check using 12 positive and 17 generalized place invariants in 3 ms returned sat
[2025-05-31 23:17:03] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-05-31 23:17:03] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:17:03] [INFO ] [Real]Added 39 Read/Feed constraints in 72 ms returned sat
[2025-05-31 23:17:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:17:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 23:17:03] [INFO ] [Nat]Absence check using 12 positive and 17 generalized place invariants in 3 ms returned sat
[2025-05-31 23:17:03] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-05-31 23:17:03] [INFO ] [Nat]Added 39 Read/Feed constraints in 262 ms returned sat
[2025-05-31 23:17:04] [INFO ] Computed and/alt/rep : 159/1021/159 causal constraints (skipped 48 transitions) in 12 ms.
[2025-05-31 23:17:04] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:17:04] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:17:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2025-05-31 23:17:04] [INFO ] Added : 102 causal constraints over 21 iterations in 825 ms. Result :sat
Minimization took 352 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 200/200 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-05-31 23:17:08] [INFO ] Invariant cache hit.
[2025-05-31 23:17:08] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-05-31 23:17:08] [INFO ] Invariant cache hit.
[2025-05-31 23:17:08] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 23:17:09] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
[2025-05-31 23:17:09] [INFO ] Redundant transitions in 1 ms returned []
Running 207 sub problems to find dead transitions.
[2025-05-31 23:17:09] [INFO ] Invariant cache hit.
[2025-05-31 23:17:09] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 2/200 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:17:12] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:17:12] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:17:12] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:17:12] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:17:12] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:17:12] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:17:12] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:17:12] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:17:13] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:17:13] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:13] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:17:13] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:13] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 0 ms to minimize.
[2025-05-31 23:17:13] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:17:13] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:17:13] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:17:13] [INFO ] Deduced a trap composed of 93 places in 45 ms of which 0 ms to minimize.
[2025-05-31 23:17:13] [INFO ] Deduced a trap composed of 93 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:17:13] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:17:13] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:17:14] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:17:14] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:17:14] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:17:14] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:17:14] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:17:14] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:17:14] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:17:14] [INFO ] Deduced a trap composed of 89 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:17:15] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:15] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:17:15] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:17:15] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2025-05-31 23:17:15] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2025-05-31 23:17:15] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:17:15] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:17:15] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:17:15] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:17:15] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:17:15] [INFO ] Deduced a trap composed of 76 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:17:15] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:17:16] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:17:16] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:17:16] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:17:16] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:17:16] [INFO ] Deduced a trap composed of 91 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:17:16] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:17:16] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:17:16] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2025-05-31 23:17:17] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:17:17] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:17:17] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:17:17] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:17:18] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:17:18] [INFO ] Deduced a trap composed of 88 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:18] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:17:19] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:17:19] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:17:19] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2025-05-31 23:17:19] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 0 ms to minimize.
[2025-05-31 23:17:19] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:17:19] [INFO ] Deduced a trap composed of 91 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:17:19] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:19] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 0 ms to minimize.
[2025-05-31 23:17:19] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:17:19] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:19] [INFO ] Deduced a trap composed of 84 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:17:19] [INFO ] Deduced a trap composed of 90 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:17:20] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:17:20] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:17:20] [INFO ] Deduced a trap composed of 91 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:17:20] [INFO ] Deduced a trap composed of 84 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:17:20] [INFO ] Deduced a trap composed of 96 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:17:20] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:17:20] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:17:21] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:17:22] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:17:22] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:17:22] [INFO ] Deduced a trap composed of 91 places in 51 ms of which 0 ms to minimize.
[2025-05-31 23:17:22] [INFO ] Deduced a trap composed of 88 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:17:22] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:22] [INFO ] Deduced a trap composed of 90 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:17:24] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:17:24] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:17:24] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:17:25] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:17:25] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:17:25] [INFO ] Deduced a trap composed of 90 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:17:25] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:17:26] [INFO ] Deduced a trap composed of 95 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:17:26] [INFO ] Deduced a trap composed of 95 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:17:26] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:17:26] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 8/121 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:17:27] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:17:28] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:17:28] [INFO ] Deduced a trap composed of 92 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:28] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:17:28] [INFO ] Deduced a trap composed of 88 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:17:28] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:17:28] [INFO ] Deduced a trap composed of 88 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:17:28] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:17:28] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:17:28] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:17:28] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:17:28] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 0 ms to minimize.
[2025-05-31 23:17:28] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:17:30] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:17:30] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2025-05-31 23:17:30] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2025-05-31 23:17:30] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2025-05-31 23:17:30] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2025-05-31 23:17:31] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:17:31] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:17:31] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 8/142 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:17:32] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:17:32] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:17:32] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:17:33] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2025-05-31 23:17:33] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:17:34] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:17:34] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:34] [INFO ] Deduced a trap composed of 95 places in 62 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/200 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Problem TDEAD28 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 17 (OVERLAPS) 208/408 variables, 200/350 constraints. Problems are: Problem set: 18 solved, 189 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/408 variables, 39/389 constraints. Problems are: Problem set: 18 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 408/408 variables, and 389 constraints, problems are : Problem set: 18 solved, 189 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 200/200 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 121/121 constraints]
Escalating to Integer solving :Problem set: 18 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 2/2 constraints. Problems are: Problem set: 18 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 15/17 constraints. Problems are: Problem set: 18 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/17 constraints. Problems are: Problem set: 18 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 9/191 variables, 10/27 constraints. Problems are: Problem set: 18 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 94/121 constraints. Problems are: Problem set: 18 solved, 189 unsolved
[2025-05-31 23:17:41] [INFO ] Deduced a trap composed of 87 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:17:41] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:17:41] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:41] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:17:41] [INFO ] Deduced a trap composed of 87 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:17:41] [INFO ] Deduced a trap composed of 87 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:17:42] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 7/128 constraints. Problems are: Problem set: 18 solved, 189 unsolved
[2025-05-31 23:17:42] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:17:42] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:17:42] [INFO ] Deduced a trap composed of 88 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:42] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:17:42] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:17:43] [INFO ] Deduced a trap composed of 88 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/134 constraints. Problems are: Problem set: 18 solved, 189 unsolved
[2025-05-31 23:17:44] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:17:44] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:17:44] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:17:44] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:17:44] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:17:45] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:45] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:45] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:17:45] [INFO ] Deduced a trap composed of 88 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:17:45] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 0 ms to minimize.
[2025-05-31 23:17:45] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:45] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:17:45] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:17:45] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:17:45] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 15/149 constraints. Problems are: Problem set: 18 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/149 constraints. Problems are: Problem set: 18 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 6/197 variables, 2/151 constraints. Problems are: Problem set: 18 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 27/178 constraints. Problems are: Problem set: 18 solved, 189 unsolved
[2025-05-31 23:17:48] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:17:48] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:17:48] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:17:48] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:17:48] [INFO ] Deduced a trap composed of 81 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:17:48] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:17:49] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 7/185 constraints. Problems are: Problem set: 18 solved, 189 unsolved
[2025-05-31 23:17:50] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 1/186 constraints. Problems are: Problem set: 18 solved, 189 unsolved
[2025-05-31 23:17:51] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:17:51] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2025-05-31 23:17:52] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 3/189 constraints. Problems are: Problem set: 18 solved, 189 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/189 constraints. Problems are: Problem set: 18 solved, 189 unsolved
At refinement iteration 15 (OVERLAPS) 208/405 variables, 197/386 constraints. Problems are: Problem set: 18 solved, 189 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 39/425 constraints. Problems are: Problem set: 18 solved, 189 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 136/561 constraints. Problems are: Problem set: 18 solved, 189 unsolved
[2025-05-31 23:18:05] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:18:05] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/405 variables, 2/563 constraints. Problems are: Problem set: 18 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/408 variables, and 563 constraints, problems are : Problem set: 18 solved, 189 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 197/200 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 136/207 constraints, Known Traps: 162/162 constraints]
After SMT, in 60105ms problems are : Problem set: 18 solved, 189 unsolved
Search for dead transitions found 18 dead transitions in 60107ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 200/200 places, 190/208 transitions.
Graph (complete) has 960 edges and 200 vertex of which 184 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 184 /200 variables (removed 16) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 184 cols
[2025-05-31 23:18:10] [INFO ] Computed 28 invariants in 10 ms
[2025-05-31 23:18:10] [INFO ] Implicit Places using invariants in 127 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 183/200 places, 190/208 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 181 transition count 188
Applied a total of 4 rules in 6 ms. Remains 181 /183 variables (removed 2) and now considering 188/190 (removed 2) transitions.
// Phase 1: matrix 188 rows 181 cols
[2025-05-31 23:18:10] [INFO ] Computed 27 invariants in 6 ms
[2025-05-31 23:18:10] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-31 23:18:10] [INFO ] Invariant cache hit.
[2025-05-31 23:18:10] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-31 23:18:11] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1384 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 181/200 places, 188/208 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62854 ms. Remains : 181/200 places, 188/208 transitions.
[2025-05-31 23:18:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143871 resets) in 671 ms. (1488 steps per ms)
BEST_FIRST walk for 1000000 steps (91408 resets) in 470 ms. (2123 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:18:12] [INFO ] Invariant cache hit.
[2025-05-31 23:18:12] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 23:18:12] [INFO ] [Real]Absence check using 12 positive and 15 generalized place invariants in 3 ms returned sat
[2025-05-31 23:18:12] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-05-31 23:18:12] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-31 23:18:12] [INFO ] [Real]Added 35 Read/Feed constraints in 65 ms returned sat
[2025-05-31 23:18:12] [INFO ] Computed and/alt/rep : 149/951/149 causal constraints (skipped 38 transitions) in 14 ms.
[2025-05-31 23:18:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:18:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-31 23:18:12] [INFO ] [Nat]Absence check using 12 positive and 15 generalized place invariants in 2 ms returned sat
[2025-05-31 23:18:13] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-05-31 23:18:13] [INFO ] [Nat]Added 35 Read/Feed constraints in 102 ms returned sat
[2025-05-31 23:18:13] [INFO ] Computed and/alt/rep : 149/951/149 causal constraints (skipped 38 transitions) in 11 ms.
[2025-05-31 23:18:13] [INFO ] Added : 108 causal constraints over 22 iterations in 686 ms. Result :sat
Minimization took 238 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 181 /181 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 181/181 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 181 /181 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:18:17] [INFO ] Invariant cache hit.
[2025-05-31 23:18:17] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-05-31 23:18:17] [INFO ] Invariant cache hit.
[2025-05-31 23:18:17] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-31 23:18:18] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
[2025-05-31 23:18:18] [INFO ] Redundant transitions in 0 ms returned []
Running 187 sub problems to find dead transitions.
[2025-05-31 23:18:18] [INFO ] Invariant cache hit.
[2025-05-31 23:18:18] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 2/181 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:18:20] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:18:20] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:18:20] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:18:20] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:18:20] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2025-05-31 23:18:20] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 0 ms to minimize.
[2025-05-31 23:18:20] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:18:21] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:18:21] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:18:21] [INFO ] Deduced a trap composed of 81 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:18:21] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 0 ms to minimize.
[2025-05-31 23:18:21] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:18:21] [INFO ] Deduced a trap composed of 84 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:18:21] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:18:21] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:18:21] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2025-05-31 23:18:22] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:18:22] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:18:22] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:18:22] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:18:22] [INFO ] Deduced a trap composed of 82 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:18:22] [INFO ] Deduced a trap composed of 82 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:18:22] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 1 ms to minimize.
[2025-05-31 23:18:23] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:18:23] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2025-05-31 23:18:23] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2025-05-31 23:18:23] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:18:23] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:18:23] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:18:23] [INFO ] Deduced a trap composed of 77 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:18:23] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 0 ms to minimize.
[2025-05-31 23:18:24] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:18:24] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 0 ms to minimize.
[2025-05-31 23:18:24] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:18:24] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:18:24] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:18:24] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:18:24] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:18:25] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:18:25] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 0 ms to minimize.
[2025-05-31 23:18:25] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 1 ms to minimize.
[2025-05-31 23:18:26] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:18:26] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:18:26] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:18:26] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:18:26] [INFO ] Deduced a trap composed of 81 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:18:26] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:18:27] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2025-05-31 23:18:27] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:18:28] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:18:28] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:18:28] [INFO ] Deduced a trap composed of 80 places in 44 ms of which 0 ms to minimize.
[2025-05-31 23:18:28] [INFO ] Deduced a trap composed of 80 places in 42 ms of which 1 ms to minimize.
[2025-05-31 23:18:28] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 188/369 variables, 181/262 constraints. Problems are: Problem set: 0 solved, 187 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 35/297 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (OVERLAPS) 0/369 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 297 constraints, problems are : Problem set: 0 solved, 187 unsolved in 17875 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 2/181 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 54/81 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:18:37] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:18:37] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:18:37] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:18:37] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:18:37] [INFO ] Deduced a trap composed of 88 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:18:37] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:18:37] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:18:37] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:18:38] [INFO ] Deduced a trap composed of 90 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:18:38] [INFO ] Deduced a trap composed of 91 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:18:38] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:18:38] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:18:38] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2025-05-31 23:18:38] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:18:39] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 15/96 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:18:39] [INFO ] Deduced a trap composed of 80 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:18:39] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:18:39] [INFO ] Deduced a trap composed of 84 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 188/369 variables, 181/280 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 35/315 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 187/502 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:18:49] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 0 ms to minimize.
[2025-05-31 23:18:50] [INFO ] Deduced a trap composed of 86 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:18:50] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:18:50] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:18:50] [INFO ] Deduced a trap composed of 90 places in 44 ms of which 0 ms to minimize.
[2025-05-31 23:18:50] [INFO ] Deduced a trap composed of 84 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 6/508 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:19:00] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:19:00] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:19:00] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/369 variables, 3/511 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:19:06] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 512 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 82/82 constraints]
After SMT, in 47955ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 47957ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49401 ms. Remains : 181/181 places, 188/188 transitions.
[2025-05-31 23:19:06] [INFO ] Flatten gal took : 11 ms
[2025-05-31 23:19:06] [INFO ] Flatten gal took : 23 ms
[2025-05-31 23:19:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5603282338492044525.gal : 11 ms
[2025-05-31 23:19:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14156114543607341332.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5603282338492044525.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14156114543607341332.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14156114543607341332.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 124
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :124 after 242
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :242 after 536
RANDOM walk for 40000 steps (5793 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :536 after 1223
BEST_FIRST walk for 40001 steps (3602 resets) in 286 ms. (139 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1223 after 23429
BEST_FIRST walk for 40003 steps (3676 resets) in 370 ms. (107 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :23429 after 43142
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :43142 after 120992
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :120992 after 263204
Interrupted probabilistic random walk after 427106 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 2
Probabilistic random walk after 427106 steps, saw 213757 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
[2025-05-31 23:19:10] [INFO ] Invariant cache hit.
[2025-05-31 23:19:10] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 129/130 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/176 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:19:10] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :263204 after 566686
[2025-05-31 23:19:10] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:19:10] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 188/364 variables, 176/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 35/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/369 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/369 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 246 constraints, problems are : Problem set: 0 solved, 2 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 129/130 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:19:10] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 46/176 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 188/364 variables, 176/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 35/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/369 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/369 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 249 constraints, problems are : Problem set: 0 solved, 2 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 767ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :566686 after 1.15222e+07
Parikh walk visited 0 properties in 7075 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 181 /181 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 181/181 places, 188/188 transitions.
RANDOM walk for 40000 steps (5843 resets) in 506 ms. (78 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3665 resets) in 433 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3707 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 429318 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 2
Probabilistic random walk after 429318 steps, saw 214864 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2025-05-31 23:19:21] [INFO ] Invariant cache hit.
[2025-05-31 23:19:21] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 129/130 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/176 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:19:21] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2025-05-31 23:19:21] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:19:21] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 188/364 variables, 176/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 35/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/369 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/369 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 246 constraints, problems are : Problem set: 0 solved, 2 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 129/130 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:19:21] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 46/176 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 188/364 variables, 176/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 35/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/369 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/369 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 249 constraints, problems are : Problem set: 0 solved, 2 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 745ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.15222e+07 after 7.69466e+07
Parikh walk visited 0 properties in 6626 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 181 /181 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 181/181 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 181 /181 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:19:28] [INFO ] Invariant cache hit.
[2025-05-31 23:19:28] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-31 23:19:28] [INFO ] Invariant cache hit.
[2025-05-31 23:19:28] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-31 23:19:30] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
[2025-05-31 23:19:30] [INFO ] Redundant transitions in 1 ms returned []
Running 187 sub problems to find dead transitions.
[2025-05-31 23:19:30] [INFO ] Invariant cache hit.
[2025-05-31 23:19:30] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 2/181 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:19:31] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:19:31] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:19:31] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:19:32] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:19:32] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:19:32] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:19:32] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 0 ms to minimize.
[2025-05-31 23:19:32] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:19:32] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:19:32] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:19:32] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:19:32] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:19:33] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:19:33] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 0 ms to minimize.
[2025-05-31 23:19:33] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:19:33] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2025-05-31 23:19:33] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 0 ms to minimize.
[2025-05-31 23:19:33] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:19:33] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:19:34] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:19:34] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
[2025-05-31 23:19:34] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:19:34] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:19:34] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:19:34] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2025-05-31 23:19:34] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2025-05-31 23:19:34] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:19:34] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:19:34] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:19:35] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:19:35] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:19:35] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 0 ms to minimize.
[2025-05-31 23:19:35] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:19:35] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:19:36] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:19:36] [INFO ] Deduced a trap composed of 83 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:19:36] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:19:36] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:19:37] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:19:37] [INFO ] Deduced a trap composed of 78 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:19:37] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:19:37] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:19:38] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:19:38] [INFO ] Deduced a trap composed of 83 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:19:38] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:19:38] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:19:38] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:19:39] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2025-05-31 23:19:39] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:19:39] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:19:40] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 0 ms to minimize.
[2025-05-31 23:19:40] [INFO ] Deduced a trap composed of 80 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:19:40] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:19:40] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 188/369 variables, 181/262 constraints. Problems are: Problem set: 0 solved, 187 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 35/297 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (OVERLAPS) 0/369 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 297 constraints, problems are : Problem set: 0 solved, 187 unsolved in 18186 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 187 unsolved
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :7.69466e+07 after 2.37926e+08
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 2/181 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 54/81 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:19:49] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:19:49] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:19:49] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:19:49] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:19:49] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:19:49] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:19:49] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:19:49] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:19:49] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:19:49] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:19:50] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:19:50] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:19:50] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2025-05-31 23:19:50] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2025-05-31 23:19:50] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 15/96 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:19:51] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:19:51] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:19:51] [INFO ] Deduced a trap composed of 84 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 188/369 variables, 181/280 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 35/315 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Detected timeout of ITS tools.
[2025-05-31 23:19:56] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:19:56] [INFO ] Applying decomposition
[2025-05-31 23:19:56] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2928951527300797277.txt' '-o' '/tmp/graph2928951527300797277.bin' '-w' '/tmp/graph2928951527300797277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2928951527300797277.bin' '-l' '-1' '-v' '-w' '/tmp/graph2928951527300797277.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:19:56] [INFO ] Decomposing Gal with order
[2025-05-31 23:19:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:19:56] [INFO ] Removed a total of 91 redundant transitions.
[2025-05-31 23:19:56] [INFO ] Flatten gal took : 14 ms
[2025-05-31 23:19:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 3 ms.
[2025-05-31 23:19:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4442872490167101309.gal : 3 ms
[2025-05-31 23:19:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11322645634331165143.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4442872490167101309.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11322645634331165143.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11322645634331165143.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :17 after 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 1146
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1146 after 12348
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :12348 after 132852
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 187/502 constraints. Problems are: Problem set: 0 solved, 187 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :132852 after 401361
[2025-05-31 23:20:01] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:20:01] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:20:02] [INFO ] Deduced a trap composed of 87 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:20:02] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 0 ms to minimize.
[2025-05-31 23:20:02] [INFO ] Deduced a trap composed of 90 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:20:02] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 6/508 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 187 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :401361 after 747419
[2025-05-31 23:20:12] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:20:12] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2025-05-31 23:20:12] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :747419 after 762731
At refinement iteration 13 (OVERLAPS) 0/369 variables, 3/511 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 23:20:17] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 512 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 82/82 constraints]
After SMT, in 48274ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 48277ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49647 ms. Remains : 181/181 places, 188/188 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 181 transition count 172
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 165 transition count 172
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 157 transition count 164
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 157 transition count 164
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 157 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 50 place count 156 transition count 163
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 156 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 154 transition count 161
Applied a total of 54 rules in 10 ms. Remains 154 /181 variables (removed 27) and now considering 161/188 (removed 27) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 161 rows 154 cols
[2025-05-31 23:20:18] [INFO ] Computed 27 invariants in 10 ms
[2025-05-31 23:20:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 23:20:18] [INFO ] [Real]Absence check using 4 positive and 23 generalized place invariants in 6 ms returned sat
[2025-05-31 23:20:18] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-31 23:20:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 23:20:18] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 23:20:18] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 23:20:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 23:20:18] [INFO ] [Nat]Absence check using 4 positive and 23 generalized place invariants in 5 ms returned sat
[2025-05-31 23:20:18] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-31 23:20:18] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 23:20:18] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 23:20:18] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 23:20:18] [INFO ] Flatten gal took : 8 ms
[2025-05-31 23:20:18] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:20:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2027346381688381062.gal : 1 ms
[2025-05-31 23:20:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality738412479573142719.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2027346381688381062.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality738412479573142719.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality738412479573142719.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 171
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :171 after 295
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :295 after 1131
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1131 after 3495
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3495 after 12611
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :12611 after 29584
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :29584 after 65317
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :65317 after 150079
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :150079 after 328681
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :328681 after 713342
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :713342 after 1.49564e+06
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.49564e+06 after 3.12129e+06
Detected timeout of ITS tools.
[2025-05-31 23:20:33] [INFO ] Flatten gal took : 12 ms
[2025-05-31 23:20:33] [INFO ] Applying decomposition
[2025-05-31 23:20:33] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6592462074677369865.txt' '-o' '/tmp/graph6592462074677369865.bin' '-w' '/tmp/graph6592462074677369865.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6592462074677369865.bin' '-l' '-1' '-v' '-w' '/tmp/graph6592462074677369865.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:20:33] [INFO ] Decomposing Gal with order
[2025-05-31 23:20:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:20:33] [INFO ] Removed a total of 95 redundant transitions.
[2025-05-31 23:20:33] [INFO ] Flatten gal took : 14 ms
[2025-05-31 23:20:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 3 ms.
[2025-05-31 23:20:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15501267410448290793.gal : 2 ms
[2025-05-31 23:20:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13989315749234538725.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15501267410448290793.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13989315749234538725.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13989315749234538725.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 24853
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30527 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-13 in 247245 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
// Phase 1: matrix 233 rows 232 cols
[2025-05-31 23:20:48] [INFO ] Computed 35 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (1462 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10000 steps (909 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2025-05-31 23:20:48] [INFO ] Invariant cache hit.
[2025-05-31 23:20:48] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-31 23:20:48] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 23:20:49] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2025-05-31 23:20:49] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-31 23:20:49] [INFO ] [Real]Added 31 Read/Feed constraints in 135 ms returned sat
[2025-05-31 23:20:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:20:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2025-05-31 23:20:49] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 23:20:49] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-05-31 23:20:49] [INFO ] [Nat]Added 31 Read/Feed constraints in 171 ms returned sat
[2025-05-31 23:20:49] [INFO ] Computed and/alt/rep : 216/1174/216 causal constraints (skipped 16 transitions) in 12 ms.
[2025-05-31 23:20:52] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:20:52] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 1 ms to minimize.
[2025-05-31 23:20:52] [INFO ] Deduced a trap composed of 92 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:20:52] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:20:52] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:20:52] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:20:52] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:20:53] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 2 ms to minimize.
[2025-05-31 23:20:53] [INFO ] Deduced a trap composed of 94 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:20:53] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:20:53] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:20:53] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:20:53] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:20:53] [INFO ] Deduced a trap composed of 97 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:20:53] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:20:53] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:20:53] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1641 ms
[2025-05-31 23:20:53] [INFO ] Added : 213 causal constraints over 44 iterations in 4391 ms. Result :sat
Minimization took 278 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 233/233 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 231 transition count 232
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 223 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 222 transition count 224
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 222 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 221 transition count 223
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 31 place count 221 transition count 214
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 40 place count 212 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 212 transition count 214
Applied a total of 42 rules in 21 ms. Remains 212 /232 variables (removed 20) and now considering 214/233 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 212/232 places, 214/233 transitions.
// Phase 1: matrix 214 rows 212 cols
[2025-05-31 23:20:54] [INFO ] Computed 35 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144420 resets) in 722 ms. (1383 steps per ms)
BEST_FIRST walk for 1000000 steps (91214 resets) in 500 ms. (1996 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:20:55] [INFO ] Invariant cache hit.
[2025-05-31 23:20:55] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-31 23:20:55] [INFO ] [Real]Absence check using 9 positive and 26 generalized place invariants in 4 ms returned sat
[2025-05-31 23:20:55] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2025-05-31 23:20:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 23:20:55] [INFO ] [Real]Added 40 Read/Feed constraints in 169 ms returned sat
[2025-05-31 23:20:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:20:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-05-31 23:20:55] [INFO ] [Nat]Absence check using 9 positive and 26 generalized place invariants in 5 ms returned sat
[2025-05-31 23:20:55] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-05-31 23:20:56] [INFO ] [Nat]Added 40 Read/Feed constraints in 162 ms returned sat
[2025-05-31 23:20:56] [INFO ] Computed and/alt/rep : 171/1061/171 causal constraints (skipped 42 transitions) in 12 ms.
[2025-05-31 23:20:56] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:20:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2025-05-31 23:20:56] [INFO ] Added : 83 causal constraints over 18 iterations in 781 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 212 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p401) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 213/213 transitions.
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 209
Reduce places removed 4 places and 12 transitions.
Graph (complete) has 950 edges and 207 vertex of which 205 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 5 rules applied. Total rules applied 6 place count 205 transition count 197
Reduce places removed 7 places and 9 transitions.
Graph (complete) has 912 edges and 198 vertex of which 194 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 8 rules applied. Total rules applied 14 place count 194 transition count 188
Reduce places removed 1 places and 2 transitions.
Graph (complete) has 890 edges and 193 vertex of which 192 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 16 place count 192 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 16 place count 192 transition count 185
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 20 transitions.
Iterating global reduction 4 with 23 rules applied. Total rules applied 39 place count 170 transition count 165
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 42 place count 167 transition count 165
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 43 place count 167 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 44 place count 166 transition count 165
Applied a total of 44 rules in 8 ms. Remains 166 /212 variables (removed 46) and now considering 165/213 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 166/212 places, 165/213 transitions.
// Phase 1: matrix 165 rows 166 cols
[2025-05-31 23:20:58] [INFO ] Computed 30 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144564 resets) in 635 ms. (1572 steps per ms)
BEST_FIRST walk for 1000001 steps (91593 resets) in 445 ms. (2242 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:20:59] [INFO ] Invariant cache hit.
[2025-05-31 23:20:59] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 23:20:59] [INFO ] [Real]Absence check using 4 positive and 26 generalized place invariants in 4 ms returned sat
[2025-05-31 23:20:59] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-05-31 23:20:59] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-31 23:20:59] [INFO ] [Real]Added 32 Read/Feed constraints in 54 ms returned sat
[2025-05-31 23:20:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:20:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 23:20:59] [INFO ] [Nat]Absence check using 4 positive and 26 generalized place invariants in 4 ms returned sat
[2025-05-31 23:20:59] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-05-31 23:20:59] [INFO ] [Nat]Added 32 Read/Feed constraints in 57 ms returned sat
[2025-05-31 23:20:59] [INFO ] Computed and/alt/rep : 133/827/133 causal constraints (skipped 31 transitions) in 12 ms.
[2025-05-31 23:21:00] [INFO ] Added : 78 causal constraints over 16 iterations in 391 ms. Result :sat
Minimization took 217 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 165/165 transitions.
Applied a total of 0 rules in 2 ms. Remains 166 /166 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 166/166 places, 165/165 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 165/165 transitions.
Applied a total of 0 rules in 2 ms. Remains 166 /166 variables (removed 0) and now considering 165/165 (removed 0) transitions.
[2025-05-31 23:21:00] [INFO ] Invariant cache hit.
[2025-05-31 23:21:00] [INFO ] Implicit Places using invariants in 119 ms returned [42, 47, 122, 127, 163]
[2025-05-31 23:21:00] [INFO ] Actually due to overlaps returned [163, 127]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 119 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 164/166 places, 165/165 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 164 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 164
Applied a total of 2 rules in 4 ms. Remains 163 /164 variables (removed 1) and now considering 164/165 (removed 1) transitions.
// Phase 1: matrix 164 rows 163 cols
[2025-05-31 23:21:00] [INFO ] Computed 28 invariants in 6 ms
[2025-05-31 23:21:00] [INFO ] Implicit Places using invariants in 108 ms returned [42, 47, 122]
[2025-05-31 23:21:00] [INFO ] Actually due to overlaps returned [47, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 108 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 161/166 places, 164/165 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 160 transition count 163
Applied a total of 2 rules in 4 ms. Remains 160 /161 variables (removed 1) and now considering 163/164 (removed 1) transitions.
// Phase 1: matrix 163 rows 160 cols
[2025-05-31 23:21:00] [INFO ] Computed 26 invariants in 5 ms
[2025-05-31 23:21:01] [INFO ] Implicit Places using invariants in 96 ms returned [119]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 159/166 places, 163/165 transitions.
Applied a total of 0 rules in 2 ms. Remains 159 /159 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 336 ms. Remains : 159/166 places, 163/165 transitions.
// Phase 1: matrix 163 rows 159 cols
[2025-05-31 23:21:01] [INFO ] Computed 25 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144202 resets) in 633 ms. (1577 steps per ms)
BEST_FIRST walk for 1000000 steps (91315 resets) in 464 ms. (2150 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:21:02] [INFO ] Invariant cache hit.
[2025-05-31 23:21:02] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-31 23:21:02] [INFO ] [Real]Absence check using 9 positive and 16 generalized place invariants in 2 ms returned sat
[2025-05-31 23:21:02] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-05-31 23:21:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-31 23:21:02] [INFO ] [Real]Added 30 Read/Feed constraints in 56 ms returned sat
[2025-05-31 23:21:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:21:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-05-31 23:21:02] [INFO ] [Nat]Absence check using 9 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-31 23:21:02] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-05-31 23:21:02] [INFO ] [Nat]Added 30 Read/Feed constraints in 77 ms returned sat
[2025-05-31 23:21:02] [INFO ] Computed and/alt/rep : 133/834/133 causal constraints (skipped 29 transitions) in 13 ms.
[2025-05-31 23:21:03] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:21:03] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:21:03] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:21:03] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2025-05-31 23:21:03] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:21:03] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:21:03] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:21:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 493 ms
[2025-05-31 23:21:03] [INFO ] Added : 106 causal constraints over 23 iterations in 1066 ms. Result :sat
Minimization took 230 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 159 /159 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 159/159 places, 163/163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 159 /159 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2025-05-31 23:21:04] [INFO ] Invariant cache hit.
[2025-05-31 23:21:04] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-05-31 23:21:04] [INFO ] Invariant cache hit.
[2025-05-31 23:21:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-31 23:21:05] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
[2025-05-31 23:21:05] [INFO ] Redundant transitions in 1 ms returned []
Running 162 sub problems to find dead transitions.
[2025-05-31 23:21:05] [INFO ] Invariant cache hit.
[2025-05-31 23:21:05] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 2/159 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:21:07] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:21:07] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:21:07] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:21:07] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:21:07] [INFO ] Deduced a trap composed of 68 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:21:07] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 0 ms to minimize.
[2025-05-31 23:21:07] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:21:07] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 3 ms to minimize.
[2025-05-31 23:21:07] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:21:07] [INFO ] Deduced a trap composed of 75 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:21:08] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2025-05-31 23:21:08] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:21:08] [INFO ] Deduced a trap composed of 69 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:21:08] [INFO ] Deduced a trap composed of 71 places in 40 ms of which 0 ms to minimize.
[2025-05-31 23:21:08] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:21:08] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2025-05-31 23:21:08] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2025-05-31 23:21:08] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:21:08] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:21:08] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 0 ms to minimize.
[2025-05-31 23:21:08] [INFO ] Deduced a trap composed of 69 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:21:08] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 0 ms to minimize.
[2025-05-31 23:21:08] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:21:08] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2025-05-31 23:21:09] [INFO ] Deduced a trap composed of 70 places in 46 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:21:10] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:21:10] [INFO ] Deduced a trap composed of 69 places in 42 ms of which 1 ms to minimize.
[2025-05-31 23:21:10] [INFO ] Deduced a trap composed of 68 places in 45 ms of which 2 ms to minimize.
[2025-05-31 23:21:10] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2025-05-31 23:21:10] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2025-05-31 23:21:10] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:21:11] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2025-05-31 23:21:11] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2025-05-31 23:21:11] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2025-05-31 23:21:11] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2025-05-31 23:21:11] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2025-05-31 23:21:11] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2025-05-31 23:21:11] [INFO ] Deduced a trap composed of 67 places in 41 ms of which 1 ms to minimize.
[2025-05-31 23:21:11] [INFO ] Deduced a trap composed of 69 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:21:12] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:21:12] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:21:12] [INFO ] Deduced a trap composed of 70 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:21:13] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2025-05-31 23:21:13] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:21:13] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:21:13] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2025-05-31 23:21:14] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:21:14] [INFO ] Deduced a trap composed of 69 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:21:14] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 0 ms to minimize.
[2025-05-31 23:21:14] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:21:14] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:21:14] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:21:14] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2025-05-31 23:21:14] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:21:14] [INFO ] Deduced a trap composed of 75 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 13/80 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:21:14] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:21:15] [INFO ] Deduced a trap composed of 62 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:21:15] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:21:15] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/159 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 14 (OVERLAPS) 163/322 variables, 159/243 constraints. Problems are: Problem set: 0 solved, 162 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 30/273 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/322 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 17 (OVERLAPS) 0/322 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 273 constraints, problems are : Problem set: 0 solved, 162 unsolved in 16595 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 159/159 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 2/159 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 59/84 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 69 places in 42 ms of which 1 ms to minimize.
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:21:23] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:21:24] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:21:24] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:21:24] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:21:24] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:21:24] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 163/322 variables, 159/263 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 30/293 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 162/455 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:21:29] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 0 ms to minimize.
[2025-05-31 23:21:31] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:21:31] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:21:31] [INFO ] Deduced a trap composed of 68 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:21:31] [INFO ] Deduced a trap composed of 70 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:21:31] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:21:31] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:21:32] [INFO ] Deduced a trap composed of 69 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:21:32] [INFO ] Deduced a trap composed of 66 places in 41 ms of which 1 ms to minimize.
[2025-05-31 23:21:32] [INFO ] Deduced a trap composed of 68 places in 41 ms of which 1 ms to minimize.
[2025-05-31 23:21:32] [INFO ] Deduced a trap composed of 68 places in 43 ms of which 0 ms to minimize.
[2025-05-31 23:21:32] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:21:32] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 13/468 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/322 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 468 constraints, problems are : Problem set: 0 solved, 162 unsolved in 26544 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 159/159 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 92/92 constraints]
After SMT, in 43187ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 43188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44079 ms. Remains : 159/159 places, 163/163 transitions.
[2025-05-31 23:21:48] [INFO ] Flatten gal took : 9 ms
[2025-05-31 23:21:48] [INFO ] Flatten gal took : 6 ms
[2025-05-31 23:21:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17458006540408862401.gal : 1 ms
[2025-05-31 23:21:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17000839311458294342.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17458006540408862401.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17000839311458294342.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17000839311458294342.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 124
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :124 after 248
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :248 after 521
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :521 after 1134
RANDOM walk for 40000 steps (5752 resets) in 348 ms. (114 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1134 after 23429
BEST_FIRST walk for 40000 steps (3650 resets) in 320 ms. (124 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3635 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :23429 after 41826
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :41826 after 102138
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :102138 after 219293
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :219293 after 471512
Interrupted probabilistic random walk after 467845 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 2
Probabilistic random walk after 467845 steps, saw 234160 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2025-05-31 23:21:52] [INFO ] Invariant cache hit.
[2025-05-31 23:21:52] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/109 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:21:52] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 0 ms to minimize.
[2025-05-31 23:21:52] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 46/155 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 163/318 variables, 155/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 30/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/322 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/322 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 159/159 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/109 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:21:52] [INFO ] Deduced a trap composed of 81 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 46/155 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 163/318 variables, 155/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 30/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:21:52] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2025-05-31 23:21:52] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2025-05-31 23:21:52] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/322 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/322 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/322 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 159/159 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 700ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :471512 after 3.61093e+06
Parikh walk visited 0 properties in 3473 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 159 /159 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 159/159 places, 163/163 transitions.
RANDOM walk for 40000 steps (5774 resets) in 582 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3647 resets) in 447 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3614 resets) in 315 ms. (126 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 423740 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 2
Probabilistic random walk after 423740 steps, saw 212071 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
[2025-05-31 23:21:59] [INFO ] Invariant cache hit.
[2025-05-31 23:21:59] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/109 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:21:59] [INFO ] Deduced a trap composed of 79 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:21:59] [INFO ] Deduced a trap composed of 79 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 46/155 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 163/318 variables, 155/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 30/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/322 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/322 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 159/159 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/109 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:22:00] [INFO ] Deduced a trap composed of 81 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 46/155 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 163/318 variables, 155/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 30/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:22:00] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2025-05-31 23:22:00] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2025-05-31 23:22:00] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/322 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/322 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/322 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 159/159 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 708ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :3.61093e+06 after 2.72655e+07
Parikh walk visited 0 properties in 2907 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 159 /159 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 159/159 places, 163/163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 159 /159 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2025-05-31 23:22:03] [INFO ] Invariant cache hit.
[2025-05-31 23:22:03] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-05-31 23:22:03] [INFO ] Invariant cache hit.
[2025-05-31 23:22:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-31 23:22:04] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
[2025-05-31 23:22:04] [INFO ] Redundant transitions in 1 ms returned []
Running 162 sub problems to find dead transitions.
[2025-05-31 23:22:04] [INFO ] Invariant cache hit.
[2025-05-31 23:22:04] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 2/159 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:22:05] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:22:05] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:22:06] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:22:06] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:22:06] [INFO ] Deduced a trap composed of 68 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:22:06] [INFO ] Deduced a trap composed of 69 places in 45 ms of which 0 ms to minimize.
[2025-05-31 23:22:06] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 0 ms to minimize.
[2025-05-31 23:22:06] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 0 ms to minimize.
[2025-05-31 23:22:06] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:22:06] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:22:06] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:22:06] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:22:06] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:22:06] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 0 ms to minimize.
[2025-05-31 23:22:07] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:22:07] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2025-05-31 23:22:07] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2025-05-31 23:22:07] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:22:07] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:22:07] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:22:07] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:22:07] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 0 ms to minimize.
[2025-05-31 23:22:07] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:22:07] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:22:07] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:22:09] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:22:09] [INFO ] Deduced a trap composed of 69 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:22:09] [INFO ] Deduced a trap composed of 68 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:22:09] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2025-05-31 23:22:09] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:22:09] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:22:10] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2025-05-31 23:22:10] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2025-05-31 23:22:10] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2025-05-31 23:22:10] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2025-05-31 23:22:10] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:22:10] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2025-05-31 23:22:10] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:22:10] [INFO ] Deduced a trap composed of 69 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:22:11] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:22:11] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:22:11] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:22:12] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:22:12] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:22:12] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:22:12] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2025-05-31 23:22:13] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:22:13] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:22:13] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:22:13] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:22:13] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:22:13] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:22:13] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 ms to minimize.
[2025-05-31 23:22:13] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:22:13] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 13/80 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:22:14] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:22:14] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2025-05-31 23:22:14] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:22:15] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 162 unsolved
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :2.72655e+07 after 8.37326e+07
At refinement iteration 13 (INCLUDED_ONLY) 0/159 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 14 (OVERLAPS) 163/322 variables, 159/243 constraints. Problems are: Problem set: 0 solved, 162 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 30/273 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/322 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 17 (OVERLAPS) 0/322 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 273 constraints, problems are : Problem set: 0 solved, 162 unsolved in 18202 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 159/159 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 2/159 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 59/84 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:22:23] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:22:23] [INFO ] Deduced a trap composed of 69 places in 42 ms of which 0 ms to minimize.
[2025-05-31 23:22:23] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:22:23] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:22:23] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:22:23] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:22:23] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:22:23] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:22:23] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:22:24] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:22:24] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:22:24] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:22:24] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:22:24] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:22:24] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:22:24] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:22:24] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:22:24] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:22:24] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:22:24] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 163/322 variables, 159/263 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 30/293 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 162/455 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2025-05-31 23:22:30] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:22:32] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 0 ms to minimize.
[2025-05-31 23:22:32] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:22:32] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:22:32] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:22:32] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:22:32] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 0 ms to minimize.
[2025-05-31 23:22:32] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:22:32] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:22:32] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:22:32] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:22:32] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:22:33] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 13/468 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Detected timeout of ITS tools.
[2025-05-31 23:22:39] [INFO ] Flatten gal took : 5 ms
[2025-05-31 23:22:39] [INFO ] Applying decomposition
[2025-05-31 23:22:39] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16653083768772740723.txt' '-o' '/tmp/graph16653083768772740723.bin' '-w' '/tmp/graph16653083768772740723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16653083768772740723.bin' '-l' '-1' '-v' '-w' '/tmp/graph16653083768772740723.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:22:39] [INFO ] Decomposing Gal with order
[2025-05-31 23:22:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:22:39] [INFO ] Removed a total of 106 redundant transitions.
[2025-05-31 23:22:39] [INFO ] Flatten gal took : 10 ms
[2025-05-31 23:22:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 2 ms.
[2025-05-31 23:22:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9931928502809996363.gal : 2 ms
[2025-05-31 23:22:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18173695997872929910.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9931928502809996363.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18173695997872929910.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality18173695997872929910.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :42 after 45
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :45 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1142 after 1149
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 162 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :447533 after 447535
At refinement iteration 13 (OVERLAPS) 0/322 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 468 constraints, problems are : Problem set: 0 solved, 162 unsolved in 27512 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 159/159 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 92/92 constraints]
After SMT, in 45800ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 45803ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46681 ms. Remains : 159/159 places, 163/163 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 159 transition count 149
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 145 transition count 149
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 138 transition count 142
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 138 transition count 142
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 138 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 44 place count 137 transition count 141
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 137 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 136 transition count 140
Applied a total of 46 rules in 11 ms. Remains 136 /159 variables (removed 23) and now considering 140/163 (removed 23) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 140 rows 136 cols
[2025-05-31 23:22:50] [INFO ] Computed 25 invariants in 5 ms
[2025-05-31 23:22:50] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 23:22:50] [INFO ] [Real]Absence check using 4 positive and 21 generalized place invariants in 4 ms returned sat
[2025-05-31 23:22:50] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-31 23:22:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 23:22:50] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 23:22:50] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 23:22:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 23:22:50] [INFO ] [Nat]Absence check using 4 positive and 21 generalized place invariants in 4 ms returned sat
[2025-05-31 23:22:50] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-31 23:22:50] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 23:22:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2025-05-31 23:22:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
TRAPS : Iteration 1
[2025-05-31 23:22:50] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 23:22:50] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 23:22:50] [INFO ] Flatten gal took : 25 ms
[2025-05-31 23:22:50] [INFO ] Flatten gal took : 5 ms
[2025-05-31 23:22:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11029345511989496680.gal : 2 ms
[2025-05-31 23:22:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8723412987272609443.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11029345511989496680.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8723412987272609443.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8723412987272609443.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 170
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :170 after 307
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :307 after 1280
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1280 after 3545
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3545 after 13224
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13224 after 31432
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :31432 after 69686
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :69686 after 160417
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :160417 after 346035
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :346035 after 739215
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :739215 after 1.55206e+06
Detected timeout of ITS tools.
[2025-05-31 23:23:05] [INFO ] Flatten gal took : 11 ms
[2025-05-31 23:23:05] [INFO ] Applying decomposition
[2025-05-31 23:23:05] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8593818532256599789.txt' '-o' '/tmp/graph8593818532256599789.bin' '-w' '/tmp/graph8593818532256599789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8593818532256599789.bin' '-l' '-1' '-v' '-w' '/tmp/graph8593818532256599789.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:23:05] [INFO ] Decomposing Gal with order
[2025-05-31 23:23:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:23:05] [INFO ] Removed a total of 78 redundant transitions.
[2025-05-31 23:23:05] [INFO ] Flatten gal took : 11 ms
[2025-05-31 23:23:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2025-05-31 23:23:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7364374227316320954.gal : 1 ms
[2025-05-31 23:23:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality901785371108661242.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7364374227316320954.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality901785371108661242.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality901785371108661242.prop.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30536 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-15 in 151868 ms.
[2025-05-31 23:23:20] [INFO ] Flatten gal took : 11 ms
[2025-05-31 23:23:20] [INFO ] Applying decomposition
[2025-05-31 23:23:20] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11088065374572947274.txt' '-o' '/tmp/graph11088065374572947274.bin' '-w' '/tmp/graph11088065374572947274.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11088065374572947274.bin' '-l' '-1' '-v' '-w' '/tmp/graph11088065374572947274.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:23:20] [INFO ] Decomposing Gal with order
[2025-05-31 23:23:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:23:20] [INFO ] Removed a total of 104 redundant transitions.
[2025-05-31 23:23:20] [INFO ] Flatten gal took : 13 ms
[2025-05-31 23:23:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 4 ms.
[2025-05-31 23:23:20] [INFO ] Time to serialize gal into /tmp/UpperBounds6031922654256553751.gal : 3 ms
[2025-05-31 23:23:20] [INFO ] Time to serialize properties into /tmp/UpperBounds9687207780808451191.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6031922654256553751.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9687207780808451191.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds9687207780808451191.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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