MCC'2025- Execution of r153-tall-174876824800078

About the Execution of 2024-gold for Peterson-PT-5

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15688.250	1228531.00	1437659.00	2849.60	5 6 6 6 6 6 1 6 1 1 1 1 1 1 1 1	normal

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.r153-tall-174876824800078.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 Peterson-PT-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824800078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 406K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 380K 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 83K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 257K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 168K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 196K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 784K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 206K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 945K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 535K 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 Peterson-PT-5-UpperBounds-00
FORMULA_NAME Peterson-PT-5-UpperBounds-01
FORMULA_NAME Peterson-PT-5-UpperBounds-02
FORMULA_NAME Peterson-PT-5-UpperBounds-03
FORMULA_NAME Peterson-PT-5-UpperBounds-04
FORMULA_NAME Peterson-PT-5-UpperBounds-05
FORMULA_NAME Peterson-PT-5-UpperBounds-06
FORMULA_NAME Peterson-PT-5-UpperBounds-07
FORMULA_NAME Peterson-PT-5-UpperBounds-08
FORMULA_NAME Peterson-PT-5-UpperBounds-09
FORMULA_NAME Peterson-PT-5-UpperBounds-10
FORMULA_NAME Peterson-PT-5-UpperBounds-11
FORMULA_NAME Peterson-PT-5-UpperBounds-12
FORMULA_NAME Peterson-PT-5-UpperBounds-13
FORMULA_NAME Peterson-PT-5-UpperBounds-14
FORMULA_NAME Peterson-PT-5-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841562246

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 05:19:23] [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-06-02 05:19:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:19:23] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2025-06-02 05:19:23] [INFO ] Transformed 834 places.
[2025-06-02 05:19:23] [INFO ] Transformed 1242 transitions.
[2025-06-02 05:19:23] [INFO ] Found NUPN structural information;
[2025-06-02 05:19:23] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 14
FORMULA Peterson-PT-5-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[6, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0] Max Struct:[6, 180, 30, 6, 150, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Peterson-PT-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[180, 30, 6, 150, 1, 1, 1, 1, 1, 1]
[2025-06-02 05:19:23] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2025-06-02 05:19:23] [INFO ] Computed 23 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[180, 30, 6, 150, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 93 ms. (106 steps per ms)
FORMULA Peterson-PT-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-5-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-5-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-5-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (12 resets) in 126 ms. (472 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 6, 1, 6, 0, 0] Max Struct:[180, 30, 6, 150, 1, 1]
[2025-06-02 05:19:24] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-02 05:19:24] [INFO ] Invariant cache hit.
[2025-06-02 05:19:24] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned sat
[2025-06-02 05:19:24] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-02 05:19:24] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2025-06-02 05:19:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-02 05:19:24] [INFO ] [Real]Added 205 Read/Feed constraints in 47 ms returned sat
[2025-06-02 05:19:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 20 ms returned sat
[2025-06-02 05:19:25] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-02 05:19:25] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2025-06-02 05:19:25] [INFO ] [Nat]Added 205 Read/Feed constraints in 149 ms returned sat
[2025-06-02 05:19:25] [INFO ] Deduced a trap composed of 85 places in 320 ms of which 40 ms to minimize.
[2025-06-02 05:19:26] [INFO ] Deduced a trap composed of 85 places in 329 ms of which 5 ms to minimize.
[2025-06-02 05:19:26] [INFO ] Deduced a trap composed of 56 places in 258 ms of which 16 ms to minimize.
[2025-06-02 05:19:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1106 ms
[2025-06-02 05:19:26] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 62 ms.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 4 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 ms
[2025-06-02 05:19:29] [INFO ] Added : 168 causal constraints over 34 iterations in 2685 ms. Result :sat
Minimization took 559 ms.
[2025-06-02 05:19:29] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned unsat
[2025-06-02 05:19:30] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2025-06-02 05:19:30] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2025-06-02 05:19:30] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2025-06-02 05:19:30] [INFO ] [Real]Added 205 Read/Feed constraints in 31 ms returned sat
[2025-06-02 05:19:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2025-06-02 05:19:30] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2025-06-02 05:19:30] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2025-06-02 05:19:30] [INFO ] [Nat]Added 205 Read/Feed constraints in 132 ms returned sat
[2025-06-02 05:19:31] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:19:31] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:19:31] [INFO ] Deduced a trap composed of 69 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 5 ms to minimize.
[2025-06-02 05:19:33] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:19:33] [INFO ] Deduced a trap composed of 63 places in 196 ms of which 4 ms to minimize.
[2025-06-02 05:19:33] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:19:33] [INFO ] Deduced a trap composed of 113 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:19:34] [INFO ] Deduced a trap composed of 64 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:19:34] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:19:34] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 4 ms to minimize.
[2025-06-02 05:19:35] [INFO ] Deduced a trap composed of 126 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:19:35] [INFO ] Deduced a trap composed of 115 places in 157 ms of which 3 ms to minimize.
[2025-06-02 05:19:35] [INFO ] Trap strengthening (SAT) tested/added 16/16 trap constraints in 4508 ms
[2025-06-02 05:19:35] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned unsat
[2025-06-02 05:19:35] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2025-06-02 05:19:35] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2025-06-02 05:19:35] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2025-06-02 05:19:36] [INFO ] [Real]Added 205 Read/Feed constraints in 19 ms returned sat
[2025-06-02 05:19:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2025-06-02 05:19:36] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-02 05:19:36] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2025-06-02 05:19:36] [INFO ] [Nat]Added 205 Read/Feed constraints in 19 ms returned sat
[2025-06-02 05:19:36] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 53 ms.
[2025-06-02 05:19:39] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:19:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2025-06-02 05:19:39] [INFO ] Added : 229 causal constraints over 46 iterations in 3196 ms. Result :sat
Minimization took 638 ms.
[2025-06-02 05:19:40] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2025-06-02 05:19:40] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-02 05:19:40] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2025-06-02 05:19:40] [INFO ] [Real]Added 205 Read/Feed constraints in 21 ms returned sat
[2025-06-02 05:19:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2025-06-02 05:19:40] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-02 05:19:41] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2025-06-02 05:19:41] [INFO ] [Nat]Added 205 Read/Feed constraints in 22 ms returned sat
[2025-06-02 05:19:41] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 60 ms.
[2025-06-02 05:19:45] [INFO ] Deduced a trap composed of 52 places in 233 ms of which 5 ms to minimize.
[2025-06-02 05:19:45] [INFO ] Deduced a trap composed of 52 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:19:45] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:19:45] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:19:45] [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 5
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: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:[2, 6, 1, 6, 0, 0] Max Struct:[180, 6, 6, 6, 1, 1]
FORMULA Peterson-PT-5-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 1, 0, 0] Max Struct:[180, 6, 1, 1]
Support contains 187 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 834 transition count 1093
Reduce places removed 149 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 299 rules applied. Total rules applied 448 place count 685 transition count 943
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 598 place count 535 transition count 943
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 598 place count 535 transition count 889
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 706 place count 481 transition count 889
Applied a total of 706 rules in 118 ms. Remains 481 /834 variables (removed 353) and now considering 889/1242 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 481/834 places, 889/1242 transitions.
[2025-06-02 05:19:46] [INFO ] Flow matrix only has 769 transitions (discarded 120 similar events)
// Phase 1: matrix 769 rows 481 cols
[2025-06-02 05:19:46] [INFO ] Computed 23 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 1, 0, 0] Max Struct:[180, 6, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 3073 ms. (325 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 4253 ms. (940 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 1, 0, 0] Max Struct:[180, 6, 1, 1]
[2025-06-02 05:19:53] [INFO ] Flow matrix only has 769 transitions (discarded 120 similar events)
[2025-06-02 05:19:53] [INFO ] Invariant cache hit.
[2025-06-02 05:19:53] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 05:19:53] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-02 05:19:53] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2025-06-02 05:19:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-02 05:19:53] [INFO ] [Real]Added 205 Read/Feed constraints in 34 ms returned sat
[2025-06-02 05:19:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 05:19:54] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-02 05:19:54] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2025-06-02 05:19:54] [INFO ] [Nat]Added 205 Read/Feed constraints in 56 ms returned sat
[2025-06-02 05:19:54] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 3 ms to minimize.
[2025-06-02 05:19:54] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 3 ms to minimize.
[2025-06-02 05:19:54] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:19:55] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 3 ms to minimize.
[2025-06-02 05:19:55] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 4 ms to minimize.
[2025-06-02 05:19:55] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 3 ms to minimize.
[2025-06-02 05:19:55] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 3 ms to minimize.
[2025-06-02 05:19:55] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 3 ms to minimize.
[2025-06-02 05:19:55] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 3 ms to minimize.
[2025-06-02 05:19:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1732 ms
[2025-06-02 05:19:56] [INFO ] Computed and/alt/rep : 703/1759/703 causal constraints (skipped 60 transitions) in 43 ms.
[2025-06-02 05:19:57] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 4 ms to minimize.
[2025-06-02 05:19:58] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2025-06-02 05:19:58] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:19:58] [INFO ] Deduced a trap composed of 99 places in 160 ms of which 3 ms to minimize.
[2025-06-02 05:19:58] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2025-06-02 05:19:58] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 4 ms to minimize.
[2025-06-02 05:19:59] [INFO ] Deduced a trap composed of 63 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:19:59] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 3 ms to minimize.
[2025-06-02 05:19:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1569 ms
[2025-06-02 05:19:59] [INFO ] Added : 184 causal constraints over 38 iterations in 3415 ms. Result :sat
Minimization took 393 ms.
[2025-06-02 05:19:59] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 05:19:59] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-02 05:20:00] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2025-06-02 05:20:00] [INFO ] [Real]Added 205 Read/Feed constraints in 23 ms returned sat
[2025-06-02 05:20:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 05:20:00] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2025-06-02 05:20:00] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-06-02 05:20:00] [INFO ] [Nat]Added 205 Read/Feed constraints in 67 ms returned sat
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 7 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 4 ms to minimize.
[2025-06-02 05:20:02] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 3 ms to minimize.
[2025-06-02 05:20:02] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 3 ms to minimize.
[2025-06-02 05:20:02] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 3 ms to minimize.
[2025-06-02 05:20:02] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:20:02] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 3 ms to minimize.
[2025-06-02 05:20:02] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 9 ms to minimize.
[2025-06-02 05:20:03] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:20:03] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:20:03] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 2 ms to minimize.
[2025-06-02 05:20:03] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 2 ms to minimize.
[2025-06-02 05:20:03] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:20:03] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 3 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 3 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:20:06] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 3 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 3 ms to minimize.
[2025-06-02 05:20:08] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:20:08] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:20:08] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:20:08] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:20:08] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:20:11] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:20:11] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:20:13] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 3 ms to minimize.
[2025-06-02 05:20:13] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:20:13] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:20:13] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 3 ms to minimize.
[2025-06-02 05:20:13] [INFO ] Deduced a trap composed of 159 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:20:13] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:20:14] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:20:14] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:20:14] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:20:14] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 3 ms to minimize.
[2025-06-02 05:20:14] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:20:16] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:20:16] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:20:16] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:20:16] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:20:16] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:20:17] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:20:17] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:20:17] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:20:17] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 3 ms to minimize.
[2025-06-02 05:20:17] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 3 ms to minimize.
[2025-06-02 05:20:17] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2025-06-02 05:20:17] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2025-06-02 05:20:18] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 3 ms to minimize.
[2025-06-02 05:20:18] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:20:18] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:20:18] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:20:19] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:20:19] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2025-06-02 05:20:19] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2025-06-02 05:20:20] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:20:20] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 2 ms to minimize.
[2025-06-02 05:20:20] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 3 ms to minimize.
[2025-06-02 05:20:20] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 3 ms to minimize.
[2025-06-02 05:20:25] [INFO ] Trap strengthening (SAT) tested/added 94/94 trap constraints in 24682 ms
[2025-06-02 05:20:25] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2025-06-02 05:20:25] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-02 05:20:25] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2025-06-02 05:20:25] [INFO ] [Real]Added 205 Read/Feed constraints in 19 ms returned sat
[2025-06-02 05:20:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 05:20:25] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-02 05:20:25] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2025-06-02 05:20:25] [INFO ] [Nat]Added 205 Read/Feed constraints in 21 ms returned sat
[2025-06-02 05:20:25] [INFO ] Computed and/alt/rep : 703/1759/703 causal constraints (skipped 60 transitions) in 42 ms.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 3 ms to minimize.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:20:28] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 3 ms to minimize.
[2025-06-02 05:20:28] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:20:28] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 3 ms to minimize.
[2025-06-02 05:20:28] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:20:28] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 3 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 3 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 1 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:20:30] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2025-06-02 05:20:30] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:20:30] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2025-06-02 05:20:30] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:20:30] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 3 ms to minimize.
[2025-06-02 05:20:30] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3771 ms
[2025-06-02 05:20:31] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2025-06-02 05:20:31] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2025-06-02 05:20:31] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2025-06-02 05:20:32] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 1 ms to minimize.
[2025-06-02 05:20:32] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:20:32] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2025-06-02 05:20:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1077 ms
[2025-06-02 05:20:32] [INFO ] Added : 208 causal constraints over 43 iterations in 6959 ms. Result :sat
Minimization took 267 ms.
[2025-06-02 05:20:33] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 05:20:33] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2025-06-02 05:20:33] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2025-06-02 05:20:33] [INFO ] [Real]Added 205 Read/Feed constraints in 17 ms returned sat
[2025-06-02 05:20:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2025-06-02 05:20:33] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2025-06-02 05:20:33] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2025-06-02 05:20:33] [INFO ] [Nat]Added 205 Read/Feed constraints in 16 ms returned sat
[2025-06-02 05:20:33] [INFO ] Computed and/alt/rep : 703/1759/703 causal constraints (skipped 60 transitions) in 45 ms.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 128 places in 146 ms of which 3 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 3 ms to minimize.
[2025-06-02 05:20:36] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:20:36] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 3 ms to minimize.
[2025-06-02 05:20:36] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 3 ms to minimize.
[2025-06-02 05:20:36] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:20:36] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:20:37] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:20:37] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 3 ms to minimize.
[2025-06-02 05:20:37] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:20:37] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:20:37] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2025-06-02 05:20:37] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2980 ms
[2025-06-02 05:20:38] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:20:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2025-06-02 05:20:38] [INFO ] Added : 200 causal constraints over 41 iterations in 5138 ms. Result :sat
Minimization took 253 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 1, 0, 0] Max Struct:[180, 6, 1, 1]
FORMULA Peterson-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 1, 0] Max Struct:[180, 6, 1]
Support contains 187 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 889/889 transitions.
Applied a total of 0 rules in 25 ms. Remains 481 /481 variables (removed 0) and now considering 889/889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 481/481 places, 889/889 transitions.
[2025-06-02 05:20:39] [INFO ] Flow matrix only has 769 transitions (discarded 120 similar events)
[2025-06-02 05:20:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 1, 0] Max Struct:[180, 6, 1]
RANDOM walk for 1000000 steps (2 resets) in 2949 ms. (338 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 3444 ms. (870 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 1, 0] Max Struct:[180, 6, 1]
[2025-06-02 05:20:45] [INFO ] Flow matrix only has 769 transitions (discarded 120 similar events)
[2025-06-02 05:20:45] [INFO ] Invariant cache hit.
[2025-06-02 05:20:45] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned unsat
[2025-06-02 05:20:46] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 05:20:46] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-02 05:20:46] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2025-06-02 05:20:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-02 05:20:46] [INFO ] [Real]Added 205 Read/Feed constraints in 18 ms returned sat
[2025-06-02 05:20:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 05:20:46] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-02 05:20:46] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2025-06-02 05:20:46] [INFO ] [Nat]Added 205 Read/Feed constraints in 69 ms returned sat
[2025-06-02 05:20:46] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 3 ms to minimize.
[2025-06-02 05:20:46] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 3 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 2 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 3 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 3 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 3 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 1 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 3 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 3 ms to minimize.
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 3 ms to minimize.
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 3 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 3 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 2 ms to minimize.
[2025-06-02 05:20:52] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2025-06-02 05:20:52] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:20:53] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:20:53] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:20:54] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:20:54] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:20:54] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:20:54] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2025-06-02 05:20:54] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 2 ms to minimize.
[2025-06-02 05:20:54] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 3 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 3 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2025-06-02 05:20:57] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:20:58] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 3 ms to minimize.
[2025-06-02 05:20:59] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:20:59] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 3 ms to minimize.
[2025-06-02 05:20:59] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2025-06-02 05:20:59] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:20:59] [INFO ] Deduced a trap composed of 159 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:20:59] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 3 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 3 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 3 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:21:01] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:21:01] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:21:01] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 3 ms to minimize.
[2025-06-02 05:21:01] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 3 ms to minimize.
[2025-06-02 05:21:01] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 3 ms to minimize.
[2025-06-02 05:21:02] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 4 ms to minimize.
[2025-06-02 05:21:02] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:21:02] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 3 ms to minimize.
[2025-06-02 05:21:02] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:21:02] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 3 ms to minimize.
[2025-06-02 05:21:03] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 3 ms to minimize.
[2025-06-02 05:21:03] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:21:03] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 6 ms to minimize.
[2025-06-02 05:21:03] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:21:03] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:21:03] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:21:04] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:21:04] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2025-06-02 05:21:04] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:21:04] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
[2025-06-02 05:21:04] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 3 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:21:11] [INFO ] Trap strengthening (SAT) tested/added 94/94 trap constraints in 24642 ms
[2025-06-02 05:21:11] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2025-06-02 05:21:11] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:11] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2025-06-02 05:21:11] [INFO ] [Real]Added 205 Read/Feed constraints in 19 ms returned sat
[2025-06-02 05:21:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-02 05:21:11] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:11] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2025-06-02 05:21:11] [INFO ] [Nat]Added 205 Read/Feed constraints in 21 ms returned sat
[2025-06-02 05:21:11] [INFO ] Computed and/alt/rep : 703/1759/703 causal constraints (skipped 60 transitions) in 39 ms.
[2025-06-02 05:21:13] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
[2025-06-02 05:21:13] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2025-06-02 05:21:13] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 3 ms to minimize.
[2025-06-02 05:21:13] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:21:14] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 3 ms to minimize.
[2025-06-02 05:21:14] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 3 ms to minimize.
[2025-06-02 05:21:14] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
[2025-06-02 05:21:14] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:21:14] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 3 ms to minimize.
[2025-06-02 05:21:15] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 3 ms to minimize.
[2025-06-02 05:21:15] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:21:15] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 2 ms to minimize.
[2025-06-02 05:21:15] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:21:15] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:21:16] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2025-06-02 05:21:16] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2025-06-02 05:21:16] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2025-06-02 05:21:16] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:21:16] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 3 ms to minimize.
[2025-06-02 05:21:16] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3806 ms
[2025-06-02 05:21:17] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 2 ms to minimize.
[2025-06-02 05:21:17] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:21:17] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1106 ms
[2025-06-02 05:21:18] [INFO ] Added : 208 causal constraints over 43 iterations in 7050 ms. Result :sat
Minimization took 264 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 1, 0] Max Struct:[6, 6, 1]
FORMULA Peterson-PT-5-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[6, 1]
Support contains 7 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 889/889 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 481 transition count 834
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 426 transition count 834
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 110 place count 426 transition count 710
Deduced a syphon composed of 124 places in 1 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 358 place count 302 transition count 710
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 418 place count 272 transition count 680
Applied a total of 418 rules in 47 ms. Remains 272 /481 variables (removed 209) and now considering 680/889 (removed 209) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 272/481 places, 680/889 transitions.
[2025-06-02 05:21:19] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 272 cols
[2025-06-02 05:21:19] [INFO ] Computed 23 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[6, 1]
RANDOM walk for 1000000 steps (2 resets) in 1436 ms. (695 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 916 ms. (2181 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0] Max Struct:[6, 1]
[2025-06-02 05:21:21] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2025-06-02 05:21:21] [INFO ] Invariant cache hit.
[2025-06-02 05:21:21] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 05:21:21] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:21] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2025-06-02 05:21:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-02 05:21:21] [INFO ] [Real]Added 205 Read/Feed constraints in 17 ms returned sat
[2025-06-02 05:21:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 05:21:21] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-02 05:21:21] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-06-02 05:21:21] [INFO ] [Nat]Added 205 Read/Feed constraints in 33 ms returned sat
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:21:27] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:27] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:21:28] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:21:28] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2025-06-02 05:21:28] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2025-06-02 05:21:28] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:21:28] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:21:28] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:21:28] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:21:28] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:21:31] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2025-06-02 05:21:31] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:21:31] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:21:31] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:21:31] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 2 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:21:35] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:21:35] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:21:37] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:21:38] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:38] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:21:38] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:21:39] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:21:39] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:21:39] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:21:39] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:21:39] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:21:39] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2025-06-02 05:21:39] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:21:39] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:21:39] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:21:40] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:21:40] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:21:40] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:21:40] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:21:40] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:21:40] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2025-06-02 05:21:40] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:21:40] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:21:43] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:21:43] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:21:43] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2025-06-02 05:21:43] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:21:43] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Trap strengthening (SAT) tested/added 113/113 trap constraints in 26348 ms
[2025-06-02 05:21:48] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Real]Added 205 Read/Feed constraints in 15 ms returned sat
[2025-06-02 05:21:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Nat]Added 205 Read/Feed constraints in 14 ms returned sat
[2025-06-02 05:21:48] [INFO ] Computed and/alt/rep : 494/1550/494 causal constraints (skipped 60 transitions) in 28 ms.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 577 ms
[2025-06-02 05:21:49] [INFO ] Added : 66 causal constraints over 14 iterations in 1079 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0] Max Struct:[6, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[6, 1]
Support contains 7 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 680/680 transitions.
Applied a total of 0 rules in 14 ms. Remains 272 /272 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 272/272 places, 680/680 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 680/680 transitions.
Applied a total of 0 rules in 12 ms. Remains 272 /272 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2025-06-02 05:21:50] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2025-06-02 05:21:50] [INFO ] Invariant cache hit.
[2025-06-02 05:21:50] [INFO ] Implicit Places using invariants in 177 ms returned [231, 243, 244, 245, 246, 247]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 180 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 266/272 places, 680/680 transitions.
Applied a total of 0 rules in 13 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 210 ms. Remains : 266/272 places, 680/680 transitions.
[2025-06-02 05:21:50] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2025-06-02 05:21:50] [INFO ] Computed 17 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[6, 1]
RANDOM walk for 1000000 steps (2 resets) in 1437 ms. (695 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 914 ms. (2185 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0] Max Struct:[6, 1]
[2025-06-02 05:21:52] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2025-06-02 05:21:52] [INFO ] Invariant cache hit.
[2025-06-02 05:21:52] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2025-06-02 05:21:52] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2025-06-02 05:21:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-02 05:21:52] [INFO ] [Real]Added 205 Read/Feed constraints in 19 ms returned sat
[2025-06-02 05:21:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 05:21:52] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-06-02 05:21:53] [INFO ] [Nat]Added 205 Read/Feed constraints in 30 ms returned sat
[2025-06-02 05:21:53] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2025-06-02 05:21:53] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2025-06-02 05:21:53] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2025-06-02 05:21:53] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:53] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:53] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:21:53] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:21:53] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:21:53] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:21:54] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2025-06-02 05:21:54] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:21:54] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2025-06-02 05:21:54] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:21:54] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:21:54] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:21:54] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:21:54] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2025-06-02 05:21:54] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:21:58] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2025-06-02 05:21:58] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:22:00] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:22:00] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:22:00] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 111 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:22:10] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:22:11] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:22:11] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:22:11] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:22:13] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:22:14] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2025-06-02 05:22:14] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2025-06-02 05:22:14] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:22:15] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:22:15] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:22:16] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 0 ms to minimize.
[2025-06-02 05:22:16] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:22:16] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:22:17] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:22:17] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:22:17] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:22:19] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2025-06-02 05:22:23] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:22:24] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:22:24] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:22:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 119 trap constraints in 32946 ms
[2025-06-02 05:22:26] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 05:22:26] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-06-02 05:22:26] [INFO ] [Real]Added 205 Read/Feed constraints in 15 ms returned sat
[2025-06-02 05:22:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 05:22:26] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2025-06-02 05:22:26] [INFO ] [Nat]Added 205 Read/Feed constraints in 17 ms returned sat
[2025-06-02 05:22:26] [INFO ] Computed and/alt/rep : 494/1550/494 causal constraints (skipped 60 transitions) in 27 ms.
[2025-06-02 05:22:26] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2025-06-02 05:22:26] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1177 ms
[2025-06-02 05:22:28] [INFO ] Added : 83 causal constraints over 17 iterations in 1708 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA Peterson-PT-5-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 266 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place BeginLoop_3_4_5) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 679/679 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 265 transition count 677
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 1 place count 265 transition count 671
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 13 place count 259 transition count 671
Applied a total of 13 rules in 22 ms. Remains 259 /266 variables (removed 7) and now considering 671/679 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 259/266 places, 671/679 transitions.
[2025-06-02 05:22:28] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2025-06-02 05:22:28] [INFO ] Computed 17 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1321 ms. (756 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 433 ms. (2304 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 05:22:30] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:22:30] [INFO ] Invariant cache hit.
[2025-06-02 05:22:30] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 05:22:30] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2025-06-02 05:22:30] [INFO ] State equation strengthened by 204 read => feed constraints.
[2025-06-02 05:22:30] [INFO ] [Real]Added 204 Read/Feed constraints in 17 ms returned sat
[2025-06-02 05:22:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 05:22:30] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-06-02 05:22:30] [INFO ] [Nat]Added 204 Read/Feed constraints in 15 ms returned sat
[2025-06-02 05:22:30] [INFO ] Computed and/alt/rep : 485/1539/485 causal constraints (skipped 60 transitions) in 27 ms.
[2025-06-02 05:22:30] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2025-06-02 05:22:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2025-06-02 05:22:30] [INFO ] Added : 58 causal constraints over 12 iterations in 527 ms. Result :sat
Minimization took 97 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 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 14 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 259/259 places, 671/671 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 13 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2025-06-02 05:22:31] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:22:31] [INFO ] Invariant cache hit.
[2025-06-02 05:22:31] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-02 05:22:31] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:22:31] [INFO ] Invariant cache hit.
[2025-06-02 05:22:31] [INFO ] State equation strengthened by 204 read => feed constraints.
[2025-06-02 05:22:31] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2025-06-02 05:22:31] [INFO ] Redundant transitions in 36 ms returned []
Running 665 sub problems to find dead transitions.
[2025-06-02 05:22:31] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:22:31] [INFO ] Invariant cache hit.
[2025-06-02 05:22:31] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:22:35] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:22:35] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:22:35] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:22:35] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:22:35] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:22:35] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2025-06-02 05:22:35] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:22:35] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:22:35] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:22:35] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:22:35] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:22:36] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:22:36] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:22:36] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:22:36] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:22:36] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:22:36] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:22:36] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:22:36] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:22:36] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:22:36] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:22:36] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:22:38] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:22:38] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:22:38] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2025-06-02 05:22:38] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:22:38] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:22:41] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:22:41] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:22:41] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:22:41] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:22:41] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:22:41] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:22:41] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 0 ms to minimize.
[2025-06-02 05:22:41] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:22:42] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:22:42] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2025-06-02 05:22:42] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2025-06-02 05:22:42] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2025-06-02 05:22:42] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:22:42] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:22:42] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:22:42] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:22:42] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:22:42] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2025-06-02 05:22:42] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:22:42] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:22:43] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2025-06-02 05:22:43] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:22:43] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:22:43] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2025-06-02 05:22:43] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:22:44] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2025-06-02 05:22:44] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:22:44] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:22:44] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2025-06-02 05:22:44] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:22:44] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:22:44] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:22:45] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:22:45] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2025-06-02 05:22:45] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:22:45] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:22:45] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:22:45] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2025-06-02 05:22:45] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:22:45] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:22:47] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2025-06-02 05:22:47] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2025-06-02 05:22:47] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2025-06-02 05:22:47] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:22:47] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:22:47] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:22:47] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:22:48] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:22:48] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:22:48] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:22:48] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2025-06-02 05:22:48] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:22:48] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:22:48] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:22:48] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2025-06-02 05:22:48] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:22:49] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:22:49] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:22:49] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:22:49] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:22:53] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2025-06-02 05:22:53] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:22:53] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:22:53] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:22:53] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:22:54] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2025-06-02 05:22:54] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2025-06-02 05:22:55] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:22:55] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:22:55] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:22:55] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:22:55] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:22:55] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:22:55] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:22:55] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:22:56] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:22:56] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:22:56] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:22:57] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
[2025-06-02 05:22:57] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:22:59] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:22:59] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:23:00] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:23:00] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:23:00] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:23:00] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:23:01] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2025-06-02 05:23:02] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:23:02] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
SMT process timed out in 30241ms, After SMT, problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 30256ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31071 ms. Remains : 259/259 places, 671/671 transitions.
RANDOM walk for 40000 steps (8 resets) in 681 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
[2025-06-02 05:23:02] [INFO ] Flatten gal took : 126 ms
[2025-06-02 05:23:02] [INFO ] Flatten gal took : 57 ms
[2025-06-02 05:23:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8401455632391144136.gal : 16 ms
[2025-06-02 05:23:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3351971117186965668.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/ReachabilityCardinality8401455632391144136.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3351971117186965668.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/ReachabilityCardinality3351971117186965668.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :17 after 29
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :29 after 87
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :87 after 187
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :187 after 342
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :342 after 692
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :692 after 3688
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3688 after 8243
Interrupted probabilistic random walk after 967918 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :0 out of 2
Probabilistic random walk after 967918 steps, saw 141022 distinct states, run finished after 3009 ms. (steps per millisecond=321 ) properties seen :0
[2025-06-02 05:23:05] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:23:05] [INFO ] Invariant cache hit.
[2025-06-02 05:23:05] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 37/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 91/130 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 194/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 739 constraints, problems are : Problem set: 0 solved, 2 unsolved in 317 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 259/259 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 37/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 91/130 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 155/285 variables, 30/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 30/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/285 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
At refinement iteration 16 (OVERLAPS) 275/560 variables, 50/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 50/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :8243 after 35144
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 194/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/560 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 135/695 variables, 5/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 135/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:23:06] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2025-06-02 05:23:06] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2025-06-02 05:23:06] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2025-06-02 05:23:06] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:23:06] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 5/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/695 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 5/700 variables, 5/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 5/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 746 constraints, problems are : Problem set: 0 solved, 2 unsolved in 873 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 259/259 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 1201ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 11 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 259/259 places, 671/671 transitions.
RANDOM walk for 40000 steps (8 resets) in 247 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :35144 after 92771
Interrupted probabilistic random walk after 885815 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :0 out of 2
Probabilistic random walk after 885815 steps, saw 128158 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :0
[2025-06-02 05:23:09] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:23:09] [INFO ] Invariant cache hit.
[2025-06-02 05:23:09] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 37/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 91/130 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 194/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 739 constraints, problems are : Problem set: 0 solved, 2 unsolved in 325 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 259/259 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 37/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 91/130 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 155/285 variables, 30/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 30/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/285 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 275/560 variables, 50/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 50/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 194/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/560 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 135/695 variables, 5/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 135/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:23:10] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2025-06-02 05:23:10] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2025-06-02 05:23:10] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2025-06-02 05:23:10] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2025-06-02 05:23:10] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 5/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/695 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 5/700 variables, 5/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 5/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 746 constraints, problems are : Problem set: 0 solved, 2 unsolved in 891 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 259/259 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 1224ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 10 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 259/259 places, 671/671 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2025-06-02 05:23:11] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:23:11] [INFO ] Invariant cache hit.
[2025-06-02 05:23:11] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-06-02 05:23:11] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:23:11] [INFO ] Invariant cache hit.
[2025-06-02 05:23:11] [INFO ] State equation strengthened by 204 read => feed constraints.
[2025-06-02 05:23:11] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
[2025-06-02 05:23:11] [INFO ] Redundant transitions in 5 ms returned []
Running 665 sub problems to find dead transitions.
[2025-06-02 05:23:11] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:23:11] [INFO ] Invariant cache hit.
[2025-06-02 05:23:11] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:23:15] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:23:15] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:23:15] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:23:15] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:23:15] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2025-06-02 05:23:15] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:23:15] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :92771 after 193656
[2025-06-02 05:23:15] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:23:15] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:23:15] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:23:15] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:23:15] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:23:15] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:23:16] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:23:16] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:23:16] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:23:16] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:23:16] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:23:16] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:23:16] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:23:16] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:23:16] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:23:16] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:23:16] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:23:16] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:23:18] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:23:18] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:23:18] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:23:23] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:23:23] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:23:23] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2025-06-02 05:23:23] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2025-06-02 05:23:23] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:23:25] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:23:25] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:23:25] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:23:25] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:23:25] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2025-06-02 05:23:25] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:23:25] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:23:29] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:23:29] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:23:29] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:23:32] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2025-06-02 05:23:33] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:23:33] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:23:33] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:23:33] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:23:34] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2025-06-02 05:23:34] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :193656 after 424082
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:23:36] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:23:36] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:23:36] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:23:37] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:23:38] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:23:39] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:23:40] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:23:40] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:23:40] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:23:40] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:23:40] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:23:41] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:23:42] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:23:42] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
SMT process timed out in 30203ms, After SMT, problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 30210ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30960 ms. Remains : 259/259 places, 671/671 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 508 edges and 259 vertex of which 179 / 259 are part of one of the 30 SCC in 2 ms
Free SCC test removed 149 places
Drop transitions (Empty/Sink Transition effects.) removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 195
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 195
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 79 place count 68 transition count 193
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 0 with 12 rules applied. Total rules applied 91 place count 62 transition count 187
Graph (trivial) has 31 edges and 62 vertex of which 30 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 97 place count 33 transition count 187
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (complete) has 162 edges and 33 vertex of which 9 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 100 output transitions
Drop transitions (Output transitions of discarded places.) removed 100 transitions
Graph (trivial) has 46 edges and 9 vertex of which 5 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 0 with 32 rules applied. Total rules applied 129 place count 5 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 181 place count 5 transition count 5
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 184 place count 3 transition count 4
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 186 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 186 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 2 transition count 1
Applied a total of 188 rules in 23 ms. Remains 2 /259 variables (removed 257) and now considering 1/671 (removed 670) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1 rows 2 cols
[2025-06-02 05:23:42] [INFO ] Computed 1 invariants in 0 ms
[2025-06-02 05:23:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:23:42] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 05:23:42] [INFO ] After 10ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2025-06-02 05:23:42] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2025-06-02 05:23:42] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:23:42] [INFO ] Flatten gal took : 0 ms
[2025-06-02 05:23:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8403050565554244068.gal : 1 ms
[2025-06-02 05:23:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9880233551829591409.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/ReachabilityCardinality8403050565554244068.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9880233551829591409.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/ReachabilityCardinality9880233551829591409.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.002248,3816,2,4,5,11,8,0,9,6,0
Total reachable state count : 2

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.002484,3816,2,3,6,11,8,0,11,6,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.002854,3816,2,3,6,11,8,0,11,6,0
Over-approximation ignoring read arcs solved 0 properties in 60 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:23:42] [INFO ] Flatten gal took : 36 ms
[2025-06-02 05:23:42] [INFO ] Applying decomposition
[2025-06-02 05:23:42] [INFO ] Flatten gal took : 31 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/graph18202577271854799121.txt' '-o' '/tmp/graph18202577271854799121.bin' '-w' '/tmp/graph18202577271854799121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18202577271854799121.bin' '-l' '-1' '-v' '-w' '/tmp/graph18202577271854799121.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:23:42] [INFO ] Decomposing Gal with order
[2025-06-02 05:23:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:23:42] [INFO ] Removed a total of 910 redundant transitions.
[2025-06-02 05:23:42] [INFO ] Flatten gal took : 100 ms
[2025-06-02 05:23:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 21 ms.
[2025-06-02 05:23:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5225789591476002687.gal : 11 ms
[2025-06-02 05:23:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2610204759643599769.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/ReachabilityCardinality5225789591476002687.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2610204759643599769.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/ReachabilityCardinality2610204759643599769.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :982108 after 982132
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for Peterson-PT-5-UpperBounds-10
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[1]
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]
[2025-06-02 05:24:32] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2025-06-02 05:24:32] [INFO ] Computed 17 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 05:24:32] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:24:32] [INFO ] Invariant cache hit.
[2025-06-02 05:24:32] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 05:24:32] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2025-06-02 05:24:32] [INFO ] State equation strengthened by 204 read => feed constraints.
[2025-06-02 05:24:32] [INFO ] [Real]Added 204 Read/Feed constraints in 15 ms returned sat
[2025-06-02 05:24:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:24:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 05:24:33] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-06-02 05:24:33] [INFO ] [Nat]Added 204 Read/Feed constraints in 15 ms returned sat
[2025-06-02 05:24:33] [INFO ] Computed and/alt/rep : 485/1539/485 causal constraints (skipped 60 transitions) in 28 ms.
[2025-06-02 05:24:33] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2025-06-02 05:24:33] [INFO ] Added : 58 causal constraints over 12 iterations in 560 ms. Result :sat
Minimization took 101 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 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 20 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 259/259 places, 671/671 transitions.
[2025-06-02 05:24:33] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:24:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1405 ms. (711 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 439 ms. (2272 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 05:24:35] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:24:35] [INFO ] Invariant cache hit.
[2025-06-02 05:24:35] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 05:24:35] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-06-02 05:24:35] [INFO ] State equation strengthened by 204 read => feed constraints.
[2025-06-02 05:24:35] [INFO ] [Real]Added 204 Read/Feed constraints in 16 ms returned sat
[2025-06-02 05:24:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:24:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 05:24:36] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-06-02 05:24:36] [INFO ] [Nat]Added 204 Read/Feed constraints in 17 ms returned sat
[2025-06-02 05:24:36] [INFO ] Computed and/alt/rep : 485/1539/485 causal constraints (skipped 60 transitions) in 28 ms.
[2025-06-02 05:24:36] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2025-06-02 05:24:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2025-06-02 05:24:36] [INFO ] Added : 58 causal constraints over 12 iterations in 563 ms. Result :sat
Minimization took 101 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 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 259/259 places, 671/671 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 10 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2025-06-02 05:24:36] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:24:36] [INFO ] Invariant cache hit.
[2025-06-02 05:24:37] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-02 05:24:37] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:24:37] [INFO ] Invariant cache hit.
[2025-06-02 05:24:37] [INFO ] State equation strengthened by 204 read => feed constraints.
[2025-06-02 05:24:37] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2025-06-02 05:24:37] [INFO ] Redundant transitions in 8 ms returned []
Running 665 sub problems to find dead transitions.
[2025-06-02 05:24:37] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2025-06-02 05:24:37] [INFO ] Invariant cache hit.
[2025-06-02 05:24:37] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:24:40] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:24:40] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:24:40] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:24:46] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:24:46] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:24:47] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:24:47] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:24:47] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:24:47] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:24:47] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:24:47] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:24:47] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:24:47] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:24:47] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:24:49] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:24:49] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:24:49] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2025-06-02 05:24:49] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2025-06-02 05:24:49] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2025-06-02 05:24:49] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 4 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:24:51] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:24:51] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:24:51] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2025-06-02 05:24:51] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:24:51] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:24:52] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:24:52] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2025-06-02 05:24:52] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2025-06-02 05:24:55] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:24:55] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:24:58] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2025-06-02 05:24:58] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2025-06-02 05:24:58] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2025-06-02 05:24:58] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:24:59] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:25:00] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2025-06-02 05:25:00] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2025-06-02 05:25:00] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:25:02] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:25:02] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:25:02] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:25:03] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:25:04] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:25:05] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:25:06] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:25:06] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:25:06] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:25:06] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:25:06] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 258/810 variables, and 401 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30030 ms.
Refiners :[Domain max(s): 258/259 constraints, Positive P Invariants (semi-flows): 16/17 constraints, State Equation: 0/259 constraints, ReadFeed: 0/204 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 127/127 constraints]
Escalating to Integer solving :Problem set: 0 solved, 665 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 127/401 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:25:10] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:25:10] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2025-06-02 05:25:10] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:25:11] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:25:12] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:25:12] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:25:13] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 7/408 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 5 (OVERLAPS) 1/259 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 20/430 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-06-02 05:25:22] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:25:22] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:25:22] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:25:23] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2025-06-02 05:25:23] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2025-06-02 05:25:23] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:25:23] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:25:23] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2025-06-02 05:25:23] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2025-06-02 05:25:23] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:25:24] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:25:24] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:25:24] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:25:24] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:25:24] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:25:25] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:25:25] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:25:25] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2025-06-02 05:25:25] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:25:25] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
Problem TDEAD331 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 20/450 constraints. Problems are: Problem set: 1 solved, 664 unsolved
[2025-06-02 05:25:28] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:25:28] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:25:28] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2025-06-02 05:25:28] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:25:29] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2025-06-02 05:25:30] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 0 ms to minimize.
[2025-06-02 05:25:30] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:25:30] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:25:31] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:25:31] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2025-06-02 05:25:31] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:25:31] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:25:32] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:25:32] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:25:32] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2025-06-02 05:25:33] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:25:34] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:25:34] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:25:34] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:25:35] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 20/470 constraints. Problems are: Problem set: 1 solved, 664 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/810 variables, and 470 constraints, problems are : Problem set: 1 solved, 664 unsolved in 30020 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/259 constraints, ReadFeed: 0/204 constraints, PredecessorRefiner: 0/665 constraints, Known Traps: 194/194 constraints]
After SMT, in 60193ms problems are : Problem set: 1 solved, 664 unsolved
Search for dead transitions found 1 dead transitions in 60199ms
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 : 259/259 places, 670/671 transitions.
Applied a total of 0 rules in 17 ms. Remains 259 /259 variables (removed 0) and now considering 670/670 (removed 0) transitions.
[2025-06-02 05:25:37] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61003 ms. Remains : 259/259 places, 670/671 transitions.
[2025-06-02 05:25:37] [INFO ] Flow matrix only has 550 transitions (discarded 120 similar events)
// Phase 1: matrix 550 rows 259 cols
[2025-06-02 05:25:37] [INFO ] Computed 17 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1327 ms. (753 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 437 ms. (2283 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 05:25:39] [INFO ] Flow matrix only has 550 transitions (discarded 120 similar events)
[2025-06-02 05:25:39] [INFO ] Invariant cache hit.
[2025-06-02 05:25:39] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 05:25:39] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-06-02 05:25:39] [INFO ] State equation strengthened by 203 read => feed constraints.
[2025-06-02 05:25:39] [INFO ] [Real]Added 203 Read/Feed constraints in 17 ms returned sat
[2025-06-02 05:25:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:25:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 05:25:39] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-06-02 05:25:39] [INFO ] [Nat]Added 203 Read/Feed constraints in 15 ms returned sat
[2025-06-02 05:25:40] [INFO ] Computed and/alt/rep : 484/1532/484 causal constraints (skipped 60 transitions) in 27 ms.
[2025-06-02 05:25:40] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2025-06-02 05:25:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2025-06-02 05:25:40] [INFO ] Added : 59 causal constraints over 12 iterations in 558 ms. Result :sat
Minimization took 100 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 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 670/670 transitions.
Applied a total of 0 rules in 7 ms. Remains 259 /259 variables (removed 0) and now considering 670/670 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 259/259 places, 670/670 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 670/670 transitions.
Applied a total of 0 rules in 7 ms. Remains 259 /259 variables (removed 0) and now considering 670/670 (removed 0) transitions.
[2025-06-02 05:25:40] [INFO ] Flow matrix only has 550 transitions (discarded 120 similar events)
[2025-06-02 05:25:40] [INFO ] Invariant cache hit.
[2025-06-02 05:25:40] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-02 05:25:40] [INFO ] Flow matrix only has 550 transitions (discarded 120 similar events)
[2025-06-02 05:25:40] [INFO ] Invariant cache hit.
[2025-06-02 05:25:41] [INFO ] State equation strengthened by 203 read => feed constraints.
[2025-06-02 05:25:41] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2025-06-02 05:25:41] [INFO ] Redundant transitions in 6 ms returned []
Running 664 sub problems to find dead transitions.
[2025-06-02 05:25:41] [INFO ] Flow matrix only has 550 transitions (discarded 120 similar events)
[2025-06-02 05:25:41] [INFO ] Invariant cache hit.
[2025-06-02 05:25:41] [INFO ] State equation strengthened by 203 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:25:44] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:25:44] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:25:44] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:25:44] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2025-06-02 05:25:44] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:25:44] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 0 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 2 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:25:55] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2025-06-02 05:25:55] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:25:55] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2025-06-02 05:25:55] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2025-06-02 05:25:56] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2025-06-02 05:25:56] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2025-06-02 05:25:56] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:25:56] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2025-06-02 05:25:56] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:25:56] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:25:56] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:25:58] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:26:02] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:26:02] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 0 ms to minimize.
[2025-06-02 05:26:03] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:26:03] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 0 ms to minimize.
[2025-06-02 05:26:03] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2025-06-02 05:26:03] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:26:03] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:26:03] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:26:03] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:26:03] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:26:04] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:26:04] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2025-06-02 05:26:04] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 3 ms to minimize.
[2025-06-02 05:26:04] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:26:04] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:26:05] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:26:05] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:26:06] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:26:06] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:26:06] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:26:06] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:26:07] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 3 ms to minimize.
[2025-06-02 05:26:08] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:26:09] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:26:10] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 5/399 constraints. Problems are: Problem set: 0 solved, 664 unsolved
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 Real declared 258/809 variables, and 399 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30018 ms.
Refiners :[Domain max(s): 258/259 constraints, Positive P Invariants (semi-flows): 16/17 constraints, State Equation: 0/259 constraints, ReadFeed: 0/203 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 125/125 constraints]
Escalating to Integer solving :Problem set: 0 solved, 664 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 125/399 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:26:13] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:26:13] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 0 ms to minimize.
[2025-06-02 05:26:14] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:26:14] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:26:18] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 6 (OVERLAPS) 1/259 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 20/426 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:26:30] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2025-06-02 05:26:31] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:26:31] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:26:31] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:26:31] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:26:31] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:26:31] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:26:31] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2025-06-02 05:26:33] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:26:33] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:26:33] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 20/446 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:26:36] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:26:36] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:26:36] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:26:37] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2025-06-02 05:26:38] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:26:39] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:26:39] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:26:39] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:26:40] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:26:40] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:26:40] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2025-06-02 05:26:40] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/809 variables, and 462 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30013 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/259 constraints, ReadFeed: 0/203 constraints, PredecessorRefiner: 0/664 constraints, Known Traps: 186/186 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 664 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60986 ms. Remains : 259/259 places, 670/670 transitions.
[2025-06-02 05:26:41] [INFO ] Flatten gal took : 29 ms
RANDOM walk for 40000 steps (8 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
[2025-06-02 05:26:41] [INFO ] Flatten gal took : 40 ms
[2025-06-02 05:26:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7536884158463959899.gal : 9 ms
[2025-06-02 05:26:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3317734229168320792.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/ReachabilityCardinality7536884158463959899.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3317734229168320792.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 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 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3317734229168320792.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 40
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :40 after 143
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :143 after 304
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :304 after 560
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :560 after 3090
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3090 after 7939
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7939 after 12488
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :12488 after 105569
Interrupted probabilistic random walk after 912541 steps, run timeout after 3007 ms. (steps per millisecond=303 ) properties seen :0 out of 2
Probabilistic random walk after 912541 steps, saw 132458 distinct states, run finished after 3007 ms. (steps per millisecond=303 ) properties seen :0
[2025-06-02 05:26:44] [INFO ] Flow matrix only has 550 transitions (discarded 120 similar events)
[2025-06-02 05:26:44] [INFO ] Invariant cache hit.
[2025-06-02 05:26:44] [INFO ] State equation strengthened by 203 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 37/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 90/129 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 155/284 variables, 30/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 30/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 275/559 variables, 50/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/559 variables, 50/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/559 variables, 194/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/559 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 135/694 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/694 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/694 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 5/699 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/699 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/699 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 110/809 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/809 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/809 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 809/809 variables, and 738 constraints, problems are : Problem set: 0 solved, 2 unsolved in 305 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 259/259 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 37/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 90/129 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 155/284 variables, 30/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 30/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 5/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 275/559 variables, 50/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/559 variables, 50/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/559 variables, 194/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/559 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 135/694 variables, 5/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/694 variables, 135/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:26:45] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2025-06-02 05:26:45] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2025-06-02 05:26:45] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:26:45] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:26:45] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/694 variables, 5/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/694 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 5/699 variables, 5/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/699 variables, 5/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/699 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 110/809 variables, 140/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/809 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/809 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 809/809 variables, and 745 constraints, problems are : Problem set: 0 solved, 2 unsolved in 903 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 259/259 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 1226ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 670/670 transitions.
Applied a total of 0 rules in 27 ms. Remains 259 /259 variables (removed 0) and now considering 670/670 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 259/259 places, 670/670 transitions.
RANDOM walk for 40000 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :105569 after 241150
Interrupted probabilistic random walk after 915887 steps, run timeout after 3003 ms. (steps per millisecond=304 ) properties seen :0 out of 2
Probabilistic random walk after 915887 steps, saw 132828 distinct states, run finished after 3003 ms. (steps per millisecond=304 ) properties seen :0
[2025-06-02 05:26:49] [INFO ] Flow matrix only has 550 transitions (discarded 120 similar events)
[2025-06-02 05:26:49] [INFO ] Invariant cache hit.
[2025-06-02 05:26:49] [INFO ] State equation strengthened by 203 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 37/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 90/129 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 155/284 variables, 30/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 30/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 275/559 variables, 50/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/559 variables, 50/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/559 variables, 194/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/559 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 135/694 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/694 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/694 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 5/699 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/699 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/699 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 110/809 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/809 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/809 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 809/809 variables, and 738 constraints, problems are : Problem set: 0 solved, 2 unsolved in 289 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 259/259 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 37/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 90/129 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 155/284 variables, 30/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 30/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 5/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 275/559 variables, 50/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/559 variables, 50/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/559 variables, 194/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/559 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 135/694 variables, 5/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/694 variables, 135/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:26:49] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2025-06-02 05:26:49] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2025-06-02 05:26:49] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:26:50] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:26:50] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/694 variables, 5/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/694 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 5/699 variables, 5/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/699 variables, 5/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/699 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 110/809 variables, 140/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/809 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/809 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 809/809 variables, and 745 constraints, problems are : Problem set: 0 solved, 2 unsolved in 853 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 259/259 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 1151ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 670/670 transitions.
Applied a total of 0 rules in 8 ms. Remains 259 /259 variables (removed 0) and now considering 670/670 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 259/259 places, 670/670 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 670/670 transitions.
Applied a total of 0 rules in 25 ms. Remains 259 /259 variables (removed 0) and now considering 670/670 (removed 0) transitions.
[2025-06-02 05:26:50] [INFO ] Flow matrix only has 550 transitions (discarded 120 similar events)
[2025-06-02 05:26:50] [INFO ] Invariant cache hit.
[2025-06-02 05:26:50] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-02 05:26:50] [INFO ] Flow matrix only has 550 transitions (discarded 120 similar events)
[2025-06-02 05:26:50] [INFO ] Invariant cache hit.
[2025-06-02 05:26:50] [INFO ] State equation strengthened by 203 read => feed constraints.
[2025-06-02 05:26:51] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2025-06-02 05:26:51] [INFO ] Redundant transitions in 5 ms returned []
Running 664 sub problems to find dead transitions.
[2025-06-02 05:26:51] [INFO ] Flow matrix only has 550 transitions (discarded 120 similar events)
[2025-06-02 05:26:51] [INFO ] Invariant cache hit.
[2025-06-02 05:26:51] [INFO ] State equation strengthened by 203 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 2 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
SDD size :241150 after 452877
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 2 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:26:57] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:26:57] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:26:57] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2025-06-02 05:26:57] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:26:57] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:26:57] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:27:04] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:27:04] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:27:04] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:27:04] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2025-06-02 05:27:04] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:27:04] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2025-06-02 05:27:05] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:27:05] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2025-06-02 05:27:05] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:27:14] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :452877 after 4.54336e+06
[2025-06-02 05:27:14] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:27:15] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:27:15] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:27:15] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:27:15] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:27:15] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:27:16] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:27:16] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:27:18] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:27:19] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:27:20] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 5/399 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 258/809 variables, and 399 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30018 ms.
Refiners :[Domain max(s): 258/259 constraints, Positive P Invariants (semi-flows): 16/17 constraints, State Equation: 0/259 constraints, ReadFeed: 0/203 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 125/125 constraints]
Escalating to Integer solving :Problem set: 0 solved, 664 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 125/399 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:27:24] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:27:24] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:27:27] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Detected timeout of ITS tools.
[2025-06-02 05:27:31] [INFO ] Flatten gal took : 20 ms
[2025-06-02 05:27:31] [INFO ] Applying decomposition
[2025-06-02 05:27:31] [INFO ] Flatten gal took : 20 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/graph5375363778250690982.txt' '-o' '/tmp/graph5375363778250690982.bin' '-w' '/tmp/graph5375363778250690982.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5375363778250690982.bin' '-l' '-1' '-v' '-w' '/tmp/graph5375363778250690982.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:27:31] [INFO ] Decomposing Gal with order
[2025-06-02 05:27:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:27:32] [INFO ] Removed a total of 909 redundant transitions.
[2025-06-02 05:27:32] [INFO ] Flatten gal took : 91 ms
[2025-06-02 05:27:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 20 ms.
[2025-06-02 05:27:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4854343885930423622.gal : 10 ms
[2025-06-02 05:27:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4894412005494578524.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/ReachabilityCardinality4854343885930423622.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4894412005494578524.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/ReachabilityCardinality4894412005494578524.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 51727
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :51727 after 51816
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 6 (OVERLAPS) 1/259 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:27:36] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2025-06-02 05:27:36] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:27:36] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:27:36] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:27:37] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:27:37] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2025-06-02 05:27:37] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:27:37] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2025-06-02 05:27:37] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:27:37] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:27:37] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:27:37] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:27:37] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:27:37] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:27:37] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:27:38] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:27:38] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:27:38] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:27:38] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:27:38] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 20/426 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2025-06-02 05:27:41] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:27:41] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:27:41] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:27:41] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:27:41] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:27:41] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:27:42] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:27:42] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2025-06-02 05:27:42] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:27:42] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:27:42] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:27:42] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:27:43] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 20/446 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2025-06-02 05:27:45] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:27:45] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:27:46] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:27:47] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:27:48] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:27:48] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:27:48] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:27:49] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:27:49] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:27:49] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:27:50] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:27:50] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:27:50] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:27:50] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:27:50] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:27:50] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2025-06-02 05:27:51] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
SMT process timed out in 60225ms, After SMT, problems are : Problem set: 0 solved, 664 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61020 ms. Remains : 259/259 places, 670/670 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 507 edges and 259 vertex of which 179 / 259 are part of one of the 30 SCC in 1 ms
Free SCC test removed 149 places
Drop transitions (Empty/Sink Transition effects.) removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 194
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 194
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 79 place count 68 transition count 191
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 0 with 12 rules applied. Total rules applied 91 place count 62 transition count 185
Graph (trivial) has 29 edges and 62 vertex of which 25 / 62 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 97 place count 37 transition count 185
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (trivial) has 129 edges and 37 vertex of which 25 / 37 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Iterating post reduction 0 with 26 rules applied. Total rules applied 123 place count 17 transition count 160
Drop transitions (Empty/Sink Transition effects.) removed 100 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 1 with 144 rules applied. Total rules applied 267 place count 17 transition count 16
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 282 place count 7 transition count 11
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 6 edges and 7 vertex of which 5 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 287 place count 3 transition count 7
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 292 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 292 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 294 place count 2 transition count 1
Applied a total of 294 rules in 13 ms. Remains 2 /259 variables (removed 257) and now considering 1/670 (removed 669) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1 rows 2 cols
[2025-06-02 05:27:51] [INFO ] Computed 1 invariants in 0 ms
[2025-06-02 05:27:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:27:51] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 05:27:51] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2025-06-02 05:27:51] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2025-06-02 05:27:51] [INFO ] Flatten gal took : 0 ms
[2025-06-02 05:27:51] [INFO ] Flatten gal took : 0 ms
[2025-06-02 05:27:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10357429305992777910.gal : 1 ms
[2025-06-02 05:27:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16653318862498246680.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/ReachabilityCardinality10357429305992777910.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16653318862498246680.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/ReachabilityCardinality16653318862498246680.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001442,3824,2,4,5,11,8,0,9,6,0
Total reachable state count : 2

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.001568,3824,2,3,6,11,8,0,11,6,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.001713,3824,2,3,6,11,8,0,11,6,0
Over-approximation ignoring read arcs solved 0 properties in 46 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 Peterson-PT-5-UpperBounds-10 in 198697 ms.
[2025-06-02 05:27:51] [INFO ] Flatten gal took : 19 ms
[2025-06-02 05:27:51] [INFO ] Applying decomposition
[2025-06-02 05:27:51] [INFO ] Flatten gal took : 19 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/graph12594221390051068247.txt' '-o' '/tmp/graph12594221390051068247.bin' '-w' '/tmp/graph12594221390051068247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12594221390051068247.bin' '-l' '-1' '-v' '-w' '/tmp/graph12594221390051068247.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:27:51] [INFO ] Decomposing Gal with order
[2025-06-02 05:27:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:27:51] [INFO ] Removed a total of 910 redundant transitions.
[2025-06-02 05:27:51] [INFO ] Flatten gal took : 39 ms
[2025-06-02 05:27:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 242 labels/synchronizations in 15 ms.
[2025-06-02 05:27:51] [INFO ] Time to serialize gal into /tmp/UpperBounds16661416776638109556.gal : 5 ms
[2025-06-02 05:27:51] [INFO ] Time to serialize properties into /tmp/UpperBounds8401609341533718125.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/UpperBounds16661416776638109556.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8401609341533718125.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 ...284
Loading property file /tmp/UpperBounds8401609341533718125.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.50285e+08,712.261,5329720,167202,1256,9.04562e+06,10588,1375,1.42348e+07,135,101825,0
Total reachable state count : 250285092

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-5-UpperBounds-10 :0 <= i12.u0.BeginLoop_3_4_5 <= 1
FORMULA Peterson-PT-5-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-5-UpperBounds-10,0,718.458,5329720,1,0,9.04562e+06,10588,1532,1.42348e+07,152,101825,1150
Total runtime 1227319 ms.

BK_STOP 1748842790777

--------------------
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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is Peterson-PT-5, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-174876824800078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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