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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 196K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 781K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 195K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 870K 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 110K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 318K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 157K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 553K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 714K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.8M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 904K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 43K 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 1.3M 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-7-UpperBounds-00
FORMULA_NAME Peterson-PT-7-UpperBounds-01
FORMULA_NAME Peterson-PT-7-UpperBounds-02
FORMULA_NAME Peterson-PT-7-UpperBounds-03
FORMULA_NAME Peterson-PT-7-UpperBounds-04
FORMULA_NAME Peterson-PT-7-UpperBounds-05
FORMULA_NAME Peterson-PT-7-UpperBounds-06
FORMULA_NAME Peterson-PT-7-UpperBounds-07
FORMULA_NAME Peterson-PT-7-UpperBounds-08
FORMULA_NAME Peterson-PT-7-UpperBounds-09
FORMULA_NAME Peterson-PT-7-UpperBounds-10
FORMULA_NAME Peterson-PT-7-UpperBounds-11
FORMULA_NAME Peterson-PT-7-UpperBounds-12
FORMULA_NAME Peterson-PT-7-UpperBounds-13
FORMULA_NAME Peterson-PT-7-UpperBounds-14
FORMULA_NAME Peterson-PT-7-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841593240

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-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 05:19:54] [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:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:19:54] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2025-06-02 05:19:54] [INFO ] Transformed 1992 places.
[2025-06-02 05:19:54] [INFO ] Transformed 3096 transitions.
[2025-06-02 05:19:54] [INFO ] Found NUPN structural information;
[2025-06-02 05:19:54] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Reduction of identical properties reduced properties to check from 16 to 14
FORMULA Peterson-PT-7-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[56, 8, 448, 8, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Peterson-PT-7-UpperBounds-02 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-01 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[56, 448, 8, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 05:19:54] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2025-06-02 05:19:54] [INFO ] Computed 31 invariants in 50 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[56, 448, 8, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 125 ms. (79 steps per ms)
FORMULA Peterson-PT-7-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-7-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-7-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-7-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-7-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-7-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 136 ms. (365 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 8, 1, 0, 0] Max Struct:[56, 448, 8, 1, 1]
[2025-06-02 05:19:55] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-02 05:19:55] [INFO ] Invariant cache hit.
[2025-06-02 05:19:55] [INFO ] [Real]Absence check using 23 positive place invariants in 55 ms returned sat
[2025-06-02 05:19:55] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 19 ms returned sat
[2025-06-02 05:19:57] [INFO ] [Real]Absence check using state equation in 1307 ms returned sat
[2025-06-02 05:19:57] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:19:57] [INFO ] [Real]Added 497 Read/Feed constraints in 176 ms returned sat
[2025-06-02 05:19:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:57] [INFO ] [Nat]Absence check using 23 positive place invariants in 53 ms returned sat
[2025-06-02 05:19:57] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-02 05:19:59] [INFO ] [Nat]Absence check using state equation in 1237 ms returned sat
[2025-06-02 05:19:59] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 05:20:00] [INFO ] [Nat]Added 497 Read/Feed constraints in 839 ms returned sat
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 13 places in 1237 ms of which 143 ms to minimize.
[2025-06-02 05:20:02] [INFO ] Deduced a trap composed of 37 places in 1056 ms of which 11 ms to minimize.
[2025-06-02 05:20:02] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2533 ms
[2025-06-02 05:20:02] [INFO ] [Real]Absence check using 23 positive place invariants in 48 ms returned unsat
[2025-06-02 05:20:03] [INFO ] [Real]Absence check using 23 positive place invariants in 48 ms returned sat
[2025-06-02 05:20:03] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-02 05:20:03] [INFO ] [Real]Absence check using state equation in 718 ms returned sat
[2025-06-02 05:20:04] [INFO ] [Real]Added 497 Read/Feed constraints in 129 ms returned sat
[2025-06-02 05:20:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2025-06-02 05:20:04] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-02 05:20:05] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2025-06-02 05:20:05] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 05:20:06] [INFO ] [Nat]Added 497 Read/Feed constraints in 990 ms returned sat
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 88 places in 1025 ms of which 11 ms to minimize.
[2025-06-02 05:20:08] [INFO ] Deduced a trap composed of 20 places in 1024 ms of which 11 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 13 places in 997 ms of which 10 ms to minimize.
[2025-06-02 05:20:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 05:20:09] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2025-06-02 05:20:09] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-02 05:20:10] [INFO ] [Real]Absence check using state equation in 702 ms returned sat
[2025-06-02 05:20:10] [INFO ] [Real]Added 497 Read/Feed constraints in 48 ms returned sat
[2025-06-02 05:20:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 46 ms returned sat
[2025-06-02 05:20:11] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-02 05:20:11] [INFO ] [Nat]Absence check using state equation in 717 ms returned sat
[2025-06-02 05:20:11] [INFO ] [Nat]Added 497 Read/Feed constraints in 47 ms returned sat
[2025-06-02 05:20:12] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 141 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-02 05:20:16] [INFO ] [Real]Absence check using 23 positive place invariants in 39 ms returned sat
[2025-06-02 05:20:16] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 05:20:16] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2025-06-02 05:20:17] [INFO ] [Real]Added 497 Read/Feed constraints in 40 ms returned sat
[2025-06-02 05:20:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:17] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2025-06-02 05:20:17] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-02 05:20:18] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2025-06-02 05:20:18] [INFO ] [Nat]Added 497 Read/Feed constraints in 52 ms returned sat
[2025-06-02 05:20:18] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 164 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 8, 1, 0, 0] Max Struct:[56, 8, 8, 1, 1]
FORMULA Peterson-PT-7-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-03 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 1, 0, 0] Max Struct:[56, 8, 1, 1]
Support contains 66 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 886 transitions
Trivial Post-agglo rules discarded 886 transitions
Performed 886 trivial Post agglomeration. Transition count delta: 886
Iterating post reduction 0 with 886 rules applied. Total rules applied 886 place count 1992 transition count 2210
Reduce places removed 886 places and 0 transitions.
Iterating post reduction 1 with 886 rules applied. Total rules applied 1772 place count 1106 transition count 2210
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1772 place count 1106 transition count 1811
Deduced a syphon composed of 399 places in 2 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 2570 place count 707 transition count 1811
Applied a total of 2570 rules in 324 ms. Remains 707 /1992 variables (removed 1285) and now considering 1811/3096 (removed 1285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 340 ms. Remains : 707/1992 places, 1811/3096 transitions.
[2025-06-02 05:20:22] [INFO ] Flow matrix only has 1475 transitions (discarded 336 similar events)
// Phase 1: matrix 1475 rows 707 cols
[2025-06-02 05:20:22] [INFO ] Computed 31 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7, 1, 0, 0] Max Struct:[56, 8, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2785 ms. (358 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 3076 ms. (1299 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 1, 0, 0] Max Struct:[56, 8, 1, 1]
[2025-06-02 05:20:28] [INFO ] Flow matrix only has 1475 transitions (discarded 336 similar events)
[2025-06-02 05:20:28] [INFO ] Invariant cache hit.
[2025-06-02 05:20:28] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2025-06-02 05:20:28] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-02 05:20:28] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2025-06-02 05:20:28] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:20:28] [INFO ] [Real]Added 497 Read/Feed constraints in 73 ms returned sat
[2025-06-02 05:20:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2025-06-02 05:20:29] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-02 05:20:29] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2025-06-02 05:20:29] [INFO ] [Nat]Added 497 Read/Feed constraints in 152 ms returned sat
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 4 ms to minimize.
[2025-06-02 05:20:30] [INFO ] Deduced a trap composed of 16 places in 264 ms of which 3 ms to minimize.
[2025-06-02 05:20:30] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 4 ms to minimize.
[2025-06-02 05:20:30] [INFO ] Deduced a trap composed of 14 places in 250 ms of which 4 ms to minimize.
[2025-06-02 05:20:31] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:20:31] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 3 ms to minimize.
[2025-06-02 05:20:31] [INFO ] Deduced a trap composed of 16 places in 275 ms of which 4 ms to minimize.
[2025-06-02 05:20:32] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 2446 ms
[2025-06-02 05:20:32] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2025-06-02 05:20:32] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-02 05:20:32] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2025-06-02 05:20:32] [INFO ] [Real]Added 497 Read/Feed constraints in 40 ms returned sat
[2025-06-02 05:20:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2025-06-02 05:20:32] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-02 05:20:32] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2025-06-02 05:20:33] [INFO ] [Nat]Added 497 Read/Feed constraints in 158 ms returned sat
[2025-06-02 05:20:33] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 4 ms to minimize.
[2025-06-02 05:20:33] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 3 ms to minimize.
[2025-06-02 05:20:33] [INFO ] Deduced a trap composed of 100 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:20:34] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:20:34] [INFO ] Deduced a trap composed of 78 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:20:34] [INFO ] Deduced a trap composed of 53 places in 235 ms of which 3 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 56 places in 235 ms of which 3 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 3 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 80 places in 245 ms of which 4 ms to minimize.
[2025-06-02 05:20:36] [INFO ] Deduced a trap composed of 78 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:20:36] [INFO ] Deduced a trap composed of 58 places in 243 ms of which 3 ms to minimize.
[2025-06-02 05:20:36] [INFO ] Deduced a trap composed of 47 places in 236 ms of which 3 ms to minimize.
[2025-06-02 05:20:37] [INFO ] Deduced a trap composed of 75 places in 261 ms of which 4 ms to minimize.
[2025-06-02 05:20:37] [INFO ] Deduced a trap composed of 69 places in 249 ms of which 4 ms to minimize.
[2025-06-02 05:20:37] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 3 ms to minimize.
[2025-06-02 05:20:38] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:20:38] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:20:38] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 3 ms to minimize.
[2025-06-02 05:20:39] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:20:39] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:20:39] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 10 ms to minimize.
[2025-06-02 05:20:39] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:20:40] [INFO ] Deduced a trap composed of 57 places in 251 ms of which 6 ms to minimize.
[2025-06-02 05:20:40] [INFO ] Deduced a trap composed of 63 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:20:40] [INFO ] Deduced a trap composed of 87 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:20:41] [INFO ] Deduced a trap composed of 127 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:20:41] [INFO ] Deduced a trap composed of 58 places in 238 ms of which 4 ms to minimize.
[2025-06-02 05:20:41] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 3 ms to minimize.
[2025-06-02 05:20:41] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:20:42] [INFO ] Deduced a trap composed of 62 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:20:43] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 4 ms to minimize.
[2025-06-02 05:20:43] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:20:44] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:20:44] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:20:44] [INFO ] Deduced a trap composed of 67 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:20:44] [INFO ] Deduced a trap composed of 46 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:20:45] [INFO ] Deduced a trap composed of 72 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:20:45] [INFO ] Deduced a trap composed of 72 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:20:45] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:20:46] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:20:46] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:20:46] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 6 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 58 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 61 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 3 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 3 ms to minimize.
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:20:54] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 50 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 61 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 83 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 61 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 28 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:20:57] [INFO ] Deduced a trap composed of 55 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:20:57] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:20:57] [INFO ] Deduced a trap composed of 125 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:20:58] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:21:01] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:21:02] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Trap strengthening (SAT) tested/added 65/65 trap constraints in 33627 ms
[2025-06-02 05:21:06] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2025-06-02 05:21:06] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-02 05:21:07] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2025-06-02 05:21:07] [INFO ] [Real]Added 497 Read/Feed constraints in 37 ms returned sat
[2025-06-02 05:21:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:07] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2025-06-02 05:21:07] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:07] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2025-06-02 05:21:07] [INFO ] [Nat]Added 497 Read/Feed constraints in 37 ms returned sat
[2025-06-02 05:21:07] [INFO ] Computed and/alt/rep : 1355/4555/1355 causal constraints (skipped 112 transitions) in 83 ms.
[2025-06-02 05:21:08] [INFO ] Added : 18 causal constraints over 4 iterations in 409 ms. Result :sat
Minimization took 407 ms.
[2025-06-02 05:21:08] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2025-06-02 05:21:08] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:08] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2025-06-02 05:21:09] [INFO ] [Real]Added 497 Read/Feed constraints in 35 ms returned sat
[2025-06-02 05:21:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:09] [INFO ] [Nat]Absence check using 23 positive place invariants in 18 ms returned sat
[2025-06-02 05:21:09] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-02 05:21:09] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2025-06-02 05:21:09] [INFO ] [Nat]Added 497 Read/Feed constraints in 39 ms returned sat
[2025-06-02 05:21:09] [INFO ] Computed and/alt/rep : 1355/4555/1355 causal constraints (skipped 112 transitions) in 78 ms.
[2025-06-02 05:21:11] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:21:11] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:21:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 677 ms
[2025-06-02 05:21:12] [INFO ] Added : 119 causal constraints over 24 iterations in 2574 ms. Result :sat
Minimization took 418 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 1, 0, 0] Max Struct:[7, 8, 1, 1]
FORMULA Peterson-PT-7-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-7-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 707 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 707/707 places, 1811/1811 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 707 transition count 1810
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 706 transition count 1810
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 2 place count 706 transition count 1760
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 102 place count 656 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 214 place count 600 transition count 1704
Applied a total of 214 rules in 113 ms. Remains 600 /707 variables (removed 107) and now considering 1704/1811 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 600/707 places, 1704/1811 transitions.
[2025-06-02 05:21:12] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 600 cols
[2025-06-02 05:21:12] [INFO ] Computed 31 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2059 ms. (485 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 598 ms. (1669 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-02 05:21:15] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:21:15] [INFO ] Invariant cache hit.
[2025-06-02 05:21:15] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2025-06-02 05:21:15] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:15] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2025-06-02 05:21:15] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:21:15] [INFO ] [Real]Added 497 Read/Feed constraints in 37 ms returned sat
[2025-06-02 05:21:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:16] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2025-06-02 05:21:16] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-02 05:21:16] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2025-06-02 05:21:16] [INFO ] [Nat]Added 497 Read/Feed constraints in 132 ms returned sat
[2025-06-02 05:21:16] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:21:16] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:21:17] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:21:17] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:21:17] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:21:17] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:21:19] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:21:19] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:21:19] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:21:19] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:21:20] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:21:20] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:21:20] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 2 ms to minimize.
[2025-06-02 05:21:21] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:21:21] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 2 ms to minimize.
[2025-06-02 05:21:21] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 2 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 2 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:21:27] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:21:27] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 2 ms to minimize.
[2025-06-02 05:21:28] [INFO ] Deduced a trap composed of 59 places in 164 ms of which 3 ms to minimize.
[2025-06-02 05:21:28] [INFO ] Deduced a trap composed of 67 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:21:28] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 2 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:21:31] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:21:31] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:21:31] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 2 ms to minimize.
[2025-06-02 05:21:35] [INFO ] Deduced a trap composed of 61 places in 168 ms of which 2 ms to minimize.
[2025-06-02 05:21:35] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:21:38] [INFO ] Deduced a trap composed of 93 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:21:38] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:21:38] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:21:39] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:21:39] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:21:39] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:21:40] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:21:40] [INFO ] Deduced a trap composed of 68 places in 169 ms of which 4 ms to minimize.
[2025-06-02 05:21:40] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 3 ms to minimize.
[2025-06-02 05:21:40] [INFO ] Deduced a trap composed of 61 places in 163 ms of which 3 ms to minimize.
[2025-06-02 05:21:40] [INFO ] Deduced a trap composed of 60 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:21:41] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:21:41] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:21:41] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 69 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:21:43] [INFO ] Deduced a trap composed of 60 places in 167 ms of which 3 ms to minimize.
[2025-06-02 05:21:44] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 3 ms to minimize.
[2025-06-02 05:21:44] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:21:44] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 3 ms to minimize.
[2025-06-02 05:21:44] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:21:45] [INFO ] Deduced a trap composed of 68 places in 155 ms of which 3 ms to minimize.
[2025-06-02 05:21:45] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:21:46] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 3 ms to minimize.
[2025-06-02 05:21:46] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 3 ms to minimize.
[2025-06-02 05:21:46] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 3 ms to minimize.
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 69 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 3 ms to minimize.
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 3 ms to minimize.
[2025-06-02 05:21:50] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:21:51] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:21:51] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:21:52] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:21:52] [INFO ] Deduced a trap composed of 70 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:21:52] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 2 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Trap strengthening (SAT) tested/added 92/92 trap constraints in 40825 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 1704/1704 transitions.
Applied a total of 0 rules in 34 ms. Remains 600 /600 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 600/600 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 1704/1704 transitions.
Applied a total of 0 rules in 47 ms. Remains 600 /600 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2025-06-02 05:21:57] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:21:57] [INFO ] Invariant cache hit.
[2025-06-02 05:21:57] [INFO ] Implicit Places using invariants in 466 ms returned [584, 585, 586, 587, 588, 597, 598, 599]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 468 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 592/600 places, 1704/1704 transitions.
Applied a total of 0 rules in 30 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 547 ms. Remains : 592/600 places, 1704/1704 transitions.
[2025-06-02 05:21:57] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2025-06-02 05:21:57] [INFO ] Computed 23 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2015 ms. (496 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 584 ms. (1709 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-02 05:22:00] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:22:00] [INFO ] Invariant cache hit.
[2025-06-02 05:22:00] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2025-06-02 05:22:00] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2025-06-02 05:22:00] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:22:00] [INFO ] [Real]Added 497 Read/Feed constraints in 41 ms returned sat
[2025-06-02 05:22:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2025-06-02 05:22:01] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2025-06-02 05:22:01] [INFO ] [Nat]Added 497 Read/Feed constraints in 118 ms returned sat
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 2 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 56 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:22:05] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:22:05] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:22:05] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:22:06] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:22:06] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 3 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 2 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 2 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 2 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:22:10] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:22:10] [INFO ] Deduced a trap composed of 75 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:22:10] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:22:11] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:22:11] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:22:11] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 2 ms to minimize.
[2025-06-02 05:22:11] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 2 ms to minimize.
[2025-06-02 05:22:11] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:22:12] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 5 ms to minimize.
[2025-06-02 05:22:12] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 4 ms to minimize.
[2025-06-02 05:22:12] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:22:13] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 4 ms to minimize.
[2025-06-02 05:22:13] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 2 ms to minimize.
[2025-06-02 05:22:13] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:22:13] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:22:14] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:22:14] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:22:14] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:22:15] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 2 ms to minimize.
[2025-06-02 05:22:15] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:22:15] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:22:15] [INFO ] Deduced a trap composed of 52 places in 186 ms of which 2 ms to minimize.
[2025-06-02 05:22:17] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:22:20] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 2 ms to minimize.
[2025-06-02 05:22:22] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:22:23] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:22:23] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:22:23] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:22:23] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:22:24] [INFO ] Deduced a trap composed of 65 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:22:24] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:22:24] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:22:24] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:22:25] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 2 ms to minimize.
[2025-06-02 05:22:25] [INFO ] Deduced a trap composed of 67 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:22:25] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:22:25] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:22:26] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:22:26] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:22:26] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:22:26] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:22:28] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 2 ms to minimize.
[2025-06-02 05:22:28] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:22:29] [INFO ] Deduced a trap composed of 58 places in 167 ms of which 4 ms to minimize.
[2025-06-02 05:22:29] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:22:29] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 3 ms to minimize.
[2025-06-02 05:22:29] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2025-06-02 05:22:32] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 2 ms to minimize.
[2025-06-02 05:22:32] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:22:32] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:22:34] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 3 ms to minimize.
[2025-06-02 05:22:38] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2025-06-02 05:22:39] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:22:43] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 42225 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 23 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 21 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2025-06-02 05:22:43] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:22:43] [INFO ] Invariant cache hit.
[2025-06-02 05:22:44] [INFO ] Implicit Places using invariants in 387 ms returned []
[2025-06-02 05:22:44] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:22:44] [INFO ] Invariant cache hit.
[2025-06-02 05:22:44] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:22:46] [INFO ] Implicit Places using invariants and state equation in 2708 ms returned []
Implicit Place search using SMT with State Equation took 3097 ms to find 0 implicit places.
[2025-06-02 05:22:47] [INFO ] Redundant transitions in 124 ms returned []
Running 1696 sub problems to find dead transitions.
[2025-06-02 05:22:47] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:22:47] [INFO ] Invariant cache hit.
[2025-06-02 05:22:47] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 592/592 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/615 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:23:03] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 3 ms to minimize.
[2025-06-02 05:23:03] [INFO ] Deduced a trap composed of 41 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:23:03] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:23:04] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 4 ms to minimize.
[2025-06-02 05:23:04] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:23:04] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:23:04] [INFO ] Deduced a trap composed of 63 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:23:05] [INFO ] Deduced a trap composed of 60 places in 238 ms of which 3 ms to minimize.
[2025-06-02 05:23:05] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:23:05] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:23:05] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:23:05] [INFO ] Deduced a trap composed of 69 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:23:06] [INFO ] Deduced a trap composed of 55 places in 231 ms of which 3 ms to minimize.
[2025-06-02 05:23:06] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:23:06] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 3 ms to minimize.
[2025-06-02 05:23:06] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:23:07] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 3 ms to minimize.
[2025-06-02 05:23:07] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:23:07] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:23:07] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/635 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:23:08] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:23:08] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 3 ms to minimize.
[2025-06-02 05:23:09] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:23:09] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:23:09] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:23:09] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:23:10] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:23:10] [INFO ] Deduced a trap composed of 83 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:23:10] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:23:10] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:23:11] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:23:11] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:23:11] [INFO ] Deduced a trap composed of 76 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:23:11] [INFO ] Deduced a trap composed of 98 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:23:11] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:23:12] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:23:12] [INFO ] Deduced a trap composed of 69 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:23:12] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:23:12] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:23:13] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/655 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1960 variables, and 655 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30040 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 592/592 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/615 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 40/655 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:23:19] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 3 ms to minimize.
[2025-06-02 05:23:19] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:23:19] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:23:20] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:23:20] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:23:20] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:23:20] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 104 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:23:23] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:23:23] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:23:23] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 1 ms to minimize.
[2025-06-02 05:23:23] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/675 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 62 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:23:25] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:23:25] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:23:25] [INFO ] Deduced a trap composed of 55 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:23:25] [INFO ] Deduced a trap composed of 63 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:23:26] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:23:26] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:23:26] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:23:26] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:23:26] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 2 ms to minimize.
[2025-06-02 05:23:26] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 2 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 3 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 3 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 2 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 20/695 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:23:29] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 2 ms to minimize.
[2025-06-02 05:23:29] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:23:29] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:23:29] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:23:30] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 2 ms to minimize.
[2025-06-02 05:23:30] [INFO ] Deduced a trap composed of 62 places in 164 ms of which 3 ms to minimize.
[2025-06-02 05:23:30] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:23:30] [INFO ] Deduced a trap composed of 90 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:23:30] [INFO ] Deduced a trap composed of 88 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:23:30] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 3 ms to minimize.
[2025-06-02 05:23:31] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:23:31] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:23:31] [INFO ] Deduced a trap composed of 61 places in 173 ms of which 2 ms to minimize.
[2025-06-02 05:23:31] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:23:31] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2025-06-02 05:23:32] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 2 ms to minimize.
[2025-06-02 05:23:32] [INFO ] Deduced a trap composed of 70 places in 156 ms of which 2 ms to minimize.
[2025-06-02 05:23:32] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 2 ms to minimize.
[2025-06-02 05:23:32] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:23:32] [INFO ] Deduced a trap composed of 69 places in 184 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 20/715 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:23:33] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:23:34] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:23:34] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:23:34] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:23:34] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:23:34] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 70 places in 187 ms of which 2 ms to minimize.
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 2 ms to minimize.
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 2 ms to minimize.
[2025-06-02 05:23:36] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 2 ms to minimize.
[2025-06-02 05:23:36] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 2 ms to minimize.
[2025-06-02 05:23:36] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 3 ms to minimize.
[2025-06-02 05:23:36] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:23:36] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2025-06-02 05:23:36] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 1 ms to minimize.
[2025-06-02 05:23:36] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2025-06-02 05:23:37] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:23:37] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 20/735 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:23:38] [INFO ] Deduced a trap composed of 68 places in 197 ms of which 2 ms to minimize.
[2025-06-02 05:23:39] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:23:39] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 2 ms to minimize.
[2025-06-02 05:23:39] [INFO ] Deduced a trap composed of 61 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:23:39] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:23:39] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:23:40] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:23:40] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:23:40] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:23:41] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:23:41] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:23:41] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:23:42] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 3 ms to minimize.
[2025-06-02 05:23:42] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:23:42] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:23:42] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 3 ms to minimize.
[2025-06-02 05:23:42] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 2 ms to minimize.
[2025-06-02 05:23:43] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:23:43] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:23:43] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 20/755 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:23:45] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2025-06-02 05:23:45] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:23:45] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:23:46] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:23:46] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:23:46] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:23:46] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2025-06-02 05:23:46] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:23:46] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 2 ms to minimize.
[2025-06-02 05:23:46] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:23:47] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:23:47] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 3 ms to minimize.
[2025-06-02 05:23:47] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:23:47] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 3 ms to minimize.
[2025-06-02 05:23:47] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 2 ms to minimize.
SMT process timed out in 60766ms, After SMT, problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 60791ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64065 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 912 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
[2025-06-02 05:23:48] [INFO ] Flatten gal took : 263 ms
[2025-06-02 05:23:48] [INFO ] Flatten gal took : 149 ms
[2025-06-02 05:23:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2404173273280077145.gal : 46 ms
[2025-06-02 05:23:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5784996871811368800.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2404173273280077145.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5784996871811368800.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/ReachabilityCardinality5784996871811368800.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 27
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :27 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :99 after 121
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :121 after 283
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :283 after 382
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :382 after 1622
Interrupted probabilistic random walk after 553797 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 2
Probabilistic random walk after 553797 steps, saw 81211 distinct states, run finished after 3004 ms. (steps per millisecond=184 ) properties seen :0
[2025-06-02 05:23:51] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:23:51] [INFO ] Invariant cache hit.
[2025-06-02 05:23:51] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 520/528 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 520/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :1622 after 2576
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/536 variables, 8/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1368/1904 variables, 536/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 497/1585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 0/1585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 56/1960 variables, 56/1641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 56/1697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 7/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1960 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1704 constraints, problems are : Problem set: 0 solved, 2 unsolved in 811 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 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/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 520/528 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 520/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/536 variables, 8/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1368/1904 variables, 536/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 497/1585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 2/1587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1904 variables, 0/1587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 56/1960 variables, 56/1643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 56/1699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 7/1706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:23:53] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:23:53] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:23:53] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:23:53] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:23:54] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2576 after 7200
[2025-06-02 05:23:54] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 3 ms to minimize.
[2025-06-02 05:23:54] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:23:54] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:23:55] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:23:55] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:23:55] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:23:55] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:23:56] [INFO ] Deduced a trap composed of 70 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:23:56] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:23:56] [INFO ] Deduced a trap composed of 57 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:23:56] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:23:57] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:23:57] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 3 ms to minimize.
SMT process timed out in 6055ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 22 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 398 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 600408 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 2
Probabilistic random walk after 600408 steps, saw 86127 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2025-06-02 05:24:00] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:24:00] [INFO ] Invariant cache hit.
[2025-06-02 05:24:00] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 520/528 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 520/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/536 variables, 8/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1368/1904 variables, 536/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 497/1585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 0/1585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 56/1960 variables, 56/1641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 56/1697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 7/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1960 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1704 constraints, problems are : Problem set: 0 solved, 2 unsolved in 786 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 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/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 520/528 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 520/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/536 variables, 8/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1368/1904 variables, 536/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 497/1585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 2/1587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1904 variables, 0/1587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 56/1960 variables, 56/1643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 56/1699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 7/1706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:24:02] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:24:02] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:24:02] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:24:03] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:24:03] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:24:03] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:24:03] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:24:04] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:24:04] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:24:04] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7200 after 16545
[2025-06-02 05:24:04] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:24:05] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:24:05] [INFO ] Deduced a trap composed of 70 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:24:05] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:24:05] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:24:06] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:24:06] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:24:06] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:24:06] [INFO ] Deduced a trap composed of 63 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:24:07] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1960 variables, 20/1726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:24:07] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:24:07] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:24:07] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:24:08] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:24:08] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:24:08] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:24:08] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:24:09] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
[2025-06-02 05:24:09] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:24:09] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:24:09] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:24:10] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:24:10] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:24:10] [INFO ] Deduced a trap composed of 57 places in 217 ms of which 9 ms to minimize.
[2025-06-02 05:24:10] [INFO ] Deduced a trap composed of 79 places in 196 ms of which 2 ms to minimize.
[2025-06-02 05:24:11] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:24:11] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:24:11] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:24:11] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:24:12] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/1960 variables, 20/1746 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:24:12] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:24:12] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 4 ms to minimize.
[2025-06-02 05:24:12] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:24:13] [INFO ] Deduced a trap composed of 77 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:24:13] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:24:13] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:24:13] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:24:14] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:24:14] [INFO ] Deduced a trap composed of 68 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:24:14] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:24:14] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:24:15] [INFO ] Deduced a trap composed of 43 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:24:15] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:24:15] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:24:15] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:24:15] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:24:16] [INFO ] Deduced a trap composed of 61 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:24:16] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:24:16] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:24:16] [INFO ] Deduced a trap composed of 70 places in 188 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1960 variables, 20/1766 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:24:17] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:24:17] [INFO ] Deduced a trap composed of 61 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:24:17] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:24:17] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 2 ms to minimize.
[2025-06-02 05:24:18] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 2 ms to minimize.
[2025-06-02 05:24:18] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:24:18] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:24:18] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:24:19] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:24:19] [INFO ] Deduced a trap composed of 52 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:24:19] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
[2025-06-02 05:24:19] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
SDD size :16545 after 73802
[2025-06-02 05:24:20] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 2 ms to minimize.
[2025-06-02 05:24:20] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 2 ms to minimize.
[2025-06-02 05:24:20] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:24:20] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:24:21] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 2 ms to minimize.
[2025-06-02 05:24:21] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:24:21] [INFO ] Deduced a trap composed of 69 places in 190 ms of which 2 ms to minimize.
[2025-06-02 05:24:21] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1960 variables, 20/1786 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:24:22] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 5 ms to minimize.
[2025-06-02 05:24:22] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:24:22] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:24:22] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 3 ms to minimize.
[2025-06-02 05:24:23] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 2 ms to minimize.
[2025-06-02 05:24:23] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 2 ms to minimize.
[2025-06-02 05:24:23] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:24:23] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:24:24] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 2 ms to minimize.
[2025-06-02 05:24:24] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 3 ms to minimize.
[2025-06-02 05:24:24] [INFO ] Deduced a trap composed of 70 places in 156 ms of which 3 ms to minimize.
[2025-06-02 05:24:24] [INFO ] Deduced a trap composed of 68 places in 156 ms of which 2 ms to minimize.
[2025-06-02 05:24:25] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:24:25] [INFO ] Deduced a trap composed of 62 places in 182 ms of which 2 ms to minimize.
[2025-06-02 05:24:25] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:24:26] [INFO ] Deduced a trap composed of 71 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:24:26] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 2 ms to minimize.
[2025-06-02 05:24:26] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:24:26] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 3 ms to minimize.
[2025-06-02 05:24:27] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1960 variables, 20/1806 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:24:27] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 2 ms to minimize.
[2025-06-02 05:24:27] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:24:27] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:24:28] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 2 ms to minimize.
[2025-06-02 05:24:28] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 2 ms to minimize.
[2025-06-02 05:24:28] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 2 ms to minimize.
[2025-06-02 05:24:28] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 2 ms to minimize.
[2025-06-02 05:24:29] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 2 ms to minimize.
[2025-06-02 05:24:29] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 1 ms to minimize.
[2025-06-02 05:24:30] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 2 ms to minimize.
[2025-06-02 05:24:30] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 2 ms to minimize.
[2025-06-02 05:24:30] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:24:30] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 3 ms to minimize.
[2025-06-02 05:24:31] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 3 ms to minimize.
[2025-06-02 05:24:31] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:24:31] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:24:31] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:24:32] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:24:32] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:24:32] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1960 variables, 20/1826 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:24:33] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 2 ms to minimize.
[2025-06-02 05:24:33] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:24:35] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:24:35] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2025-06-02 05:24:35] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:24:35] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2025-06-02 05:24:36] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2025-06-02 05:24:36] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:24:37] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:24:37] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:24:37] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:24:37] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:24:37] [INFO ] Deduced a trap composed of 76 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:24:38] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:24:38] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:24:38] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:24:38] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 05:24:38] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 2 ms to minimize.
[2025-06-02 05:24:38] [INFO ] Flatten gal took : 105 ms
[2025-06-02 05:24:38] [INFO ] Applying decomposition
[2025-06-02 05:24:38] [INFO ] Flatten gal took : 54 ms
[2025-06-02 05:24:39] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 2 ms to minimize.
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/graph9196180798005836020.txt' '-o' '/tmp/graph9196180798005836020.bin' '-w' '/tmp/graph9196180798005836020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9196180798005836020.bin' '-l' '-1' '-v' '-w' '/tmp/graph9196180798005836020.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:24:39] [INFO ] Deduced a trap composed of 60 places in 183 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1960 variables, 20/1846 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:24:39] [INFO ] Decomposing Gal with order
[2025-06-02 05:24:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:24:39] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:24:39] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 1 ms to minimize.
[2025-06-02 05:24:39] [INFO ] Removed a total of 2615 redundant transitions.
[2025-06-02 05:24:39] [INFO ] Flatten gal took : 251 ms
[2025-06-02 05:24:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 295 labels/synchronizations in 113 ms.
[2025-06-02 05:24:40] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:24:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5853215728508351920.gal : 32 ms
[2025-06-02 05:24:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1065657431230865723.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5853215728508351920.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1065657431230865723.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
[2025-06-02 05:24:40] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 3 ms to minimize.
Loading property file /tmp/ReachabilityCardinality1065657431230865723.prop.
[2025-06-02 05:24:40] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 2 ms to minimize.
[2025-06-02 05:24:40] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:24:40] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:24:40] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :10 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 32
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :32 after 125
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :125 after 383
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :383 after 1108
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1108 after 4513
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 2 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 2 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 2 ms to minimize.
[2025-06-02 05:24:45] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4513 after 27897
[2025-06-02 05:24:45] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 3 ms to minimize.
[2025-06-02 05:24:45] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:24:46] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1960/1960 variables, and 1862 constraints, problems are : Problem set: 1 solved, 1 unsolved in 45014 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 156/156 constraints]
After SMT, in 45817ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 30 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 721413 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 1
Probabilistic random walk after 721413 steps, saw 100429 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
[2025-06-02 05:24:49] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:24:49] [INFO ] Invariant cache hit.
[2025-06-02 05:24:49] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 520/528 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 520/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/536 variables, 8/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1368/1904 variables, 536/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 497/1585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 0/1585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 56/1960 variables, 56/1641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 56/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 7/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1960 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 531 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 520/528 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 520/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/536 variables, 8/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1368/1904 variables, 536/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 497/1585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 1/1586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1904 variables, 0/1586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 56/1960 variables, 56/1642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 56/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 7/1705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:24:51] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:24:51] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:24:51] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:24:52] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:24:52] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:24:52] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:24:52] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 3 ms to minimize.
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :27897 after 72498
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 2 ms to minimize.
[2025-06-02 05:24:55] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:24:55] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 4 ms to minimize.
[2025-06-02 05:24:55] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:24:56] [INFO ] Deduced a trap composed of 43 places in 286 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1960 variables, 20/1725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:24:56] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:24:56] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 3 ms to minimize.
[2025-06-02 05:24:57] [INFO ] Deduced a trap composed of 61 places in 270 ms of which 2 ms to minimize.
[2025-06-02 05:24:57] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:24:57] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 2 ms to minimize.
[2025-06-02 05:24:57] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:24:58] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:24:58] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:24:58] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:24:58] [INFO ] Deduced a trap composed of 59 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:24:59] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 3 ms to minimize.
[2025-06-02 05:24:59] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:24:59] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 3 ms to minimize.
[2025-06-02 05:24:59] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:25:00] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:25:00] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 4 ms to minimize.
[2025-06-02 05:25:00] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:25:00] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1960 variables, 20/1745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 50 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 68 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:25:02] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 2 ms to minimize.
[2025-06-02 05:25:02] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 2 ms to minimize.
[2025-06-02 05:25:02] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:25:02] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:25:03] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:25:03] [INFO ] Deduced a trap composed of 70 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:25:03] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:25:03] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:25:04] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 2 ms to minimize.
[2025-06-02 05:25:04] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:25:04] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:25:04] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:25:05] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 2 ms to minimize.
[2025-06-02 05:25:05] [INFO ] Deduced a trap composed of 93 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:25:05] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:25:05] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:25:06] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 6 ms to minimize.
[2025-06-02 05:25:06] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1960 variables, 20/1765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:25:06] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:25:07] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:25:07] [INFO ] Deduced a trap composed of 80 places in 206 ms of which 2 ms to minimize.
[2025-06-02 05:25:07] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:25:07] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 2 ms to minimize.
[2025-06-02 05:25:08] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:25:08] [INFO ] Deduced a trap composed of 51 places in 181 ms of which 2 ms to minimize.
[2025-06-02 05:25:08] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:25:08] [INFO ] Deduced a trap composed of 69 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:25:09] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 2 ms to minimize.
[2025-06-02 05:25:09] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :72498 after 273917
[2025-06-02 05:25:11] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2025-06-02 05:25:11] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 2 ms to minimize.
[2025-06-02 05:25:12] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:25:13] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 3 ms to minimize.
[2025-06-02 05:25:13] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 2 ms to minimize.
[2025-06-02 05:25:13] [INFO ] Deduced a trap composed of 68 places in 180 ms of which 3 ms to minimize.
[2025-06-02 05:25:13] [INFO ] Deduced a trap composed of 71 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:25:14] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:25:14] [INFO ] Deduced a trap composed of 83 places in 191 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1960 variables, 20/1785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:25:14] [INFO ] Deduced a trap composed of 52 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:25:14] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 2 ms to minimize.
[2025-06-02 05:25:15] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 2 ms to minimize.
[2025-06-02 05:25:16] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 2 ms to minimize.
[2025-06-02 05:25:16] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:25:17] [INFO ] Deduced a trap composed of 61 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:25:17] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:25:18] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:25:18] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:25:18] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:25:18] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 3 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 2 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 2 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1960 variables, 20/1805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 2 ms to minimize.
[2025-06-02 05:25:21] [INFO ] Deduced a trap composed of 61 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:25:21] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 2 ms to minimize.
[2025-06-02 05:25:21] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:25:22] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:25:22] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 3 ms to minimize.
[2025-06-02 05:25:22] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 2 ms to minimize.
[2025-06-02 05:25:22] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :273917 after 712260
[2025-06-02 05:25:23] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:25:23] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:25:23] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:25:23] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 2 ms to minimize.
[2025-06-02 05:25:24] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:25:24] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:25:24] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 2 ms to minimize.
[2025-06-02 05:25:25] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:25:25] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:25:25] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:25:26] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 2 ms to minimize.
[2025-06-02 05:25:26] [INFO ] Deduced a trap composed of 66 places in 177 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1960 variables, 20/1825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:25:26] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:25:26] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 3 ms to minimize.
[2025-06-02 05:25:27] [INFO ] Deduced a trap composed of 68 places in 150 ms of which 2 ms to minimize.
[2025-06-02 05:25:27] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 2 ms to minimize.
[2025-06-02 05:25:28] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 2 ms to minimize.
[2025-06-02 05:25:28] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 3 ms to minimize.
[2025-06-02 05:25:29] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 2 ms to minimize.
[2025-06-02 05:25:29] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:25:29] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 2 ms to minimize.
[2025-06-02 05:25:29] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 2 ms to minimize.
[2025-06-02 05:25:30] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 05:25:30] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 3 ms to minimize.
[2025-06-02 05:25:31] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 2 ms to minimize.
[2025-06-02 05:25:32] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:25:33] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:25:33] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 2 ms to minimize.
[2025-06-02 05:25:33] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 3 ms to minimize.
[2025-06-02 05:25:33] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:25:34] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:25:34] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1960 variables, 20/1845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:25:34] [INFO ] Deduced a trap composed of 69 places in 166 ms of which 3 ms to minimize.
[2025-06-02 05:25:34] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 2 ms to minimize.
[2025-06-02 05:25:35] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:25:35] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:25:35] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:25:35] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:25:35] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:25:35] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:25:37] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 3 ms to minimize.
[2025-06-02 05:25:37] [INFO ] Deduced a trap composed of 65 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:25:37] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:25:37] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:25:38] [INFO ] Deduced a trap composed of 60 places in 162 ms of which 3 ms to minimize.
[2025-06-02 05:25:39] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:25:39] [INFO ] Deduced a trap composed of 67 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:25:39] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 3 ms to minimize.
[2025-06-02 05:25:40] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 3 ms to minimize.
[2025-06-02 05:25:40] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:25:43] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 2 ms to minimize.
[2025-06-02 05:25:44] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1960 variables, 20/1865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:25:44] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:25:44] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 2 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 2 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 2 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 2 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:25:48] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 2 ms to minimize.
[2025-06-02 05:25:48] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 2 ms to minimize.
[2025-06-02 05:25:49] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 2 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 4 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:25:56] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:25:56] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:25:56] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:25:56] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 3 ms to minimize.
[2025-06-02 05:25:56] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1960 variables, 20/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 3 ms to minimize.
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 1 ms to minimize.
[2025-06-02 05:25:58] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2025-06-02 05:25:58] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:25:59] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 2 ms to minimize.
[2025-06-02 05:25:59] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
[2025-06-02 05:26:00] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 2 ms to minimize.
[2025-06-02 05:26:00] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:26:00] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:26:00] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1960/1960 variables, and 1897 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75018 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 192/192 constraints]
After SMT, in 75578ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 26 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 20 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2025-06-02 05:26:05] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:26:05] [INFO ] Invariant cache hit.
[2025-06-02 05:26:05] [INFO ] Implicit Places using invariants in 409 ms returned []
[2025-06-02 05:26:05] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:26:05] [INFO ] Invariant cache hit.
[2025-06-02 05:26:05] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:26:08] [INFO ] Implicit Places using invariants and state equation in 2721 ms returned []
Implicit Place search using SMT with State Equation took 3138 ms to find 0 implicit places.
[2025-06-02 05:26:08] [INFO ] Redundant transitions in 87 ms returned []
Running 1696 sub problems to find dead transitions.
[2025-06-02 05:26:08] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:26:08] [INFO ] Invariant cache hit.
[2025-06-02 05:26:08] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 592/592 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/615 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:26:23] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:26:24] [INFO ] Deduced a trap composed of 41 places in 255 ms of which 3 ms to minimize.
[2025-06-02 05:26:24] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:26:24] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:26:24] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:26:25] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 15 ms to minimize.
[2025-06-02 05:26:25] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:26:25] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:26:25] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:26:26] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:26:26] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 3 ms to minimize.
[2025-06-02 05:26:26] [INFO ] Deduced a trap composed of 69 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:26:26] [INFO ] Deduced a trap composed of 55 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:26:26] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 3 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/635 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:26:29] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:26:29] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 3 ms to minimize.
[2025-06-02 05:26:29] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:26:29] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:26:29] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:26:30] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:26:30] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:26:30] [INFO ] Deduced a trap composed of 83 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:26:30] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:26:31] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:26:31] [INFO ] Deduced a trap composed of 46 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:26:31] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:26:31] [INFO ] Deduced a trap composed of 76 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 98 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 69 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:26:33] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:26:33] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/655 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1960 variables, and 655 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30036 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 592/592 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/615 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 40/655 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:26:40] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:26:40] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 3 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Deduced a trap composed of 104 places in 167 ms of which 3 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 2 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 2 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Deduced a trap composed of 54 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:26:44] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:26:44] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:26:44] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:26:44] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/675 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:26:45] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:26:45] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:26:45] [INFO ] Deduced a trap composed of 62 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:26:46] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:26:46] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:26:46] [INFO ] Deduced a trap composed of 55 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:26:46] [INFO ] Deduced a trap composed of 63 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:26:46] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:26:47] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 2 ms to minimize.
[2025-06-02 05:26:47] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:26:47] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 2 ms to minimize.
[2025-06-02 05:26:47] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 3 ms to minimize.
[2025-06-02 05:26:47] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:26:48] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:26:48] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 3 ms to minimize.
[2025-06-02 05:26:48] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 2 ms to minimize.
[2025-06-02 05:26:48] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 2 ms to minimize.
[2025-06-02 05:26:48] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 2 ms to minimize.
[2025-06-02 05:26:48] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:26:49] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 20/695 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:26:50] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:26:50] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:26:50] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:26:50] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:26:50] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:26:51] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 3 ms to minimize.
[2025-06-02 05:26:51] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:26:51] [INFO ] Deduced a trap composed of 90 places in 163 ms of which 3 ms to minimize.
[2025-06-02 05:26:51] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 2 ms to minimize.
[2025-06-02 05:26:51] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 2 ms to minimize.
[2025-06-02 05:26:51] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2025-06-02 05:26:52] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 3 ms to minimize.
[2025-06-02 05:26:52] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:26:52] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:26:52] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:26:52] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 2 ms to minimize.
[2025-06-02 05:26:52] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 3 ms to minimize.
[2025-06-02 05:26:53] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 2 ms to minimize.
[2025-06-02 05:26:53] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:26:53] [INFO ] Deduced a trap composed of 69 places in 169 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 20/715 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 2 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 4 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 2 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 2 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 2 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 3 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 2 ms to minimize.
[2025-06-02 05:26:57] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:26:57] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 1 ms to minimize.
[2025-06-02 05:26:57] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2025-06-02 05:26:57] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2025-06-02 05:26:57] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:26:57] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 20/735 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:26:59] [INFO ] Deduced a trap composed of 68 places in 201 ms of which 2 ms to minimize.
[2025-06-02 05:26:59] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:26:59] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:26:59] [INFO ] Deduced a trap composed of 61 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 2 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 3 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 2 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 2 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 3 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 2 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 2 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 20/755 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:27:05] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 2 ms to minimize.
[2025-06-02 05:27:05] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:27:05] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 3 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 3 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 1 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 3 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 3 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 3 ms to minimize.
[2025-06-02 05:27:08] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:27:08] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/1960 variables, and 772 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30024 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1696 constraints, Known Traps: 157/157 constraints]
After SMT, in 60686ms problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 60701ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63964 ms. Remains : 592/592 places, 1704/1704 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[8]
Starting property specific reduction for Peterson-PT-7-UpperBounds-05
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2025-06-02 05:27:09] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:27:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-02 05:27:09] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:27:09] [INFO ] Invariant cache hit.
[2025-06-02 05:27:09] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2025-06-02 05:27:09] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2025-06-02 05:27:09] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:27:09] [INFO ] [Real]Added 497 Read/Feed constraints in 43 ms returned sat
[2025-06-02 05:27:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:27:09] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2025-06-02 05:27:10] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2025-06-02 05:27:10] [INFO ] [Nat]Added 497 Read/Feed constraints in 114 ms returned sat
[2025-06-02 05:27:10] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 4 ms to minimize.
[2025-06-02 05:27:10] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:27:10] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:27:11] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:27:11] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:27:11] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:27:11] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 45 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 56 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 2 ms to minimize.
[2025-06-02 05:27:14] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:27:14] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:27:14] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 4548 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 21 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 592/592 places, 1704/1704 transitions.
[2025-06-02 05:27:14] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:27:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2067 ms. (483 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 603 ms. (1655 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-02 05:27:17] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:27:17] [INFO ] Invariant cache hit.
[2025-06-02 05:27:17] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2025-06-02 05:27:17] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2025-06-02 05:27:17] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:27:17] [INFO ] [Real]Added 497 Read/Feed constraints in 44 ms returned sat
[2025-06-02 05:27:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:27:17] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2025-06-02 05:27:18] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2025-06-02 05:27:18] [INFO ] [Nat]Added 497 Read/Feed constraints in 108 ms returned sat
[2025-06-02 05:27:18] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:27:18] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:27:19] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:27:19] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:27:19] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:27:19] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:27:20] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:27:20] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:27:20] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:27:20] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:27:21] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:27:21] [INFO ] Deduced a trap composed of 30 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:27:21] [INFO ] Deduced a trap composed of 56 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:27:21] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 30 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:27:23] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:27:23] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 2 ms to minimize.
[2025-06-02 05:27:23] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 2 ms to minimize.
[2025-06-02 05:27:24] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:27:24] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:27:24] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 3 ms to minimize.
[2025-06-02 05:27:25] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:27:25] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 2 ms to minimize.
[2025-06-02 05:27:25] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:27:26] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:27:26] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:27:26] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:27:27] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:27:27] [INFO ] Deduced a trap composed of 75 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:27:27] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 2 ms to minimize.
[2025-06-02 05:27:27] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:27:28] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:27:28] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:27:28] [INFO ] Deduced a trap composed of 61 places in 195 ms of which 2 ms to minimize.
[2025-06-02 05:27:28] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:27:29] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:27:29] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:27:29] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:27:30] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:27:30] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:27:30] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 2 ms to minimize.
[2025-06-02 05:27:30] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:27:30] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:27:31] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:27:31] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:27:32] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:27:32] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:27:32] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:27:32] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:27:34] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 2 ms to minimize.
[2025-06-02 05:27:37] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:27:39] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 55 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:27:41] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:27:41] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 2 ms to minimize.
[2025-06-02 05:27:41] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:27:41] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 2 ms to minimize.
[2025-06-02 05:27:42] [INFO ] Deduced a trap composed of 65 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:27:42] [INFO ] Deduced a trap composed of 67 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:27:42] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:27:42] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:27:43] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:27:43] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:27:43] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:27:43] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:27:44] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:27:44] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:27:44] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 6 ms to minimize.
[2025-06-02 05:27:44] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:27:45] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:27:45] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 2 ms to minimize.
[2025-06-02 05:27:46] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 2 ms to minimize.
[2025-06-02 05:27:46] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:27:46] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:27:46] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:27:49] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:27:49] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 2 ms to minimize.
[2025-06-02 05:27:49] [INFO ] Deduced a trap composed of 57 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:27:51] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 2 ms to minimize.
[2025-06-02 05:27:56] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:27:56] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 2 ms to minimize.
[2025-06-02 05:28:00] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 42505 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 21 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 20 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2025-06-02 05:28:00] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:28:00] [INFO ] Invariant cache hit.
[2025-06-02 05:28:01] [INFO ] Implicit Places using invariants in 381 ms returned []
[2025-06-02 05:28:01] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:28:01] [INFO ] Invariant cache hit.
[2025-06-02 05:28:01] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:28:03] [INFO ] Implicit Places using invariants and state equation in 2654 ms returned []
Implicit Place search using SMT with State Equation took 3037 ms to find 0 implicit places.
[2025-06-02 05:28:04] [INFO ] Redundant transitions in 39 ms returned []
Running 1696 sub problems to find dead transitions.
[2025-06-02 05:28:04] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:28:04] [INFO ] Invariant cache hit.
[2025-06-02 05:28:04] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 592/592 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/615 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:28:19] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:28:19] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:28:20] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:28:20] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:28:20] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:28:20] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:28:20] [INFO ] Deduced a trap composed of 63 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:28:21] [INFO ] Deduced a trap composed of 60 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:28:21] [INFO ] Deduced a trap composed of 43 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:28:21] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:28:21] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:28:22] [INFO ] Deduced a trap composed of 69 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:28:22] [INFO ] Deduced a trap composed of 55 places in 232 ms of which 3 ms to minimize.
[2025-06-02 05:28:22] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:28:22] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:28:23] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 3 ms to minimize.
[2025-06-02 05:28:23] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:28:23] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:28:23] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:28:24] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/635 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:28:24] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:28:24] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:28:25] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:28:25] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:28:25] [INFO ] Deduced a trap composed of 52 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:28:25] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 83 places in 231 ms of which 3 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 98 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 69 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 3 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:28:29] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/655 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1960 variables, and 655 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30030 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 592/592 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/615 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 40/655 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:28:36] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:28:36] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:28:36] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:28:36] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:28:37] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:28:37] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:28:37] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:28:37] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:28:37] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:28:38] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:28:38] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 3 ms to minimize.
[2025-06-02 05:28:38] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:28:38] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 3 ms to minimize.
[2025-06-02 05:28:38] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:28:39] [INFO ] Deduced a trap composed of 54 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:28:39] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:28:39] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:28:39] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 2 ms to minimize.
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/675 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 62 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 3 ms to minimize.
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 55 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 64 places in 166 ms of which 2 ms to minimize.
[2025-06-02 05:28:43] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2025-06-02 05:28:43] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 3 ms to minimize.
[2025-06-02 05:28:43] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 2 ms to minimize.
[2025-06-02 05:28:43] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 2 ms to minimize.
[2025-06-02 05:28:43] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 2 ms to minimize.
[2025-06-02 05:28:44] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:28:44] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2025-06-02 05:28:44] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 2 ms to minimize.
[2025-06-02 05:28:44] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 3 ms to minimize.
[2025-06-02 05:28:44] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 20/695 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:28:45] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:28:45] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 3 ms to minimize.
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 2 ms to minimize.
[2025-06-02 05:28:47] [INFO ] Deduced a trap composed of 90 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:28:47] [INFO ] Deduced a trap composed of 88 places in 162 ms of which 2 ms to minimize.
[2025-06-02 05:28:47] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 2 ms to minimize.
[2025-06-02 05:28:47] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:28:47] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 2 ms to minimize.
[2025-06-02 05:28:47] [INFO ] Deduced a trap composed of 61 places in 160 ms of which 3 ms to minimize.
[2025-06-02 05:28:48] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:28:48] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:28:48] [INFO ] Deduced a trap composed of 62 places in 164 ms of which 3 ms to minimize.
[2025-06-02 05:28:48] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 2 ms to minimize.
[2025-06-02 05:28:48] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 2 ms to minimize.
[2025-06-02 05:28:48] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 3 ms to minimize.
[2025-06-02 05:28:49] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 20/715 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:28:50] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:28:50] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:28:50] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:28:50] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:28:51] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:28:51] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:28:51] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:28:51] [INFO ] Deduced a trap composed of 70 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:28:51] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:28:51] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 2 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 2 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 3 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2025-06-02 05:28:53] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 1 ms to minimize.
[2025-06-02 05:28:53] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2025-06-02 05:28:53] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:28:53] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 20/735 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 68 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 6 ms to minimize.
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 4 ms to minimize.
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:28:56] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:28:56] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:28:56] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:28:57] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:28:57] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:28:58] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:28:58] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:28:58] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 2 ms to minimize.
[2025-06-02 05:28:58] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 2 ms to minimize.
[2025-06-02 05:28:58] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 2 ms to minimize.
[2025-06-02 05:28:59] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 2 ms to minimize.
[2025-06-02 05:28:59] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 2 ms to minimize.
[2025-06-02 05:28:59] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 3 ms to minimize.
[2025-06-02 05:28:59] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 20/755 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:29:01] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:29:01] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:29:01] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 1 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 3 ms to minimize.
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:29:04] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/1960 variables, and 772 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30024 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1696 constraints, Known Traps: 157/157 constraints]
After SMT, in 60617ms problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 60631ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63741 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 288 ms. (138 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
[2025-06-02 05:29:04] [INFO ] Flatten gal took : 116 ms
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
[2025-06-02 05:29:04] [INFO ] Flatten gal took : 99 ms
[2025-06-02 05:29:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17109154671009114663.gal : 9 ms
[2025-06-02 05:29:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3351533086288426824.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17109154671009114663.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3351533086288426824.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3351533086288426824.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 27
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :27 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :99 after 121
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :121 after 283
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :283 after 382
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :382 after 1622
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1622 after 2576
Interrupted probabilistic random walk after 573039 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 2
Probabilistic random walk after 573039 steps, saw 83092 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
[2025-06-02 05:29:07] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:29:07] [INFO ] Invariant cache hit.
[2025-06-02 05:29:07] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 520/528 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 520/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/536 variables, 8/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1368/1904 variables, 536/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 497/1585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 0/1585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 56/1960 variables, 56/1641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 56/1697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 7/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1960 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1704 constraints, problems are : Problem set: 0 solved, 2 unsolved in 784 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 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/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 520/528 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 520/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/536 variables, 8/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1368/1904 variables, 536/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 497/1585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 2/1587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1904 variables, 0/1587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 56/1960 variables, 56/1643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 56/1699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 7/1706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:29:09] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:29:09] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2576 after 7200
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:29:11] [INFO ] Deduced a trap composed of 45 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:29:11] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:29:11] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:29:11] [INFO ] Deduced a trap composed of 45 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:29:12] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:29:12] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:29:12] [INFO ] Deduced a trap composed of 70 places in 239 ms of which 3 ms to minimize.
[2025-06-02 05:29:13] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 3 ms to minimize.
[2025-06-02 05:29:13] [INFO ] Deduced a trap composed of 57 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:29:13] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:29:13] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 3 ms to minimize.
SMT process timed out in 6014ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 20 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 553581 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 2
Probabilistic random walk after 553581 steps, saw 81210 distinct states, run finished after 3002 ms. (steps per millisecond=184 ) properties seen :0
[2025-06-02 05:29:16] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:29:16] [INFO ] Invariant cache hit.
[2025-06-02 05:29:16] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 520/528 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 520/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/536 variables, 8/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1368/1904 variables, 536/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 497/1585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 0/1585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 56/1960 variables, 56/1641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 56/1697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 7/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1960 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1704 constraints, problems are : Problem set: 0 solved, 2 unsolved in 833 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 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/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 520/528 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 520/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/536 variables, 8/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1368/1904 variables, 536/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 497/1585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 2/1587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1904 variables, 0/1587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 56/1960 variables, 56/1643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 56/1699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 7/1706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:29:18] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:29:19] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:29:19] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7200 after 16545
[2025-06-02 05:29:19] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:29:19] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:29:20] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:29:20] [INFO ] Deduced a trap composed of 45 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:29:20] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:29:20] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 3 ms to minimize.
[2025-06-02 05:29:21] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:29:21] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:29:21] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:29:21] [INFO ] Deduced a trap composed of 70 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:29:22] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:29:22] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:29:22] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:29:23] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:29:23] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:29:23] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:29:23] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1960 variables, 20/1726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 61 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:29:25] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:29:25] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:29:25] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:29:25] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 4 ms to minimize.
Problem MAX0 is UNSAT
[2025-06-02 05:29:26] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:29:26] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:29:26] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:29:27] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:29:27] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:29:27] [INFO ] Deduced a trap composed of 57 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:29:27] [INFO ] Deduced a trap composed of 79 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:29:28] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:29:28] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:29:28] [INFO ] Deduced a trap composed of 57 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:29:28] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:29:29] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/1960 variables, 20/1746 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:29:29] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 3 ms to minimize.
[2025-06-02 05:29:29] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:29:29] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:29:30] [INFO ] Deduced a trap composed of 77 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:29:30] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:29:30] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:29:30] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:29:31] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:29:31] [INFO ] Deduced a trap composed of 68 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:29:31] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:29:31] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:29:32] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:29:32] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:29:32] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
[2025-06-02 05:29:32] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 3 ms to minimize.
SDD size :16545 after 73802
[2025-06-02 05:29:33] [INFO ] Deduced a trap composed of 60 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:29:33] [INFO ] Deduced a trap composed of 61 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:29:33] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:29:33] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 2 ms to minimize.
[2025-06-02 05:29:33] [INFO ] Deduced a trap composed of 70 places in 196 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1960 variables, 20/1766 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:29:34] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:29:34] [INFO ] Deduced a trap composed of 61 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:29:34] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:29:34] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:29:35] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:29:35] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:29:35] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:29:35] [INFO ] Deduced a trap composed of 69 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:29:36] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 2 ms to minimize.
[2025-06-02 05:29:36] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:29:36] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:29:36] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 2 ms to minimize.
[2025-06-02 05:29:37] [INFO ] Deduced a trap composed of 82 places in 184 ms of which 2 ms to minimize.
[2025-06-02 05:29:37] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 2 ms to minimize.
[2025-06-02 05:29:37] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:29:37] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:29:37] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 2 ms to minimize.
[2025-06-02 05:29:38] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:29:38] [INFO ] Deduced a trap composed of 69 places in 191 ms of which 2 ms to minimize.
[2025-06-02 05:29:38] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1960 variables, 20/1786 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:29:38] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:29:39] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:29:39] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 3 ms to minimize.
[2025-06-02 05:29:39] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 2 ms to minimize.
[2025-06-02 05:29:39] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:29:40] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 2 ms to minimize.
[2025-06-02 05:29:40] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:29:40] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 2 ms to minimize.
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 70 places in 161 ms of which 3 ms to minimize.
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 68 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:29:42] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:29:42] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 2 ms to minimize.
[2025-06-02 05:29:42] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:29:42] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 2 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 2 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 3 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1960 variables, 20/1806 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:29:44] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 2 ms to minimize.
[2025-06-02 05:29:44] [INFO ] Deduced a trap composed of 81 places in 188 ms of which 2 ms to minimize.
[2025-06-02 05:29:44] [INFO ] Deduced a trap composed of 79 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:29:44] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 2 ms to minimize.
[2025-06-02 05:29:45] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:29:45] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:29:45] [INFO ] Deduced a trap composed of 70 places in 159 ms of which 2 ms to minimize.
[2025-06-02 05:29:45] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 1 ms to minimize.
[2025-06-02 05:29:46] [INFO ] Deduced a trap composed of 69 places in 151 ms of which 2 ms to minimize.
[2025-06-02 05:29:46] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:29:47] [INFO ] Deduced a trap composed of 52 places in 175 ms of which 2 ms to minimize.
[2025-06-02 05:29:47] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 2 ms to minimize.
[2025-06-02 05:29:47] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:29:47] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 2 ms to minimize.
[2025-06-02 05:29:48] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 2 ms to minimize.
[2025-06-02 05:29:48] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:29:48] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 2 ms to minimize.
[2025-06-02 05:29:49] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2025-06-02 05:29:49] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:29:49] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1960 variables, 20/1826 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:29:49] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:29:50] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 1 ms to minimize.
[2025-06-02 05:29:52] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:29:52] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 1 ms to minimize.
[2025-06-02 05:29:52] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:29:52] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2025-06-02 05:29:52] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2025-06-02 05:29:53] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:29:53] [INFO ] Deduced a trap composed of 63 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:29:53] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 2 ms to minimize.
[2025-06-02 05:29:54] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 2 ms to minimize.
[2025-06-02 05:29:54] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 2 ms to minimize.
[2025-06-02 05:29:54] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 2 ms to minimize.
[2025-06-02 05:29:54] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 2 ms to minimize.
[2025-06-02 05:29:54] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2025-06-02 05:29:54] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 05:29:55] [INFO ] Flatten gal took : 41 ms
[2025-06-02 05:29:55] [INFO ] Applying decomposition
[2025-06-02 05:29:55] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 35 ms to minimize.
[2025-06-02 05:29:55] [INFO ] Flatten gal took : 72 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/graph7900769998510376288.txt' '-o' '/tmp/graph7900769998510376288.bin' '-w' '/tmp/graph7900769998510376288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7900769998510376288.bin' '-l' '-1' '-v' '-w' '/tmp/graph7900769998510376288.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:29:55] [INFO ] Decomposing Gal with order
[2025-06-02 05:29:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:29:55] [INFO ] Removed a total of 2624 redundant transitions.
[2025-06-02 05:29:55] [INFO ] Flatten gal took : 97 ms
[2025-06-02 05:29:55] [INFO ] Deduced a trap composed of 53 places in 355 ms of which 2 ms to minimize.
[2025-06-02 05:29:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 430 labels/synchronizations in 45 ms.
[2025-06-02 05:29:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12693953007709261710.gal : 14 ms
[2025-06-02 05:29:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13305598606271641512.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12693953007709261710.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13305598606271641512.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
[2025-06-02 05:29:55] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 2 ms to minimize.
Loading property file /tmp/ReachabilityCardinality13305598606271641512.prop.
[2025-06-02 05:29:55] [INFO ] Deduced a trap composed of 60 places in 258 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1960 variables, 20/1846 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 2 ms to minimize.
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 31
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :31 after 35
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :35 after 60
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :60 after 230
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :230 after 542
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 2 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 2 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :542 after 1277
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1277 after 5547
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5547 after 13347
[2025-06-02 05:29:59] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 2 ms to minimize.
[2025-06-02 05:29:59] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:29:59] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 2 ms to minimize.
[2025-06-02 05:30:01] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 2 ms to minimize.
[2025-06-02 05:30:02] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :13347 after 42133
[2025-06-02 05:30:02] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:30:02] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1960/1960 variables, and 1862 constraints, problems are : Problem set: 1 solved, 1 unsolved in 45016 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 156/156 constraints]
After SMT, in 45864ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 27 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 763353 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :0 out of 1
Probabilistic random walk after 763353 steps, saw 103729 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
[2025-06-02 05:30:05] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:30:05] [INFO ] Invariant cache hit.
[2025-06-02 05:30:05] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 520/528 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 520/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/536 variables, 8/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1368/1904 variables, 536/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 497/1585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 0/1585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 56/1960 variables, 56/1641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 56/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 7/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1960 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 520/528 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 520/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/536 variables, 8/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1368/1904 variables, 536/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 497/1585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 1/1586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1904 variables, 0/1586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 56/1960 variables, 56/1642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 56/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 7/1705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:30:07] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:30:07] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:30:07] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:30:07] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:30:08] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 3 ms to minimize.
[2025-06-02 05:30:08] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:30:08] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:30:09] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:30:09] [INFO ] Deduced a trap composed of 43 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:30:09] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:30:09] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:30:11] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:30:11] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:30:11] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 2 ms to minimize.
[2025-06-02 05:30:11] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:30:12] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1960 variables, 20/1725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:30:12] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 3 ms to minimize.
[2025-06-02 05:30:12] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:30:13] [INFO ] Deduced a trap composed of 61 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:30:13] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:30:13] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:30:13] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 59 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:30:15] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:30:15] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:30:15] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
[2025-06-02 05:30:15] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 3 ms to minimize.
SDD size :42133 after 96121
[2025-06-02 05:30:16] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:30:16] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:30:16] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:30:16] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:30:17] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 2 ms to minimize.
[2025-06-02 05:30:17] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1960 variables, 20/1745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:30:17] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 2 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 68 places in 202 ms of which 2 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:30:19] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:30:19] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:30:19] [INFO ] Deduced a trap composed of 70 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:30:19] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:30:20] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:30:20] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:30:20] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:30:20] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:30:21] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 2 ms to minimize.
[2025-06-02 05:30:21] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:30:21] [INFO ] Deduced a trap composed of 93 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:30:21] [INFO ] Deduced a trap composed of 43 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:30:22] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 2 ms to minimize.
[2025-06-02 05:30:22] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:30:22] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1960 variables, 20/1765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:30:23] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:30:23] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:30:23] [INFO ] Deduced a trap composed of 80 places in 200 ms of which 2 ms to minimize.
[2025-06-02 05:30:23] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 33 places in 204 ms of which 2 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:30:25] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:30:25] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 2 ms to minimize.
[2025-06-02 05:30:25] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 2 ms to minimize.
[2025-06-02 05:30:27] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:30:27] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 2 ms to minimize.
[2025-06-02 05:30:28] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:30:29] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:30:29] [INFO ] Deduced a trap composed of 69 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:30:29] [INFO ] Deduced a trap composed of 68 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:30:30] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 2 ms to minimize.
[2025-06-02 05:30:30] [INFO ] Deduced a trap composed of 82 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:30:30] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1960 variables, 20/1785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:30:30] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:30:30] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:30:31] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :96121 after 331734
[2025-06-02 05:30:32] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 3 ms to minimize.
[2025-06-02 05:30:33] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 2 ms to minimize.
[2025-06-02 05:30:33] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:30:34] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:30:34] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:30:34] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:30:34] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:30:34] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:30:35] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 8 ms to minimize.
[2025-06-02 05:30:35] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:30:35] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:30:35] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:30:36] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:30:36] [INFO ] Deduced a trap composed of 70 places in 156 ms of which 2 ms to minimize.
[2025-06-02 05:30:36] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 2 ms to minimize.
[2025-06-02 05:30:36] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 2 ms to minimize.
[2025-06-02 05:30:36] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1960 variables, 20/1805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:30:37] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 2 ms to minimize.
[2025-06-02 05:30:37] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 2 ms to minimize.
[2025-06-02 05:30:37] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 2 ms to minimize.
[2025-06-02 05:30:38] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:30:38] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:30:38] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 2 ms to minimize.
[2025-06-02 05:30:38] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:30:39] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 3 ms to minimize.
[2025-06-02 05:30:39] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 2 ms to minimize.
[2025-06-02 05:30:39] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 3 ms to minimize.
[2025-06-02 05:30:39] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 2 ms to minimize.
[2025-06-02 05:30:40] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 2 ms to minimize.
[2025-06-02 05:30:40] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:30:40] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:30:40] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:30:41] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:30:41] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:30:41] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2025-06-02 05:30:42] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 2 ms to minimize.
[2025-06-02 05:30:42] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1960 variables, 20/1825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:30:42] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 3 ms to minimize.
[2025-06-02 05:30:42] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 2 ms to minimize.
[2025-06-02 05:30:43] [INFO ] Deduced a trap composed of 68 places in 153 ms of which 2 ms to minimize.
[2025-06-02 05:30:43] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 3 ms to minimize.
[2025-06-02 05:30:44] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 2 ms to minimize.
[2025-06-02 05:30:44] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:30:45] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 3 ms to minimize.
[2025-06-02 05:30:45] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 05:30:45] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 2 ms to minimize.
[2025-06-02 05:30:46] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 2 ms to minimize.
[2025-06-02 05:30:46] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:30:46] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 2 ms to minimize.
[2025-06-02 05:30:47] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:30:48] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:30:49] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:30:49] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:30:49] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 2 ms to minimize.
[2025-06-02 05:30:50] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:30:50] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:30:50] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1960 variables, 20/1845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:30:51] [INFO ] Deduced a trap composed of 69 places in 174 ms of which 2 ms to minimize.
[2025-06-02 05:30:51] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 2 ms to minimize.
[2025-06-02 05:30:51] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 9 ms to minimize.
[2025-06-02 05:30:51] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:30:51] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:30:51] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:30:52] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:30:52] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 3 ms to minimize.
[2025-06-02 05:30:53] [INFO ] Deduced a trap composed of 70 places in 161 ms of which 3 ms to minimize.
[2025-06-02 05:30:53] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 2 ms to minimize.
[2025-06-02 05:30:54] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 2 ms to minimize.
[2025-06-02 05:30:54] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 2 ms to minimize.
[2025-06-02 05:30:54] [INFO ] Deduced a trap composed of 60 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:30:55] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 2 ms to minimize.
[2025-06-02 05:30:56] [INFO ] Deduced a trap composed of 67 places in 162 ms of which 3 ms to minimize.
[2025-06-02 05:30:56] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 2 ms to minimize.
[2025-06-02 05:30:56] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:30:57] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:31:00] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:31:00] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1960 variables, 20/1865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:31:00] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:31:01] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:31:02] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 2 ms to minimize.
[2025-06-02 05:31:03] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 3 ms to minimize.
[2025-06-02 05:31:03] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 2 ms to minimize.
[2025-06-02 05:31:03] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:31:03] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:31:03] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:31:04] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:31:05] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 3 ms to minimize.
[2025-06-02 05:31:05] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:31:05] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:31:08] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:31:10] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 2 ms to minimize.
[2025-06-02 05:31:10] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:31:12] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:31:12] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:31:13] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:31:13] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2025-06-02 05:31:13] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1960 variables, 20/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:31:13] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 3 ms to minimize.
[2025-06-02 05:31:13] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 2 ms to minimize.
[2025-06-02 05:31:14] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:31:14] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2025-06-02 05:31:14] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:31:15] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 1 ms to minimize.
[2025-06-02 05:31:15] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2025-06-02 05:31:15] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2025-06-02 05:31:16] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 2 ms to minimize.
[2025-06-02 05:31:17] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:31:17] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 3 ms to minimize.
[2025-06-02 05:31:17] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1960/1960 variables, and 1897 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75015 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 192/192 constraints]
After SMT, in 75506ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 27 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 19 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2025-06-02 05:31:21] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:31:21] [INFO ] Invariant cache hit.
[2025-06-02 05:31:21] [INFO ] Implicit Places using invariants in 349 ms returned []
[2025-06-02 05:31:21] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:31:21] [INFO ] Invariant cache hit.
[2025-06-02 05:31:22] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:31:24] [INFO ] Implicit Places using invariants and state equation in 2493 ms returned []
Implicit Place search using SMT with State Equation took 2843 ms to find 0 implicit places.
[2025-06-02 05:31:24] [INFO ] Redundant transitions in 28 ms returned []
Running 1696 sub problems to find dead transitions.
[2025-06-02 05:31:24] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:31:24] [INFO ] Invariant cache hit.
[2025-06-02 05:31:24] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 592/592 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/615 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:31:39] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 5 ms to minimize.
[2025-06-02 05:31:40] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:31:40] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:31:40] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:31:40] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:31:40] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:31:41] [INFO ] Deduced a trap composed of 63 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:31:41] [INFO ] Deduced a trap composed of 60 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:31:41] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:31:41] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:31:42] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:31:42] [INFO ] Deduced a trap composed of 69 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:31:42] [INFO ] Deduced a trap composed of 55 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:31:42] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:31:43] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:31:43] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:31:43] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:31:43] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 3 ms to minimize.
[2025-06-02 05:31:44] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:31:44] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/635 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:31:44] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:31:45] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:31:45] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 3 ms to minimize.
[2025-06-02 05:31:45] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:31:45] [INFO ] Deduced a trap composed of 52 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 83 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 76 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 98 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:31:48] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:31:48] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:31:48] [INFO ] Deduced a trap composed of 69 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:31:48] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:31:49] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:31:49] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/655 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1960 variables, and 655 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30023 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 592/592 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/615 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 40/655 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:31:56] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:31:56] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:31:57] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:31:57] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:31:57] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:31:57] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:31:57] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:31:58] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:31:58] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:31:58] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:31:58] [INFO ] Deduced a trap composed of 61 places in 163 ms of which 3 ms to minimize.
[2025-06-02 05:31:58] [INFO ] Deduced a trap composed of 104 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:31:59] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:31:59] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 4 ms to minimize.
[2025-06-02 05:31:59] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:31:59] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:32:00] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:32:00] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:32:00] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:32:00] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/675 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:32:01] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:32:01] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:32:01] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:32:01] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:32:02] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:32:02] [INFO ] Deduced a trap composed of 55 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:32:02] [INFO ] Deduced a trap composed of 63 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:32:02] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:32:03] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 2 ms to minimize.
[2025-06-02 05:32:03] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 2 ms to minimize.
[2025-06-02 05:32:03] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:32:03] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 3 ms to minimize.
[2025-06-02 05:32:03] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 3 ms to minimize.
[2025-06-02 05:32:04] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:32:04] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:32:04] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 3 ms to minimize.
[2025-06-02 05:32:04] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 2 ms to minimize.
[2025-06-02 05:32:04] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 2 ms to minimize.
[2025-06-02 05:32:04] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:32:05] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 20/695 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:32:06] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:32:06] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:32:06] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 4 ms to minimize.
[2025-06-02 05:32:06] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:32:06] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 2 ms to minimize.
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 3 ms to minimize.
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 90 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 88 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 3 ms to minimize.
[2025-06-02 05:32:08] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 2 ms to minimize.
[2025-06-02 05:32:08] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 2 ms to minimize.
[2025-06-02 05:32:08] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:32:08] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 3 ms to minimize.
[2025-06-02 05:32:08] [INFO ] Deduced a trap composed of 62 places in 157 ms of which 2 ms to minimize.
[2025-06-02 05:32:08] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 2 ms to minimize.
[2025-06-02 05:32:09] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 2 ms to minimize.
[2025-06-02 05:32:09] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 2 ms to minimize.
[2025-06-02 05:32:09] [INFO ] Deduced a trap composed of 69 places in 167 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 20/715 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:32:10] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:32:10] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:32:10] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:32:11] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:32:11] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:32:11] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 3 ms to minimize.
[2025-06-02 05:32:11] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 2 ms to minimize.
[2025-06-02 05:32:11] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 3 ms to minimize.
[2025-06-02 05:32:12] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 2 ms to minimize.
[2025-06-02 05:32:12] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 2 ms to minimize.
[2025-06-02 05:32:12] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:32:12] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 3 ms to minimize.
[2025-06-02 05:32:12] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 2 ms to minimize.
[2025-06-02 05:32:12] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 2 ms to minimize.
[2025-06-02 05:32:13] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:32:13] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 1 ms to minimize.
[2025-06-02 05:32:13] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 1 ms to minimize.
[2025-06-02 05:32:13] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 1 ms to minimize.
[2025-06-02 05:32:13] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:32:13] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 20/735 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:32:15] [INFO ] Deduced a trap composed of 68 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:32:15] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:32:15] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:32:15] [INFO ] Deduced a trap composed of 61 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:32:16] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:32:16] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:32:16] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:32:16] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:32:17] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:32:17] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:32:17] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:32:18] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:32:18] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 2 ms to minimize.
[2025-06-02 05:32:18] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 2 ms to minimize.
[2025-06-02 05:32:18] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 3 ms to minimize.
[2025-06-02 05:32:19] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 2 ms to minimize.
[2025-06-02 05:32:19] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 2 ms to minimize.
[2025-06-02 05:32:19] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 3 ms to minimize.
[2025-06-02 05:32:19] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 2 ms to minimize.
[2025-06-02 05:32:19] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 20/755 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:32:21] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 2 ms to minimize.
[2025-06-02 05:32:21] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:32:22] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:32:22] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:32:22] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:32:22] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:32:22] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
[2025-06-02 05:32:22] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:32:22] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 2 ms to minimize.
[2025-06-02 05:32:23] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:32:23] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 2 ms to minimize.
[2025-06-02 05:32:23] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 2 ms to minimize.
[2025-06-02 05:32:23] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:32:23] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:32:23] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2025-06-02 05:32:24] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:32:24] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 1)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 1)
(s458 1)
(s459 1)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/1960 variables, and 772 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30027 ms.
Refiners :[Domain max(s): 592/592 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1696 constraints, Known Traps: 157/157 constraints]
After SMT, in 60616ms problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 60641ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63543 ms. Remains : 592/592 places, 1704/1704 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[8]
Ending property specific reduction for Peterson-PT-7-UpperBounds-05 in 315883 ms.
[2025-06-02 05:32:25] [INFO ] Flatten gal took : 40 ms
[2025-06-02 05:32:25] [INFO ] Applying decomposition
[2025-06-02 05:32:25] [INFO ] Flatten gal took : 40 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/graph8815313364644724117.txt' '-o' '/tmp/graph8815313364644724117.bin' '-w' '/tmp/graph8815313364644724117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8815313364644724117.bin' '-l' '-1' '-v' '-w' '/tmp/graph8815313364644724117.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:32:25] [INFO ] Decomposing Gal with order
[2025-06-02 05:32:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:32:25] [INFO ] Removed a total of 2496 redundant transitions.
[2025-06-02 05:32:25] [INFO ] Flatten gal took : 96 ms
[2025-06-02 05:32:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 920 labels/synchronizations in 75 ms.
[2025-06-02 05:32:25] [INFO ] Time to serialize gal into /tmp/UpperBounds10892135051320631763.gal : 92 ms
[2025-06-02 05:32:25] [INFO ] Time to serialize properties into /tmp/UpperBounds11303101517007264287.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10892135051320631763.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11303101517007264287.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 ...306
Loading property file /tmp/UpperBounds11303101517007264287.prop.
ITS-tools command line returned an error code 137
[2025-06-02 05:42:07] [INFO ] Applying decomposition
[2025-06-02 05:42:07] [INFO ] Flatten gal took : 38 ms
[2025-06-02 05:42:07] [INFO ] Decomposing Gal with order
[2025-06-02 05:42:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:42:07] [INFO ] Removed a total of 2098 redundant transitions.
[2025-06-02 05:42:07] [INFO ] Flatten gal took : 200 ms
[2025-06-02 05:42:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 966 labels/synchronizations in 38 ms.
[2025-06-02 05:42:07] [INFO ] Time to serialize gal into /tmp/UpperBounds10244897743036817455.gal : 9 ms
[2025-06-02 05:42:07] [INFO ] Time to serialize properties into /tmp/UpperBounds1329793752068886443.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/UpperBounds10244897743036817455.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1329793752068886443.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 ...305
Loading property file /tmp/UpperBounds1329793752068886443.prop.
ITS-tools command line returned an error code 137
[2025-06-02 05:51:18] [INFO ] Flatten gal took : 49 ms
[2025-06-02 05:51:18] [INFO ] Input system was already deterministic with 1704 transitions.
[2025-06-02 05:51:18] [INFO ] Transformed 592 places.
[2025-06-02 05:51:18] [INFO ] Transformed 1704 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 05:51:18] [INFO ] Time to serialize gal into /tmp/UpperBounds5561257264107597033.gal : 6 ms
[2025-06-02 05:51:18] [INFO ] Time to serialize properties into /tmp/UpperBounds12196038363507502977.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/UpperBounds5561257264107597033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12196038363507502977.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds12196038363507502977.prop.
ITS-tools command line returned an error code 137
Total runtime 2475978 ms.

BK_STOP 1748844070537

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

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 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 ;