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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 92K 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 PolyORBNT-COL-S10J20-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748896461204

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 20:34:22] [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 20:34:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:34:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 20:34:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 20:34:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 594 ms
[2025-06-02 20:34:23] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2025-06-02 20:34:23] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2025-06-02 20:34:23] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2025-06-02 20:34:23] [INFO ] Computed 13 invariants in 17 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 10, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 21] Max Struct:[+inf, 10, +inf, 2, 1, 1, 10, 10, +inf, +inf, +inf, 10, 4, 1, 3, 21]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-15 21 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 20:34:23] [INFO ] Invariant cache hit.
[2025-06-02 20:34:23] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 20:34:23] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2025-06-02 20:34:23] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 20:34:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:34:23] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:34:23] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 16 ms to minimize.
[2025-06-02 20:34:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:23] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:34:23] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 20:34:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:34:23] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2025-06-02 20:34:23] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2025-06-02 20:34:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2025-06-02 20:34:23] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 20:34:24] [INFO ] Added : 36 causal constraints over 8 iterations in 121 ms. Result :sat
Minimization took 29 ms.
[2025-06-02 20:34:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Real]Added 1 Read/Feed constraints in 10 ms returned sat
[2025-06-02 20:34:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:34:24] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2025-06-02 20:34:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2025-06-02 20:34:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:34:24] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2025-06-02 20:34:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2025-06-02 20:34:24] [INFO ] Added : 36 causal constraints over 8 iterations in 98 ms. Result :sat
Minimization took 146 ms.
[2025-06-02 20:34:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2025-06-02 20:34:24] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-02 20:34:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:34:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 20:34:24] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2025-06-02 20:34:24] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2025-06-02 20:34:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2025-06-02 20:34:24] [INFO ] Added : 20 causal constraints over 4 iterations in 202 ms. Result :sat
Minimization took 115 ms.
[2025-06-02 20:34:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:34:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:34:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:34:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:34:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:34:25] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-06-02 20:34:25] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2025-06-02 20:34:25] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
[2025-06-02 20:34:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 117 ms
[2025-06-02 20:34:25] [INFO ] Added : 36 causal constraints over 8 iterations in 162 ms. Result :sat
Minimization took 20 ms.
[2025-06-02 20:34:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:34:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-02 20:34:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 20:34:25] [INFO ] Added : 21 causal constraints over 5 iterations in 315 ms. Result :sat
Minimization took 186 ms.
[2025-06-02 20:34:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:34:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:34:25] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2025-06-02 20:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2025-06-02 20:34:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 20:34:26] [INFO ] Added : 11 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 120 ms.
[2025-06-02 20:34:26] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:34:26] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2025-06-02 20:34:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:34:26] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2025-06-02 20:34:26] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2025-06-02 20:34:26] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2025-06-02 20:34:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 100 ms
[2025-06-02 20:34:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:34:26] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2025-06-02 20:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-06-02 20:34:26] [INFO ] Added : 36 causal constraints over 8 iterations in 86 ms. Result :sat
Minimization took 19 ms.
[2025-06-02 20:34:26] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:34:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:34:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:34:26] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 14 ms.
[2025-06-02 20:34:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2025-06-02 20:34:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 20:34:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:34:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:34:26] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 27 ms.
[2025-06-02 20:34:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:34:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:34:26] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2025-06-02 20:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2025-06-02 20:34:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:34:27] [INFO ] Added : 20 causal constraints over 4 iterations in 202 ms. Result :sat
Minimization took 27 ms.
[2025-06-02 20:34:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:34:27] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 20:34:27] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:34:27] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2025-06-02 20:34:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:34:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:34:27] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-02 20:34:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:34:27] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2025-06-02 20:34:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2025-06-02 20:34:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:34:27] [INFO ] Added : 36 causal constraints over 8 iterations in 46 ms. Result :sat
Minimization took 31 ms.
[2025-06-02 20:34:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:34:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:34:27] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-02 20:34:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:34:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:34:27] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:34:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 71 ms returned sat
[2025-06-02 20:34:27] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2025-06-02 20:34:27] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2025-06-02 20:34:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2025-06-02 20:34:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:34:27] [INFO ] Added : 21 causal constraints over 5 iterations in 23 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 10, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, 10, 10, 2, 1, 10, 10, +inf, +inf, 1, 10, 4, 1, 3]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-02 20:34:28] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 228 ms.
[2025-06-02 20:34:28] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 26 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 10, 2, 1, 10, 10, +inf, +inf, 10, 4, 1, 3]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 10, 2, 1, 10, 10, +inf, +inf, 10, 4, 1, 3]
[2025-06-02 20:34:28] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2025-06-02 20:34:28] [INFO ] Computed 72 invariants in 84 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 10, 2, 1, 10, 10, 11, 11, 10, 4, 1, 3]
RANDOM walk for 10000 steps (559 resets) in 251 ms. (39 steps per ms)
FORMULA PolyORBNT-COL-S10J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (938 resets) in 258 ms. (347 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[11, 10, 2, 10, 10, 11, 11, 4, 3]
[2025-06-02 20:34:28] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2025-06-02 20:34:28] [INFO ] Invariant cache hit.
[2025-06-02 20:34:28] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 20:34:28] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-02 20:34:29] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2025-06-02 20:34:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:34:29] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2025-06-02 20:34:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:29] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2025-06-02 20:34:29] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-02 20:34:29] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2025-06-02 20:34:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 155 ms returned sat
[2025-06-02 20:34:30] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 198 ms.
[2025-06-02 20:34:31] [INFO ] Deduced a trap composed of 69 places in 399 ms of which 3 ms to minimize.
[2025-06-02 20:34:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 664 ms
[2025-06-02 20:34:31] [INFO ] Added : 23 causal constraints over 5 iterations in 1374 ms. Result :sat
Minimization took 677 ms.
[2025-06-02 20:34:32] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2025-06-02 20:34:32] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-02 20:34:32] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2025-06-02 20:34:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 20:34:32] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-02 20:34:33] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2025-06-02 20:34:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 119 ms returned sat
[2025-06-02 20:34:33] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 342 ms.
[2025-06-02 20:34:34] [INFO ] Added : 11 causal constraints over 3 iterations in 643 ms. Result :sat
Minimization took 676 ms.
[2025-06-02 20:34:34] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 20:34:34] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-02 20:34:35] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2025-06-02 20:34:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2025-06-02 20:34:35] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-02 20:34:37] [INFO ] [Nat]Absence check using state equation in 1775 ms returned unknown
[2025-06-02 20:34:37] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 20:34:37] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-02 20:34:37] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2025-06-02 20:34:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:37] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2025-06-02 20:34:37] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-02 20:34:38] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2025-06-02 20:34:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 87 ms returned sat
[2025-06-02 20:34:38] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 117 ms.
[2025-06-02 20:34:38] [INFO ] Added : 6 causal constraints over 2 iterations in 335 ms. Result :sat
Minimization took 675 ms.
[2025-06-02 20:34:39] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2025-06-02 20:34:39] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-02 20:34:40] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2025-06-02 20:34:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:40] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 20:34:40] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-02 20:34:40] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2025-06-02 20:34:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 148 ms returned sat
[2025-06-02 20:34:41] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 118 ms.
[2025-06-02 20:34:41] [INFO ] Added : 7 causal constraints over 2 iterations in 346 ms. Result :sat
Minimization took 670 ms.
[2025-06-02 20:34:42] [INFO ] [Real]Absence check using 65 positive place invariants in 25 ms returned sat
[2025-06-02 20:34:42] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 14 ms returned sat
[2025-06-02 20:34:42] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2025-06-02 20:34:42] [INFO ] [Real]Added 1 Read/Feed constraints in 21 ms returned sat
[2025-06-02 20:34:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:42] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2025-06-02 20:34:42] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-02 20:34:43] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2025-06-02 20:34:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 154 ms returned sat
[2025-06-02 20:34:43] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 120 ms.
[2025-06-02 20:34:44] [INFO ] Deduced a trap composed of 19 places in 419 ms of which 3 ms to minimize.
[2025-06-02 20:34:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 618 ms
[2025-06-02 20:34:44] [INFO ] Added : 33 causal constraints over 7 iterations in 1412 ms. Result :sat
Minimization took 657 ms.
[2025-06-02 20:34:45] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 20:34:45] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned unsat
[2025-06-02 20:34:45] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 20:34:45] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-02 20:34:46] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2025-06-02 20:34:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:46] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2025-06-02 20:34:46] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-02 20:34:46] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2025-06-02 20:34:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 81 ms returned sat
[2025-06-02 20:34:46] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 102 ms.
[2025-06-02 20:34:47] [INFO ] Added : 12 causal constraints over 3 iterations in 378 ms. Result :sat
Minimization took 670 ms.
[2025-06-02 20:34:47] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2025-06-02 20:34:47] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-02 20:34:48] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2025-06-02 20:34:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:48] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-02 20:34:48] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-02 20:34:49] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2025-06-02 20:34:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 57 ms returned sat
[2025-06-02 20:34:49] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 116 ms.
[2025-06-02 20:34:49] [INFO ] Deduced a trap composed of 218 places in 376 ms of which 3 ms to minimize.
[2025-06-02 20:34:50] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 919 ms
Maximisation of solution failed !
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[11, 10, 2, 10, 10, 11, 1, 4, 3]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 10, 2, 10, 10, 11, 4, 3]
Support contains 17 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 464 transition count 1627
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 57 place count 441 transition count 1626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 440 transition count 1626
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 58 place count 440 transition count 1602
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 106 place count 416 transition count 1602
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 415 transition count 1601
Applied a total of 108 rules in 259 ms. Remains 415 /474 variables (removed 59) and now considering 1601/1650 (removed 49) transitions.
Running 1590 sub problems to find dead transitions.
[2025-06-02 20:34:53] [INFO ] Flow matrix only has 1592 transitions (discarded 9 similar events)
// Phase 1: matrix 1592 rows 415 cols
[2025-06-02 20:34:53] [INFO ] Computed 62 invariants in 52 ms
[2025-06-02 20:34:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/2007 variables, and 52 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/415 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1590/590 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
[2025-06-02 20:35:29] [INFO ] Deduced a trap composed of 23 places in 293 ms of which 1 ms to minimize.
[2025-06-02 20:35:31] [INFO ] Deduced a trap composed of 10 places in 363 ms of which 3 ms to minimize.
[2025-06-02 20:35:34] [INFO ] Deduced a trap composed of 18 places in 376 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
[2025-06-02 20:35:47] [INFO ] Deduced a trap composed of 102 places in 161 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/2007 variables, and 56 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/415 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/590 constraints, Known Traps: 4/4 constraints]
After SMT, in 54802ms problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 54835ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55119 ms. Remains : 415/474 places, 1601/1650 transitions.
[2025-06-02 20:35:48] [INFO ] Flow matrix only has 1592 transitions (discarded 9 similar events)
[2025-06-02 20:35:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 10, 2, 10, 10, 11, 4, 3]
RANDOM walk for 1000000 steps (68687 resets) in 14180 ms. (70 steps per ms)
FORMULA PolyORBNT-COL-S10J20-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000005 steps (44595 resets) in 11352 ms. (440 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 4, 4, 3, 1] Max Struct:[11, 10, 10, 10, 11]
[2025-06-02 20:36:13] [INFO ] Flow matrix only has 1592 transitions (discarded 9 similar events)
[2025-06-02 20:36:13] [INFO ] Invariant cache hit.
[2025-06-02 20:36:14] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned unsat
[2025-06-02 20:36:14] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2025-06-02 20:36:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:14] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Nat]Absence check using state equation in 1254 ms returned unsat
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned unsat
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2025-06-02 20:36:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:16] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2025-06-02 20:36:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:36:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 75 ms returned sat
[2025-06-02 20:36:17] [INFO ] Deduced a trap composed of 84 places in 371 ms of which 2 ms to minimize.
[2025-06-02 20:36:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 493 ms
[2025-06-02 20:36:17] [INFO ] Computed and/alt/rep : 1259/4773/1259 causal constraints (skipped 322 transitions) in 102 ms.
[2025-06-02 20:36:17] [INFO ] Added : 11 causal constraints over 3 iterations in 444 ms. Result :sat
Minimization took 1623 ms.
[2025-06-02 20:36:19] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2025-06-02 20:36:19] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 4, 4, 3, 1] Max Struct:[1, 4, 4, 10, 1]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1601/1601 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 415 transition count 1599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 413 transition count 1599
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 411 transition count 1597
Applied a total of 8 rules in 84 ms. Remains 411 /415 variables (removed 4) and now considering 1597/1601 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 411/415 places, 1597/1601 transitions.
[2025-06-02 20:36:19] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
// Phase 1: matrix 1588 rows 411 cols
[2025-06-02 20:36:19] [INFO ] Computed 62 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (70359 resets) in 13807 ms. (72 steps per ms)
BEST_FIRST walk for 1000001 steps (9647 resets) in 2297 ms. (435 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2025-06-02 20:36:35] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-02 20:36:35] [INFO ] Invariant cache hit.
[2025-06-02 20:36:35] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2025-06-02 20:36:35] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2025-06-02 20:36:36] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2025-06-02 20:36:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:36] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2025-06-02 20:36:36] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned sat
[2025-06-02 20:36:36] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2025-06-02 20:36:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:36:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2025-06-02 20:36:37] [INFO ] Deduced a trap composed of 84 places in 359 ms of which 3 ms to minimize.
[2025-06-02 20:36:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 460 ms
[2025-06-02 20:36:37] [INFO ] Computed and/alt/rep : 1255/4766/1255 causal constraints (skipped 322 transitions) in 92 ms.
[2025-06-02 20:36:37] [INFO ] Added : 12 causal constraints over 3 iterations in 447 ms. Result :sat
Minimization took 2390 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1597/1597 transitions.
Applied a total of 0 rules in 47 ms. Remains 411 /411 variables (removed 0) and now considering 1597/1597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 411/411 places, 1597/1597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1597/1597 transitions.
Applied a total of 0 rules in 34 ms. Remains 411 /411 variables (removed 0) and now considering 1597/1597 (removed 0) transitions.
[2025-06-02 20:36:40] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-02 20:36:40] [INFO ] Invariant cache hit.
[2025-06-02 20:36:40] [INFO ] Implicit Places using invariants in 525 ms returned []
[2025-06-02 20:36:40] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-02 20:36:40] [INFO ] Invariant cache hit.
[2025-06-02 20:36:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:36:42] [INFO ] Implicit Places using invariants and state equation in 1821 ms returned []
Implicit Place search using SMT with State Equation took 2349 ms to find 0 implicit places.
[2025-06-02 20:36:42] [INFO ] Redundant transitions in 80 ms returned []
Running 1586 sub problems to find dead transitions.
[2025-06-02 20:36:42] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-02 20:36:42] [INFO ] Invariant cache hit.
[2025-06-02 20:36:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1360 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/410 variables, 9/61 constraints. Problems are: Problem set: 558 solved, 1028 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/61 constraints. Problems are: Problem set: 558 solved, 1028 unsolved
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1306 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/411 variables, 1/62 constraints. Problems are: Problem set: 615 solved, 971 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/1999 variables, and 62 constraints, problems are : Problem set: 615 solved, 971 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1586/586 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 615 solved, 971 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 615 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 615 solved, 971 unsolved
[2025-06-02 20:37:28] [INFO ] Deduced a trap composed of 68 places in 302 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/53 constraints. Problems are: Problem set: 615 solved, 971 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/53 constraints. Problems are: Problem set: 615 solved, 971 unsolved
At refinement iteration 4 (OVERLAPS) 9/410 variables, 9/62 constraints. Problems are: Problem set: 615 solved, 971 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 615 solved, 971 unsolved
At refinement iteration 6 (OVERLAPS) 1/411 variables, 1/63 constraints. Problems are: Problem set: 615 solved, 971 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/1999 variables, and 63 constraints, problems are : Problem set: 615 solved, 971 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 385/586 constraints, Known Traps: 1/1 constraints]
After SMT, in 74662ms problems are : Problem set: 615 solved, 971 unsolved
Search for dead transitions found 615 dead transitions in 74678ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 411/411 places, 982/1597 transitions.
Applied a total of 0 rules in 20 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2025-06-02 20:37:57] [INFO ] Redundant transitions in 29 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77205 ms. Remains : 411/411 places, 982/1597 transitions.
[2025-06-02 20:37:57] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2025-06-02 20:37:57] [INFO ] Computed 62 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (70508 resets) in 8311 ms. (120 steps per ms)
BEST_FIRST walk for 1000001 steps (9487 resets) in 1559 ms. (641 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2025-06-02 20:38:07] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:38:07] [INFO ] Invariant cache hit.
[2025-06-02 20:38:07] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2025-06-02 20:38:07] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 16 ms returned sat
[2025-06-02 20:38:07] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2025-06-02 20:38:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:38:07] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2025-06-02 20:38:07] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2025-06-02 20:38:07] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2025-06-02 20:38:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:38:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 87 ms returned sat
[2025-06-02 20:38:08] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 2 ms to minimize.
[2025-06-02 20:38:08] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:38:08] [INFO ] Deduced a trap composed of 156 places in 237 ms of which 3 ms to minimize.
[2025-06-02 20:38:08] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 3 ms to minimize.
[2025-06-02 20:38:09] [INFO ] Deduced a trap composed of 154 places in 220 ms of which 3 ms to minimize.
[2025-06-02 20:38:09] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:38:09] [INFO ] Deduced a trap composed of 170 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:38:09] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:38:10] [INFO ] Deduced a trap composed of 152 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:38:10] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:38:10] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 3 ms to minimize.
[2025-06-02 20:38:10] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:38:11] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:38:11] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 2 ms to minimize.
[2025-06-02 20:38:11] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 3 ms to minimize.
[2025-06-02 20:38:11] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:38:12] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:38:12] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 3 ms to minimize.
[2025-06-02 20:38:12] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 3 ms to minimize.
[2025-06-02 20:38:13] [INFO ] Deduced a trap composed of 168 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:38:13] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 3 ms to minimize.
[2025-06-02 20:38:13] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:38:13] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:38:14] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 3 ms to minimize.
[2025-06-02 20:38:15] [INFO ] Deduced a trap composed of 177 places in 226 ms of which 4 ms to minimize.
[2025-06-02 20:38:16] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 3 ms to minimize.
[2025-06-02 20:38:16] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:38:17] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 3 ms to minimize.
[2025-06-02 20:38:18] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:38:18] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 3 ms to minimize.
[2025-06-02 20:38:19] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:38:19] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 3 ms to minimize.
[2025-06-02 20:38:19] [INFO ] Deduced a trap composed of 154 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:38:19] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:38:20] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 2 ms to minimize.
[2025-06-02 20:38:20] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 3 ms to minimize.
[2025-06-02 20:38:20] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:38:21] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:38:21] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:38:21] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:38:21] [INFO ] Deduced a trap composed of 150 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:38:22] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:38:22] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 2 ms to minimize.
[2025-06-02 20:38:22] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:38:22] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:38:23] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:38:23] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:38:23] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:38:24] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:38:24] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:38:24] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 2 ms to minimize.
[2025-06-02 20:38:26] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:38:26] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:38:26] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 3 ms to minimize.
[2025-06-02 20:38:26] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:38:27] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:38:27] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 3 ms to minimize.
[2025-06-02 20:38:27] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:38:28] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:38:28] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 3 ms to minimize.
[2025-06-02 20:38:28] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:38:29] [INFO ] Deduced a trap composed of 156 places in 215 ms of which 4 ms to minimize.
[2025-06-02 20:38:29] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 3 ms to minimize.
[2025-06-02 20:38:30] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:38:30] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 3 ms to minimize.
[2025-06-02 20:38:30] [INFO ] Deduced a trap composed of 156 places in 215 ms of which 3 ms to minimize.
[2025-06-02 20:38:31] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:38:31] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:38:31] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:38:31] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:38:32] [INFO ] Deduced a trap composed of 159 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:38:32] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:38:32] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 2 ms to minimize.
[2025-06-02 20:38:33] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 3 ms to minimize.
[2025-06-02 20:38:33] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 3 ms to minimize.
[2025-06-02 20:38:34] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 3 ms to minimize.
[2025-06-02 20:38:34] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 2 ms to minimize.
[2025-06-02 20:38:34] [INFO ] Deduced a trap composed of 169 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:38:35] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:38:35] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:38:40] [INFO ] Trap strengthening (SAT) tested/added 80/80 trap constraints in 32456 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 18 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 16 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2025-06-02 20:38:40] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:38:40] [INFO ] Invariant cache hit.
[2025-06-02 20:38:40] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-06-02 20:38:40] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:38:40] [INFO ] Invariant cache hit.
[2025-06-02 20:38:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:38:42] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 1713 ms to find 0 implicit places.
[2025-06-02 20:38:42] [INFO ] Redundant transitions in 15 ms returned []
Running 971 sub problems to find dead transitions.
[2025-06-02 20:38:42] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:38:42] [INFO ] Invariant cache hit.
[2025-06-02 20:38:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:38:52] [INFO ] Deduced a trap composed of 122 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:38:52] [INFO ] Deduced a trap composed of 122 places in 145 ms of which 3 ms to minimize.
[2025-06-02 20:38:52] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 2 ms to minimize.
[2025-06-02 20:38:52] [INFO ] Deduced a trap composed of 170 places in 132 ms of which 2 ms to minimize.
[2025-06-02 20:38:52] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 2 ms to minimize.
[2025-06-02 20:38:52] [INFO ] Deduced a trap composed of 127 places in 137 ms of which 2 ms to minimize.
[2025-06-02 20:38:53] [INFO ] Deduced a trap composed of 122 places in 143 ms of which 2 ms to minimize.
[2025-06-02 20:38:53] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 3 ms to minimize.
[2025-06-02 20:38:53] [INFO ] Deduced a trap composed of 127 places in 146 ms of which 3 ms to minimize.
[2025-06-02 20:38:53] [INFO ] Deduced a trap composed of 127 places in 144 ms of which 2 ms to minimize.
[2025-06-02 20:38:53] [INFO ] Deduced a trap composed of 137 places in 148 ms of which 3 ms to minimize.
[2025-06-02 20:38:53] [INFO ] Deduced a trap composed of 166 places in 148 ms of which 2 ms to minimize.
[2025-06-02 20:38:53] [INFO ] Deduced a trap composed of 166 places in 137 ms of which 2 ms to minimize.
[2025-06-02 20:38:54] [INFO ] Deduced a trap composed of 166 places in 130 ms of which 2 ms to minimize.
[2025-06-02 20:38:54] [INFO ] Deduced a trap composed of 168 places in 135 ms of which 3 ms to minimize.
[2025-06-02 20:38:54] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 3 ms to minimize.
[2025-06-02 20:38:54] [INFO ] Deduced a trap composed of 168 places in 140 ms of which 3 ms to minimize.
[2025-06-02 20:38:54] [INFO ] Deduced a trap composed of 166 places in 152 ms of which 3 ms to minimize.
[2025-06-02 20:38:54] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 2 ms to minimize.
[2025-06-02 20:38:55] [INFO ] Deduced a trap composed of 172 places in 139 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:38:55] [INFO ] Deduced a trap composed of 130 places in 159 ms of which 2 ms to minimize.
[2025-06-02 20:38:55] [INFO ] Deduced a trap composed of 124 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:38:55] [INFO ] Deduced a trap composed of 142 places in 156 ms of which 2 ms to minimize.
[2025-06-02 20:38:56] [INFO ] Deduced a trap composed of 130 places in 137 ms of which 2 ms to minimize.
[2025-06-02 20:38:56] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 3 ms to minimize.
[2025-06-02 20:38:56] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:38:56] [INFO ] Deduced a trap composed of 136 places in 141 ms of which 2 ms to minimize.
[2025-06-02 20:38:56] [INFO ] Deduced a trap composed of 136 places in 133 ms of which 2 ms to minimize.
[2025-06-02 20:38:56] [INFO ] Deduced a trap composed of 142 places in 159 ms of which 2 ms to minimize.
[2025-06-02 20:38:57] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:38:57] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 3 ms to minimize.
[2025-06-02 20:38:57] [INFO ] Deduced a trap composed of 148 places in 155 ms of which 2 ms to minimize.
[2025-06-02 20:38:57] [INFO ] Deduced a trap composed of 171 places in 138 ms of which 2 ms to minimize.
[2025-06-02 20:38:57] [INFO ] Deduced a trap composed of 130 places in 144 ms of which 2 ms to minimize.
[2025-06-02 20:38:57] [INFO ] Deduced a trap composed of 124 places in 133 ms of which 3 ms to minimize.
[2025-06-02 20:38:58] [INFO ] Deduced a trap composed of 136 places in 140 ms of which 3 ms to minimize.
[2025-06-02 20:38:58] [INFO ] Deduced a trap composed of 174 places in 139 ms of which 2 ms to minimize.
[2025-06-02 20:38:58] [INFO ] Deduced a trap composed of 183 places in 244 ms of which 2 ms to minimize.
[2025-06-02 20:38:58] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 3 ms to minimize.
[2025-06-02 20:38:58] [INFO ] Deduced a trap composed of 125 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 5 (OVERLAPS) 9/410 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 971 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1384 variables, and 101 constraints, problems are : Problem set: 0 solved, 971 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 971/971 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 971 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:39:16] [INFO ] Deduced a trap composed of 160 places in 131 ms of which 2 ms to minimize.
[2025-06-02 20:39:17] [INFO ] Deduced a trap composed of 162 places in 124 ms of which 2 ms to minimize.
[2025-06-02 20:39:17] [INFO ] Deduced a trap composed of 112 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:39:17] [INFO ] Deduced a trap composed of 177 places in 209 ms of which 3 ms to minimize.
[2025-06-02 20:39:17] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 3 ms to minimize.
[2025-06-02 20:39:18] [INFO ] Deduced a trap composed of 181 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:39:18] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:39:18] [INFO ] Deduced a trap composed of 179 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:39:18] [INFO ] Deduced a trap composed of 176 places in 211 ms of which 3 ms to minimize.
[2025-06-02 20:39:18] [INFO ] Deduced a trap composed of 132 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:39:19] [INFO ] Deduced a trap composed of 174 places in 211 ms of which 3 ms to minimize.
[2025-06-02 20:39:19] [INFO ] Deduced a trap composed of 127 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:39:19] [INFO ] Deduced a trap composed of 183 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:39:19] [INFO ] Deduced a trap composed of 177 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:39:20] [INFO ] Deduced a trap composed of 179 places in 224 ms of which 3 ms to minimize.
[2025-06-02 20:39:20] [INFO ] Deduced a trap composed of 171 places in 227 ms of which 2 ms to minimize.
[2025-06-02 20:39:20] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:39:20] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:39:20] [INFO ] Deduced a trap composed of 173 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:39:21] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:39:21] [INFO ] Deduced a trap composed of 177 places in 208 ms of which 2 ms to minimize.
[2025-06-02 20:39:21] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 3 ms to minimize.
[2025-06-02 20:39:22] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:39:22] [INFO ] Deduced a trap composed of 127 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:39:22] [INFO ] Deduced a trap composed of 179 places in 202 ms of which 2 ms to minimize.
[2025-06-02 20:39:22] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 2 ms to minimize.
[2025-06-02 20:39:23] [INFO ] Deduced a trap composed of 179 places in 205 ms of which 2 ms to minimize.
[2025-06-02 20:39:23] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 2 ms to minimize.
[2025-06-02 20:39:23] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:39:23] [INFO ] Deduced a trap composed of 167 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:39:23] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 3 ms to minimize.
[2025-06-02 20:39:24] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 3 ms to minimize.
[2025-06-02 20:39:24] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:39:24] [INFO ] Deduced a trap composed of 146 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:39:24] [INFO ] Deduced a trap composed of 117 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:39:25] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:39:25] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:39:25] [INFO ] Deduced a trap composed of 173 places in 239 ms of which 2 ms to minimize.
[2025-06-02 20:39:25] [INFO ] Deduced a trap composed of 171 places in 231 ms of which 2 ms to minimize.
[2025-06-02 20:39:26] [INFO ] Deduced a trap composed of 174 places in 239 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:39:27] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 1 ms to minimize.
[2025-06-02 20:39:27] [INFO ] Deduced a trap composed of 127 places in 243 ms of which 3 ms to minimize.
[2025-06-02 20:39:28] [INFO ] Deduced a trap composed of 127 places in 241 ms of which 2 ms to minimize.
[2025-06-02 20:39:28] [INFO ] Deduced a trap composed of 136 places in 239 ms of which 2 ms to minimize.
[2025-06-02 20:39:28] [INFO ] Deduced a trap composed of 117 places in 222 ms of which 2 ms to minimize.
[2025-06-02 20:39:28] [INFO ] Deduced a trap composed of 122 places in 237 ms of which 3 ms to minimize.
[2025-06-02 20:39:29] [INFO ] Deduced a trap composed of 126 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:39:29] [INFO ] Deduced a trap composed of 132 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:39:29] [INFO ] Deduced a trap composed of 141 places in 247 ms of which 3 ms to minimize.
[2025-06-02 20:39:29] [INFO ] Deduced a trap composed of 122 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:39:30] [INFO ] Deduced a trap composed of 141 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:39:30] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:39:30] [INFO ] Deduced a trap composed of 117 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:39:30] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:39:30] [INFO ] Deduced a trap composed of 141 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:39:31] [INFO ] Deduced a trap composed of 131 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:39:31] [INFO ] Deduced a trap composed of 136 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:39:31] [INFO ] Deduced a trap composed of 117 places in 218 ms of which 3 ms to minimize.
[2025-06-02 20:39:31] [INFO ] Deduced a trap composed of 131 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:39:32] [INFO ] Deduced a trap composed of 136 places in 217 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:39:33] [INFO ] Deduced a trap composed of 168 places in 235 ms of which 3 ms to minimize.
[2025-06-02 20:39:33] [INFO ] Deduced a trap composed of 170 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:39:34] [INFO ] Deduced a trap composed of 185 places in 223 ms of which 3 ms to minimize.
[2025-06-02 20:39:34] [INFO ] Deduced a trap composed of 189 places in 221 ms of which 3 ms to minimize.
[2025-06-02 20:39:34] [INFO ] Deduced a trap composed of 170 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:39:35] [INFO ] Deduced a trap composed of 172 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:39:35] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 2 ms to minimize.
[2025-06-02 20:39:35] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:39:35] [INFO ] Deduced a trap composed of 172 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:39:35] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 2 ms to minimize.
[2025-06-02 20:39:36] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:39:36] [INFO ] Deduced a trap composed of 177 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:39:36] [INFO ] Deduced a trap composed of 181 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:39:36] [INFO ] Deduced a trap composed of 177 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:39:37] [INFO ] Deduced a trap composed of 177 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:39:37] [INFO ] Deduced a trap composed of 122 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:39:37] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 3 ms to minimize.
[2025-06-02 20:39:37] [INFO ] Deduced a trap composed of 177 places in 214 ms of which 3 ms to minimize.
[2025-06-02 20:39:38] [INFO ] Deduced a trap composed of 175 places in 227 ms of which 3 ms to minimize.
[2025-06-02 20:39:38] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:39:43] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1384 variables, and 173 constraints, problems are : Problem set: 0 solved, 971 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/971 constraints, Known Traps: 121/121 constraints]
After SMT, in 63898ms problems are : Problem set: 0 solved, 971 unsolved
Search for dead transitions found 0 dead transitions in 63907ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65663 ms. Remains : 411/411 places, 982/982 transitions.
RANDOM walk for 40000 steps (2815 resets) in 1034 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (390 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
[2025-06-02 20:39:46] [INFO ] Flatten gal took : 264 ms
BEST_FIRST walk for 40002 steps (385 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
[2025-06-02 20:39:46] [INFO ] Flatten gal took : 170 ms
[2025-06-02 20:39:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16169256708936502520.gal : 40 ms
[2025-06-02 20:39:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality527332498013563561.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/ReachabilityCardinality16169256708936502520.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality527332498013563561.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/ReachabilityCardinality527332498013563561.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 128
Interrupted probabilistic random walk after 399928 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 2
Probabilistic random walk after 399928 steps, saw 65383 distinct states, run finished after 3004 ms. (steps per millisecond=133 ) properties seen :0
[2025-06-02 20:39:49] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:39:49] [INFO ] Invariant cache hit.
[2025-06-02 20:39:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/410 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 973/1383 variables, 410/472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1383 variables, 1/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1383 variables, 0/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1384 variables, 1/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1384 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1384 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1384/1384 variables, and 474 constraints, problems are : Problem set: 1 solved, 1 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 20:39:50] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 3 ms to minimize.
[2025-06-02 20:39:50] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 3 ms to minimize.
[2025-06-02 20:39:50] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 2 ms to minimize.
[2025-06-02 20:39:50] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 3 ms to minimize.
[2025-06-02 20:39:51] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 3 ms to minimize.
[2025-06-02 20:39:51] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 3 ms to minimize.
[2025-06-02 20:39:51] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 2 ms to minimize.
[2025-06-02 20:39:51] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:39:51] [INFO ] Deduced a trap composed of 172 places in 192 ms of which 3 ms to minimize.
[2025-06-02 20:39:52] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 3 ms to minimize.
[2025-06-02 20:39:52] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 2 ms to minimize.
[2025-06-02 20:39:52] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 3 ms to minimize.
[2025-06-02 20:39:52] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 3 ms to minimize.
[2025-06-02 20:39:52] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 3 ms to minimize.
[2025-06-02 20:39:53] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 2 ms to minimize.
[2025-06-02 20:39:53] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 4 ms to minimize.
[2025-06-02 20:39:53] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:39:53] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 3 ms to minimize.
[2025-06-02 20:39:53] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:39:54] [INFO ] Deduced a trap composed of 168 places in 185 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 20/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 20:39:54] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 3 ms to minimize.
[2025-06-02 20:39:54] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:39:54] [INFO ] Deduced a trap composed of 164 places in 187 ms of which 4 ms to minimize.
[2025-06-02 20:39:54] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 5 ms to minimize.
[2025-06-02 20:39:55] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 2 ms to minimize.
SMT process timed out in 5596ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 23 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Running 971 sub problems to find dead transitions.
[2025-06-02 20:39:55] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:39:55] [INFO ] Invariant cache hit.
[2025-06-02 20:39:55] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :128 after 1024
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1024 after 2050
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2050 after 2053
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2053 after 2058
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2058 after 2067
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2067 after 2085
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:40:05] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 3 ms to minimize.
[2025-06-02 20:40:05] [INFO ] Deduced a trap composed of 122 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:40:06] [INFO ] Deduced a trap composed of 122 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:40:06] [INFO ] Deduced a trap composed of 170 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:40:06] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 2 ms to minimize.
[2025-06-02 20:40:06] [INFO ] Deduced a trap composed of 127 places in 147 ms of which 3 ms to minimize.
[2025-06-02 20:40:06] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2085 after 27130
[2025-06-02 20:40:06] [INFO ] Deduced a trap composed of 122 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:40:07] [INFO ] Deduced a trap composed of 127 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:40:07] [INFO ] Deduced a trap composed of 127 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:40:07] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:40:07] [INFO ] Deduced a trap composed of 166 places in 145 ms of which 3 ms to minimize.
[2025-06-02 20:40:07] [INFO ] Deduced a trap composed of 166 places in 141 ms of which 2 ms to minimize.
[2025-06-02 20:40:07] [INFO ] Deduced a trap composed of 166 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:40:08] [INFO ] Deduced a trap composed of 168 places in 141 ms of which 2 ms to minimize.
[2025-06-02 20:40:08] [INFO ] Deduced a trap composed of 132 places in 144 ms of which 2 ms to minimize.
[2025-06-02 20:40:08] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 3 ms to minimize.
[2025-06-02 20:40:08] [INFO ] Deduced a trap composed of 166 places in 145 ms of which 2 ms to minimize.
[2025-06-02 20:40:08] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:40:08] [INFO ] Deduced a trap composed of 172 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:40:09] [INFO ] Deduced a trap composed of 130 places in 156 ms of which 2 ms to minimize.
[2025-06-02 20:40:09] [INFO ] Deduced a trap composed of 124 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:40:09] [INFO ] Deduced a trap composed of 142 places in 236 ms of which 2 ms to minimize.
[2025-06-02 20:40:09] [INFO ] Deduced a trap composed of 130 places in 149 ms of which 3 ms to minimize.
[2025-06-02 20:40:10] [INFO ] Deduced a trap composed of 136 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:40:10] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 2 ms to minimize.
[2025-06-02 20:40:10] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 3 ms to minimize.
[2025-06-02 20:40:10] [INFO ] Deduced a trap composed of 136 places in 146 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :27130 after 127876
[2025-06-02 20:40:10] [INFO ] Deduced a trap composed of 142 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:40:10] [INFO ] Deduced a trap composed of 136 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:40:10] [INFO ] Deduced a trap composed of 136 places in 145 ms of which 2 ms to minimize.
[2025-06-02 20:40:11] [INFO ] Deduced a trap composed of 148 places in 165 ms of which 2 ms to minimize.
[2025-06-02 20:40:11] [INFO ] Deduced a trap composed of 171 places in 145 ms of which 2 ms to minimize.
[2025-06-02 20:40:11] [INFO ] Deduced a trap composed of 130 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:40:11] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 3 ms to minimize.
[2025-06-02 20:40:11] [INFO ] Deduced a trap composed of 136 places in 149 ms of which 2 ms to minimize.
[2025-06-02 20:40:11] [INFO ] Deduced a trap composed of 174 places in 145 ms of which 2 ms to minimize.
[2025-06-02 20:40:12] [INFO ] Deduced a trap composed of 183 places in 145 ms of which 2 ms to minimize.
[2025-06-02 20:40:12] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 2 ms to minimize.
[2025-06-02 20:40:12] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :127876 after 430188
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1384 variables, and 92 constraints, problems are : Problem set: 0 solved, 971 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 971/971 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 971 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:40:20] [INFO ] Deduced a trap composed of 160 places in 142 ms of which 2 ms to minimize.
[2025-06-02 20:40:20] [INFO ] Deduced a trap composed of 162 places in 139 ms of which 2 ms to minimize.
[2025-06-02 20:40:21] [INFO ] Deduced a trap composed of 112 places in 234 ms of which 2 ms to minimize.
[2025-06-02 20:40:21] [INFO ] Deduced a trap composed of 177 places in 231 ms of which 3 ms to minimize.
[2025-06-02 20:40:21] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 3 ms to minimize.
[2025-06-02 20:40:21] [INFO ] Deduced a trap composed of 181 places in 231 ms of which 3 ms to minimize.
[2025-06-02 20:40:22] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 3 ms to minimize.
[2025-06-02 20:40:22] [INFO ] Deduced a trap composed of 179 places in 232 ms of which 2 ms to minimize.
[2025-06-02 20:40:22] [INFO ] Deduced a trap composed of 176 places in 228 ms of which 2 ms to minimize.
[2025-06-02 20:40:22] [INFO ] Deduced a trap composed of 132 places in 230 ms of which 3 ms to minimize.
[2025-06-02 20:40:23] [INFO ] Deduced a trap composed of 174 places in 229 ms of which 2 ms to minimize.
[2025-06-02 20:40:23] [INFO ] Deduced a trap composed of 127 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:40:23] [INFO ] Deduced a trap composed of 183 places in 237 ms of which 2 ms to minimize.
[2025-06-02 20:40:23] [INFO ] Deduced a trap composed of 177 places in 231 ms of which 2 ms to minimize.
[2025-06-02 20:40:24] [INFO ] Deduced a trap composed of 179 places in 236 ms of which 2 ms to minimize.
[2025-06-02 20:40:24] [INFO ] Deduced a trap composed of 171 places in 240 ms of which 2 ms to minimize.
[2025-06-02 20:40:24] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 3 ms to minimize.
[2025-06-02 20:40:24] [INFO ] Deduced a trap composed of 172 places in 235 ms of which 3 ms to minimize.
[2025-06-02 20:40:25] [INFO ] Deduced a trap composed of 173 places in 231 ms of which 2 ms to minimize.
[2025-06-02 20:40:25] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:40:25] [INFO ] Deduced a trap composed of 177 places in 234 ms of which 2 ms to minimize.
[2025-06-02 20:40:26] [INFO ] Deduced a trap composed of 168 places in 240 ms of which 2 ms to minimize.
[2025-06-02 20:40:26] [INFO ] Deduced a trap composed of 162 places in 235 ms of which 2 ms to minimize.
[2025-06-02 20:40:26] [INFO ] Deduced a trap composed of 127 places in 235 ms of which 2 ms to minimize.
[2025-06-02 20:40:26] [INFO ] Deduced a trap composed of 179 places in 224 ms of which 2 ms to minimize.
[2025-06-02 20:40:27] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:40:27] [INFO ] Deduced a trap composed of 179 places in 226 ms of which 2 ms to minimize.
[2025-06-02 20:40:27] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 3 ms to minimize.
[2025-06-02 20:40:27] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:40:28] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 2 ms to minimize.
[2025-06-02 20:40:28] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 2 ms to minimize.
[2025-06-02 20:40:28] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 3 ms to minimize.
[2025-06-02 20:40:28] [INFO ] Deduced a trap composed of 162 places in 246 ms of which 2 ms to minimize.
[2025-06-02 20:40:29] [INFO ] Deduced a trap composed of 146 places in 231 ms of which 2 ms to minimize.
[2025-06-02 20:40:29] [INFO ] Deduced a trap composed of 117 places in 230 ms of which 3 ms to minimize.
[2025-06-02 20:40:29] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 2 ms to minimize.
[2025-06-02 20:40:29] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
[2025-06-02 20:40:30] [INFO ] Deduced a trap composed of 173 places in 240 ms of which 3 ms to minimize.
SDD size :430188 after 1.18257e+06
[2025-06-02 20:40:30] [INFO ] Deduced a trap composed of 171 places in 227 ms of which 2 ms to minimize.
[2025-06-02 20:40:30] [INFO ] Deduced a trap composed of 174 places in 232 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:40:31] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 1 ms to minimize.
[2025-06-02 20:40:32] [INFO ] Deduced a trap composed of 127 places in 235 ms of which 2 ms to minimize.
[2025-06-02 20:40:32] [INFO ] Deduced a trap composed of 127 places in 232 ms of which 2 ms to minimize.
[2025-06-02 20:40:32] [INFO ] Deduced a trap composed of 136 places in 229 ms of which 3 ms to minimize.
[2025-06-02 20:40:33] [INFO ] Deduced a trap composed of 117 places in 229 ms of which 3 ms to minimize.
[2025-06-02 20:40:33] [INFO ] Deduced a trap composed of 122 places in 232 ms of which 3 ms to minimize.
[2025-06-02 20:40:33] [INFO ] Deduced a trap composed of 126 places in 232 ms of which 2 ms to minimize.
[2025-06-02 20:40:33] [INFO ] Deduced a trap composed of 132 places in 228 ms of which 3 ms to minimize.
[2025-06-02 20:40:34] [INFO ] Deduced a trap composed of 141 places in 230 ms of which 2 ms to minimize.
[2025-06-02 20:40:34] [INFO ] Deduced a trap composed of 122 places in 228 ms of which 2 ms to minimize.
[2025-06-02 20:40:34] [INFO ] Deduced a trap composed of 141 places in 228 ms of which 3 ms to minimize.
[2025-06-02 20:40:34] [INFO ] Deduced a trap composed of 136 places in 228 ms of which 3 ms to minimize.
[2025-06-02 20:40:35] [INFO ] Deduced a trap composed of 117 places in 230 ms of which 3 ms to minimize.
[2025-06-02 20:40:35] [INFO ] Deduced a trap composed of 136 places in 231 ms of which 2 ms to minimize.
[2025-06-02 20:40:35] [INFO ] Deduced a trap composed of 141 places in 230 ms of which 2 ms to minimize.
[2025-06-02 20:40:35] [INFO ] Deduced a trap composed of 131 places in 231 ms of which 3 ms to minimize.
[2025-06-02 20:40:36] [INFO ] Deduced a trap composed of 136 places in 228 ms of which 3 ms to minimize.
[2025-06-02 20:40:36] [INFO ] Deduced a trap composed of 117 places in 231 ms of which 3 ms to minimize.
[2025-06-02 20:40:36] [INFO ] Deduced a trap composed of 131 places in 229 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 20:40:36] [INFO ] Deduced a trap composed of 136 places in 239 ms of which 2 ms to minimize.
[2025-06-02 20:40:36] [INFO ] Flatten gal took : 77 ms
[2025-06-02 20:40:36] [INFO ] Applying decomposition
[2025-06-02 20:40:37] [INFO ] Flatten gal took : 70 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/graph5430738588524514717.txt' '-o' '/tmp/graph5430738588524514717.bin' '-w' '/tmp/graph5430738588524514717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5430738588524514717.bin' '-l' '-1' '-v' '-w' '/tmp/graph5430738588524514717.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:40:37] [INFO ] Decomposing Gal with order
[2025-06-02 20:40:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:40:37] [INFO ] Removed a total of 2739 redundant transitions.
[2025-06-02 20:40:37] [INFO ] Flatten gal took : 230 ms
[2025-06-02 20:40:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 271 labels/synchronizations in 56 ms.
[2025-06-02 20:40:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12830958258491994773.gal : 19 ms
[2025-06-02 20:40:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3946799223539768723.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/ReachabilityCardinality12830958258491994773.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3946799223539768723.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality3946799223539768723.prop.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:40:38] [INFO ] Deduced a trap composed of 168 places in 243 ms of which 2 ms to minimize.
[2025-06-02 20:40:38] [INFO ] Deduced a trap composed of 170 places in 222 ms of which 2 ms to minimize.
[2025-06-02 20:40:38] [INFO ] Deduced a trap composed of 185 places in 251 ms of which 2 ms to minimize.
[2025-06-02 20:40:39] [INFO ] Deduced a trap composed of 189 places in 249 ms of which 2 ms to minimize.
[2025-06-02 20:40:39] [INFO ] Deduced a trap composed of 170 places in 246 ms of which 2 ms to minimize.
[2025-06-02 20:40:39] [INFO ] Deduced a trap composed of 172 places in 233 ms of which 2 ms to minimize.
SMT process timed out in 44657ms, After SMT, problems are : Problem set: 0 solved, 971 unsolved
Search for dead transitions found 0 dead transitions in 44671ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44703 ms. Remains : 411/411 places, 982/982 transitions.
RANDOM walk for 40000 steps (2780 resets) in 484 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (364 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 532027 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 532027 steps, saw 86692 distinct states, run finished after 3003 ms. (steps per millisecond=177 ) properties seen :0
[2025-06-02 20:40:43] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:40:43] [INFO ] Invariant cache hit.
[2025-06-02 20:40:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/410 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 973/1383 variables, 410/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1383 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1383 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1384 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1384/1384 variables, and 474 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:40:43] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 3 ms to minimize.
[2025-06-02 20:40:43] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:40:44] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 2 ms to minimize.
[2025-06-02 20:40:44] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 2 ms to minimize.
[2025-06-02 20:40:44] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 3 ms to minimize.
[2025-06-02 20:40:44] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 2 ms to minimize.
[2025-06-02 20:40:44] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 2 ms to minimize.
[2025-06-02 20:40:45] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 2 ms to minimize.
[2025-06-02 20:40:45] [INFO ] Deduced a trap composed of 172 places in 197 ms of which 2 ms to minimize.
[2025-06-02 20:40:45] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 2 ms to minimize.
[2025-06-02 20:40:45] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 2 ms to minimize.
[2025-06-02 20:40:45] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 3 ms to minimize.
[2025-06-02 20:40:46] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 2 ms to minimize.
[2025-06-02 20:40:46] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 2 ms to minimize.
[2025-06-02 20:40:46] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 3 ms to minimize.
[2025-06-02 20:40:46] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 3 ms to minimize.
[2025-06-02 20:40:47] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 3 ms to minimize.
[2025-06-02 20:40:47] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 2 ms to minimize.
[2025-06-02 20:40:47] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 3 ms to minimize.
[2025-06-02 20:40:47] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:40:47] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 2 ms to minimize.
[2025-06-02 20:40:48] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 2 ms to minimize.
[2025-06-02 20:40:48] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 3 ms to minimize.
[2025-06-02 20:40:48] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 2 ms to minimize.
[2025-06-02 20:40:48] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 3 ms to minimize.
[2025-06-02 20:40:48] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 3 ms to minimize.
[2025-06-02 20:40:49] [INFO ] Deduced a trap composed of 169 places in 201 ms of which 2 ms to minimize.
[2025-06-02 20:40:49] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 2 ms to minimize.
[2025-06-02 20:40:49] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 2 ms to minimize.
[2025-06-02 20:40:49] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 3 ms to minimize.
[2025-06-02 20:40:49] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 2 ms to minimize.
[2025-06-02 20:40:50] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 3 ms to minimize.
[2025-06-02 20:40:50] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 2 ms to minimize.
[2025-06-02 20:40:50] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 2 ms to minimize.
[2025-06-02 20:40:50] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 3 ms to minimize.
[2025-06-02 20:40:50] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 2 ms to minimize.
[2025-06-02 20:40:51] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 2 ms to minimize.
[2025-06-02 20:40:51] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:40:51] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:40:51] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:40:52] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 2 ms to minimize.
[2025-06-02 20:40:52] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 2 ms to minimize.
[2025-06-02 20:40:52] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:40:52] [INFO ] Deduced a trap composed of 170 places in 205 ms of which 2 ms to minimize.
[2025-06-02 20:40:53] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 3 ms to minimize.
[2025-06-02 20:40:53] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:40:53] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 2 ms to minimize.
[2025-06-02 20:40:53] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 3 ms to minimize.
[2025-06-02 20:40:53] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 3 ms to minimize.
[2025-06-02 20:40:54] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 2 ms to minimize.
[2025-06-02 20:40:54] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 3 ms to minimize.
[2025-06-02 20:40:54] [INFO ] Deduced a trap composed of 172 places in 204 ms of which 3 ms to minimize.
[2025-06-02 20:40:54] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 3 ms to minimize.
[2025-06-02 20:40:55] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 2 ms to minimize.
[2025-06-02 20:40:55] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 3 ms to minimize.
[2025-06-02 20:40:56] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 2 ms to minimize.
[2025-06-02 20:40:56] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 2 ms to minimize.
[2025-06-02 20:40:56] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 2 ms to minimize.
[2025-06-02 20:40:56] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 2 ms to minimize.
[2025-06-02 20:40:56] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:40:57] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 2 ms to minimize.
[2025-06-02 20:40:57] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 2 ms to minimize.
[2025-06-02 20:40:57] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 3 ms to minimize.
[2025-06-02 20:40:58] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 2 ms to minimize.
[2025-06-02 20:40:58] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 3 ms to minimize.
[2025-06-02 20:40:58] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 2 ms to minimize.
[2025-06-02 20:40:58] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 3 ms to minimize.
[2025-06-02 20:40:58] [INFO ] Deduced a trap composed of 168 places in 189 ms of which 2 ms to minimize.
[2025-06-02 20:40:59] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 3 ms to minimize.
[2025-06-02 20:40:59] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 2 ms to minimize.
[2025-06-02 20:40:59] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 3 ms to minimize.
[2025-06-02 20:40:59] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 2 ms to minimize.
[2025-06-02 20:41:00] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 3 ms to minimize.
[2025-06-02 20:41:00] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 3 ms to minimize.
[2025-06-02 20:41:00] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 2 ms to minimize.
[2025-06-02 20:41:00] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 2 ms to minimize.
[2025-06-02 20:41:00] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 2 ms to minimize.
[2025-06-02 20:41:01] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 2 ms to minimize.
[2025-06-02 20:41:01] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 3 ms to minimize.
[2025-06-02 20:41:01] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:41:01] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 3 ms to minimize.
[2025-06-02 20:41:01] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 3 ms to minimize.
[2025-06-02 20:41:02] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 2 ms to minimize.
[2025-06-02 20:41:02] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 3 ms to minimize.
[2025-06-02 20:41:02] [INFO ] Deduced a trap composed of 158 places in 186 ms of which 2 ms to minimize.
[2025-06-02 20:41:02] [INFO ] Deduced a trap composed of 160 places in 165 ms of which 2 ms to minimize.
[2025-06-02 20:41:02] [INFO ] Deduced a trap composed of 168 places in 189 ms of which 2 ms to minimize.
[2025-06-02 20:41:03] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 2 ms to minimize.
[2025-06-02 20:41:03] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 2 ms to minimize.
[2025-06-02 20:41:03] [INFO ] Deduced a trap composed of 168 places in 186 ms of which 3 ms to minimize.
[2025-06-02 20:41:03] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 3 ms to minimize.
[2025-06-02 20:41:03] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 2 ms to minimize.
[2025-06-02 20:41:04] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 3 ms to minimize.
[2025-06-02 20:41:04] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 3 ms to minimize.
[2025-06-02 20:41:04] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 3 ms to minimize.
[2025-06-02 20:41:04] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 3 ms to minimize.
[2025-06-02 20:41:04] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:41:05] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 3 ms to minimize.
[2025-06-02 20:41:05] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 2 ms to minimize.
[2025-06-02 20:41:05] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:41:05] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:41:05] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 3 ms to minimize.
[2025-06-02 20:41:07] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 3 ms to minimize.
[2025-06-02 20:41:07] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 3 ms to minimize.
[2025-06-02 20:41:07] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 2 ms to minimize.
[2025-06-02 20:41:07] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:41:08] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 2 ms to minimize.
[2025-06-02 20:41:08] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 3 ms to minimize.
[2025-06-02 20:41:09] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 3 ms to minimize.
[2025-06-02 20:41:09] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 2 ms to minimize.
[2025-06-02 20:41:09] [INFO ] Deduced a trap composed of 158 places in 183 ms of which 2 ms to minimize.
[2025-06-02 20:41:10] [INFO ] Deduced a trap composed of 170 places in 190 ms of which 2 ms to minimize.
[2025-06-02 20:41:10] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 2 ms to minimize.
[2025-06-02 20:41:10] [INFO ] Deduced a trap composed of 168 places in 189 ms of which 2 ms to minimize.
[2025-06-02 20:41:10] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 2 ms to minimize.
[2025-06-02 20:41:10] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:41:11] [INFO ] Deduced a trap composed of 172 places in 184 ms of which 2 ms to minimize.
[2025-06-02 20:41:11] [INFO ] Deduced a trap composed of 168 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:41:11] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 3 ms to minimize.
[2025-06-02 20:41:12] [INFO ] Deduced a trap composed of 154 places in 201 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:41:12] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 2 ms to minimize.
[2025-06-02 20:41:13] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 2 ms to minimize.
[2025-06-02 20:41:13] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 2 ms to minimize.
[2025-06-02 20:41:14] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 3 ms to minimize.
[2025-06-02 20:41:14] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 3 ms to minimize.
[2025-06-02 20:41:15] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 2 ms to minimize.
[2025-06-02 20:41:15] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 2 ms to minimize.
[2025-06-02 20:41:15] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 3 ms to minimize.
[2025-06-02 20:41:16] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 2 ms to minimize.
[2025-06-02 20:41:17] [INFO ] Deduced a trap composed of 154 places in 194 ms of which 2 ms to minimize.
[2025-06-02 20:41:17] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 3 ms to minimize.
[2025-06-02 20:41:17] [INFO ] Deduced a trap composed of 168 places in 190 ms of which 3 ms to minimize.
[2025-06-02 20:41:17] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 2 ms to minimize.
[2025-06-02 20:41:18] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 3 ms to minimize.
[2025-06-02 20:41:18] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 2 ms to minimize.
[2025-06-02 20:41:18] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 3 ms to minimize.
[2025-06-02 20:41:18] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 2 ms to minimize.
[2025-06-02 20:41:19] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 3 ms to minimize.
[2025-06-02 20:41:19] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:41:19] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:41:19] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 3 ms to minimize.
[2025-06-02 20:41:19] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:41:20] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 2 ms to minimize.
[2025-06-02 20:41:20] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 3 ms to minimize.
[2025-06-02 20:41:20] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 3 ms to minimize.
[2025-06-02 20:41:20] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 2 ms to minimize.
[2025-06-02 20:41:20] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 3 ms to minimize.
[2025-06-02 20:41:21] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 18 ms to minimize.
[2025-06-02 20:41:21] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 3 ms to minimize.
[2025-06-02 20:41:21] [INFO ] Deduced a trap composed of 154 places in 191 ms of which 3 ms to minimize.
[2025-06-02 20:41:21] [INFO ] Deduced a trap composed of 152 places in 189 ms of which 2 ms to minimize.
[2025-06-02 20:41:21] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 2 ms to minimize.
[2025-06-02 20:41:22] [INFO ] Deduced a trap composed of 154 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:41:22] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:41:22] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:41:22] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 2 ms to minimize.
[2025-06-02 20:41:23] [INFO ] Deduced a trap composed of 154 places in 190 ms of which 3 ms to minimize.
[2025-06-02 20:41:23] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 2 ms to minimize.
[2025-06-02 20:41:23] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:41:24] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:41:24] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 3 ms to minimize.
[2025-06-02 20:41:24] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:41:25] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 2 ms to minimize.
[2025-06-02 20:41:25] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 2 ms to minimize.
[2025-06-02 20:41:25] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 2 ms to minimize.
[2025-06-02 20:41:26] [INFO ] Deduced a trap composed of 150 places in 206 ms of which 2 ms to minimize.
[2025-06-02 20:41:26] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 2 ms to minimize.
[2025-06-02 20:41:26] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/1384 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45008 ms.
Refiners :[Positive P Invariants (semi-flows): 53/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 168/168 constraints]
After SMT, in 45359ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 40 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 18 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2025-06-02 20:41:28] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:41:28] [INFO ] Invariant cache hit.
[2025-06-02 20:41:28] [INFO ] Implicit Places using invariants in 310 ms returned []
[2025-06-02 20:41:28] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:41:28] [INFO ] Invariant cache hit.
[2025-06-02 20:41:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:41:30] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned []
Implicit Place search using SMT with State Equation took 1709 ms to find 0 implicit places.
[2025-06-02 20:41:30] [INFO ] Redundant transitions in 11 ms returned []
Running 971 sub problems to find dead transitions.
[2025-06-02 20:41:30] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:41:30] [INFO ] Invariant cache hit.
[2025-06-02 20:41:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:41:40] [INFO ] Deduced a trap composed of 122 places in 135 ms of which 3 ms to minimize.
[2025-06-02 20:41:40] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 2 ms to minimize.
[2025-06-02 20:41:40] [INFO ] Deduced a trap composed of 122 places in 155 ms of which 2 ms to minimize.
[2025-06-02 20:41:40] [INFO ] Deduced a trap composed of 170 places in 149 ms of which 3 ms to minimize.
[2025-06-02 20:41:40] [INFO ] Deduced a trap composed of 122 places in 151 ms of which 2 ms to minimize.
[2025-06-02 20:41:41] [INFO ] Deduced a trap composed of 127 places in 149 ms of which 2 ms to minimize.
[2025-06-02 20:41:41] [INFO ] Deduced a trap composed of 122 places in 152 ms of which 2 ms to minimize.
[2025-06-02 20:41:41] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 2 ms to minimize.
[2025-06-02 20:41:41] [INFO ] Deduced a trap composed of 127 places in 140 ms of which 2 ms to minimize.
[2025-06-02 20:41:41] [INFO ] Deduced a trap composed of 127 places in 155 ms of which 3 ms to minimize.
[2025-06-02 20:41:41] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 2 ms to minimize.
[2025-06-02 20:41:42] [INFO ] Deduced a trap composed of 166 places in 152 ms of which 3 ms to minimize.
[2025-06-02 20:41:42] [INFO ] Deduced a trap composed of 166 places in 144 ms of which 2 ms to minimize.
[2025-06-02 20:41:42] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 2 ms to minimize.
[2025-06-02 20:41:42] [INFO ] Deduced a trap composed of 168 places in 139 ms of which 2 ms to minimize.
[2025-06-02 20:41:42] [INFO ] Deduced a trap composed of 132 places in 135 ms of which 3 ms to minimize.
[2025-06-02 20:41:42] [INFO ] Deduced a trap composed of 168 places in 138 ms of which 2 ms to minimize.
[2025-06-02 20:41:42] [INFO ] Deduced a trap composed of 166 places in 139 ms of which 2 ms to minimize.
[2025-06-02 20:41:43] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 2 ms to minimize.
[2025-06-02 20:41:43] [INFO ] Deduced a trap composed of 172 places in 134 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:41:43] [INFO ] Deduced a trap composed of 130 places in 149 ms of which 3 ms to minimize.
[2025-06-02 20:41:43] [INFO ] Deduced a trap composed of 124 places in 150 ms of which 2 ms to minimize.
[2025-06-02 20:41:43] [INFO ] Deduced a trap composed of 142 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:41:44] [INFO ] Deduced a trap composed of 130 places in 155 ms of which 2 ms to minimize.
[2025-06-02 20:41:44] [INFO ] Deduced a trap composed of 136 places in 150 ms of which 2 ms to minimize.
[2025-06-02 20:41:44] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 2 ms to minimize.
[2025-06-02 20:41:44] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 3 ms to minimize.
[2025-06-02 20:41:44] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 2 ms to minimize.
[2025-06-02 20:41:45] [INFO ] Deduced a trap composed of 142 places in 152 ms of which 2 ms to minimize.
[2025-06-02 20:41:45] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 2 ms to minimize.
[2025-06-02 20:41:45] [INFO ] Deduced a trap composed of 136 places in 145 ms of which 3 ms to minimize.
[2025-06-02 20:41:45] [INFO ] Deduced a trap composed of 148 places in 157 ms of which 3 ms to minimize.
[2025-06-02 20:41:45] [INFO ] Deduced a trap composed of 171 places in 154 ms of which 3 ms to minimize.
[2025-06-02 20:41:45] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 2 ms to minimize.
[2025-06-02 20:41:46] [INFO ] Deduced a trap composed of 124 places in 157 ms of which 2 ms to minimize.
[2025-06-02 20:41:46] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 3 ms to minimize.
[2025-06-02 20:41:46] [INFO ] Deduced a trap composed of 174 places in 159 ms of which 2 ms to minimize.
[2025-06-02 20:41:46] [INFO ] Deduced a trap composed of 183 places in 146 ms of which 3 ms to minimize.
[2025-06-02 20:41:46] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:41:46] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 5 (OVERLAPS) 9/410 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 971 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1384 variables, and 101 constraints, problems are : Problem set: 0 solved, 971 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 971/971 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 971 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:42:04] [INFO ] Deduced a trap composed of 160 places in 143 ms of which 2 ms to minimize.
[2025-06-02 20:42:05] [INFO ] Deduced a trap composed of 162 places in 133 ms of which 2 ms to minimize.
[2025-06-02 20:42:05] [INFO ] Deduced a trap composed of 112 places in 223 ms of which 2 ms to minimize.
[2025-06-02 20:42:05] [INFO ] Deduced a trap composed of 177 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:42:05] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:42:05] [INFO ] Deduced a trap composed of 181 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:42:06] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 2 ms to minimize.
[2025-06-02 20:42:06] [INFO ] Deduced a trap composed of 179 places in 216 ms of which 3 ms to minimize.
[2025-06-02 20:42:06] [INFO ] Deduced a trap composed of 176 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:42:06] [INFO ] Deduced a trap composed of 132 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:42:07] [INFO ] Deduced a trap composed of 174 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:42:07] [INFO ] Deduced a trap composed of 127 places in 220 ms of which 3 ms to minimize.
[2025-06-02 20:42:07] [INFO ] Deduced a trap composed of 183 places in 216 ms of which 3 ms to minimize.
[2025-06-02 20:42:07] [INFO ] Deduced a trap composed of 177 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:42:07] [INFO ] Deduced a trap composed of 179 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:42:08] [INFO ] Deduced a trap composed of 171 places in 222 ms of which 2 ms to minimize.
[2025-06-02 20:42:08] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:42:08] [INFO ] Deduced a trap composed of 172 places in 228 ms of which 2 ms to minimize.
[2025-06-02 20:42:08] [INFO ] Deduced a trap composed of 173 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:42:09] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:42:09] [INFO ] Deduced a trap composed of 177 places in 239 ms of which 2 ms to minimize.
[2025-06-02 20:42:09] [INFO ] Deduced a trap composed of 168 places in 223 ms of which 2 ms to minimize.
[2025-06-02 20:42:10] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:42:10] [INFO ] Deduced a trap composed of 127 places in 222 ms of which 3 ms to minimize.
[2025-06-02 20:42:10] [INFO ] Deduced a trap composed of 179 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:42:10] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 2 ms to minimize.
[2025-06-02 20:42:11] [INFO ] Deduced a trap composed of 179 places in 206 ms of which 2 ms to minimize.
[2025-06-02 20:42:11] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 2 ms to minimize.
[2025-06-02 20:42:11] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 2 ms to minimize.
[2025-06-02 20:42:11] [INFO ] Deduced a trap composed of 167 places in 205 ms of which 2 ms to minimize.
[2025-06-02 20:42:11] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 2 ms to minimize.
[2025-06-02 20:42:12] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:42:12] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:42:12] [INFO ] Deduced a trap composed of 146 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:42:12] [INFO ] Deduced a trap composed of 117 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:42:13] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:42:13] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:42:13] [INFO ] Deduced a trap composed of 173 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:42:13] [INFO ] Deduced a trap composed of 171 places in 208 ms of which 3 ms to minimize.
[2025-06-02 20:42:14] [INFO ] Deduced a trap composed of 174 places in 221 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:42:15] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 0 ms to minimize.
[2025-06-02 20:42:15] [INFO ] Deduced a trap composed of 127 places in 216 ms of which 3 ms to minimize.
[2025-06-02 20:42:16] [INFO ] Deduced a trap composed of 127 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:42:16] [INFO ] Deduced a trap composed of 136 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:42:16] [INFO ] Deduced a trap composed of 117 places in 216 ms of which 3 ms to minimize.
[2025-06-02 20:42:16] [INFO ] Deduced a trap composed of 122 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:42:16] [INFO ] Deduced a trap composed of 126 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:42:17] [INFO ] Deduced a trap composed of 132 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:42:17] [INFO ] Deduced a trap composed of 141 places in 218 ms of which 3 ms to minimize.
[2025-06-02 20:42:17] [INFO ] Deduced a trap composed of 122 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:42:17] [INFO ] Deduced a trap composed of 141 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:42:18] [INFO ] Deduced a trap composed of 136 places in 219 ms of which 3 ms to minimize.
[2025-06-02 20:42:18] [INFO ] Deduced a trap composed of 117 places in 215 ms of which 3 ms to minimize.
[2025-06-02 20:42:18] [INFO ] Deduced a trap composed of 136 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:42:18] [INFO ] Deduced a trap composed of 141 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:42:19] [INFO ] Deduced a trap composed of 131 places in 218 ms of which 3 ms to minimize.
[2025-06-02 20:42:19] [INFO ] Deduced a trap composed of 136 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:42:19] [INFO ] Deduced a trap composed of 117 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:42:19] [INFO ] Deduced a trap composed of 131 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:42:19] [INFO ] Deduced a trap composed of 136 places in 216 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:42:21] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 3 ms to minimize.
[2025-06-02 20:42:21] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:42:22] [INFO ] Deduced a trap composed of 185 places in 225 ms of which 3 ms to minimize.
[2025-06-02 20:42:22] [INFO ] Deduced a trap composed of 189 places in 229 ms of which 3 ms to minimize.
[2025-06-02 20:42:22] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 3 ms to minimize.
[2025-06-02 20:42:22] [INFO ] Deduced a trap composed of 172 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:42:23] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:42:23] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:42:23] [INFO ] Deduced a trap composed of 172 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:42:23] [INFO ] Deduced a trap composed of 170 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:42:24] [INFO ] Deduced a trap composed of 177 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:42:24] [INFO ] Deduced a trap composed of 177 places in 222 ms of which 3 ms to minimize.
[2025-06-02 20:42:24] [INFO ] Deduced a trap composed of 181 places in 227 ms of which 3 ms to minimize.
[2025-06-02 20:42:24] [INFO ] Deduced a trap composed of 177 places in 222 ms of which 3 ms to minimize.
[2025-06-02 20:42:25] [INFO ] Deduced a trap composed of 177 places in 224 ms of which 3 ms to minimize.
[2025-06-02 20:42:25] [INFO ] Deduced a trap composed of 122 places in 225 ms of which 2 ms to minimize.
[2025-06-02 20:42:25] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 2 ms to minimize.
[2025-06-02 20:42:25] [INFO ] Deduced a trap composed of 177 places in 224 ms of which 2 ms to minimize.
[2025-06-02 20:42:26] [INFO ] Deduced a trap composed of 175 places in 230 ms of which 3 ms to minimize.
[2025-06-02 20:42:26] [INFO ] Deduced a trap composed of 170 places in 219 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:42:31] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1384 variables, and 173 constraints, problems are : Problem set: 0 solved, 971 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/971 constraints, Known Traps: 121/121 constraints]
After SMT, in 63700ms problems are : Problem set: 0 solved, 971 unsolved
Search for dead transitions found 0 dead transitions in 63710ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65456 ms. Remains : 411/411 places, 982/982 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Starting property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2025-06-02 20:42:33] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:42:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (708 resets) in 87 ms. (113 steps per ms)
BEST_FIRST walk for 10001 steps (98 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2025-06-02 20:42:33] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:42:33] [INFO ] Invariant cache hit.
[2025-06-02 20:42:34] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2025-06-02 20:42:34] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2025-06-02 20:42:34] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2025-06-02 20:42:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:42:34] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2025-06-02 20:42:34] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2025-06-02 20:42:34] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2025-06-02 20:42:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:42:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 89 ms returned sat
[2025-06-02 20:42:34] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 3 ms to minimize.
[2025-06-02 20:42:35] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:42:35] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:42:35] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 2 ms to minimize.
[2025-06-02 20:42:35] [INFO ] Deduced a trap composed of 154 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:42:36] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:42:36] [INFO ] Deduced a trap composed of 170 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:42:36] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:42:36] [INFO ] Deduced a trap composed of 152 places in 215 ms of which 3 ms to minimize.
[2025-06-02 20:42:37] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 3 ms to minimize.
[2025-06-02 20:42:37] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 3 ms to minimize.
[2025-06-02 20:42:37] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 3 ms to minimize.
[2025-06-02 20:42:37] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:42:38] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:42:38] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:42:38] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 3 ms to minimize.
[2025-06-02 20:42:39] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:42:39] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:42:39] [INFO ] Trap strengthening (SAT) tested/added 18/18 trap constraints in 4610 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 26 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Running 971 sub problems to find dead transitions.
[2025-06-02 20:42:39] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:42:39] [INFO ] Invariant cache hit.
[2025-06-02 20:42:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:42:49] [INFO ] Deduced a trap composed of 122 places in 155 ms of which 2 ms to minimize.
[2025-06-02 20:42:49] [INFO ] Deduced a trap composed of 122 places in 149 ms of which 2 ms to minimize.
[2025-06-02 20:42:49] [INFO ] Deduced a trap composed of 122 places in 151 ms of which 3 ms to minimize.
[2025-06-02 20:42:49] [INFO ] Deduced a trap composed of 170 places in 138 ms of which 3 ms to minimize.
[2025-06-02 20:42:50] [INFO ] Deduced a trap composed of 122 places in 150 ms of which 2 ms to minimize.
[2025-06-02 20:42:50] [INFO ] Deduced a trap composed of 127 places in 138 ms of which 2 ms to minimize.
[2025-06-02 20:42:50] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 2 ms to minimize.
[2025-06-02 20:42:50] [INFO ] Deduced a trap composed of 122 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:42:50] [INFO ] Deduced a trap composed of 127 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:42:50] [INFO ] Deduced a trap composed of 127 places in 150 ms of which 3 ms to minimize.
[2025-06-02 20:42:50] [INFO ] Deduced a trap composed of 137 places in 148 ms of which 2 ms to minimize.
[2025-06-02 20:42:51] [INFO ] Deduced a trap composed of 166 places in 149 ms of which 3 ms to minimize.
[2025-06-02 20:42:51] [INFO ] Deduced a trap composed of 166 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:42:51] [INFO ] Deduced a trap composed of 166 places in 136 ms of which 2 ms to minimize.
[2025-06-02 20:42:51] [INFO ] Deduced a trap composed of 168 places in 134 ms of which 2 ms to minimize.
[2025-06-02 20:42:51] [INFO ] Deduced a trap composed of 132 places in 150 ms of which 2 ms to minimize.
[2025-06-02 20:42:51] [INFO ] Deduced a trap composed of 168 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:42:52] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 2 ms to minimize.
[2025-06-02 20:42:52] [INFO ] Deduced a trap composed of 137 places in 287 ms of which 2 ms to minimize.
[2025-06-02 20:42:52] [INFO ] Deduced a trap composed of 172 places in 152 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:42:52] [INFO ] Deduced a trap composed of 130 places in 155 ms of which 3 ms to minimize.
[2025-06-02 20:42:53] [INFO ] Deduced a trap composed of 124 places in 150 ms of which 2 ms to minimize.
[2025-06-02 20:42:53] [INFO ] Deduced a trap composed of 142 places in 154 ms of which 3 ms to minimize.
[2025-06-02 20:42:53] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 2 ms to minimize.
[2025-06-02 20:42:53] [INFO ] Deduced a trap composed of 136 places in 154 ms of which 2 ms to minimize.
[2025-06-02 20:42:53] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:42:54] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:42:54] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:42:54] [INFO ] Deduced a trap composed of 142 places in 151 ms of which 2 ms to minimize.
[2025-06-02 20:42:54] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 3 ms to minimize.
[2025-06-02 20:42:54] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:42:54] [INFO ] Deduced a trap composed of 148 places in 151 ms of which 3 ms to minimize.
[2025-06-02 20:42:54] [INFO ] Deduced a trap composed of 171 places in 149 ms of which 3 ms to minimize.
[2025-06-02 20:42:55] [INFO ] Deduced a trap composed of 130 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:42:55] [INFO ] Deduced a trap composed of 124 places in 174 ms of which 2 ms to minimize.
[2025-06-02 20:42:55] [INFO ] Deduced a trap composed of 136 places in 154 ms of which 2 ms to minimize.
[2025-06-02 20:42:55] [INFO ] Deduced a trap composed of 174 places in 148 ms of which 2 ms to minimize.
[2025-06-02 20:42:55] [INFO ] Deduced a trap composed of 183 places in 148 ms of which 2 ms to minimize.
[2025-06-02 20:42:55] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 2 ms to minimize.
[2025-06-02 20:42:56] [INFO ] Deduced a trap composed of 125 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.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 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 9.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 timeout
0.0)
(s317 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1384 variables, and 92 constraints, problems are : Problem set: 0 solved, 971 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 971/971 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 971 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:43:04] [INFO ] Deduced a trap composed of 160 places in 134 ms of which 3 ms to minimize.
[2025-06-02 20:43:04] [INFO ] Deduced a trap composed of 162 places in 129 ms of which 3 ms to minimize.
[2025-06-02 20:43:04] [INFO ] Deduced a trap composed of 112 places in 222 ms of which 2 ms to minimize.
[2025-06-02 20:43:04] [INFO ] Deduced a trap composed of 177 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:43:05] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:43:05] [INFO ] Deduced a trap composed of 181 places in 233 ms of which 2 ms to minimize.
[2025-06-02 20:43:05] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:43:05] [INFO ] Deduced a trap composed of 179 places in 222 ms of which 3 ms to minimize.
[2025-06-02 20:43:06] [INFO ] Deduced a trap composed of 176 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:43:06] [INFO ] Deduced a trap composed of 132 places in 228 ms of which 3 ms to minimize.
[2025-06-02 20:43:06] [INFO ] Deduced a trap composed of 174 places in 214 ms of which 3 ms to minimize.
[2025-06-02 20:43:06] [INFO ] Deduced a trap composed of 127 places in 222 ms of which 3 ms to minimize.
[2025-06-02 20:43:07] [INFO ] Deduced a trap composed of 183 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:43:07] [INFO ] Deduced a trap composed of 177 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:43:07] [INFO ] Deduced a trap composed of 179 places in 220 ms of which 3 ms to minimize.
[2025-06-02 20:43:07] [INFO ] Deduced a trap composed of 171 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:43:07] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:43:08] [INFO ] Deduced a trap composed of 172 places in 219 ms of which 3 ms to minimize.
[2025-06-02 20:43:08] [INFO ] Deduced a trap composed of 173 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:43:08] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:43:09] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 3 ms to minimize.
[2025-06-02 20:43:09] [INFO ] Deduced a trap composed of 168 places in 223 ms of which 2 ms to minimize.
[2025-06-02 20:43:09] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 2 ms to minimize.
[2025-06-02 20:43:09] [INFO ] Deduced a trap composed of 127 places in 223 ms of which 2 ms to minimize.
[2025-06-02 20:43:10] [INFO ] Deduced a trap composed of 179 places in 212 ms of which 3 ms to minimize.
[2025-06-02 20:43:10] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 2 ms to minimize.
[2025-06-02 20:43:10] [INFO ] Deduced a trap composed of 179 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:43:10] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 2 ms to minimize.
[2025-06-02 20:43:11] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:43:11] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 2 ms to minimize.
[2025-06-02 20:43:11] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 3 ms to minimize.
[2025-06-02 20:43:11] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:43:12] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 3 ms to minimize.
[2025-06-02 20:43:12] [INFO ] Deduced a trap composed of 146 places in 221 ms of which 3 ms to minimize.
[2025-06-02 20:43:12] [INFO ] Deduced a trap composed of 117 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:43:12] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:43:12] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 3 ms to minimize.
[2025-06-02 20:43:13] [INFO ] Deduced a trap composed of 173 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:43:13] [INFO ] Deduced a trap composed of 171 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:43:13] [INFO ] Deduced a trap composed of 174 places in 223 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:43:14] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2025-06-02 20:43:15] [INFO ] Deduced a trap composed of 127 places in 239 ms of which 2 ms to minimize.
[2025-06-02 20:43:15] [INFO ] Deduced a trap composed of 127 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:43:15] [INFO ] Deduced a trap composed of 136 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:43:16] [INFO ] Deduced a trap composed of 117 places in 222 ms of which 3 ms to minimize.
[2025-06-02 20:43:16] [INFO ] Deduced a trap composed of 122 places in 229 ms of which 2 ms to minimize.
[2025-06-02 20:43:16] [INFO ] Deduced a trap composed of 126 places in 233 ms of which 2 ms to minimize.
[2025-06-02 20:43:16] [INFO ] Deduced a trap composed of 132 places in 235 ms of which 2 ms to minimize.
[2025-06-02 20:43:17] [INFO ] Deduced a trap composed of 141 places in 238 ms of which 3 ms to minimize.
[2025-06-02 20:43:17] [INFO ] Deduced a trap composed of 122 places in 237 ms of which 3 ms to minimize.
[2025-06-02 20:43:17] [INFO ] Deduced a trap composed of 141 places in 238 ms of which 3 ms to minimize.
[2025-06-02 20:43:17] [INFO ] Deduced a trap composed of 136 places in 238 ms of which 3 ms to minimize.
[2025-06-02 20:43:18] [INFO ] Deduced a trap composed of 117 places in 231 ms of which 2 ms to minimize.
[2025-06-02 20:43:18] [INFO ] Deduced a trap composed of 136 places in 240 ms of which 2 ms to minimize.
[2025-06-02 20:43:18] [INFO ] Deduced a trap composed of 141 places in 240 ms of which 3 ms to minimize.
[2025-06-02 20:43:19] [INFO ] Deduced a trap composed of 131 places in 243 ms of which 3 ms to minimize.
[2025-06-02 20:43:19] [INFO ] Deduced a trap composed of 136 places in 236 ms of which 2 ms to minimize.
[2025-06-02 20:43:19] [INFO ] Deduced a trap composed of 117 places in 240 ms of which 2 ms to minimize.
[2025-06-02 20:43:19] [INFO ] Deduced a trap composed of 131 places in 235 ms of which 2 ms to minimize.
[2025-06-02 20:43:19] [INFO ] Deduced a trap composed of 136 places in 218 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:43:21] [INFO ] Deduced a trap composed of 168 places in 241 ms of which 2 ms to minimize.
[2025-06-02 20:43:21] [INFO ] Deduced a trap composed of 170 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:43:22] [INFO ] Deduced a trap composed of 185 places in 226 ms of which 2 ms to minimize.
[2025-06-02 20:43:22] [INFO ] Deduced a trap composed of 189 places in 222 ms of which 2 ms to minimize.
[2025-06-02 20:43:22] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:43:22] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 2 ms to minimize.
[2025-06-02 20:43:23] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:43:23] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 2 ms to minimize.
SMT process timed out in 43931ms, After SMT, problems are : Problem set: 0 solved, 971 unsolved
Search for dead transitions found 0 dead transitions in 43942ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43971 ms. Remains : 411/411 places, 982/982 transitions.
[2025-06-02 20:43:23] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:43:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (70217 resets) in 8383 ms. (119 steps per ms)
BEST_FIRST walk for 1000001 steps (9609 resets) in 1618 ms. (617 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2025-06-02 20:43:33] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:43:33] [INFO ] Invariant cache hit.
[2025-06-02 20:43:33] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2025-06-02 20:43:33] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2025-06-02 20:43:33] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2025-06-02 20:43:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:43:33] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2025-06-02 20:43:33] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2025-06-02 20:43:33] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2025-06-02 20:43:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:43:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 85 ms returned sat
[2025-06-02 20:43:34] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:43:34] [INFO ] Deduced a trap composed of 162 places in 238 ms of which 2 ms to minimize.
[2025-06-02 20:43:34] [INFO ] Deduced a trap composed of 156 places in 237 ms of which 3 ms to minimize.
[2025-06-02 20:43:35] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:43:35] [INFO ] Deduced a trap composed of 154 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:43:35] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 3 ms to minimize.
[2025-06-02 20:43:35] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:43:36] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:43:36] [INFO ] Deduced a trap composed of 152 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:43:36] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:43:36] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 3 ms to minimize.
[2025-06-02 20:43:37] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:43:37] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 3 ms to minimize.
[2025-06-02 20:43:37] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:43:37] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:43:38] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 3 ms to minimize.
[2025-06-02 20:43:38] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 3 ms to minimize.
[2025-06-02 20:43:38] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 2 ms to minimize.
[2025-06-02 20:43:39] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:43:39] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:43:39] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 4 ms to minimize.
[2025-06-02 20:43:39] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:43:40] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 3 ms to minimize.
[2025-06-02 20:43:40] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:43:42] [INFO ] Deduced a trap composed of 177 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:43:42] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:43:42] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:43:43] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:43:44] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:43:44] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 2 ms to minimize.
[2025-06-02 20:43:45] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:43:45] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:43:45] [INFO ] Deduced a trap composed of 154 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:43:46] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:43:46] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:43:46] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:43:46] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:43:47] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:43:47] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:43:47] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:43:48] [INFO ] Deduced a trap composed of 150 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:43:48] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 3 ms to minimize.
[2025-06-02 20:43:48] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 3 ms to minimize.
[2025-06-02 20:43:48] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 3 ms to minimize.
[2025-06-02 20:43:49] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 3 ms to minimize.
[2025-06-02 20:43:49] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 3 ms to minimize.
[2025-06-02 20:43:49] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:43:49] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:43:50] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 2 ms to minimize.
[2025-06-02 20:43:50] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 3 ms to minimize.
[2025-06-02 20:43:50] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:43:52] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 2 ms to minimize.
[2025-06-02 20:43:52] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 3 ms to minimize.
[2025-06-02 20:43:52] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 3 ms to minimize.
[2025-06-02 20:43:53] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:43:53] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 3 ms to minimize.
[2025-06-02 20:43:53] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 3 ms to minimize.
[2025-06-02 20:43:53] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 3 ms to minimize.
[2025-06-02 20:43:54] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:43:54] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:43:55] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:43:55] [INFO ] Deduced a trap composed of 156 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:43:56] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 3 ms to minimize.
[2025-06-02 20:43:56] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:43:56] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 2 ms to minimize.
[2025-06-02 20:43:56] [INFO ] Deduced a trap composed of 156 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:43:57] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 3 ms to minimize.
[2025-06-02 20:43:57] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:43:57] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 3 ms to minimize.
[2025-06-02 20:43:58] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:43:58] [INFO ] Deduced a trap composed of 159 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:43:58] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:43:59] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 2 ms to minimize.
[2025-06-02 20:43:59] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:43:59] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 3 ms to minimize.
[2025-06-02 20:44:00] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:44:00] [INFO ] Deduced a trap composed of 156 places in 209 ms of which 3 ms to minimize.
[2025-06-02 20:44:00] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:44:01] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 3 ms to minimize.
[2025-06-02 20:44:02] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:44:06] [INFO ] Trap strengthening (SAT) tested/added 80/80 trap constraints in 32505 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 14 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 13 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2025-06-02 20:44:06] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:44:06] [INFO ] Invariant cache hit.
[2025-06-02 20:44:06] [INFO ] Implicit Places using invariants in 298 ms returned []
[2025-06-02 20:44:06] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:44:06] [INFO ] Invariant cache hit.
[2025-06-02 20:44:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:44:08] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 1698 ms to find 0 implicit places.
[2025-06-02 20:44:08] [INFO ] Redundant transitions in 9 ms returned []
Running 971 sub problems to find dead transitions.
[2025-06-02 20:44:08] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:44:08] [INFO ] Invariant cache hit.
[2025-06-02 20:44:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:44:18] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 2 ms to minimize.
[2025-06-02 20:44:18] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 2 ms to minimize.
[2025-06-02 20:44:18] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 3 ms to minimize.
[2025-06-02 20:44:18] [INFO ] Deduced a trap composed of 170 places in 131 ms of which 2 ms to minimize.
[2025-06-02 20:44:18] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 2 ms to minimize.
[2025-06-02 20:44:19] [INFO ] Deduced a trap composed of 127 places in 130 ms of which 2 ms to minimize.
[2025-06-02 20:44:19] [INFO ] Deduced a trap composed of 122 places in 131 ms of which 3 ms to minimize.
[2025-06-02 20:44:19] [INFO ] Deduced a trap composed of 122 places in 131 ms of which 3 ms to minimize.
[2025-06-02 20:44:19] [INFO ] Deduced a trap composed of 127 places in 141 ms of which 2 ms to minimize.
[2025-06-02 20:44:19] [INFO ] Deduced a trap composed of 127 places in 136 ms of which 2 ms to minimize.
[2025-06-02 20:44:19] [INFO ] Deduced a trap composed of 137 places in 130 ms of which 3 ms to minimize.
[2025-06-02 20:44:19] [INFO ] Deduced a trap composed of 166 places in 136 ms of which 2 ms to minimize.
[2025-06-02 20:44:20] [INFO ] Deduced a trap composed of 166 places in 129 ms of which 2 ms to minimize.
[2025-06-02 20:44:20] [INFO ] Deduced a trap composed of 166 places in 132 ms of which 2 ms to minimize.
[2025-06-02 20:44:20] [INFO ] Deduced a trap composed of 168 places in 134 ms of which 2 ms to minimize.
[2025-06-02 20:44:20] [INFO ] Deduced a trap composed of 132 places in 135 ms of which 3 ms to minimize.
[2025-06-02 20:44:20] [INFO ] Deduced a trap composed of 168 places in 133 ms of which 3 ms to minimize.
[2025-06-02 20:44:20] [INFO ] Deduced a trap composed of 166 places in 133 ms of which 2 ms to minimize.
[2025-06-02 20:44:20] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 2 ms to minimize.
[2025-06-02 20:44:21] [INFO ] Deduced a trap composed of 172 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:44:21] [INFO ] Deduced a trap composed of 130 places in 142 ms of which 2 ms to minimize.
[2025-06-02 20:44:21] [INFO ] Deduced a trap composed of 124 places in 138 ms of which 2 ms to minimize.
[2025-06-02 20:44:21] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 3 ms to minimize.
[2025-06-02 20:44:22] [INFO ] Deduced a trap composed of 130 places in 146 ms of which 4 ms to minimize.
[2025-06-02 20:44:22] [INFO ] Deduced a trap composed of 136 places in 137 ms of which 2 ms to minimize.
[2025-06-02 20:44:22] [INFO ] Deduced a trap composed of 136 places in 132 ms of which 2 ms to minimize.
[2025-06-02 20:44:22] [INFO ] Deduced a trap composed of 136 places in 136 ms of which 2 ms to minimize.
[2025-06-02 20:44:22] [INFO ] Deduced a trap composed of 136 places in 140 ms of which 2 ms to minimize.
[2025-06-02 20:44:22] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 5 ms to minimize.
[2025-06-02 20:44:22] [INFO ] Deduced a trap composed of 136 places in 139 ms of which 2 ms to minimize.
[2025-06-02 20:44:23] [INFO ] Deduced a trap composed of 136 places in 133 ms of which 2 ms to minimize.
[2025-06-02 20:44:23] [INFO ] Deduced a trap composed of 148 places in 138 ms of which 2 ms to minimize.
[2025-06-02 20:44:23] [INFO ] Deduced a trap composed of 171 places in 136 ms of which 3 ms to minimize.
[2025-06-02 20:44:23] [INFO ] Deduced a trap composed of 130 places in 137 ms of which 3 ms to minimize.
[2025-06-02 20:44:23] [INFO ] Deduced a trap composed of 124 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:44:23] [INFO ] Deduced a trap composed of 136 places in 142 ms of which 3 ms to minimize.
[2025-06-02 20:44:23] [INFO ] Deduced a trap composed of 174 places in 136 ms of which 2 ms to minimize.
[2025-06-02 20:44:24] [INFO ] Deduced a trap composed of 183 places in 139 ms of which 2 ms to minimize.
[2025-06-02 20:44:24] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 2 ms to minimize.
[2025-06-02 20:44:24] [INFO ] Deduced a trap composed of 125 places in 134 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 5 (OVERLAPS) 9/410 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:44:42] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 2 ms to minimize.
[2025-06-02 20:44:42] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 3 ms to minimize.
SMT process timed out in 33959ms, After SMT, problems are : Problem set: 0 solved, 971 unsolved
Search for dead transitions found 0 dead transitions in 33968ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35703 ms. Remains : 411/411 places, 982/982 transitions.
[2025-06-02 20:44:42] [INFO ] Flatten gal took : 143 ms
RANDOM walk for 40000 steps (2803 resets) in 833 ms. (47 steps per ms) remains 2/2 properties
[2025-06-02 20:44:42] [INFO ] Flatten gal took : 91 ms
[2025-06-02 20:44:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8362194017808328607.gal : 15 ms
[2025-06-02 20:44:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11341063423861553416.prop : 5 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/ReachabilityCardinality8362194017808328607.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11341063423861553416.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40005 steps (368 resets) in 133 ms. (298 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (394 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11341063423861553416.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 128
Interrupted probabilistic random walk after 418035 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 2
Probabilistic random walk after 418035 steps, saw 68323 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
[2025-06-02 20:44:45] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:44:45] [INFO ] Invariant cache hit.
[2025-06-02 20:44:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/410 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 973/1383 variables, 410/472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1383 variables, 1/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1383 variables, 0/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1384 variables, 1/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1384 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1384 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1384/1384 variables, and 474 constraints, problems are : Problem set: 1 solved, 1 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 20:44:46] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 2 ms to minimize.
[2025-06-02 20:44:46] [INFO ] Deduced a trap composed of 158 places in 182 ms of which 2 ms to minimize.
[2025-06-02 20:44:46] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 2 ms to minimize.
[2025-06-02 20:44:46] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 2 ms to minimize.
[2025-06-02 20:44:47] [INFO ] Deduced a trap composed of 166 places in 183 ms of which 2 ms to minimize.
[2025-06-02 20:44:47] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 3 ms to minimize.
[2025-06-02 20:44:47] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 3 ms to minimize.
[2025-06-02 20:44:47] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 2 ms to minimize.
[2025-06-02 20:44:47] [INFO ] Deduced a trap composed of 172 places in 182 ms of which 3 ms to minimize.
[2025-06-02 20:44:48] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 3 ms to minimize.
[2025-06-02 20:44:48] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 2 ms to minimize.
[2025-06-02 20:44:48] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 2 ms to minimize.
[2025-06-02 20:44:48] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:44:48] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:44:49] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 3 ms to minimize.
[2025-06-02 20:44:49] [INFO ] Deduced a trap composed of 166 places in 182 ms of which 2 ms to minimize.
[2025-06-02 20:44:49] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 2 ms to minimize.
[2025-06-02 20:44:49] [INFO ] Deduced a trap composed of 164 places in 187 ms of which 2 ms to minimize.
[2025-06-02 20:44:49] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 2 ms to minimize.
[2025-06-02 20:44:49] [INFO ] Deduced a trap composed of 168 places in 174 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 20/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 20:44:50] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 2 ms to minimize.
[2025-06-02 20:44:50] [INFO ] Deduced a trap composed of 168 places in 179 ms of which 2 ms to minimize.
[2025-06-02 20:44:50] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:44:50] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 2 ms to minimize.
[2025-06-02 20:44:50] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 2 ms to minimize.
[2025-06-02 20:44:51] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 2 ms to minimize.
SMT process timed out in 5508ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 14 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Running 971 sub problems to find dead transitions.
[2025-06-02 20:44:51] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:44:51] [INFO ] Invariant cache hit.
[2025-06-02 20:44:51] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :128 after 1024
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1024 after 2050
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2050 after 2053
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2053 after 2058
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2058 after 2067
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:45:01] [INFO ] Deduced a trap composed of 122 places in 146 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2067 after 2085
[2025-06-02 20:45:01] [INFO ] Deduced a trap composed of 122 places in 151 ms of which 3 ms to minimize.
[2025-06-02 20:45:01] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 2 ms to minimize.
[2025-06-02 20:45:02] [INFO ] Deduced a trap composed of 170 places in 148 ms of which 2 ms to minimize.
[2025-06-02 20:45:02] [INFO ] Deduced a trap composed of 122 places in 145 ms of which 2 ms to minimize.
[2025-06-02 20:45:02] [INFO ] Deduced a trap composed of 127 places in 145 ms of which 2 ms to minimize.
[2025-06-02 20:45:02] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 2 ms to minimize.
[2025-06-02 20:45:02] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 2 ms to minimize.
[2025-06-02 20:45:02] [INFO ] Deduced a trap composed of 127 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:45:03] [INFO ] Deduced a trap composed of 127 places in 141 ms of which 2 ms to minimize.
[2025-06-02 20:45:03] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 2 ms to minimize.
[2025-06-02 20:45:03] [INFO ] Deduced a trap composed of 166 places in 171 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2085 after 27130
[2025-06-02 20:45:03] [INFO ] Deduced a trap composed of 166 places in 133 ms of which 3 ms to minimize.
[2025-06-02 20:45:03] [INFO ] Deduced a trap composed of 166 places in 151 ms of which 2 ms to minimize.
[2025-06-02 20:45:03] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 2 ms to minimize.
[2025-06-02 20:45:03] [INFO ] Deduced a trap composed of 132 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:45:04] [INFO ] Deduced a trap composed of 168 places in 132 ms of which 2 ms to minimize.
[2025-06-02 20:45:04] [INFO ] Deduced a trap composed of 166 places in 167 ms of which 2 ms to minimize.
[2025-06-02 20:45:04] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 3 ms to minimize.
[2025-06-02 20:45:04] [INFO ] Deduced a trap composed of 172 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:45:04] [INFO ] Deduced a trap composed of 130 places in 161 ms of which 2 ms to minimize.
[2025-06-02 20:45:05] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 3 ms to minimize.
[2025-06-02 20:45:05] [INFO ] Deduced a trap composed of 142 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:45:05] [INFO ] Deduced a trap composed of 130 places in 142 ms of which 2 ms to minimize.
[2025-06-02 20:45:05] [INFO ] Deduced a trap composed of 136 places in 150 ms of which 2 ms to minimize.
[2025-06-02 20:45:05] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 2 ms to minimize.
[2025-06-02 20:45:06] [INFO ] Deduced a trap composed of 136 places in 150 ms of which 2 ms to minimize.
[2025-06-02 20:45:06] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 2 ms to minimize.
[2025-06-02 20:45:06] [INFO ] Deduced a trap composed of 142 places in 152 ms of which 2 ms to minimize.
[2025-06-02 20:45:06] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 2 ms to minimize.
[2025-06-02 20:45:06] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 2 ms to minimize.
[2025-06-02 20:45:06] [INFO ] Deduced a trap composed of 148 places in 148 ms of which 2 ms to minimize.
[2025-06-02 20:45:06] [INFO ] Deduced a trap composed of 171 places in 148 ms of which 2 ms to minimize.
[2025-06-02 20:45:07] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 2 ms to minimize.
[2025-06-02 20:45:07] [INFO ] Deduced a trap composed of 124 places in 147 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
[2025-06-02 20:45:07] [INFO ] Deduced a trap composed of 136 places in 149 ms of which 3 ms to minimize.
SDD size :27130 after 127876
[2025-06-02 20:45:07] [INFO ] Deduced a trap composed of 174 places in 150 ms of which 2 ms to minimize.
[2025-06-02 20:45:07] [INFO ] Deduced a trap composed of 183 places in 238 ms of which 2 ms to minimize.
[2025-06-02 20:45:08] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 2 ms to minimize.
[2025-06-02 20:45:08] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1384 variables, and 92 constraints, problems are : Problem set: 0 solved, 971 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 971/971 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 971 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:45:16] [INFO ] Deduced a trap composed of 160 places in 149 ms of which 2 ms to minimize.
[2025-06-02 20:45:16] [INFO ] Deduced a trap composed of 162 places in 123 ms of which 2 ms to minimize.
[2025-06-02 20:45:16] [INFO ] Deduced a trap composed of 112 places in 230 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
[2025-06-02 20:45:16] [INFO ] Deduced a trap composed of 177 places in 223 ms of which 2 ms to minimize.
SDD size :127876 after 430188
[2025-06-02 20:45:17] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:45:17] [INFO ] Deduced a trap composed of 181 places in 219 ms of which 3 ms to minimize.
[2025-06-02 20:45:17] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:45:17] [INFO ] Deduced a trap composed of 179 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:45:17] [INFO ] Deduced a trap composed of 176 places in 222 ms of which 2 ms to minimize.
[2025-06-02 20:45:18] [INFO ] Deduced a trap composed of 132 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:45:18] [INFO ] Deduced a trap composed of 174 places in 220 ms of which 3 ms to minimize.
[2025-06-02 20:45:18] [INFO ] Deduced a trap composed of 127 places in 213 ms of which 3 ms to minimize.
[2025-06-02 20:45:18] [INFO ] Deduced a trap composed of 183 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:45:19] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:45:19] [INFO ] Deduced a trap composed of 179 places in 226 ms of which 2 ms to minimize.
[2025-06-02 20:45:19] [INFO ] Deduced a trap composed of 171 places in 222 ms of which 2 ms to minimize.
[2025-06-02 20:45:19] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:45:20] [INFO ] Deduced a trap composed of 172 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:45:20] [INFO ] Deduced a trap composed of 173 places in 231 ms of which 2 ms to minimize.
[2025-06-02 20:45:20] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:45:21] [INFO ] Deduced a trap composed of 177 places in 223 ms of which 2 ms to minimize.
[2025-06-02 20:45:21] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 2 ms to minimize.
[2025-06-02 20:45:21] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 2 ms to minimize.
[2025-06-02 20:45:21] [INFO ] Deduced a trap composed of 127 places in 228 ms of which 2 ms to minimize.
[2025-06-02 20:45:22] [INFO ] Deduced a trap composed of 179 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:45:22] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 2 ms to minimize.
[2025-06-02 20:45:22] [INFO ] Deduced a trap composed of 179 places in 201 ms of which 2 ms to minimize.
[2025-06-02 20:45:22] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:45:22] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 3 ms to minimize.
[2025-06-02 20:45:23] [INFO ] Deduced a trap composed of 167 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:45:23] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:45:23] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:45:23] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 2 ms to minimize.
[2025-06-02 20:45:24] [INFO ] Deduced a trap composed of 146 places in 228 ms of which 2 ms to minimize.
[2025-06-02 20:45:24] [INFO ] Deduced a trap composed of 117 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:45:24] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 3 ms to minimize.
[2025-06-02 20:45:24] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 3 ms to minimize.
[2025-06-02 20:45:24] [INFO ] Deduced a trap composed of 173 places in 227 ms of which 2 ms to minimize.
[2025-06-02 20:45:25] [INFO ] Deduced a trap composed of 171 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:45:25] [INFO ] Deduced a trap composed of 174 places in 226 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:45:26] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2025-06-02 20:45:27] [INFO ] Deduced a trap composed of 127 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:45:27] [INFO ] Deduced a trap composed of 127 places in 216 ms of which 3 ms to minimize.
[2025-06-02 20:45:27] [INFO ] Deduced a trap composed of 136 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:45:27] [INFO ] Deduced a trap composed of 117 places in 225 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
[2025-06-02 20:45:28] [INFO ] Deduced a trap composed of 122 places in 220 ms of which 2 ms to minimize.
SDD size :430188 after 1.18257e+06
[2025-06-02 20:45:28] [INFO ] Deduced a trap composed of 126 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:45:28] [INFO ] Deduced a trap composed of 132 places in 218 ms of which 3 ms to minimize.
[2025-06-02 20:45:28] [INFO ] Deduced a trap composed of 141 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:45:28] [INFO ] Deduced a trap composed of 122 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:45:29] [INFO ] Deduced a trap composed of 141 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:45:29] [INFO ] Deduced a trap composed of 136 places in 220 ms of which 3 ms to minimize.
[2025-06-02 20:45:29] [INFO ] Deduced a trap composed of 117 places in 236 ms of which 2 ms to minimize.
[2025-06-02 20:45:29] [INFO ] Deduced a trap composed of 136 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:45:30] [INFO ] Deduced a trap composed of 141 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:45:30] [INFO ] Deduced a trap composed of 131 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:45:30] [INFO ] Deduced a trap composed of 136 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:45:30] [INFO ] Deduced a trap composed of 117 places in 214 ms of which 3 ms to minimize.
[2025-06-02 20:45:31] [INFO ] Deduced a trap composed of 131 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:45:31] [INFO ] Deduced a trap composed of 136 places in 216 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 971 unsolved
Detected timeout of ITS tools.
[2025-06-02 20:45:32] [INFO ] Flatten gal took : 52 ms
[2025-06-02 20:45:32] [INFO ] Applying decomposition
[2025-06-02 20:45:32] [INFO ] Flatten gal took : 52 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/graph17069351341589553199.txt' '-o' '/tmp/graph17069351341589553199.bin' '-w' '/tmp/graph17069351341589553199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17069351341589553199.bin' '-l' '-1' '-v' '-w' '/tmp/graph17069351341589553199.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:45:32] [INFO ] Decomposing Gal with order
[2025-06-02 20:45:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:45:33] [INFO ] Removed a total of 2737 redundant transitions.
[2025-06-02 20:45:33] [INFO ] Flatten gal took : 114 ms
[2025-06-02 20:45:33] [INFO ] Deduced a trap composed of 168 places in 541 ms of which 2 ms to minimize.
[2025-06-02 20:45:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 259 labels/synchronizations in 39 ms.
[2025-06-02 20:45:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality516668293355423634.gal : 11 ms
[2025-06-02 20:45:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1474040572976040484.prop : 18 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/ReachabilityCardinality516668293355423634.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1474040572976040484.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality1474040572976040484.prop.
[2025-06-02 20:45:33] [INFO ] Deduced a trap composed of 170 places in 380 ms of which 18 ms to minimize.
[2025-06-02 20:45:33] [INFO ] Deduced a trap composed of 185 places in 238 ms of which 2 ms to minimize.
[2025-06-02 20:45:34] [INFO ] Deduced a trap composed of 189 places in 233 ms of which 2 ms to minimize.
[2025-06-02 20:45:34] [INFO ] Deduced a trap composed of 170 places in 218 ms of which 3 ms to minimize.
[2025-06-02 20:45:34] [INFO ] Deduced a trap composed of 172 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:45:34] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:45:35] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:45:35] [INFO ] Deduced a trap composed of 172 places in 224 ms of which 2 ms to minimize.
SMT process timed out in 44190ms, After SMT, problems are : Problem set: 0 solved, 971 unsolved
Search for dead transitions found 0 dead transitions in 44214ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44231 ms. Remains : 411/411 places, 982/982 transitions.
RANDOM walk for 40000 steps (2852 resets) in 616 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (388 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 542218 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 542218 steps, saw 88248 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2025-06-02 20:45:38] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:45:38] [INFO ] Invariant cache hit.
[2025-06-02 20:45:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/410 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 973/1383 variables, 410/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1383 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1383 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1384 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1384/1384 variables, and 474 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 317/375 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/397 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/408 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:45:39] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 2 ms to minimize.
[2025-06-02 20:45:39] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 3 ms to minimize.
[2025-06-02 20:45:39] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 3 ms to minimize.
[2025-06-02 20:45:39] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:45:40] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 3 ms to minimize.
[2025-06-02 20:45:40] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 3 ms to minimize.
[2025-06-02 20:45:40] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 2 ms to minimize.
[2025-06-02 20:45:40] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 2 ms to minimize.
[2025-06-02 20:45:40] [INFO ] Deduced a trap composed of 172 places in 180 ms of which 3 ms to minimize.
[2025-06-02 20:45:41] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 2 ms to minimize.
[2025-06-02 20:45:41] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 2 ms to minimize.
[2025-06-02 20:45:41] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 3 ms to minimize.
[2025-06-02 20:45:41] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 2 ms to minimize.
[2025-06-02 20:45:41] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 2 ms to minimize.
[2025-06-02 20:45:42] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 2 ms to minimize.
[2025-06-02 20:45:42] [INFO ] Deduced a trap composed of 166 places in 182 ms of which 3 ms to minimize.
[2025-06-02 20:45:42] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 2 ms to minimize.
[2025-06-02 20:45:42] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 2 ms to minimize.
[2025-06-02 20:45:42] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 2 ms to minimize.
[2025-06-02 20:45:42] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:45:43] [INFO ] Deduced a trap composed of 166 places in 182 ms of which 2 ms to minimize.
[2025-06-02 20:45:43] [INFO ] Deduced a trap composed of 168 places in 183 ms of which 13 ms to minimize.
[2025-06-02 20:45:43] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 3 ms to minimize.
[2025-06-02 20:45:43] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 2 ms to minimize.
[2025-06-02 20:45:43] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 2 ms to minimize.
[2025-06-02 20:45:44] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 3 ms to minimize.
[2025-06-02 20:45:44] [INFO ] Deduced a trap composed of 169 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:45:44] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 2 ms to minimize.
[2025-06-02 20:45:44] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 3 ms to minimize.
[2025-06-02 20:45:44] [INFO ] Deduced a trap composed of 156 places in 184 ms of which 2 ms to minimize.
[2025-06-02 20:45:45] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 3 ms to minimize.
[2025-06-02 20:45:45] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 2 ms to minimize.
[2025-06-02 20:45:45] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 2 ms to minimize.
[2025-06-02 20:45:45] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 2 ms to minimize.
[2025-06-02 20:45:45] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:45:46] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 2 ms to minimize.
[2025-06-02 20:45:46] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 14 ms to minimize.
[2025-06-02 20:45:46] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 2 ms to minimize.
[2025-06-02 20:45:46] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 3 ms to minimize.
[2025-06-02 20:45:46] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:45:47] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:45:47] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 3 ms to minimize.
[2025-06-02 20:45:47] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 2 ms to minimize.
[2025-06-02 20:45:47] [INFO ] Deduced a trap composed of 170 places in 193 ms of which 3 ms to minimize.
[2025-06-02 20:45:47] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 2 ms to minimize.
[2025-06-02 20:45:48] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 2 ms to minimize.
[2025-06-02 20:45:48] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:45:48] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:45:48] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 2 ms to minimize.
[2025-06-02 20:45:49] [INFO ] Deduced a trap composed of 166 places in 187 ms of which 2 ms to minimize.
[2025-06-02 20:45:49] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 2 ms to minimize.
[2025-06-02 20:45:49] [INFO ] Deduced a trap composed of 172 places in 193 ms of which 2 ms to minimize.
[2025-06-02 20:45:49] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 2 ms to minimize.
[2025-06-02 20:45:50] [INFO ] Deduced a trap composed of 166 places in 180 ms of which 2 ms to minimize.
[2025-06-02 20:45:50] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 3 ms to minimize.
[2025-06-02 20:45:50] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 2 ms to minimize.
[2025-06-02 20:45:51] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 2 ms to minimize.
[2025-06-02 20:45:51] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 2 ms to minimize.
[2025-06-02 20:45:51] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 2 ms to minimize.
[2025-06-02 20:45:51] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:45:51] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 3 ms to minimize.
[2025-06-02 20:45:52] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 2 ms to minimize.
[2025-06-02 20:45:52] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:45:52] [INFO ] Deduced a trap composed of 156 places in 183 ms of which 2 ms to minimize.
[2025-06-02 20:45:52] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 2 ms to minimize.
[2025-06-02 20:45:53] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 2 ms to minimize.
[2025-06-02 20:45:53] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 3 ms to minimize.
[2025-06-02 20:45:53] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 2 ms to minimize.
[2025-06-02 20:45:53] [INFO ] Deduced a trap composed of 158 places in 182 ms of which 2 ms to minimize.
[2025-06-02 20:45:53] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 2 ms to minimize.
[2025-06-02 20:45:54] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 2 ms to minimize.
[2025-06-02 20:45:54] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 2 ms to minimize.
[2025-06-02 20:45:54] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 2 ms to minimize.
[2025-06-02 20:45:54] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 3 ms to minimize.
[2025-06-02 20:45:55] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 2 ms to minimize.
[2025-06-02 20:45:55] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 3 ms to minimize.
[2025-06-02 20:45:55] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 3 ms to minimize.
[2025-06-02 20:45:55] [INFO ] Deduced a trap composed of 170 places in 177 ms of which 2 ms to minimize.
[2025-06-02 20:45:55] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 2 ms to minimize.
[2025-06-02 20:45:55] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:45:56] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 2 ms to minimize.
[2025-06-02 20:45:56] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 2 ms to minimize.
[2025-06-02 20:45:56] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 2 ms to minimize.
[2025-06-02 20:45:56] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 2 ms to minimize.
[2025-06-02 20:45:56] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 2 ms to minimize.
[2025-06-02 20:45:57] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 3 ms to minimize.
[2025-06-02 20:45:57] [INFO ] Deduced a trap composed of 168 places in 189 ms of which 3 ms to minimize.
[2025-06-02 20:45:57] [INFO ] Deduced a trap composed of 160 places in 182 ms of which 2 ms to minimize.
[2025-06-02 20:45:57] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 3 ms to minimize.
[2025-06-02 20:45:57] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 3 ms to minimize.
[2025-06-02 20:45:58] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 2 ms to minimize.
[2025-06-02 20:45:58] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 2 ms to minimize.
[2025-06-02 20:45:58] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 2 ms to minimize.
[2025-06-02 20:45:58] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 2 ms to minimize.
[2025-06-02 20:45:58] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 3 ms to minimize.
[2025-06-02 20:45:58] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 2 ms to minimize.
[2025-06-02 20:45:59] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 2 ms to minimize.
[2025-06-02 20:45:59] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 3 ms to minimize.
[2025-06-02 20:45:59] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 2 ms to minimize.
[2025-06-02 20:45:59] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:45:59] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 2 ms to minimize.
[2025-06-02 20:46:00] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 2 ms to minimize.
[2025-06-02 20:46:01] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 2 ms to minimize.
[2025-06-02 20:46:01] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:46:01] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 2 ms to minimize.
[2025-06-02 20:46:02] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 2 ms to minimize.
[2025-06-02 20:46:02] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 2 ms to minimize.
[2025-06-02 20:46:02] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 2 ms to minimize.
[2025-06-02 20:46:03] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 2 ms to minimize.
[2025-06-02 20:46:03] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 2 ms to minimize.
[2025-06-02 20:46:03] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 2 ms to minimize.
[2025-06-02 20:46:04] [INFO ] Deduced a trap composed of 170 places in 177 ms of which 3 ms to minimize.
[2025-06-02 20:46:04] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 2 ms to minimize.
[2025-06-02 20:46:04] [INFO ] Deduced a trap composed of 168 places in 183 ms of which 2 ms to minimize.
[2025-06-02 20:46:04] [INFO ] Deduced a trap composed of 160 places in 179 ms of which 2 ms to minimize.
[2025-06-02 20:46:04] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 2 ms to minimize.
[2025-06-02 20:46:05] [INFO ] Deduced a trap composed of 172 places in 170 ms of which 2 ms to minimize.
[2025-06-02 20:46:05] [INFO ] Deduced a trap composed of 168 places in 179 ms of which 2 ms to minimize.
[2025-06-02 20:46:05] [INFO ] Deduced a trap composed of 168 places in 171 ms of which 2 ms to minimize.
[2025-06-02 20:46:06] [INFO ] Deduced a trap composed of 154 places in 186 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:46:06] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 3 ms to minimize.
[2025-06-02 20:46:06] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 2 ms to minimize.
[2025-06-02 20:46:07] [INFO ] Deduced a trap composed of 166 places in 183 ms of which 2 ms to minimize.
[2025-06-02 20:46:08] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 2 ms to minimize.
[2025-06-02 20:46:08] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 2 ms to minimize.
[2025-06-02 20:46:08] [INFO ] Deduced a trap composed of 156 places in 181 ms of which 3 ms to minimize.
[2025-06-02 20:46:09] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 2 ms to minimize.
[2025-06-02 20:46:09] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:46:09] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 2 ms to minimize.
[2025-06-02 20:46:11] [INFO ] Deduced a trap composed of 154 places in 182 ms of which 3 ms to minimize.
[2025-06-02 20:46:11] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 2 ms to minimize.
[2025-06-02 20:46:11] [INFO ] Deduced a trap composed of 168 places in 179 ms of which 3 ms to minimize.
[2025-06-02 20:46:11] [INFO ] Deduced a trap composed of 164 places in 179 ms of which 2 ms to minimize.
[2025-06-02 20:46:11] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 2 ms to minimize.
[2025-06-02 20:46:12] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 2 ms to minimize.
[2025-06-02 20:46:12] [INFO ] Deduced a trap composed of 156 places in 176 ms of which 2 ms to minimize.
[2025-06-02 20:46:12] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 2 ms to minimize.
[2025-06-02 20:46:12] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 2 ms to minimize.
[2025-06-02 20:46:12] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 2 ms to minimize.
[2025-06-02 20:46:13] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:46:13] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 2 ms to minimize.
[2025-06-02 20:46:13] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 2 ms to minimize.
[2025-06-02 20:46:13] [INFO ] Deduced a trap composed of 162 places in 180 ms of which 2 ms to minimize.
[2025-06-02 20:46:13] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 2 ms to minimize.
[2025-06-02 20:46:14] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 2 ms to minimize.
[2025-06-02 20:46:14] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 3 ms to minimize.
[2025-06-02 20:46:14] [INFO ] Deduced a trap composed of 166 places in 174 ms of which 2 ms to minimize.
[2025-06-02 20:46:14] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 2 ms to minimize.
[2025-06-02 20:46:14] [INFO ] Deduced a trap composed of 166 places in 166 ms of which 2 ms to minimize.
[2025-06-02 20:46:14] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 14 ms to minimize.
[2025-06-02 20:46:15] [INFO ] Deduced a trap composed of 152 places in 172 ms of which 3 ms to minimize.
[2025-06-02 20:46:15] [INFO ] Deduced a trap composed of 166 places in 172 ms of which 2 ms to minimize.
[2025-06-02 20:46:15] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 2 ms to minimize.
[2025-06-02 20:46:15] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 2 ms to minimize.
[2025-06-02 20:46:15] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 2 ms to minimize.
[2025-06-02 20:46:16] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 2 ms to minimize.
[2025-06-02 20:46:16] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 2 ms to minimize.
[2025-06-02 20:46:16] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 3 ms to minimize.
[2025-06-02 20:46:16] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 2 ms to minimize.
[2025-06-02 20:46:17] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:46:17] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 2 ms to minimize.
[2025-06-02 20:46:17] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 2 ms to minimize.
[2025-06-02 20:46:18] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 2 ms to minimize.
[2025-06-02 20:46:18] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:46:19] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 2 ms to minimize.
[2025-06-02 20:46:19] [INFO ] Deduced a trap composed of 150 places in 195 ms of which 2 ms to minimize.
[2025-06-02 20:46:19] [INFO ] Deduced a trap composed of 170 places in 190 ms of which 3 ms to minimize.
[2025-06-02 20:46:19] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 2 ms to minimize.
[2025-06-02 20:46:22] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 2 ms to minimize.
[2025-06-02 20:46:22] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:46:22] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 2 ms to minimize.
[2025-06-02 20:46:22] [INFO ] Deduced a trap composed of 166 places in 180 ms of which 2 ms to minimize.
[2025-06-02 20:46:23] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 20:46:23] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 3 ms to minimize.
[2025-06-02 20:46:23] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:46:23] [INFO ] Deduced a trap composed of 170 places in 177 ms of which 2 ms to minimize.
[2025-06-02 20:46:24] [INFO ] Deduced a trap composed of 166 places in 177 ms of which 3 ms to minimize.
SMT process timed out in 45428ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 29 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 15 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2025-06-02 20:46:24] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:46:24] [INFO ] Invariant cache hit.
[2025-06-02 20:46:24] [INFO ] Implicit Places using invariants in 324 ms returned []
[2025-06-02 20:46:24] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:46:24] [INFO ] Invariant cache hit.
[2025-06-02 20:46:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:46:25] [INFO ] Implicit Places using invariants and state equation in 1385 ms returned []
Implicit Place search using SMT with State Equation took 1710 ms to find 0 implicit places.
[2025-06-02 20:46:25] [INFO ] Redundant transitions in 14 ms returned []
Running 971 sub problems to find dead transitions.
[2025-06-02 20:46:25] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2025-06-02 20:46:25] [INFO ] Invariant cache hit.
[2025-06-02 20:46:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:46:35] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 3 ms to minimize.
[2025-06-02 20:46:35] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 2 ms to minimize.
[2025-06-02 20:46:35] [INFO ] Deduced a trap composed of 122 places in 150 ms of which 3 ms to minimize.
[2025-06-02 20:46:36] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 2 ms to minimize.
[2025-06-02 20:46:36] [INFO ] Deduced a trap composed of 122 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:46:36] [INFO ] Deduced a trap composed of 127 places in 137 ms of which 2 ms to minimize.
[2025-06-02 20:46:36] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 2 ms to minimize.
[2025-06-02 20:46:36] [INFO ] Deduced a trap composed of 122 places in 152 ms of which 2 ms to minimize.
[2025-06-02 20:46:36] [INFO ] Deduced a trap composed of 127 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:46:37] [INFO ] Deduced a trap composed of 127 places in 151 ms of which 2 ms to minimize.
[2025-06-02 20:46:37] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 3 ms to minimize.
[2025-06-02 20:46:37] [INFO ] Deduced a trap composed of 166 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:46:37] [INFO ] Deduced a trap composed of 166 places in 140 ms of which 2 ms to minimize.
[2025-06-02 20:46:37] [INFO ] Deduced a trap composed of 166 places in 155 ms of which 3 ms to minimize.
[2025-06-02 20:46:37] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 2 ms to minimize.
[2025-06-02 20:46:37] [INFO ] Deduced a trap composed of 132 places in 149 ms of which 3 ms to minimize.
[2025-06-02 20:46:38] [INFO ] Deduced a trap composed of 168 places in 152 ms of which 2 ms to minimize.
[2025-06-02 20:46:38] [INFO ] Deduced a trap composed of 166 places in 144 ms of which 2 ms to minimize.
[2025-06-02 20:46:38] [INFO ] Deduced a trap composed of 137 places in 136 ms of which 2 ms to minimize.
[2025-06-02 20:46:38] [INFO ] Deduced a trap composed of 172 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:46:39] [INFO ] Deduced a trap composed of 130 places in 156 ms of which 2 ms to minimize.
[2025-06-02 20:46:39] [INFO ] Deduced a trap composed of 124 places in 143 ms of which 2 ms to minimize.
[2025-06-02 20:46:39] [INFO ] Deduced a trap composed of 142 places in 155 ms of which 2 ms to minimize.
[2025-06-02 20:46:39] [INFO ] Deduced a trap composed of 130 places in 160 ms of which 2 ms to minimize.
[2025-06-02 20:46:39] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 2 ms to minimize.
[2025-06-02 20:46:39] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 3 ms to minimize.
[2025-06-02 20:46:40] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 2 ms to minimize.
[2025-06-02 20:46:40] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:46:40] [INFO ] Deduced a trap composed of 142 places in 158 ms of which 2 ms to minimize.
[2025-06-02 20:46:40] [INFO ] Deduced a trap composed of 136 places in 149 ms of which 2 ms to minimize.
[2025-06-02 20:46:40] [INFO ] Deduced a trap composed of 136 places in 137 ms of which 2 ms to minimize.
[2025-06-02 20:46:40] [INFO ] Deduced a trap composed of 148 places in 156 ms of which 3 ms to minimize.
[2025-06-02 20:46:41] [INFO ] Deduced a trap composed of 171 places in 289 ms of which 2 ms to minimize.
[2025-06-02 20:46:41] [INFO ] Deduced a trap composed of 130 places in 160 ms of which 2 ms to minimize.
[2025-06-02 20:46:41] [INFO ] Deduced a trap composed of 124 places in 155 ms of which 2 ms to minimize.
[2025-06-02 20:46:41] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 2 ms to minimize.
[2025-06-02 20:46:41] [INFO ] Deduced a trap composed of 174 places in 158 ms of which 3 ms to minimize.
[2025-06-02 20:46:42] [INFO ] Deduced a trap composed of 183 places in 160 ms of which 2 ms to minimize.
[2025-06-02 20:46:42] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:46:42] [INFO ] Deduced a trap composed of 125 places in 156 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 5 (OVERLAPS) 9/410 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 971 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1384 variables, and 101 constraints, problems are : Problem set: 0 solved, 971 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 971/971 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 971 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:47:00] [INFO ] Deduced a trap composed of 160 places in 135 ms of which 2 ms to minimize.
[2025-06-02 20:47:00] [INFO ] Deduced a trap composed of 162 places in 133 ms of which 2 ms to minimize.
[2025-06-02 20:47:00] [INFO ] Deduced a trap composed of 112 places in 232 ms of which 2 ms to minimize.
[2025-06-02 20:47:01] [INFO ] Deduced a trap composed of 177 places in 222 ms of which 3 ms to minimize.
[2025-06-02 20:47:01] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 3 ms to minimize.
[2025-06-02 20:47:01] [INFO ] Deduced a trap composed of 181 places in 219 ms of which 3 ms to minimize.
[2025-06-02 20:47:01] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:47:01] [INFO ] Deduced a trap composed of 179 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:47:02] [INFO ] Deduced a trap composed of 176 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:47:02] [INFO ] Deduced a trap composed of 132 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:47:02] [INFO ] Deduced a trap composed of 174 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:47:02] [INFO ] Deduced a trap composed of 127 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:47:03] [INFO ] Deduced a trap composed of 183 places in 219 ms of which 3 ms to minimize.
[2025-06-02 20:47:03] [INFO ] Deduced a trap composed of 177 places in 215 ms of which 3 ms to minimize.
[2025-06-02 20:47:03] [INFO ] Deduced a trap composed of 179 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:47:03] [INFO ] Deduced a trap composed of 171 places in 222 ms of which 2 ms to minimize.
[2025-06-02 20:47:04] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:47:04] [INFO ] Deduced a trap composed of 172 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:47:04] [INFO ] Deduced a trap composed of 173 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:47:04] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:47:05] [INFO ] Deduced a trap composed of 177 places in 222 ms of which 3 ms to minimize.
[2025-06-02 20:47:05] [INFO ] Deduced a trap composed of 168 places in 222 ms of which 2 ms to minimize.
[2025-06-02 20:47:05] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 3 ms to minimize.
[2025-06-02 20:47:06] [INFO ] Deduced a trap composed of 127 places in 232 ms of which 2 ms to minimize.
[2025-06-02 20:47:06] [INFO ] Deduced a trap composed of 179 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:47:06] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:47:06] [INFO ] Deduced a trap composed of 179 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:47:06] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 2 ms to minimize.
[2025-06-02 20:47:07] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:47:07] [INFO ] Deduced a trap composed of 167 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:47:07] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 3 ms to minimize.
[2025-06-02 20:47:07] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:47:08] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 2 ms to minimize.
[2025-06-02 20:47:08] [INFO ] Deduced a trap composed of 146 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:47:08] [INFO ] Deduced a trap composed of 117 places in 223 ms of which 2 ms to minimize.
[2025-06-02 20:47:08] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 3 ms to minimize.
[2025-06-02 20:47:09] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 2 ms to minimize.
[2025-06-02 20:47:09] [INFO ] Deduced a trap composed of 173 places in 222 ms of which 2 ms to minimize.
[2025-06-02 20:47:09] [INFO ] Deduced a trap composed of 171 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:47:09] [INFO ] Deduced a trap composed of 174 places in 220 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:47:11] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 1 ms to minimize.
[2025-06-02 20:47:11] [INFO ] Deduced a trap composed of 127 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:47:11] [INFO ] Deduced a trap composed of 127 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:47:12] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:47:12] [INFO ] Deduced a trap composed of 117 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:47:12] [INFO ] Deduced a trap composed of 122 places in 217 ms of which 2 ms to minimize.
[2025-06-02 20:47:12] [INFO ] Deduced a trap composed of 126 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:47:12] [INFO ] Deduced a trap composed of 132 places in 223 ms of which 2 ms to minimize.
[2025-06-02 20:47:13] [INFO ] Deduced a trap composed of 141 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:47:13] [INFO ] Deduced a trap composed of 122 places in 222 ms of which 2 ms to minimize.
[2025-06-02 20:47:13] [INFO ] Deduced a trap composed of 141 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:47:13] [INFO ] Deduced a trap composed of 136 places in 216 ms of which 3 ms to minimize.
[2025-06-02 20:47:14] [INFO ] Deduced a trap composed of 117 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:47:14] [INFO ] Deduced a trap composed of 136 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:47:14] [INFO ] Deduced a trap composed of 141 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:47:14] [INFO ] Deduced a trap composed of 131 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:47:15] [INFO ] Deduced a trap composed of 136 places in 221 ms of which 3 ms to minimize.
[2025-06-02 20:47:15] [INFO ] Deduced a trap composed of 117 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:47:15] [INFO ] Deduced a trap composed of 131 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:47:15] [INFO ] Deduced a trap composed of 136 places in 212 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:47:17] [INFO ] Deduced a trap composed of 168 places in 223 ms of which 2 ms to minimize.
[2025-06-02 20:47:17] [INFO ] Deduced a trap composed of 170 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:47:17] [INFO ] Deduced a trap composed of 185 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:47:18] [INFO ] Deduced a trap composed of 189 places in 227 ms of which 2 ms to minimize.
[2025-06-02 20:47:18] [INFO ] Deduced a trap composed of 170 places in 224 ms of which 2 ms to minimize.
[2025-06-02 20:47:18] [INFO ] Deduced a trap composed of 172 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:47:18] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:47:19] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 2 ms to minimize.
[2025-06-02 20:47:19] [INFO ] Deduced a trap composed of 172 places in 229 ms of which 2 ms to minimize.
[2025-06-02 20:47:19] [INFO ] Deduced a trap composed of 170 places in 235 ms of which 2 ms to minimize.
[2025-06-02 20:47:19] [INFO ] Deduced a trap composed of 177 places in 239 ms of which 2 ms to minimize.
[2025-06-02 20:47:20] [INFO ] Deduced a trap composed of 177 places in 238 ms of which 2 ms to minimize.
[2025-06-02 20:47:20] [INFO ] Deduced a trap composed of 181 places in 243 ms of which 3 ms to minimize.
[2025-06-02 20:47:20] [INFO ] Deduced a trap composed of 177 places in 247 ms of which 2 ms to minimize.
[2025-06-02 20:47:20] [INFO ] Deduced a trap composed of 177 places in 223 ms of which 2 ms to minimize.
[2025-06-02 20:47:21] [INFO ] Deduced a trap composed of 122 places in 233 ms of which 3 ms to minimize.
[2025-06-02 20:47:21] [INFO ] Deduced a trap composed of 166 places in 251 ms of which 3 ms to minimize.
[2025-06-02 20:47:21] [INFO ] Deduced a trap composed of 177 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:47:22] [INFO ] Deduced a trap composed of 175 places in 227 ms of which 2 ms to minimize.
[2025-06-02 20:47:22] [INFO ] Deduced a trap composed of 170 places in 243 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2025-06-02 20:47:27] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1384 variables, and 173 constraints, problems are : Problem set: 0 solved, 971 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/971 constraints, Known Traps: 121/121 constraints]
After SMT, in 63574ms problems are : Problem set: 0 solved, 971 unsolved
Search for dead transitions found 0 dead transitions in 63583ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65336 ms. Remains : 411/411 places, 982/982 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-07 in 295545 ms.
[2025-06-02 20:47:29] [INFO ] Flatten gal took : 58 ms
[2025-06-02 20:47:29] [INFO ] Applying decomposition
[2025-06-02 20:47:29] [INFO ] Flatten gal took : 51 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/graph5894855617977698949.txt' '-o' '/tmp/graph5894855617977698949.bin' '-w' '/tmp/graph5894855617977698949.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5894855617977698949.bin' '-l' '-1' '-v' '-w' '/tmp/graph5894855617977698949.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:47:29] [INFO ] Decomposing Gal with order
[2025-06-02 20:47:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:47:29] [INFO ] Removed a total of 2736 redundant transitions.
[2025-06-02 20:47:29] [INFO ] Flatten gal took : 104 ms
[2025-06-02 20:47:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 255 labels/synchronizations in 31 ms.
[2025-06-02 20:47:29] [INFO ] Time to serialize gal into /tmp/UpperBounds5379291485546396329.gal : 10 ms
[2025-06-02 20:47:29] [INFO ] Time to serialize properties into /tmp/UpperBounds7549897822163889456.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/UpperBounds5379291485546396329.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7549897822163889456.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds7549897822163889456.prop.
ITS-tools command line returned an error code 137
[2025-06-02 20:54:44] [INFO ] Applying decomposition
[2025-06-02 20:54:44] [INFO ] Flatten gal took : 46 ms
[2025-06-02 20:54:44] [INFO ] Decomposing Gal with order
[2025-06-02 20:54:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:54:44] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to block in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[CreatedJobs_30],[CreatedJobs_31],[CreatedJobs_32],[CreatedJobs_33],[CreatedJobs_34],[CreatedJobs_35],[CreatedJobs_36],[CreatedJobs_37],[CreatedJobs_38],[CreatedJobs_39],[CreatedJobs_40],[CreatedJobs_41],[CreatedJobs_42],[CreatedJobs_43],[CreatedJobs_44],[CreatedJobs_45],[CreatedJobs_46],[CreatedJobs_47],[CreatedJobs_48],[CreatedJobs_49],[CreatedJobs_50],[CreatedJobs_51],[CreatedJobs_52],[CreatedJobs_53],[CreatedJobs_54],[CreatedJobs_55],[CreatedJobs_56],[CreatedJobs_57],[CreatedJobs_58],[CreatedJobs_59],[CreatedJobs_60],[CreatedJobs_61],[CreatedJobs_62],[CreatedJobs_63],[CreatedJobs_64],[CreatedJobs_65],[CreatedJobs_66],[CreatedJobs_67],[CreatedJobs_68],[CreatedJobs_69],[CreatedJobs_70],[CreatedJobs_71],[CreatedJobs_72],[CreatedJobs_73],[CreatedJobs_74],[CreatedJobs_75],[CreatedJobs_76],[CreatedJobs_77],[CreatedJobs_78],[CreatedJobs_79],[CreatedJobs_80],[CreatedJobs_81],[CreatedJobs_82],[CreatedJobs_83],[CreatedJobs_84],[CreatedJobs_85],[CreatedJobs_86],[CreatedJobs_87],[CreatedJobs_88],[CreatedJobs_89],[CreatedJobs_90],[CreatedJobs_91],[CreatedJobs_92],[CreatedJobs_93],[CreatedJobs_94],[CreatedJobs_95],[CreatedJobs_96],[CreatedJobs_97],[CreatedJobs_98],[CreatedJobs_99],[CreatedJobs_100],[CreatedJobs_101],[CreatedJobs_102],[CreatedJobs_103],[CreatedJobs_104],[CreatedJobs_105],[CreatedJobs_106],[CreatedJobs_107],[CreatedJobs_108],[CreatedJobs_109],[CreatedJobs_110],[CreatedJobs_111],[CreatedJobs_112],[CreatedJobs_113],[CreatedJobs_114],[CreatedJobs_115],[CreatedJobs_116],[CreatedJobs_117],[CreatedJobs_118],[CreatedJobs_119],[CreatedJobs_120],[CreatedJobs_121],[CreatedJobs_122],[CreatedJobs_123],[CreatedJobs_124],[CreatedJobs_125],[CreatedJobs_126],[CreatedJobs_127],[CreatedJobs_128],[CreatedJobs_129],[CreatedJobs_130],[CreatedJobs_131],[CreatedJobs_132],[CreatedJobs_133],[CreatedJobs_134],[CreatedJobs_135],[CreatedJobs_136],[CreatedJobs_137],[CreatedJobs_138],[CreatedJobs_139],[CreatedJobs_140],[CreatedJobs_141],[CreatedJobs_142],[CreatedJobs_143],[CreatedJobs_144],[CreatedJobs_145],[CreatedJobs_146],[CreatedJobs_147],[CreatedJobs_148],[CreatedJobs_149],[CreatedJobs_150],[CreatedJobs_151],[CreatedJobs_152],[CreatedJobs_153],[CreatedJobs_154],[CreatedJobs_155],[CreatedJobs_156],[CreatedJobs_157],[CreatedJobs_158],[CreatedJobs_159],[CreatedJobs_160],[CreatedJobs_161],[CreatedJobs_162],[CreatedJobs_163],[CreatedJobs_164],[CreatedJobs_165],[CreatedJobs_166],[CreatedJobs_167],[CreatedJobs_168],[CreatedJobs_169],[CreatedJobs_170],[CreatedJobs_171],[CreatedJobs_172],[CreatedJobs_173],[CreatedJobs_174],[CreatedJobs_175],[CreatedJobs_176],[CreatedJobs_177],[CreatedJobs_178],[CreatedJobs_179],[CreatedJobs_180],[CreatedJobs_181],[CreatedJobs_182],[CreatedJobs_183],[CreatedJobs_184],[CreatedJobs_185],[CreatedJobs_186],[CreatedJobs_187],[CreatedJobs_188],[CreatedJobs_189],[CreatedJobs_190],[CreatedJobs_191],[CreatedJobs_192],[CreatedJobs_193],[CreatedJobs_194],[CreatedJobs_195],[CreatedJobs_196],[CreatedJobs_197],[CreatedJobs_198],[CreatedJobs_199],[CreatedJobs_200],[CreatedJobs_201],[CreatedJobs_202],[CreatedJobs_203],[CreatedJobs_204],[CreatedJobs_205],[CreatedJobs_206],[CreatedJobs_207],[CreatedJobs_208],[CreatedJobs_209],[f3_0, f2_0, f1_0, AvailableJobId_0],[f3_1, f2_1, f1_1, AvailableJobId_1],[f3_2, f2_2, f1_2, AvailableJobId_2],[f3_3, f2_3, f1_3, AvailableJobId_3],[f3_4, f2_4, f1_4, AvailableJobId_4],[f3_5, f2_5, f1_5, AvailableJobId_5],[f3_6, f2_6, f1_6, AvailableJobId_6],[f3_7, f2_7, f1_7, AvailableJobId_7],[f3_8, f2_8, f1_8, AvailableJobId_8],[f3_9, f2_9, f1_9, AvailableJobId_9],[f3_10, f2_10, f1_10, AvailableJobId_10],[f3_11, f2_11, f1_11, AvailableJobId_11],[f3_12, f2_12, f1_12, AvailableJobId_12],[f3_13, f2_13, f1_13, AvailableJobId_13],[f3_14, f2_14, f1_14, AvailableJobId_14],[f3_15, f2_15, f1_15, AvailableJobId_15],[f3_16, f2_16, f1_16, AvailableJobId_16],[f3_17, f2_17, f1_17, AvailableJobId_17],[f3_18, f2_18, f1_18, AvailableJobId_18],[f3_19, f2_19, f1_19, AvailableJobId_19],[f3_20, f2_20, f1_20, AvailableJobId_20],[FetchJobE_0, QueueJobB_0, NotifyEventJobQueuedB_0],[FetchJobE_1, QueueJobB_1, NotifyEventJobQueuedB_1],[FetchJobE_2, QueueJobB_2, NotifyEventJobQueuedB_2],[FetchJobE_3, QueueJobB_3, NotifyEventJobQueuedB_3],[FetchJobE_4, QueueJobB_4, NotifyEventJobQueuedB_4],[FetchJobE_5, QueueJobB_5, NotifyEventJobQueuedB_5],[FetchJobE_6, QueueJobB_6, NotifyEventJobQueuedB_6],[FetchJobE_7, QueueJobB_7, NotifyEventJobQueuedB_7],[FetchJobE_8, QueueJobB_8, NotifyEventJobQueuedB_8],[FetchJobE_9, QueueJobB_9, NotifyEventJobQueuedB_9],[FetchJobE_10, QueueJobB_10, NotifyEventJobQueuedB_10],[FetchJobE_11, QueueJobB_11, NotifyEventJobQueuedB_11],[FetchJobE_12, QueueJobB_12, NotifyEventJobQueuedB_12],[FetchJobE_13, QueueJobB_13, NotifyEventJobQueuedB_13],[FetchJobE_14, QueueJobB_14, NotifyEventJobQueuedB_14],[FetchJobE_15, QueueJobB_15, NotifyEventJobQueuedB_15],[FetchJobE_16, QueueJobB_16, NotifyEventJobQueuedB_16],[FetchJobE_17, QueueJobB_17, NotifyEventJobQueuedB_17],[FetchJobE_18, QueueJobB_18, NotifyEventJobQueuedB_18],[FetchJobE_19, QueueJobB_19, NotifyEventJobQueuedB_19],[FetchJobE_20, QueueJobB_20, NotifyEventJobQueuedB_20],[place_482_0],[place_482_1],[place_482_2],[place_482_3],[place_482_4],[place_482_5],[place_482_6],[place_482_7],[place_482_8],[place_482_9],[ModifiedSrc_0, TheSour_0],[ModifiedSrc_1, TheSour_1],[ModifiedSrc_2, TheSour_2],[ModifiedSrc_3, TheSour_3],[ModifiedSrc_4, TheSour_4],[ModifiedSrc_5, TheSour_5],[ModifiedSrc_6, TheSour_6],[ModifiedSrc_7, TheSour_7],[ModifiedSrc_8, TheSour_8],[ModifiedSrc_9, TheSour_9],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
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 20:54:44] [INFO ] Flatten gal took : 70 ms
[2025-06-02 20:54:44] [INFO ] Time to serialize gal into /tmp/UpperBounds9083232468648333409.gal : 30 ms
[2025-06-02 20:54:44] [INFO ] Time to serialize properties into /tmp/UpperBounds10651488462657694016.prop : 2 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/UpperBounds9083232468648333409.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10651488462657694016.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/UpperBounds10651488462657694016.prop.
ITS-tools command line returned an error code 137
[2025-06-02 21:04:35] [INFO ] Flatten gal took : 58 ms
[2025-06-02 21:04:35] [INFO ] Input system was already deterministic with 982 transitions.
[2025-06-02 21:04:35] [INFO ] Transformed 411 places.
[2025-06-02 21:04:35] [INFO ] Transformed 982 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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 21:05:05] [INFO ] Time to serialize gal into /tmp/UpperBounds14191846900396392214.gal : 7 ms
[2025-06-02 21:05:05] [INFO ] Time to serialize properties into /tmp/UpperBounds10220698775202337487.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/UpperBounds14191846900396392214.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10220698775202337487.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 ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10220698775202337487.prop.
ITS-tools command line returned an error code 137
Total runtime 2380497 ms.

BK_STOP 1748898843077

--------------------
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="PolyORBNT-COL-S10J20"
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 PolyORBNT-COL-S10J20, 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 r167-tall-174881266100075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 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 ;