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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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.9K 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 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748891033147

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 19:03:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 19:03:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:03:54] [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 19:03:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 19:03:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 653 ms
[2025-06-02 19:03:55] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-02 19:03:55] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-02 19:03:55] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:03:55] [INFO ] Computed 26 invariants in 21 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 0] Max Struct:[2, 20, 1, 21, 2, 1, 8, 8, 3, 20, 20, 2, 1, 2, 10, 4]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 19:03:55] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:03:55] [INFO ] Computed 26 invariants in 11 ms
[2025-06-02 19:03:55] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2025-06-02 19:03:55] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-02 19:03:55] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-06-02 19:03:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:03:55] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2025-06-02 19:03:55] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 19:03:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 19:03:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-02 19:03:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-02 19:03:55] [INFO ] Added : 39 causal constraints over 10 iterations in 128 ms. Result :sat
Minimization took 38 ms.
[2025-06-02 19:03:56] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 19:03:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-02 19:03:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-02 19:03:56] [INFO ] Added : 27 causal constraints over 6 iterations in 58 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 19:03:56] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:03:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:03:56] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 16 ms to minimize.
[2025-06-02 19:03:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2025-06-02 19:03:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:03:56] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:03:56] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
[2025-06-02 19:03:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2025-06-02 19:03:56] [INFO ] Added : 54 causal constraints over 11 iterations in 182 ms. Result :sat
Minimization took 21 ms.
[2025-06-02 19:03:56] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned unsat
[2025-06-02 19:03:56] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:03:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:03:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:03:56] [INFO ] Added : 8 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 20 ms.
[2025-06-02 19:03:56] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:03:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:03:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:03:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:03:56] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 14 ms.
[2025-06-02 19:03:57] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:03:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:03:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:03:57] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2025-06-02 19:03:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2025-06-02 19:03:57] [INFO ] Added : 58 causal constraints over 13 iterations in 152 ms. Result :sat
Minimization took 27 ms.
[2025-06-02 19:03:57] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:03:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:03:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:03:57] [INFO ] Added : 27 causal constraints over 6 iterations in 61 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 19:03:57] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:03:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 43 ms returned sat
[2025-06-02 19:03:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:03:57] [INFO ] Added : 57 causal constraints over 12 iterations in 119 ms. Result :sat
Minimization took 37 ms.
[2025-06-02 19:03:57] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:03:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:03:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:03:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 19:03:58] [INFO ] Added : 9 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 20 ms.
[2025-06-02 19:03:58] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:03:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-02 19:03:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:03:58] [INFO ] Added : 27 causal constraints over 6 iterations in 59 ms. Result :sat
Minimization took 20 ms.
[2025-06-02 19:03:58] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:03:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:03:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:03:58] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 15 ms.
[2025-06-02 19:03:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:03:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-02 19:03:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:03:58] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:03:58] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2025-06-02 19:03:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2025-06-02 19:03:58] [INFO ] Added : 57 causal constraints over 13 iterations in 203 ms. Result :sat
Minimization took 21 ms.
[2025-06-02 19:03:58] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:03:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:03:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-02 19:03:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:03:59] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2025-06-02 19:03:59] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2025-06-02 19:03:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2025-06-02 19:03:59] [INFO ] Added : 58 causal constraints over 13 iterations in 177 ms. Result :sat
Minimization took 23 ms.
[2025-06-02 19:03:59] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:03:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:03:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:03:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:03:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:03:59] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-06-02 19:03:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 16 ms returned sat
[2025-06-02 19:03:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:03:59] [INFO ] Added : 45 causal constraints over 9 iterations in 71 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 20, 1, 1, 2, 1, 8, 8, 3, 20, 20, 2, 1, 2, 4]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-02 19:03:59] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 56 ms.
[2025-06-02 19:03:59] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
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, 0, 0] Max Struct:[2, 20, 1, 2, 1, 8, 8, 3, 20, 20, 2, 1, 2, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 20, 1, 2, 1, 8, 8, 3, 20, 20, 2, 1, 2, 4]
[2025-06-02 19:03:59] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2025-06-02 19:03:59] [INFO ] Computed 54 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 20, 1, 2, 1, 8, 8, 3, 20, 20, 2, 1, 2, 4]
RANDOM walk for 10000 steps (2 resets) in 90 ms. (109 steps per ms)
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90006 steps (23 resets) in 319 ms. (281 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 1, 1, 0, 2, 2, 1, 0] Max Struct:[20, 2, 8, 8, 3, 20, 20, 2, 4]
[2025-06-02 19:03:59] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2025-06-02 19:03:59] [INFO ] Invariant cache hit.
[2025-06-02 19:04:00] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-02 19:04:00] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 31 ms returned sat
[2025-06-02 19:04:00] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2025-06-02 19:04:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:04:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2025-06-02 19:04:00] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 26 ms returned sat
[2025-06-02 19:04:01] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2025-06-02 19:04:01] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:04:02] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:04:02] [INFO ] [Nat]Added 96 Read/Feed constraints in 837 ms returned sat
[2025-06-02 19:04:02] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 95 ms.
[2025-06-02 19:04:04] [INFO ] Added : 71 causal constraints over 15 iterations in 1809 ms. Result :sat
Minimization took 658 ms.
[2025-06-02 19:04:04] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-02 19:04:04] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 20 ms returned unsat
[2025-06-02 19:04:05] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2025-06-02 19:04:05] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 21 ms returned unsat
[2025-06-02 19:04:05] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2025-06-02 19:04:05] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 22 ms returned unsat
[2025-06-02 19:04:05] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-02 19:04:05] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 20 ms returned sat
[2025-06-02 19:04:05] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2025-06-02 19:04:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:04:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-02 19:04:05] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 20 ms returned sat
[2025-06-02 19:04:06] [INFO ] [Nat]Absence check using state equation in 994 ms returned sat
[2025-06-02 19:04:07] [INFO ] [Nat]Added 96 Read/Feed constraints in 500 ms returned sat
[2025-06-02 19:04:07] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2025-06-02 19:04:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2025-06-02 19:04:07] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 100 ms.
[2025-06-02 19:04:09] [INFO ] Deduced a trap composed of 19 places in 300 ms of which 4 ms to minimize.
[2025-06-02 19:04:10] [INFO ] Deduced a trap composed of 368 places in 300 ms of which 5 ms to minimize.
[2025-06-02 19:04:10] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1214 ms
Maximisation of solution failed !
Minimization took 2 ms.
[2025-06-02 19:04:10] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-02 19:04:10] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 23 ms returned sat
[2025-06-02 19:04:11] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2025-06-02 19:04:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:04:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-02 19:04:11] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 29 ms returned sat
[2025-06-02 19:04:13] [INFO ] [Nat]Absence check using state equation in 1538 ms returned sat
[2025-06-02 19:04:13] [INFO ] [Nat]Added 96 Read/Feed constraints in 363 ms returned sat
[2025-06-02 19:04:13] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2025-06-02 19:04:13] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2025-06-02 19:04:14] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:04:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 395 ms
[2025-06-02 19:04:14] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 93 ms.
[2025-06-02 19:04:16] [INFO ] Added : 75 causal constraints over 16 iterations in 2184 ms. Result :sat
Minimization took 399 ms.
[2025-06-02 19:04:16] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-02 19:04:16] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 26 ms returned sat
[2025-06-02 19:04:17] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2025-06-02 19:04:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:04:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2025-06-02 19:04:17] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 24 ms returned sat
[2025-06-02 19:04:18] [INFO ] [Nat]Absence check using state equation in 925 ms returned sat
[2025-06-02 19:04:19] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:04:19] [INFO ] [Nat]Added 96 Read/Feed constraints in 677 ms returned sat
[2025-06-02 19:04:19] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 85 ms.
[2025-06-02 19:04:21] [INFO ] Added : 72 causal constraints over 15 iterations in 2105 ms. Result :sat
Minimization took 546 ms.
[2025-06-02 19:04:22] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-02 19:04:22] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 16 ms returned unsat
[2025-06-02 19:04:22] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-02 19:04:22] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 20 ms returned sat
[2025-06-02 19:04:22] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2025-06-02 19:04:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:04:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-02 19:04:22] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 22 ms returned sat
[2025-06-02 19:04:23] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2025-06-02 19:04:24] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:04:24] [INFO ] [Nat]Added 96 Read/Feed constraints in 926 ms returned sat
[2025-06-02 19:04:24] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 80 ms.
[2025-06-02 19:04:26] [INFO ] Deduced a trap composed of 365 places in 305 ms of which 5 ms to minimize.
[2025-06-02 19:04:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 424 ms
[2025-06-02 19:04:27] [INFO ] Added : 67 causal constraints over 14 iterations in 2491 ms. Result :sat
Minimization took 503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 1, 1, 0, 2, 2, 1, 0] Max Struct:[20, 1, 1, 1, 3, 20, 20, 1, 4]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
Support contains 40 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 688 transition count 1250
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 122 place count 632 transition count 1242
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 130 place count 624 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 130 place count 624 transition count 1162
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 290 place count 544 transition count 1162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 402 place count 488 transition count 1106
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 410 place count 488 transition count 1098
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 418 place count 480 transition count 1098
Applied a total of 418 rules in 228 ms. Remains 480 /690 variables (removed 210) and now considering 1098/1306 (removed 208) transitions.
Running 1096 sub problems to find dead transitions.
[2025-06-02 19:04:27] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 480 cols
[2025-06-02 19:04:27] [INFO ] Computed 52 invariants in 27 ms
[2025-06-02 19:04:27] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2025-06-02 19:04:39] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 2 ms to minimize.
[2025-06-02 19:04:39] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2025-06-02 19:04:39] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2025-06-02 19:04:39] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2025-06-02 19:04:39] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 0 ms to minimize.
[2025-06-02 19:04:39] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:04:39] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:04:40] [INFO ] Deduced a trap composed of 192 places in 222 ms of which 3 ms to minimize.
[2025-06-02 19:04:40] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:04:43] [INFO ] Deduced a trap composed of 104 places in 173 ms of which 3 ms to minimize.
[2025-06-02 19:04:45] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 2 ms to minimize.
[2025-06-02 19:04:45] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2025-06-02 19:04:49] [INFO ] Deduced a trap composed of 150 places in 220 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1562 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2025-06-02 19:04:54] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2025-06-02 19:04:54] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 1 ms to minimize.
[2025-06-02 19:04:54] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2025-06-02 19:05:08] [INFO ] Deduced a trap composed of 165 places in 213 ms of which 3 ms to minimize.
[2025-06-02 19:05:09] [INFO ] Deduced a trap composed of 193 places in 199 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1562 variables, and 68 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 18/18 constraints]
After SMT, in 42172ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 42199ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42451 ms. Remains : 480/690 places, 1098/1306 transitions.
[2025-06-02 19:05:10] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-02 19:05:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
RANDOM walk for 1000000 steps (406 resets) in 4069 ms. (245 steps per ms)
BEST_FIRST walk for 5000002 steps (774 resets) in 9865 ms. (506 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
[2025-06-02 19:05:24] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-02 19:05:24] [INFO ] Invariant cache hit.
[2025-06-02 19:05:24] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2025-06-02 19:05:24] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 26 ms returned sat
[2025-06-02 19:05:24] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2025-06-02 19:05:24] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:05:24] [INFO ] [Real]Added 96 Read/Feed constraints in 149 ms returned sat
[2025-06-02 19:05:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:05:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-02 19:05:24] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 19 ms returned sat
[2025-06-02 19:05:25] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2025-06-02 19:05:25] [INFO ] [Nat]Added 96 Read/Feed constraints in 327 ms returned sat
[2025-06-02 19:05:25] [INFO ] Computed and/alt/rep : 488/1670/480 causal constraints (skipped 600 transitions) in 59 ms.
[2025-06-02 19:05:27] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2025-06-02 19:05:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2025-06-02 19:05:27] [INFO ] Added : 107 causal constraints over 22 iterations in 1653 ms. Result :sat
Minimization took 4317 ms.
[2025-06-02 19:05:31] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-02 19:05:31] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 20 ms returned sat
[2025-06-02 19:05:32] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2025-06-02 19:05:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:05:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-02 19:05:32] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 20 ms returned sat
[2025-06-02 19:05:33] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2025-06-02 19:05:33] [INFO ] [Nat]Added 96 Read/Feed constraints in 299 ms returned sat
[2025-06-02 19:05:33] [INFO ] Computed and/alt/rep : 488/1670/480 causal constraints (skipped 600 transitions) in 66 ms.
[2025-06-02 19:05:36] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 4 ms to minimize.
[2025-06-02 19:05:36] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2025-06-02 19:05:36] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2025-06-02 19:05:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 658 ms
[2025-06-02 19:05:37] [INFO ] Added : 180 causal constraints over 37 iterations in 3754 ms. Result :sat
Minimization took 4509 ms.
[2025-06-02 19:05:41] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-02 19:05:41] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 21 ms returned sat
[2025-06-02 19:05:42] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2025-06-02 19:05:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:05:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-02 19:05:42] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 20 ms returned sat
[2025-06-02 19:05:42] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2025-06-02 19:05:42] [INFO ] [Nat]Added 96 Read/Feed constraints in 260 ms returned sat
[2025-06-02 19:05:42] [INFO ] Computed and/alt/rep : 488/1670/480 causal constraints (skipped 600 transitions) in 62 ms.
[2025-06-02 19:05:43] [INFO ] Deduced a trap composed of 173 places in 232 ms of which 3 ms to minimize.
[2025-06-02 19:05:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2025-06-02 19:05:43] [INFO ] Added : 33 causal constraints over 7 iterations in 893 ms. Result :sat
Minimization took 4087 ms.
[2025-06-02 19:05:47] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-02 19:05:47] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 23 ms returned sat
[2025-06-02 19:05:48] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2025-06-02 19:05:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:05:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-02 19:05:48] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 20 ms returned sat
[2025-06-02 19:05:49] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2025-06-02 19:05:49] [INFO ] [Nat]Added 96 Read/Feed constraints in 422 ms returned sat
[2025-06-02 19:05:49] [INFO ] Computed and/alt/rep : 488/1670/480 causal constraints (skipped 600 transitions) in 65 ms.
[2025-06-02 19:05:51] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2025-06-02 19:05:51] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2025-06-02 19:05:51] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 0 ms to minimize.
[2025-06-02 19:05:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 392 ms
[2025-06-02 19:05:51] [INFO ] Added : 113 causal constraints over 24 iterations in 2379 ms. Result :sat
Minimization took 3999 ms.
[2025-06-02 19:05:56] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-02 19:05:56] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 21 ms returned sat
[2025-06-02 19:05:56] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2025-06-02 19:05:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:05:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-02 19:05:56] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 19 ms returned sat
[2025-06-02 19:05:56] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2025-06-02 19:05:57] [INFO ] [Nat]Added 96 Read/Feed constraints in 412 ms returned sat
[2025-06-02 19:05:57] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 3 ms to minimize.
[2025-06-02 19:05:57] [INFO ] Deduced a trap composed of 180 places in 230 ms of which 3 ms to minimize.
[2025-06-02 19:05:58] [INFO ] Deduced a trap composed of 190 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:05:58] [INFO ] Deduced a trap composed of 165 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:05:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1241 ms
[2025-06-02 19:05:58] [INFO ] Computed and/alt/rep : 488/1670/480 causal constraints (skipped 600 transitions) in 50 ms.
[2025-06-02 19:06:08] [INFO ] Added : 45 causal constraints over 9 iterations in 9514 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
Support contains 40 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1098/1098 transitions.
Applied a total of 0 rules in 27 ms. Remains 480 /480 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 480/480 places, 1098/1098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1098/1098 transitions.
Applied a total of 0 rules in 27 ms. Remains 480 /480 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
[2025-06-02 19:06:09] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-02 19:06:09] [INFO ] Invariant cache hit.
[2025-06-02 19:06:10] [INFO ] Implicit Places using invariants in 417 ms returned [434, 435, 436, 437, 438, 439, 440, 441]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 427 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 472/480 places, 1098/1098 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 464 transition count 1090
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 464 transition count 1090
Applied a total of 16 rules in 41 ms. Remains 464 /472 variables (removed 8) and now considering 1090/1098 (removed 8) transitions.
[2025-06-02 19:06:10] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2025-06-02 19:06:10] [INFO ] Computed 44 invariants in 17 ms
[2025-06-02 19:06:10] [INFO ] Implicit Places using invariants in 393 ms returned []
[2025-06-02 19:06:10] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:06:10] [INFO ] Invariant cache hit.
[2025-06-02 19:06:11] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:06:16] [INFO ] Implicit Places using invariants and state equation in 5702 ms returned []
Implicit Place search using SMT with State Equation took 6100 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 464/480 places, 1090/1098 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6595 ms. Remains : 464/480 places, 1090/1098 transitions.
[2025-06-02 19:06:16] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:06:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
RANDOM walk for 1000000 steps (380 resets) in 3698 ms. (270 steps per ms)
BEST_FIRST walk for 5000004 steps (756 resets) in 8882 ms. (562 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
[2025-06-02 19:06:29] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:06:29] [INFO ] Invariant cache hit.
[2025-06-02 19:06:29] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 19:06:29] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2025-06-02 19:06:29] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2025-06-02 19:06:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:06:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-02 19:06:29] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2025-06-02 19:06:30] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2025-06-02 19:06:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:06:30] [INFO ] [Nat]Added 96 Read/Feed constraints in 147 ms returned sat
[2025-06-02 19:06:30] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 65 ms.
[2025-06-02 19:06:31] [INFO ] Deduced a trap composed of 190 places in 212 ms of which 3 ms to minimize.
[2025-06-02 19:06:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 438 ms
[2025-06-02 19:06:31] [INFO ] Added : 46 causal constraints over 11 iterations in 1289 ms. Result :sat
Minimization took 4501 ms.
[2025-06-02 19:06:36] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-02 19:06:36] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2025-06-02 19:06:36] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2025-06-02 19:06:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:06:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 19:06:36] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 12 ms returned sat
[2025-06-02 19:06:37] [INFO ] [Nat]Absence check using state equation in 786 ms returned sat
[2025-06-02 19:06:37] [INFO ] [Nat]Added 96 Read/Feed constraints in 222 ms returned sat
[2025-06-02 19:06:37] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 2 ms to minimize.
[2025-06-02 19:06:38] [INFO ] Deduced a trap composed of 174 places in 217 ms of which 3 ms to minimize.
[2025-06-02 19:06:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 564 ms
[2025-06-02 19:06:38] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 62 ms.
[2025-06-02 19:06:40] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2025-06-02 19:06:40] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2025-06-02 19:06:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 296 ms
[2025-06-02 19:06:40] [INFO ] Added : 123 causal constraints over 25 iterations in 2245 ms. Result :sat
Minimization took 4502 ms.
[2025-06-02 19:06:45] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-02 19:06:45] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-02 19:06:45] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2025-06-02 19:06:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:06:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 19:06:45] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-02 19:06:45] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2025-06-02 19:06:46] [INFO ] [Nat]Added 96 Read/Feed constraints in 286 ms returned sat
[2025-06-02 19:06:46] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 58 ms.
[2025-06-02 19:06:47] [INFO ] Deduced a trap composed of 186 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:06:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 707 ms
[2025-06-02 19:06:47] [INFO ] Added : 22 causal constraints over 5 iterations in 1360 ms. Result :sat
Minimization took 4393 ms.
[2025-06-02 19:06:52] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-02 19:06:52] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-02 19:06:52] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2025-06-02 19:06:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:06:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 19:06:52] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-02 19:06:52] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2025-06-02 19:06:53] [INFO ] [Nat]Added 96 Read/Feed constraints in 494 ms returned sat
[2025-06-02 19:06:53] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 55 ms.
[2025-06-02 19:06:54] [INFO ] Added : 34 causal constraints over 7 iterations in 805 ms. Result :sat
Minimization took 4520 ms.
[2025-06-02 19:06:58] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 19:06:58] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 17 ms returned sat
[2025-06-02 19:06:59] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2025-06-02 19:06:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:06:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 19:06:59] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2025-06-02 19:06:59] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2025-06-02 19:07:04] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:07:05] [INFO ] [Nat]Added 96 Read/Feed constraints in 6095 ms returned sat
[2025-06-02 19:07:06] [INFO ] Deduced a trap composed of 174 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:07:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2025-06-02 19:07:06] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 54 ms.
[2025-06-02 19:07:07] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2025-06-02 19:07:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2025-06-02 19:07:07] [INFO ] Added : 52 causal constraints over 11 iterations in 1244 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
Support contains 40 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Applied a total of 0 rules in 20 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 464/464 places, 1090/1090 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Applied a total of 0 rules in 17 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
[2025-06-02 19:07:12] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:07:12] [INFO ] Invariant cache hit.
[2025-06-02 19:07:12] [INFO ] Implicit Places using invariants in 356 ms returned []
[2025-06-02 19:07:12] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:07:12] [INFO ] Invariant cache hit.
[2025-06-02 19:07:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:07:18] [INFO ] Implicit Places using invariants and state equation in 5775 ms returned []
Implicit Place search using SMT with State Equation took 6134 ms to find 0 implicit places.
[2025-06-02 19:07:18] [INFO ] Redundant transitions in 61 ms returned []
Running 1088 sub problems to find dead transitions.
[2025-06-02 19:07:18] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:07:18] [INFO ] Invariant cache hit.
[2025-06-02 19:07:18] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2025-06-02 19:07:28] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2025-06-02 19:07:28] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2025-06-02 19:07:28] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2025-06-02 19:07:28] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2025-06-02 19:07:29] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2025-06-02 19:07:29] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:07:29] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2025-06-02 19:07:29] [INFO ] Deduced a trap composed of 178 places in 222 ms of which 3 ms to minimize.
[2025-06-02 19:07:32] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 2 ms to minimize.
[2025-06-02 19:07:32] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:07:35] [INFO ] Deduced a trap composed of 201 places in 205 ms of which 2 ms to minimize.
[2025-06-02 19:07:39] [INFO ] Deduced a trap composed of 150 places in 208 ms of which 3 ms to minimize.
[2025-06-02 19:07:39] [INFO ] Deduced a trap composed of 217 places in 205 ms of which 3 ms to minimize.
[2025-06-02 19:07:41] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 3 ms to minimize.
[2025-06-02 19:07:41] [INFO ] Deduced a trap composed of 63 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
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 462/1538 variables, and 57 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2025-06-02 19:07:55] [INFO ] Deduced a trap composed of 76 places in 199 ms of which 3 ms to minimize.
[2025-06-02 19:07:59] [INFO ] Deduced a trap composed of 292 places in 214 ms of which 3 ms to minimize.
[2025-06-02 19:07:59] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1538 variables, and 60 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 18/18 constraints]
After SMT, in 61804ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 61817ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68051 ms. Remains : 464/464 places, 1090/1090 transitions.
[2025-06-02 19:08:21] [INFO ] Flatten gal took : 326 ms
[2025-06-02 19:08:21] [INFO ] Flatten gal took : 179 ms
[2025-06-02 19:08:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4381257222960171570.gal : 36 ms
[2025-06-02 19:08:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality515061460213798122.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/ReachabilityCardinality4381257222960171570.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality515061460213798122.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (22 resets) in 2502 ms. (15 steps per ms) remains 10/10 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 ...327
BEST_FIRST walk for 40004 steps (12 resets) in 535 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (13 resets) in 365 ms. (109 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality515061460213798122.prop.
BEST_FIRST walk for 40002 steps (10 resets) in 370 ms. (107 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (11 resets) in 290 ms. (137 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 245 ms. (162 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (11 resets) in 233 ms. (170 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :6 after 7
BEST_FIRST walk for 40002 steps (10 resets) in 324 ms. (123 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :7 after 10
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :10 after 50
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :50 after 80
BEST_FIRST walk for 40003 steps (15 resets) in 299 ms. (133 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (11 resets) in 249 ms. (160 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :430 after 2019
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :2019 after 6317
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :6317 after 6690
Interrupted probabilistic random walk after 127554 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 10
Probabilistic random walk after 127554 steps, saw 73651 distinct states, run finished after 3004 ms. (steps per millisecond=42 ) properties seen :0
[2025-06-02 19:08:25] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:08:25] [INFO ] Invariant cache hit.
[2025-06-02 19:08:25] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 24/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 33/97 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 14/111 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
At refinement iteration 7 (OVERLAPS) 344/455 variables, 26/36 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2025-06-02 19:08:25] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 3 ms to minimize.
[2025-06-02 19:08:26] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2025-06-02 19:08:26] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 2 ms to minimize.
[2025-06-02 19:08:26] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 2 ms to minimize.
[2025-06-02 19:08:26] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2025-06-02 19:08:26] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 6/42 constraints. Problems are: Problem set: 3 solved, 7 unsolved
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :6690 after 9078
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 4/459 variables, 4/46 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/46 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 3/462 variables, 3/49 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1074/1536 variables, 462/511 constraints. Problems are: Problem set: 3 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1536 variables, 96/607 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1536 variables, 0/607 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/1538 variables, 2/609 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1538 variables, 1/610 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1538 variables, 0/610 constraints. Problems are: Problem set: 3 solved, 7 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :9078 after 12234
At refinement iteration 20 (OVERLAPS) 0/1538 variables, 0/610 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1538/1538 variables, and 610 constraints, problems are : Problem set: 3 solved, 7 unsolved in 4673 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 464/464 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 24/64 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 33/97 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 14/111 variables, 7/10 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 344/455 variables, 26/36 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 6/42 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2025-06-02 19:08:30] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 1/43 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 4/459 variables, 4/47 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/47 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 3/462 variables, 3/50 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1074/1536 variables, 462/512 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1536 variables, 96/608 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1536 variables, 7/615 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2025-06-02 19:08:32] [INFO ] Deduced a trap composed of 179 places in 198 ms of which 3 ms to minimize.
[2025-06-02 19:08:33] [INFO ] Deduced a trap composed of 184 places in 228 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1536 variables, 2/617 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1536 variables, 0/617 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1538/1538 variables, and 619 constraints, problems are : Problem set: 3 solved, 7 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 464/464 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 7/10 constraints, Known Traps: 9/9 constraints]
After SMT, in 9706ms problems are : Problem set: 3 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Applied a total of 0 rules in 18 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Running 1088 sub problems to find dead transitions.
[2025-06-02 19:08:35] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:08:35] [INFO ] Invariant cache hit.
[2025-06-02 19:08:35] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :12234 after 88248
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2025-06-02 19:08:45] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2025-06-02 19:08:45] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2025-06-02 19:08:45] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
[2025-06-02 19:08:45] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2025-06-02 19:08:45] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2025-06-02 19:08:45] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:08:45] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 0 ms to minimize.
[2025-06-02 19:08:46] [INFO ] Deduced a trap composed of 178 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:08:49] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 2 ms to minimize.
[2025-06-02 19:08:49] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :88248 after 236060
[2025-06-02 19:08:52] [INFO ] Deduced a trap composed of 201 places in 216 ms of which 3 ms to minimize.
[2025-06-02 19:08:56] [INFO ] Deduced a trap composed of 150 places in 210 ms of which 3 ms to minimize.
[2025-06-02 19:08:56] [INFO ] Deduced a trap composed of 217 places in 200 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1538 variables, and 55 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Detected timeout of ITS tools.
[2025-06-02 19:09:11] [INFO ] Flatten gal took : 75 ms
[2025-06-02 19:09:11] [INFO ] Applying decomposition
[2025-06-02 19:09:11] [INFO ] Flatten gal took : 86 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/graph17231607223840508169.txt' '-o' '/tmp/graph17231607223840508169.bin' '-w' '/tmp/graph17231607223840508169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17231607223840508169.bin' '-l' '-1' '-v' '-w' '/tmp/graph17231607223840508169.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:09:12] [INFO ] Decomposing Gal with order
[2025-06-02 19:09:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:09:13] [INFO ] Removed a total of 998 redundant transitions.
[2025-06-02 19:09:13] [INFO ] Flatten gal took : 757 ms
[2025-06-02 19:09:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 390 labels/synchronizations in 120 ms.
[2025-06-02 19:09:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18346572584836262660.gal : 31 ms
[2025-06-02 19:09:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3563538470337003161.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/ReachabilityCardinality18346572584836262660.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3563538470337003161.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3563538470337003161.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :13 after 18
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :18 after 19
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :19 after 50
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :50 after 64
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :64 after 180
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :430 after 2068
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :2068 after 2530
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :2530 after 3020
[2025-06-02 19:09:16] [INFO ] Deduced a trap composed of 292 places in 241 ms of which 3 ms to minimize.
[2025-06-02 19:09:16] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 2 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :3020 after 3455
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 9)
(s187 0)
(s188 1)
(s189 1)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 1)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s317 1)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 1)
(s371 0)
(s372 1)
(s373 1)
(s374 0)
(s375 1)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 9)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1538 variables, and 57 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 15/15 constraints]
After SMT, in 41889ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 41901ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41923 ms. Remains : 464/464 places, 1090/1090 transitions.
RANDOM walk for 40000 steps (19 resets) in 425 ms. (93 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (11 resets) in 168 ms. (236 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (9 resets) in 239 ms. (166 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 185 ms. (215 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (10 resets) in 234 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (12 resets) in 208 ms. (191 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 213 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (15 resets) in 241 ms. (165 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :3455 after 6262
Interrupted probabilistic random walk after 150413 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 7
Probabilistic random walk after 150413 steps, saw 86009 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2025-06-02 19:09:20] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:09:20] [INFO ] Invariant cache hit.
[2025-06-02 19:09:20] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 24/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 33/97 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 14/111 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 344/455 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 4/459 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 3/462 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1074/1536 variables, 462/505 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1536 variables, 96/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1536 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 2/1538 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1538 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1538 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/1538 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1538/1538 variables, and 604 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3132 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 464/464 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 24/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 33/97 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 14/111 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 344/455 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2025-06-02 19:09:24] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 2 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :6262 after 9867
[2025-06-02 19:09:24] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 2 ms to minimize.
[2025-06-02 19:09:24] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2025-06-02 19:09:24] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2025-06-02 19:09:24] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:09:24] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 4/459 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 3/462 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1074/1536 variables, 462/511 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1536 variables, 96/607 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1536 variables, 7/614 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2025-06-02 19:09:27] [INFO ] Deduced a trap composed of 173 places in 208 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1536 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1536 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 2/1538 variables, 2/617 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1538 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2025-06-02 19:09:28] [INFO ] Deduced a trap composed of 167 places in 212 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1538 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1538 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2025-06-02 19:09:32] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/1538 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1538 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 0/1538 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1538/1538 variables, and 620 constraints, problems are : Problem set: 0 solved, 7 unsolved in 17850 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 464/464 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 9/9 constraints]
After SMT, in 21006ms problems are : Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :42118 after 57812
Detected timeout of ITS tools.
Parikh walk visited 0 properties in 28206 ms.
Support contains 40 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Applied a total of 0 rules in 14 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 464/464 places, 1090/1090 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Applied a total of 0 rules in 14 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
[2025-06-02 19:10:10] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:10:10] [INFO ] Invariant cache hit.
[2025-06-02 19:10:10] [INFO ] Implicit Places using invariants in 375 ms returned []
[2025-06-02 19:10:10] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:10:10] [INFO ] Invariant cache hit.
[2025-06-02 19:10:10] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:10:16] [INFO ] Implicit Places using invariants and state equation in 5807 ms returned []
Implicit Place search using SMT with State Equation took 6187 ms to find 0 implicit places.
[2025-06-02 19:10:16] [INFO ] Redundant transitions in 44 ms returned []
Running 1088 sub problems to find dead transitions.
[2025-06-02 19:10:16] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:10:16] [INFO ] Invariant cache hit.
[2025-06-02 19:10:16] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2025-06-02 19:10:26] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2025-06-02 19:10:26] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 2 ms to minimize.
[2025-06-02 19:10:26] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2025-06-02 19:10:26] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2025-06-02 19:10:27] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2025-06-02 19:10:27] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 0 ms to minimize.
[2025-06-02 19:10:27] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 0 ms to minimize.
[2025-06-02 19:10:27] [INFO ] Deduced a trap composed of 178 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:10:30] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 2 ms to minimize.
[2025-06-02 19:10:30] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:10:33] [INFO ] Deduced a trap composed of 201 places in 209 ms of which 3 ms to minimize.
[2025-06-02 19:10:37] [INFO ] Deduced a trap composed of 150 places in 197 ms of which 3 ms to minimize.
[2025-06-02 19:10:38] [INFO ] Deduced a trap composed of 217 places in 191 ms of which 3 ms to minimize.
[2025-06-02 19:10:39] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 2 ms to minimize.
[2025-06-02 19:10:39] [INFO ] Deduced a trap composed of 63 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.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 (/ 1.0 6.0))
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 (/ 17.0 6.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 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.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 0.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 0.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 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.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 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 9.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.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 timeout
0.0)
(s254 0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1538 variables, and 57 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2025-06-02 19:10:53] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 3 ms to minimize.
[2025-06-02 19:10:57] [INFO ] Deduced a trap composed of 292 places in 200 ms of which 3 ms to minimize.
[2025-06-02 19:10:57] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1538 variables, and 60 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 18/18 constraints]
After SMT, in 61991ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 62002ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68264 ms. Remains : 464/464 places, 1090/1090 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 0, 2, 2, 0] Max Struct:[20, 3, 20, 20, 4]
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2025-06-02 19:11:18] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:11:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (6 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-02 19:11:18] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:11:18] [INFO ] Invariant cache hit.
[2025-06-02 19:11:18] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 19:11:18] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-02 19:11:18] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2025-06-02 19:11:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 19:11:19] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-02 19:11:19] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2025-06-02 19:11:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:11:19] [INFO ] [Nat]Added 96 Read/Feed constraints in 153 ms returned sat
[2025-06-02 19:11:19] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 56 ms.
[2025-06-02 19:11:20] [INFO ] Deduced a trap composed of 190 places in 225 ms of which 2 ms to minimize.
[2025-06-02 19:11:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 452 ms
[2025-06-02 19:11:21] [INFO ] Added : 46 causal constraints over 11 iterations in 1294 ms. Result :sat
Minimization took 547 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 8 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 456 transition count 1082
Applied a total of 16 rules in 47 ms. Remains 456 /464 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
Running 1080 sub problems to find dead transitions.
[2025-06-02 19:11:21] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 456 cols
[2025-06-02 19:11:21] [INFO ] Computed 44 invariants in 18 ms
[2025-06-02 19:11:21] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:11:32] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2025-06-02 19:11:32] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 0 ms to minimize.
[2025-06-02 19:11:33] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:11:33] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 3 ms to minimize.
[2025-06-02 19:11:33] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:11:33] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2025-06-02 19:11:33] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2025-06-02 19:11:33] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2025-06-02 19:11:33] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 51 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:11:45] [INFO ] Deduced a trap composed of 167 places in 212 ms of which 3 ms to minimize.
[2025-06-02 19:11:45] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 3 ms to minimize.
[2025-06-02 19:11:47] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2025-06-02 19:11:55] [INFO ] Deduced a trap composed of 150 places in 216 ms of which 3 ms to minimize.
[2025-06-02 19:11:55] [INFO ] Deduced a trap composed of 161 places in 207 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 56 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 14/14 constraints]
After SMT, in 41888ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 41899ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41948 ms. Remains : 456/464 places, 1082/1090 transitions.
[2025-06-02 19:12:03] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:12:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (397 resets) in 3294 ms. (303 steps per ms)
BEST_FIRST walk for 1000001 steps (161 resets) in 1607 ms. (621 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-02 19:12:08] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:12:08] [INFO ] Invariant cache hit.
[2025-06-02 19:12:08] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-02 19:12:08] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 16 ms returned sat
[2025-06-02 19:12:08] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2025-06-02 19:12:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:12:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2025-06-02 19:12:09] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-02 19:12:09] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2025-06-02 19:12:09] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:12:09] [INFO ] [Nat]Added 96 Read/Feed constraints in 624 ms returned sat
[2025-06-02 19:12:10] [INFO ] Deduced a trap composed of 192 places in 220 ms of which 3 ms to minimize.
[2025-06-02 19:12:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2025-06-02 19:12:10] [INFO ] Computed and/alt/rep : 408/1453/400 causal constraints (skipped 664 transitions) in 57 ms.
[2025-06-02 19:12:11] [INFO ] Added : 39 causal constraints over 8 iterations in 840 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 8 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 29 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 456/456 places, 1082/1082 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 19 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2025-06-02 19:12:15] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:12:15] [INFO ] Invariant cache hit.
[2025-06-02 19:12:16] [INFO ] Implicit Places using invariants in 609 ms returned []
[2025-06-02 19:12:16] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:12:16] [INFO ] Invariant cache hit.
[2025-06-02 19:12:16] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:12:23] [INFO ] Implicit Places using invariants and state equation in 7036 ms returned []
Implicit Place search using SMT with State Equation took 7675 ms to find 0 implicit places.
[2025-06-02 19:12:23] [INFO ] Redundant transitions in 12 ms returned []
Running 1080 sub problems to find dead transitions.
[2025-06-02 19:12:23] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:12:23] [INFO ] Invariant cache hit.
[2025-06-02 19:12:23] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:12:34] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 2 ms to minimize.
[2025-06-02 19:12:34] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2025-06-02 19:12:34] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 2 ms to minimize.
[2025-06-02 19:12:34] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2025-06-02 19:12:34] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2025-06-02 19:12:34] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 0 ms to minimize.
[2025-06-02 19:12:34] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 0 ms to minimize.
[2025-06-02 19:12:34] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2025-06-02 19:12:35] [INFO ] Deduced a trap composed of 160 places in 234 ms of which 4 ms to minimize.
[2025-06-02 19:12:37] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2025-06-02 19:12:43] [INFO ] Deduced a trap composed of 150 places in 215 ms of which 3 ms to minimize.
[2025-06-02 19:12:44] [INFO ] Deduced a trap composed of 122 places in 207 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 54 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:12:57] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2025-06-02 19:13:01] [INFO ] Deduced a trap composed of 284 places in 222 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:13:13] [INFO ] Deduced a trap composed of 186 places in 246 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 57 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 15/15 constraints]
After SMT, in 62080ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 62093ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69856 ms. Remains : 456/456 places, 1082/1082 transitions.
[2025-06-02 19:13:25] [INFO ] Flatten gal took : 146 ms
RANDOM walk for 40000 steps (17 resets) in 457 ms. (87 steps per ms) remains 2/2 properties
[2025-06-02 19:13:25] [INFO ] Flatten gal took : 127 ms
[2025-06-02 19:13:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4660850596971315051.gal : 11 ms
[2025-06-02 19:13:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2304985175692200543.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/ReachabilityCardinality4660850596971315051.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2304985175692200543.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (14 resets) in 268 ms. (148 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40002 steps (12 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality2304985175692200543.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :10 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 180
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :180 after 458
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :458 after 1076
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1076 after 1396
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1396 after 3792
Interrupted probabilistic random walk after 129843 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 129843 steps, saw 74647 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2025-06-02 19:13:28] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:13:28] [INFO ] Invariant cache hit.
[2025-06-02 19:13:28] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3792 after 12768
[2025-06-02 19:13:30] [INFO ] Deduced a trap composed of 46 places in 1384 ms of which 2 ms to minimize.
[2025-06-02 19:13:31] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 1 ms to minimize.
[2025-06-02 19:13:31] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 1 ms to minimize.
[2025-06-02 19:13:31] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 2 ms to minimize.
[2025-06-02 19:13:31] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2025-06-02 19:13:31] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 6/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/451 variables, 4/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/454 variables, 3/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1066/1520 variables, 454/503 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1520 variables, 96/599 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1520 variables, 0/599 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1522 variables, 2/601 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1522 variables, 1/602 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1522 variables, 0/602 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1522 variables, 0/602 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1522/1522 variables, and 602 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2887 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 6/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/451 variables, 4/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/454 variables, 3/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1066/1520 variables, 454/503 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1520 variables, 96/599 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1520 variables, 1/600 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1520 variables, 0/600 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1522 variables, 2/602 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1522 variables, 1/603 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:13:33] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 2 ms to minimize.
[2025-06-02 19:13:33] [INFO ] Deduced a trap composed of 189 places in 248 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1522 variables, 2/605 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1522 variables, 0/605 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1522 variables, 0/605 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 16384
After SMT solving in domain Int declared 1522/1522 variables, and 605 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1978 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 4922ms problems are : Problem set: 1 solved, 1 unsolved
SDD size :12768 after 33556
Parikh walk visited 0 properties in 24 ms.
Support contains 8 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 25 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2025-06-02 19:13:33] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:13:33] [INFO ] Invariant cache hit.
[2025-06-02 19:13:33] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:13:44] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 2 ms to minimize.
[2025-06-02 19:13:44] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:13:44] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2025-06-02 19:13:44] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2025-06-02 19:13:44] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2025-06-02 19:13:44] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:13:44] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2025-06-02 19:13:44] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2025-06-02 19:13:45] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :33556 after 75820
[2025-06-02 19:13:47] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:13:53] [INFO ] Deduced a trap composed of 150 places in 204 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :75820 after 126534
[2025-06-02 19:13:54] [INFO ] Deduced a trap composed of 122 places in 218 ms of which 3 ms to minimize.
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 454/1522 variables, and 54 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:13:56] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2025-06-02 19:14:00] [INFO ] Deduced a trap composed of 284 places in 201 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:14:12] [INFO ] Deduced a trap composed of 186 places in 220 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :126534 after 348866
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 57 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 15/15 constraints]
After SMT, in 41642ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 41653ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41680 ms. Remains : 456/456 places, 1082/1082 transitions.
RANDOM walk for 40000 steps (17 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Detected timeout of ITS tools.
[2025-06-02 19:14:16] [INFO ] Flatten gal took : 45 ms
[2025-06-02 19:14:16] [INFO ] Applying decomposition
[2025-06-02 19:14:16] [INFO ] Flatten gal took : 44 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/graph15905776390640054816.txt' '-o' '/tmp/graph15905776390640054816.bin' '-w' '/tmp/graph15905776390640054816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15905776390640054816.bin' '-l' '-1' '-v' '-w' '/tmp/graph15905776390640054816.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:14:16] [INFO ] Decomposing Gal with order
[2025-06-02 19:14:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:14:16] [INFO ] Removed a total of 860 redundant transitions.
[2025-06-02 19:14:16] [INFO ] Flatten gal took : 125 ms
[2025-06-02 19:14:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 490 labels/synchronizations in 28 ms.
[2025-06-02 19:14:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12138363664559427144.gal : 8 ms
[2025-06-02 19:14:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality223257276911093020.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/ReachabilityCardinality12138363664559427144.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality223257276911093020.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/ReachabilityCardinality223257276911093020.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 57
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :57 after 71
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :71 after 79
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :79 after 156
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :156 after 794
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :794 after 948
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :948 after 1242
Interrupted probabilistic random walk after 282499 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 282499 steps, saw 155927 distinct states, run finished after 3003 ms. (steps per millisecond=94 ) properties seen :0
[2025-06-02 19:14:18] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:14:18] [INFO ] Invariant cache hit.
[2025-06-02 19:14:18] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/451 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/454 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1242 after 2250
At refinement iteration 13 (OVERLAPS) 1066/1520 variables, 454/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1520 variables, 96/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1520 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1522 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1522 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1522 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1522 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1522/1522 variables, and 596 constraints, problems are : Problem set: 0 solved, 1 unsolved in 830 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:14:19] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 2 ms to minimize.
[2025-06-02 19:14:19] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2025-06-02 19:14:20] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2025-06-02 19:14:20] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/451 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/454 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1066/1520 variables, 454/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1520 variables, 96/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1520 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1520 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1522 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1522 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2250 after 8586
[2025-06-02 19:14:21] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1522 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1522 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1522 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1522/1522 variables, and 602 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2090 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2936ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 8 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 14 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 456/456 places, 1082/1082 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 13 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2025-06-02 19:14:21] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:14:21] [INFO ] Invariant cache hit.
[2025-06-02 19:14:22] [INFO ] Implicit Places using invariants in 391 ms returned []
[2025-06-02 19:14:22] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:14:22] [INFO ] Invariant cache hit.
[2025-06-02 19:14:22] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8586 after 25704
[2025-06-02 19:14:29] [INFO ] Implicit Places using invariants and state equation in 6953 ms returned []
Implicit Place search using SMT with State Equation took 7356 ms to find 0 implicit places.
[2025-06-02 19:14:29] [INFO ] Redundant transitions in 8 ms returned []
Running 1080 sub problems to find dead transitions.
[2025-06-02 19:14:29] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:14:29] [INFO ] Invariant cache hit.
[2025-06-02 19:14:29] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:14:39] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 2 ms to minimize.
[2025-06-02 19:14:39] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2025-06-02 19:14:39] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2025-06-02 19:14:40] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 0 ms to minimize.
[2025-06-02 19:14:40] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2025-06-02 19:14:40] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
[2025-06-02 19:14:40] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2025-06-02 19:14:40] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2025-06-02 19:14:40] [INFO ] Deduced a trap composed of 160 places in 299 ms of which 5 ms to minimize.
[2025-06-02 19:14:42] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 6 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :68624 after 74976
[2025-06-02 19:14:48] [INFO ] Deduced a trap composed of 150 places in 205 ms of which 3 ms to minimize.
[2025-06-02 19:14:49] [INFO ] Deduced a trap composed of 122 places in 202 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1080 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 454/1522 variables, and 54 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:15:02] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2025-06-02 19:15:06] [INFO ] Deduced a trap composed of 284 places in 212 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:15:18] [INFO ] Deduced a trap composed of 186 places in 217 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 57 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 15/15 constraints]
After SMT, in 61621ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 61631ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69016 ms. Remains : 456/456 places, 1082/1082 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-01 in 252321 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3]
[2025-06-02 19:15:30] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2025-06-02 19:15:30] [INFO ] Computed 44 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 10000 steps (5 resets) in 35 ms. (277 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2025-06-02 19:15:30] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:15:30] [INFO ] Invariant cache hit.
[2025-06-02 19:15:30] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 19:15:30] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2025-06-02 19:15:31] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2025-06-02 19:15:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:15:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 19:15:31] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2025-06-02 19:15:32] [INFO ] [Nat]Absence check using state equation in 805 ms returned sat
[2025-06-02 19:15:32] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:15:32] [INFO ] [Nat]Added 96 Read/Feed constraints in 230 ms returned sat
[2025-06-02 19:15:32] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 3 ms to minimize.
[2025-06-02 19:15:32] [INFO ] Deduced a trap composed of 174 places in 226 ms of which 3 ms to minimize.
[2025-06-02 19:15:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 566 ms
[2025-06-02 19:15:33] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 62 ms.
[2025-06-02 19:15:34] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2025-06-02 19:15:35] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:15:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 296 ms
[2025-06-02 19:15:35] [INFO ] Added : 123 causal constraints over 25 iterations in 2304 ms. Result :sat
Minimization took 547 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 8 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 464 transition count 1082
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 456 transition count 1082
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 448 transition count 1074
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 448 transition count 1066
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 48 place count 440 transition count 1066
Applied a total of 48 rules in 47 ms. Remains 440 /464 variables (removed 24) and now considering 1066/1090 (removed 24) transitions.
Running 1064 sub problems to find dead transitions.
[2025-06-02 19:15:35] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
// Phase 1: matrix 1050 rows 440 cols
[2025-06-02 19:15:35] [INFO ] Computed 44 invariants in 19 ms
[2025-06-02 19:15:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:15:46] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2025-06-02 19:15:46] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2025-06-02 19:15:46] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2025-06-02 19:15:46] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:15:46] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:15:46] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:15:46] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:15:47] [INFO ] Deduced a trap composed of 178 places in 216 ms of which 3 ms to minimize.
[2025-06-02 19:15:50] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:15:54] [INFO ] Deduced a trap composed of 199 places in 214 ms of which 3 ms to minimize.
[2025-06-02 19:15:54] [INFO ] Deduced a trap composed of 215 places in 211 ms of which 3 ms to minimize.
[2025-06-02 19:15:54] [INFO ] Deduced a trap composed of 242 places in 222 ms of which 2 ms to minimize.
[2025-06-02 19:15:54] [INFO ] Deduced a trap composed of 150 places in 205 ms of which 2 ms to minimize.
[2025-06-02 19:15:55] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 56 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:16:00] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2025-06-02 19:16:00] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 2 ms to minimize.
[2025-06-02 19:16:00] [INFO ] Deduced a trap composed of 167 places in 222 ms of which 3 ms to minimize.
[2025-06-02 19:16:05] [INFO ] Deduced a trap composed of 268 places in 200 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 60 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 18/18 constraints]
After SMT, in 41917ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 41928ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41978 ms. Remains : 440/464 places, 1066/1090 transitions.
[2025-06-02 19:16:17] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:16:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (438 resets) in 3333 ms. (299 steps per ms)
BEST_FIRST walk for 1000000 steps (180 resets) in 1604 ms. (623 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2025-06-02 19:16:22] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:16:22] [INFO ] Invariant cache hit.
[2025-06-02 19:16:22] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-02 19:16:22] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 16 ms returned sat
[2025-06-02 19:16:23] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2025-06-02 19:16:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:16:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-02 19:16:23] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 18 ms returned sat
[2025-06-02 19:16:23] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2025-06-02 19:16:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:16:26] [INFO ] [Nat]Added 96 Read/Feed constraints in 2870 ms returned sat
[2025-06-02 19:16:26] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2025-06-02 19:16:26] [INFO ] Deduced a trap composed of 159 places in 221 ms of which 2 ms to minimize.
[2025-06-02 19:16:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 445 ms
[2025-06-02 19:16:27] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 656 transitions) in 54 ms.
[2025-06-02 19:16:27] [INFO ] Added : 48 causal constraints over 10 iterations in 837 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 22 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 440/440 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 12 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2025-06-02 19:16:32] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:16:32] [INFO ] Invariant cache hit.
[2025-06-02 19:16:32] [INFO ] Implicit Places using invariants in 395 ms returned []
[2025-06-02 19:16:32] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:16:32] [INFO ] Invariant cache hit.
[2025-06-02 19:16:33] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:16:38] [INFO ] Implicit Places using invariants and state equation in 5826 ms returned []
Implicit Place search using SMT with State Equation took 6232 ms to find 0 implicit places.
[2025-06-02 19:16:38] [INFO ] Redundant transitions in 9 ms returned []
Running 1064 sub problems to find dead transitions.
[2025-06-02 19:16:38] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:16:38] [INFO ] Invariant cache hit.
[2025-06-02 19:16:38] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:16:48] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 3 ms to minimize.
[2025-06-02 19:16:48] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2025-06-02 19:16:48] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 2 ms to minimize.
[2025-06-02 19:16:48] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2025-06-02 19:16:48] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2025-06-02 19:16:48] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:16:48] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:16:48] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:16:49] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 2 ms to minimize.
[2025-06-02 19:16:49] [INFO ] Deduced a trap composed of 172 places in 199 ms of which 3 ms to minimize.
[2025-06-02 19:16:49] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 3 ms to minimize.
[2025-06-02 19:16:50] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:17:00] [INFO ] Deduced a trap composed of 165 places in 225 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:17:04] [INFO ] Deduced a trap composed of 268 places in 201 ms of which 2 ms to minimize.
[2025-06-02 19:17:08] [INFO ] Deduced a trap composed of 227 places in 209 ms of which 2 ms to minimize.
[2025-06-02 19:17:08] [INFO ] Deduced a trap composed of 150 places in 206 ms of which 2 ms to minimize.
[2025-06-02 19:17:09] [INFO ] Deduced a trap composed of 159 places in 202 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 59 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:17:20] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:17:36] [INFO ] Deduced a trap composed of 159 places in 223 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 61 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 19/19 constraints]
After SMT, in 61731ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 61741ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68009 ms. Remains : 440/440 places, 1066/1066 transitions.
[2025-06-02 19:17:40] [INFO ] Flatten gal took : 142 ms
RANDOM walk for 40000 steps (17 resets) in 494 ms. (80 steps per ms) remains 2/2 properties
[2025-06-02 19:17:40] [INFO ] Flatten gal took : 90 ms
[2025-06-02 19:17:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4694246999113385956.gal : 22 ms
[2025-06-02 19:17:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3474067311710600458.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/ReachabilityCardinality4694246999113385956.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3474067311710600458.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40001 steps (12 resets) in 353 ms. (112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (14 resets) in 429 ms. (93 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3474067311710600458.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 96
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :96 after 497
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :497 after 588
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :588 after 1358
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1358 after 2462
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2462 after 7412
Interrupted probabilistic random walk after 221512 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 221512 steps, saw 124416 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2025-06-02 19:17:43] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:17:43] [INFO ] Invariant cache hit.
[2025-06-02 19:17:43] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:17:44] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 2 ms to minimize.
[2025-06-02 19:17:44] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2025-06-02 19:17:44] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2025-06-02 19:17:44] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2025-06-02 19:17:44] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7412 after 14374
At refinement iteration 14 (OVERLAPS) 1050/1488 variables, 438/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 96/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1490 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1490 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 585 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1328 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:17:45] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1050/1488 variables, 438/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 96/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1488 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1488 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/1490 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1490 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:17:46] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1490 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1490 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1490 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 589 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1705 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 3047ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 12 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Running 1064 sub problems to find dead transitions.
[2025-06-02 19:17:47] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:17:47] [INFO ] Invariant cache hit.
[2025-06-02 19:17:47] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :43536 after 43644
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:17:56] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 3 ms to minimize.
[2025-06-02 19:17:57] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2025-06-02 19:17:57] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
[2025-06-02 19:17:57] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:17:57] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:17:57] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:17:57] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2025-06-02 19:17:57] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:17:57] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 2 ms to minimize.
[2025-06-02 19:17:58] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 6 ms to minimize.
[2025-06-02 19:17:58] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 3 ms to minimize.
[2025-06-02 19:17:59] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :43644 after 89102
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 54 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:18:14] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 3 ms to minimize.
[2025-06-02 19:18:14] [INFO ] Deduced a trap composed of 178 places in 238 ms of which 3 ms to minimize.
[2025-06-02 19:18:14] [INFO ] Deduced a trap composed of 180 places in 238 ms of which 3 ms to minimize.
[2025-06-02 19:18:19] [INFO ] Deduced a trap composed of 268 places in 222 ms of which 3 ms to minimize.
[2025-06-02 19:18:25] [INFO ] Deduced a trap composed of 150 places in 262 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :89102 after 236262
[2025-06-02 19:18:26] [INFO ] Deduced a trap composed of 147 places in 227 ms of which 2 ms to minimize.
[2025-06-02 19:18:27] [INFO ] Deduced a trap composed of 129 places in 330 ms of which 4 ms to minimize.
[2025-06-02 19:18:28] [INFO ] Deduced a trap composed of 63 places in 330 ms of which 5 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 438/1490 variables, and 62 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 20/20 constraints]
After SMT, in 41801ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 41810ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41825 ms. Remains : 440/440 places, 1066/1066 transitions.
RANDOM walk for 40000 steps (14 resets) in 568 ms. (70 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (9 resets) in 332 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 277 ms. (143 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2025-06-02 19:18:30] [INFO ] Flatten gal took : 44 ms
[2025-06-02 19:18:30] [INFO ] Applying decomposition
[2025-06-02 19:18:30] [INFO ] Flatten gal took : 43 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/graph6978365776699765190.txt' '-o' '/tmp/graph6978365776699765190.bin' '-w' '/tmp/graph6978365776699765190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6978365776699765190.bin' '-l' '-1' '-v' '-w' '/tmp/graph6978365776699765190.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:18:30] [INFO ] Decomposing Gal with order
[2025-06-02 19:18:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:18:31] [INFO ] Removed a total of 885 redundant transitions.
[2025-06-02 19:18:31] [INFO ] Flatten gal took : 120 ms
[2025-06-02 19:18:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 517 labels/synchronizations in 21 ms.
[2025-06-02 19:18:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11545474506980423459.gal : 8 ms
[2025-06-02 19:18:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8535328610819356804.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/ReachabilityCardinality11545474506980423459.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8535328610819356804.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8535328610819356804.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :22 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 134
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :134 after 234
Interrupted probabilistic random walk after 177221 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 2
Probabilistic random walk after 177221 steps, saw 100677 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2025-06-02 19:18:32] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:18:32] [INFO ] Invariant cache hit.
[2025-06-02 19:18:32] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :234 after 906
[2025-06-02 19:18:32] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 2 ms to minimize.
[2025-06-02 19:18:32] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :906 after 1720
[2025-06-02 19:18:32] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2025-06-02 19:18:32] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2025-06-02 19:18:32] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1050/1488 variables, 438/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1720 after 3240
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 96/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1490 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1490 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 585 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1335 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:18:33] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1050/1488 variables, 438/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3240 after 6852
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 96/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1488 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1488 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/1490 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1490 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:18:35] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1490 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1490 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1490 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 589 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1751 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 3102ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 108 ms.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 13 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 440/440 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 13 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2025-06-02 19:18:35] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:18:35] [INFO ] Invariant cache hit.
[2025-06-02 19:18:35] [INFO ] Implicit Places using invariants in 385 ms returned []
[2025-06-02 19:18:35] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:18:35] [INFO ] Invariant cache hit.
[2025-06-02 19:18:36] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6852 after 16566
[2025-06-02 19:18:41] [INFO ] Implicit Places using invariants and state equation in 5666 ms returned []
Implicit Place search using SMT with State Equation took 6053 ms to find 0 implicit places.
[2025-06-02 19:18:41] [INFO ] Redundant transitions in 15 ms returned []
Running 1064 sub problems to find dead transitions.
[2025-06-02 19:18:41] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:18:41] [INFO ] Invariant cache hit.
[2025-06-02 19:18:41] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :43536 after 43604
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:18:51] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2025-06-02 19:18:51] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2025-06-02 19:18:52] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 2 ms to minimize.
[2025-06-02 19:18:52] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2025-06-02 19:18:52] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:18:52] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:18:52] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:18:52] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2025-06-02 19:18:52] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:18:52] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 2 ms to minimize.
[2025-06-02 19:18:53] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 3 ms to minimize.
[2025-06-02 19:18:53] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2025-06-02 19:19:03] [INFO ] Deduced a trap composed of 165 places in 217 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:19:07] [INFO ] Deduced a trap composed of 268 places in 210 ms of which 3 ms to minimize.
[2025-06-02 19:19:11] [INFO ] Deduced a trap composed of 227 places in 208 ms of which 3 ms to minimize.
[2025-06-02 19:19:11] [INFO ] Deduced a trap composed of 150 places in 208 ms of which 2 ms to minimize.
[2025-06-02 19:19:12] [INFO ] Deduced a trap composed of 159 places in 204 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :43604 after 59165
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 59 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Detected timeout of ITS tools.
[2025-06-02 19:19:23] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:19:38] [INFO ] Deduced a trap composed of 159 places in 216 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 61 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 19/19 constraints]
After SMT, in 61753ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 61763ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67855 ms. Remains : 440/440 places, 1066/1066 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-08 in 252699 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2025-06-02 19:19:43] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2025-06-02 19:19:43] [INFO ] Computed 44 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (10 resets) in 40 ms. (243 steps per ms)
BEST_FIRST walk for 10000 steps (3 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-02 19:19:43] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:19:43] [INFO ] Invariant cache hit.
[2025-06-02 19:19:43] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 19:19:43] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-02 19:19:43] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2025-06-02 19:19:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-02 19:19:43] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-02 19:19:44] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2025-06-02 19:19:44] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:19:44] [INFO ] [Nat]Added 96 Read/Feed constraints in 287 ms returned sat
[2025-06-02 19:19:44] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 58 ms.
[2025-06-02 19:19:45] [INFO ] Deduced a trap composed of 186 places in 226 ms of which 3 ms to minimize.
[2025-06-02 19:19:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 711 ms
[2025-06-02 19:19:46] [INFO ] Added : 22 causal constraints over 5 iterations in 1376 ms. Result :sat
Minimization took 615 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 8 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 464 transition count 1082
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 456 transition count 1082
Applied a total of 16 rules in 25 ms. Remains 456 /464 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
Running 1080 sub problems to find dead transitions.
[2025-06-02 19:19:46] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 456 cols
[2025-06-02 19:19:46] [INFO ] Computed 44 invariants in 22 ms
[2025-06-02 19:19:46] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:19:57] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2025-06-02 19:19:57] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2025-06-02 19:19:57] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2025-06-02 19:19:57] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:19:57] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:19:57] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:19:57] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:19:57] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:19:58] [INFO ] Deduced a trap composed of 173 places in 223 ms of which 3 ms to minimize.
[2025-06-02 19:19:58] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:20:00] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 2 ms to minimize.
[2025-06-02 19:20:03] [INFO ] Deduced a trap composed of 169 places in 217 ms of which 3 ms to minimize.
[2025-06-02 19:20:07] [INFO ] Deduced a trap composed of 150 places in 198 ms of which 3 ms to minimize.
[2025-06-02 19:20:07] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 56 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:20:13] [INFO ] Deduced a trap composed of 67 places in 213 ms of which 3 ms to minimize.
[2025-06-02 19:20:16] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 58 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 16/16 constraints]
After SMT, in 41940ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 41951ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41979 ms. Remains : 456/464 places, 1082/1090 transitions.
[2025-06-02 19:20:28] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:20:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (394 resets) in 3303 ms. (302 steps per ms)
BEST_FIRST walk for 1000000 steps (178 resets) in 1585 ms. (630 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-02 19:20:33] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:20:33] [INFO ] Invariant cache hit.
[2025-06-02 19:20:33] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-02 19:20:33] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-02 19:20:33] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2025-06-02 19:20:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:20:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-02 19:20:34] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-02 19:20:34] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2025-06-02 19:20:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:20:34] [INFO ] [Nat]Added 96 Read/Feed constraints in 367 ms returned sat
[2025-06-02 19:20:34] [INFO ] Deduced a trap composed of 180 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:20:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2025-06-02 19:20:35] [INFO ] Computed and/alt/rep : 464/1581/456 causal constraints (skipped 608 transitions) in 57 ms.
[2025-06-02 19:20:35] [INFO ] Added : 42 causal constraints over 9 iterations in 761 ms. Result :sat
Minimization took 4510 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 8 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 22 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 456/456 places, 1082/1082 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 16 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2025-06-02 19:20:40] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:20:40] [INFO ] Invariant cache hit.
[2025-06-02 19:20:40] [INFO ] Implicit Places using invariants in 362 ms returned []
[2025-06-02 19:20:40] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:20:40] [INFO ] Invariant cache hit.
[2025-06-02 19:20:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:20:47] [INFO ] Implicit Places using invariants and state equation in 6614 ms returned []
Implicit Place search using SMT with State Equation took 6978 ms to find 0 implicit places.
[2025-06-02 19:20:47] [INFO ] Redundant transitions in 10 ms returned []
Running 1080 sub problems to find dead transitions.
[2025-06-02 19:20:47] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:20:47] [INFO ] Invariant cache hit.
[2025-06-02 19:20:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:20:58] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 2 ms to minimize.
[2025-06-02 19:20:58] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2025-06-02 19:20:58] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:20:58] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2025-06-02 19:20:58] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2025-06-02 19:20:58] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:20:58] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:20:58] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:20:58] [INFO ] Deduced a trap composed of 174 places in 228 ms of which 3 ms to minimize.
[2025-06-02 19:20:59] [INFO ] Deduced a trap composed of 159 places in 211 ms of which 3 ms to minimize.
[2025-06-02 19:20:59] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2025-06-02 19:21:08] [INFO ] Deduced a trap composed of 150 places in 224 ms of which 3 ms to minimize.
[2025-06-02 19:21:08] [INFO ] Deduced a trap composed of 147 places in 201 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 1.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 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.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 0.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 0.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 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.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 9.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 1.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 1.0)
(s199 0.0)
(s200 1.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 1.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 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 55 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:21:27] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2025-06-02 19:21:32] [INFO ] Deduced a trap composed of 296 places in 203 ms of which 3 ms to minimize.
[2025-06-02 19:21:33] [INFO ] Deduced a trap composed of 148 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 58 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 16/16 constraints]
After SMT, in 62052ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 62063ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69079 ms. Remains : 456/456 places, 1082/1082 transitions.
[2025-06-02 19:21:49] [INFO ] Flatten gal took : 52 ms
[2025-06-02 19:21:49] [INFO ] Flatten gal took : 40 ms
[2025-06-02 19:21:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15452309809429637343.gal : 9 ms
[2025-06-02 19:21:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5102680167516438646.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/ReachabilityCardinality15452309809429637343.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5102680167516438646.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (21 resets) in 356 ms. (112 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 40003 steps (12 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 332 ms. (120 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5102680167516438646.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 10
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10 after 50
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :50 after 80
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :430 after 2243
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2243 after 5603
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5603 after 5950
Interrupted probabilistic random walk after 206650 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 206650 steps, saw 115998 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2025-06-02 19:21:52] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:21:52] [INFO ] Invariant cache hit.
[2025-06-02 19:21:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:21:53] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 3 ms to minimize.
[2025-06-02 19:21:53] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2025-06-02 19:21:53] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2025-06-02 19:21:53] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2025-06-02 19:21:53] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2025-06-02 19:21:53] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 6/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/451 variables, 4/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/454 variables, 3/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1066/1520 variables, 454/503 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1520 variables, 96/599 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1520 variables, 0/599 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1522 variables, 2/601 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1522 variables, 1/602 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1522 variables, 0/602 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1522 variables, 0/602 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1522/1522 variables, and 602 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 6/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/451 variables, 4/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/454 variables, 3/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1066/1520 variables, 454/503 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5950 after 9335
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/1522 variables, and 599 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 454/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 2476ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 8 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 13 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2025-06-02 19:21:55] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:21:55] [INFO ] Invariant cache hit.
[2025-06-02 19:21:55] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :9335 after 12216
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:22:05] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2025-06-02 19:22:05] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 1 ms to minimize.
[2025-06-02 19:22:05] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 0 ms to minimize.
[2025-06-02 19:22:05] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 0 ms to minimize.
[2025-06-02 19:22:05] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:22:05] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 0 ms to minimize.
[2025-06-02 19:22:05] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:22:05] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:22:06] [INFO ] Deduced a trap composed of 174 places in 204 ms of which 3 ms to minimize.
[2025-06-02 19:22:06] [INFO ] Deduced a trap composed of 159 places in 203 ms of which 3 ms to minimize.
[2025-06-02 19:22:06] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :12216 after 169376
[2025-06-02 19:22:15] [INFO ] Deduced a trap composed of 150 places in 200 ms of which 2 ms to minimize.
[2025-06-02 19:22:16] [INFO ] Deduced a trap composed of 147 places in 196 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 55 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:22:25] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :169376 after 239168
[2025-06-02 19:22:29] [INFO ] Deduced a trap composed of 296 places in 215 ms of which 2 ms to minimize.
[2025-06-02 19:22:30] [INFO ] Deduced a trap composed of 148 places in 195 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1080 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 Int declared 454/1522 variables, and 58 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 16/16 constraints]
After SMT, in 41900ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 41911ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41926 ms. Remains : 456/456 places, 1082/1082 transitions.
RANDOM walk for 40000 steps (19 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (10 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Detected timeout of ITS tools.
[2025-06-02 19:22:39] [INFO ] Flatten gal took : 41 ms
[2025-06-02 19:22:39] [INFO ] Applying decomposition
[2025-06-02 19:22:39] [INFO ] Flatten gal took : 43 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/graph6398272699103639777.txt' '-o' '/tmp/graph6398272699103639777.bin' '-w' '/tmp/graph6398272699103639777.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6398272699103639777.bin' '-l' '-1' '-v' '-w' '/tmp/graph6398272699103639777.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:22:39] [INFO ] Decomposing Gal with order
[2025-06-02 19:22:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:22:39] [INFO ] Removed a total of 764 redundant transitions.
[2025-06-02 19:22:40] [INFO ] Flatten gal took : 108 ms
[2025-06-02 19:22:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 474 labels/synchronizations in 18 ms.
[2025-06-02 19:22:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7147201678424544843.gal : 7 ms
[2025-06-02 19:22:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14984210109395569324.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/ReachabilityCardinality7147201678424544843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14984210109395569324.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Interrupted probabilistic random walk after 297995 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 297995 steps, saw 163959 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2025-06-02 19:22:40] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:22:40] [INFO ] Invariant cache hit.
[2025-06-02 19:22:40] [INFO ] State equation strengthened by 96 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality14984210109395569324.prop.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/451 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/454 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 80
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :80 after 206
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :206 after 778
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :778 after 830
At refinement iteration 13 (OVERLAPS) 1066/1520 variables, 454/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :830 after 1128
At refinement iteration 14 (INCLUDED_ONLY) 0/1520 variables, 96/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1520 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1128 after 2220
At refinement iteration 16 (OVERLAPS) 2/1522 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1522 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1522 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1522 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1522/1522 variables, and 596 constraints, problems are : Problem set: 0 solved, 1 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/447 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2220 after 7230
[2025-06-02 19:22:41] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2025-06-02 19:22:41] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2025-06-02 19:22:41] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2025-06-02 19:22:41] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/451 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/454 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7230 after 36884
At refinement iteration 14 (OVERLAPS) 1066/1520 variables, 454/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1520 variables, 96/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1520 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1520 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1522 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1522 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1522 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1522 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1522/1522 variables, and 601 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1788 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2548ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 8 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 12 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 456/456 places, 1082/1082 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 13 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2025-06-02 19:22:42] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:22:42] [INFO ] Invariant cache hit.
[2025-06-02 19:22:43] [INFO ] Implicit Places using invariants in 380 ms returned []
[2025-06-02 19:22:43] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:22:43] [INFO ] Invariant cache hit.
[2025-06-02 19:22:43] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :57620 after 72687
[2025-06-02 19:22:49] [INFO ] Implicit Places using invariants and state equation in 6487 ms returned []
Implicit Place search using SMT with State Equation took 6867 ms to find 0 implicit places.
[2025-06-02 19:22:49] [INFO ] Redundant transitions in 14 ms returned []
Running 1080 sub problems to find dead transitions.
[2025-06-02 19:22:49] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-02 19:22:49] [INFO ] Invariant cache hit.
[2025-06-02 19:22:49] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :72687 after 105738
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:23:00] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2025-06-02 19:23:00] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2025-06-02 19:23:00] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2025-06-02 19:23:00] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:23:00] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2025-06-02 19:23:00] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:23:00] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:23:00] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:23:00] [INFO ] Deduced a trap composed of 174 places in 226 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :105738 after 329268
[2025-06-02 19:23:01] [INFO ] Deduced a trap composed of 159 places in 216 ms of which 3 ms to minimize.
[2025-06-02 19:23:01] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 0 ms to minimize.
[2025-06-02 19:23:10] [INFO ] Deduced a trap composed of 150 places in 205 ms of which 3 ms to minimize.
[2025-06-02 19:23:10] [INFO ] Deduced a trap composed of 147 places in 193 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :329268 after 634662
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 55 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2025-06-02 19:23:29] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 19:23:34] [INFO ] Deduced a trap composed of 296 places in 214 ms of which 3 ms to minimize.
[2025-06-02 19:23:35] [INFO ] Deduced a trap composed of 148 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 9)
(s179 0)
(s180 1)
(s181 1)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 1)
(s195 0)
(s196 0)
(s197 timeout
0)
(s198 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 58 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 16/16 constraints]
After SMT, in 61892ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 61903ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68803 ms. Remains : 456/456 places, 1082/1082 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-09 in 248270 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-10
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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2025-06-02 19:23:51] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2025-06-02 19:23:51] [INFO ] Computed 44 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (3 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-02 19:23:51] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:23:51] [INFO ] Invariant cache hit.
[2025-06-02 19:23:51] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-02 19:23:51] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-02 19:23:52] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2025-06-02 19:23:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:23:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-02 19:23:52] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2025-06-02 19:23:52] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2025-06-02 19:23:52] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:23:53] [INFO ] [Nat]Added 96 Read/Feed constraints in 475 ms returned sat
[2025-06-02 19:23:53] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 61 ms.
[2025-06-02 19:23:53] [INFO ] Added : 34 causal constraints over 7 iterations in 831 ms. Result :sat
Minimization took 605 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 8 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 456 transition count 1082
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 456 transition count 1074
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 448 transition count 1074
Applied a total of 32 rules in 40 ms. Remains 448 /464 variables (removed 16) and now considering 1074/1090 (removed 16) transitions.
Running 1072 sub problems to find dead transitions.
[2025-06-02 19:23:54] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
// Phase 1: matrix 1058 rows 448 cols
[2025-06-02 19:23:54] [INFO ] Computed 44 invariants in 22 ms
[2025-06-02 19:23:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2025-06-02 19:24:04] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2025-06-02 19:24:04] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2025-06-02 19:24:04] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2025-06-02 19:24:04] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:24:04] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:24:05] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 1 ms to minimize.
[2025-06-02 19:24:05] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2025-06-02 19:24:05] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:24:05] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2025-06-02 19:24:05] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:24:06] [INFO ] Deduced a trap composed of 174 places in 219 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 53 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2025-06-02 19:24:22] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2025-06-02 19:24:27] [INFO ] Deduced a trap composed of 150 places in 205 ms of which 3 ms to minimize.
[2025-06-02 19:24:27] [INFO ] Deduced a trap composed of 276 places in 218 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1506 variables, and 56 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 14/14 constraints]
After SMT, in 41883ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 41893ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41935 ms. Remains : 448/464 places, 1074/1090 transitions.
[2025-06-02 19:24:36] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-02 19:24:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (424 resets) in 3371 ms. (296 steps per ms)
BEST_FIRST walk for 1000001 steps (165 resets) in 1692 ms. (590 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-02 19:24:41] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-02 19:24:41] [INFO ] Invariant cache hit.
[2025-06-02 19:24:41] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2025-06-02 19:24:41] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-02 19:24:41] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2025-06-02 19:24:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:24:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-02 19:24:42] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 25 ms returned sat
[2025-06-02 19:24:42] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2025-06-02 19:24:42] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:24:42] [INFO ] [Nat]Added 96 Read/Feed constraints in 232 ms returned sat
[2025-06-02 19:24:43] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 58 ms.
[2025-06-02 19:24:43] [INFO ] Deduced a trap composed of 177 places in 219 ms of which 2 ms to minimize.
[2025-06-02 19:24:44] [INFO ] Deduced a trap composed of 183 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:24:44] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 3 ms to minimize.
[2025-06-02 19:24:45] [INFO ] Deduced a trap composed of 186 places in 192 ms of which 2 ms to minimize.
[2025-06-02 19:24:45] [INFO ] Deduced a trap composed of 171 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:24:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2119 ms
[2025-06-02 19:24:46] [INFO ] Added : 61 causal constraints over 13 iterations in 3071 ms. Result :sat
Minimization took 3286 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 12 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 448/448 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 11 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2025-06-02 19:24:49] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-02 19:24:49] [INFO ] Invariant cache hit.
[2025-06-02 19:24:50] [INFO ] Implicit Places using invariants in 385 ms returned []
[2025-06-02 19:24:50] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-02 19:24:50] [INFO ] Invariant cache hit.
[2025-06-02 19:24:50] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:24:56] [INFO ] Implicit Places using invariants and state equation in 6317 ms returned []
Implicit Place search using SMT with State Equation took 6715 ms to find 0 implicit places.
[2025-06-02 19:24:56] [INFO ] Redundant transitions in 11 ms returned []
Running 1072 sub problems to find dead transitions.
[2025-06-02 19:24:56] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-02 19:24:56] [INFO ] Invariant cache hit.
[2025-06-02 19:24:56] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2025-06-02 19:25:06] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
[2025-06-02 19:25:06] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2025-06-02 19:25:07] [INFO ] Deduced a trap composed of 171 places in 125 ms of which 2 ms to minimize.
[2025-06-02 19:25:07] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2025-06-02 19:25:07] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 0 ms to minimize.
[2025-06-02 19:25:07] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 0 ms to minimize.
[2025-06-02 19:25:07] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2025-06-02 19:25:07] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 0 ms to minimize.
[2025-06-02 19:25:07] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2025-06-02 19:25:07] [INFO ] Deduced a trap composed of 165 places in 215 ms of which 3 ms to minimize.
[2025-06-02 19:25:08] [INFO ] Deduced a trap composed of 159 places in 374 ms of which 3 ms to minimize.
[2025-06-02 19:25:09] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 2 ms to minimize.
[2025-06-02 19:25:09] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 3 ms to minimize.
[2025-06-02 19:25:09] [INFO ] Deduced a trap composed of 182 places in 228 ms of which 2 ms to minimize.
[2025-06-02 19:25:09] [INFO ] Deduced a trap composed of 169 places in 200 ms of which 3 ms to minimize.
[2025-06-02 19:25:10] [INFO ] Deduced a trap composed of 184 places in 235 ms of which 3 ms to minimize.
[2025-06-02 19:25:10] [INFO ] Deduced a trap composed of 184 places in 235 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2025-06-02 19:25:25] [INFO ] Deduced a trap composed of 276 places in 205 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 Real declared 446/1506 variables, and 60 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2025-06-02 19:25:38] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2025-06-02 19:25:43] [INFO ] Deduced a trap composed of 150 places in 195 ms of which 2 ms to minimize.
[2025-06-02 19:25:45] [INFO ] Deduced a trap composed of 147 places in 192 ms of which 3 ms to minimize.
[2025-06-02 19:25:46] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 3 ms to minimize.
[2025-06-02 19:25:46] [INFO ] Deduced a trap composed of 67 places in 196 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1506 variables, and 65 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 23/23 constraints]
After SMT, in 61849ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 61859ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68603 ms. Remains : 448/448 places, 1074/1074 transitions.
[2025-06-02 19:25:58] [INFO ] Flatten gal took : 88 ms
[2025-06-02 19:25:58] [INFO ] Flatten gal took : 79 ms
[2025-06-02 19:25:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6998533425102525448.gal : 20 ms
[2025-06-02 19:25:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14807076629905088562.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/ReachabilityCardinality6998533425102525448.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14807076629905088562.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (26 resets) in 785 ms. (50 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 40001 steps (9 resets) in 447 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 312 ms. (127 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality14807076629905088562.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :10 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 180
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :180 after 836
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :836 after 1214
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1214 after 2378
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2378 after 4694
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4694 after 9644
Interrupted probabilistic random walk after 121474 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 2
Probabilistic random walk after 121474 steps, saw 70034 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2025-06-02 19:26:01] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-02 19:26:01] [INFO ] Invariant cache hit.
[2025-06-02 19:26:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 175/183 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/208 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/222 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/439 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:26:02] [INFO ] Deduced a trap composed of 45 places in 260 ms of which 31 ms to minimize.
[2025-06-02 19:26:04] [INFO ] Deduced a trap composed of 45 places in 2206 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :9644 after 20736
[2025-06-02 19:26:04] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2025-06-02 19:26:04] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2025-06-02 19:26:04] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 5/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/443 variables, 4/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/446 variables, 3/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1058/1504 variables, 446/494 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1504 variables, 96/590 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 0/590 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1506 variables, 2/592 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1506 variables, 1/593 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1506 variables, 0/593 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1506 variables, 0/593 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 593 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3809 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 175/183 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/208 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/222 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/439 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 5/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/443 variables, 4/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/446 variables, 3/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1058/1504 variables, 446/494 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/1506 variables, and 590 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1441 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 446/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 5279ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 12 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Running 1072 sub problems to find dead transitions.
[2025-06-02 19:26:07] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-02 19:26:07] [INFO ] Invariant cache hit.
[2025-06-02 19:26:07] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :20736 after 64326
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2025-06-02 19:26:18] [INFO ] Deduced a trap composed of 45 places in 183 ms of which 2 ms to minimize.
[2025-06-02 19:26:18] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 2 ms to minimize.
[2025-06-02 19:26:18] [INFO ] Deduced a trap composed of 171 places in 167 ms of which 1 ms to minimize.
[2025-06-02 19:26:19] [INFO ] Deduced a trap composed of 45 places in 1002 ms of which 2 ms to minimize.
[2025-06-02 19:26:19] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:26:21] [INFO ] Deduced a trap composed of 45 places in 1297 ms of which 24 ms to minimize.
[2025-06-02 19:26:21] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2025-06-02 19:26:21] [INFO ] Deduced a trap composed of 45 places in 620 ms of which 32 ms to minimize.
[2025-06-02 19:26:23] [INFO ] Deduced a trap composed of 45 places in 1145 ms of which 28 ms to minimize.
[2025-06-02 19:26:23] [INFO ] Deduced a trap composed of 165 places in 429 ms of which 4 ms to minimize.
[2025-06-02 19:26:24] [INFO ] Deduced a trap composed of 159 places in 318 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :64326 after 104422
[2025-06-02 19:26:25] [INFO ] Deduced a trap composed of 165 places in 437 ms of which 3 ms to minimize.
[2025-06-02 19:26:25] [INFO ] Deduced a trap composed of 160 places in 447 ms of which 2 ms to minimize.
[2025-06-02 19:26:26] [INFO ] Deduced a trap composed of 182 places in 619 ms of which 2 ms to minimize.
[2025-06-02 19:26:30] [INFO ] Deduced a trap composed of 169 places in 4819 ms of which 7 ms to minimize.
SMT process timed out in 23751ms, After SMT, problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 23760ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23774 ms. Remains : 448/448 places, 1074/1074 transitions.
RANDOM walk for 40000 steps (16 resets) in 391 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (10 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 292103 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 1
Probabilistic random walk after 292103 steps, saw 160707 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
[2025-06-02 19:26:34] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-02 19:26:34] [INFO ] Invariant cache hit.
[2025-06-02 19:26:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 175/183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 25/208 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/222 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/439 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/443 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/446 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1058/1504 variables, 446/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1504 variables, 96/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1504 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1506 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1506 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1438 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 175/183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/208 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/222 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 217/439 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:26:35] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 2 ms to minimize.
[2025-06-02 19:26:36] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 2 ms to minimize.
[2025-06-02 19:26:36] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
[2025-06-02 19:26:36] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/443 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/446 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1058/1504 variables, 446/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1504 variables, 96/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1504 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1506 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1506 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1506 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1506 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1506/1506 variables, and 593 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2147 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 3623ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 17 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 448/448 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 25 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2025-06-02 19:26:37] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-02 19:26:37] [INFO ] Invariant cache hit.
[2025-06-02 19:26:38] [INFO ] Implicit Places using invariants in 563 ms returned []
[2025-06-02 19:26:38] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-02 19:26:38] [INFO ] Invariant cache hit.
[2025-06-02 19:26:38] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :104422 after 234634
[2025-06-02 19:26:44] [INFO ] Implicit Places using invariants and state equation in 6297 ms returned []
Implicit Place search using SMT with State Equation took 6862 ms to find 0 implicit places.
[2025-06-02 19:26:44] [INFO ] Redundant transitions in 11 ms returned []
Running 1072 sub problems to find dead transitions.
[2025-06-02 19:26:44] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-02 19:26:44] [INFO ] Invariant cache hit.
[2025-06-02 19:26:44] [INFO ] State equation strengthened by 96 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-02 19:26:48] [INFO ] Flatten gal took : 39 ms
[2025-06-02 19:26:48] [INFO ] Applying decomposition
[2025-06-02 19:26:48] [INFO ] Flatten gal took : 38 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/graph5929878008423429932.txt' '-o' '/tmp/graph5929878008423429932.bin' '-w' '/tmp/graph5929878008423429932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5929878008423429932.bin' '-l' '-1' '-v' '-w' '/tmp/graph5929878008423429932.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:26:48] [INFO ] Decomposing Gal with order
[2025-06-02 19:26:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:26:49] [INFO ] Removed a total of 879 redundant transitions.
[2025-06-02 19:26:49] [INFO ] Flatten gal took : 182 ms
[2025-06-02 19:26:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 483 labels/synchronizations in 38 ms.
[2025-06-02 19:26:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5161840789878395582.gal : 32 ms
[2025-06-02 19:26:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6619682605975981269.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/ReachabilityCardinality5161840789878395582.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6619682605975981269.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/ReachabilityCardinality6619682605975981269.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 21
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :21 after 28
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :28 after 31
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :31 after 47
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :47 after 76
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :76 after 128
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :128 after 181
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :181 after 246
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :246 after 1925
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1925 after 8312
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2025-06-02 19:26:54] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 1 ms to minimize.
[2025-06-02 19:26:54] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 1 ms to minimize.
[2025-06-02 19:26:55] [INFO ] Deduced a trap composed of 171 places in 108 ms of which 2 ms to minimize.
[2025-06-02 19:26:55] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:26:55] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:26:55] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2025-06-02 19:26:55] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
[2025-06-02 19:26:55] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:26:55] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:26:55] [INFO ] Deduced a trap composed of 165 places in 214 ms of which 3 ms to minimize.
[2025-06-02 19:26:56] [INFO ] Deduced a trap composed of 159 places in 212 ms of which 3 ms to minimize.
[2025-06-02 19:26:56] [INFO ] Deduced a trap composed of 165 places in 213 ms of which 3 ms to minimize.
[2025-06-02 19:26:56] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 3 ms to minimize.
[2025-06-02 19:26:57] [INFO ] Deduced a trap composed of 182 places in 215 ms of which 2 ms to minimize.
[2025-06-02 19:26:57] [INFO ] Deduced a trap composed of 169 places in 212 ms of which 3 ms to minimize.
[2025-06-02 19:26:57] [INFO ] Deduced a trap composed of 184 places in 220 ms of which 2 ms to minimize.
[2025-06-02 19:26:57] [INFO ] Deduced a trap composed of 184 places in 215 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8312 after 23258
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2025-06-02 19:27:11] [INFO ] Deduced a trap composed of 276 places in 206 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :23258 after 34484
[2025-06-02 19:27:15] [INFO ] Deduced a trap composed of 150 places in 209 ms of which 3 ms to minimize.
[2025-06-02 19:27:16] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 62 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :34484 after 139942
[2025-06-02 19:27:32] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 2 ms to minimize.
[2025-06-02 19:27:32] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2025-06-02 19:27:38] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1506 variables, and 65 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 23/23 constraints]
After SMT, in 61979ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 61990ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68897 ms. Remains : 448/448 places, 1074/1074 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-10 in 235014 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2025-06-02 19:27:46] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2025-06-02 19:27:46] [INFO ] Computed 44 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (2 resets) in 37 ms. (263 steps per ms)
BEST_FIRST walk for 10000 steps (3 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-06-02 19:27:46] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 19:27:46] [INFO ] Invariant cache hit.
[2025-06-02 19:27:46] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-02 19:27:46] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 12 ms returned sat
[2025-06-02 19:27:47] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2025-06-02 19:27:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:27:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-02 19:27:47] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 12 ms returned sat
[2025-06-02 19:27:47] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2025-06-02 19:27:47] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:27:48] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:27:48] [INFO ] [Nat]Added 96 Read/Feed constraints in 1019 ms returned sat
[2025-06-02 19:27:49] [INFO ] Computed and/alt/rep : 472/1589/464 causal constraints (skipped 608 transitions) in 62 ms.
[2025-06-02 19:27:49] [INFO ] Added : 25 causal constraints over 5 iterations in 666 ms. Result :sat
Minimization took 631 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 464 transition count 1082
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 456 transition count 1082
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 448 transition count 1074
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 448 transition count 1066
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 48 place count 440 transition count 1066
Applied a total of 48 rules in 42 ms. Remains 440 /464 variables (removed 24) and now considering 1066/1090 (removed 24) transitions.
Running 1064 sub problems to find dead transitions.
[2025-06-02 19:27:50] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
// Phase 1: matrix 1050 rows 440 cols
[2025-06-02 19:27:50] [INFO ] Computed 44 invariants in 19 ms
[2025-06-02 19:27:50] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:27:59] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2025-06-02 19:27:59] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
[2025-06-02 19:28:00] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:28:00] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:28:00] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2025-06-02 19:28:00] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:28:00] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:28:00] [INFO ] Deduced a trap composed of 178 places in 200 ms of which 2 ms to minimize.
[2025-06-02 19:28:04] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:28:07] [INFO ] Deduced a trap composed of 199 places in 195 ms of which 3 ms to minimize.
[2025-06-02 19:28:07] [INFO ] Deduced a trap composed of 215 places in 200 ms of which 3 ms to minimize.
[2025-06-02 19:28:07] [INFO ] Deduced a trap composed of 242 places in 196 ms of which 3 ms to minimize.
[2025-06-02 19:28:07] [INFO ] Deduced a trap composed of 150 places in 205 ms of which 3 ms to minimize.
[2025-06-02 19:28:08] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 56 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:28:14] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2025-06-02 19:28:14] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 2 ms to minimize.
[2025-06-02 19:28:14] [INFO ] Deduced a trap composed of 167 places in 207 ms of which 3 ms to minimize.
[2025-06-02 19:28:19] [INFO ] Deduced a trap composed of 268 places in 190 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 60 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 18/18 constraints]
After SMT, in 41811ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 41820ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41865 ms. Remains : 440/464 places, 1066/1090 transitions.
[2025-06-02 19:28:32] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:28:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (436 resets) in 3666 ms. (272 steps per ms)
BEST_FIRST walk for 1000001 steps (179 resets) in 1726 ms. (579 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-06-02 19:28:37] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:28:37] [INFO ] Invariant cache hit.
[2025-06-02 19:28:37] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-02 19:28:37] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-02 19:28:38] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2025-06-02 19:28:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:28:38] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-02 19:28:38] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2025-06-02 19:28:39] [INFO ] [Nat]Absence check using state equation in 1558 ms returned sat
[2025-06-02 19:28:39] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:28:40] [INFO ] [Nat]Added 96 Read/Feed constraints in 746 ms returned sat
[2025-06-02 19:28:40] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 656 transitions) in 62 ms.
[2025-06-02 19:28:40] [INFO ] Added : 20 causal constraints over 4 iterations in 391 ms. Result :sat
Minimization took 4517 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 17 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 440/440 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 12 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2025-06-02 19:28:45] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:28:45] [INFO ] Invariant cache hit.
[2025-06-02 19:28:45] [INFO ] Implicit Places using invariants in 400 ms returned []
[2025-06-02 19:28:45] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:28:45] [INFO ] Invariant cache hit.
[2025-06-02 19:28:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:28:51] [INFO ] Implicit Places using invariants and state equation in 5747 ms returned []
Implicit Place search using SMT with State Equation took 6149 ms to find 0 implicit places.
[2025-06-02 19:28:51] [INFO ] Redundant transitions in 10 ms returned []
Running 1064 sub problems to find dead transitions.
[2025-06-02 19:28:51] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:28:51] [INFO ] Invariant cache hit.
[2025-06-02 19:28:51] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:29:01] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2025-06-02 19:29:01] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 1 ms to minimize.
[2025-06-02 19:29:01] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
[2025-06-02 19:29:01] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2025-06-02 19:29:01] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2025-06-02 19:29:01] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2025-06-02 19:29:01] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:29:01] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:29:01] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:29:02] [INFO ] Deduced a trap composed of 172 places in 216 ms of which 2 ms to minimize.
[2025-06-02 19:29:02] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 3 ms to minimize.
[2025-06-02 19:29:03] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:29:13] [INFO ] Deduced a trap composed of 165 places in 204 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:29:17] [INFO ] Deduced a trap composed of 268 places in 188 ms of which 3 ms to minimize.
[2025-06-02 19:29:21] [INFO ] Deduced a trap composed of 227 places in 203 ms of which 3 ms to minimize.
[2025-06-02 19:29:21] [INFO ] Deduced a trap composed of 150 places in 187 ms of which 3 ms to minimize.
[2025-06-02 19:29:22] [INFO ] Deduced a trap composed of 159 places in 187 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 59 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:29:33] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:29:48] [INFO ] Deduced a trap composed of 159 places in 222 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 61 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 19/19 constraints]
After SMT, in 61929ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 61939ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68123 ms. Remains : 440/440 places, 1066/1066 transitions.
[2025-06-02 19:29:53] [INFO ] Flatten gal took : 40 ms
[2025-06-02 19:29:53] [INFO ] Flatten gal took : 39 ms
[2025-06-02 19:29:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9524110919830719293.gal : 6 ms
[2025-06-02 19:29:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7418289740534158978.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/ReachabilityCardinality9524110919830719293.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7418289740534158978.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (21 resets) in 277 ms. (143 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40002 steps (13 resets) in 316 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (14 resets) in 250 ms. (159 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality7418289740534158978.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 96
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :96 after 497
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :497 after 588
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :588 after 1358
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1358 after 2462
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2462 after 7412
Interrupted probabilistic random walk after 212552 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 2
Probabilistic random walk after 212552 steps, saw 119659 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2025-06-02 19:29:56] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:29:56] [INFO ] Invariant cache hit.
[2025-06-02 19:29:56] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:29:57] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2025-06-02 19:29:57] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2025-06-02 19:29:57] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2025-06-02 19:29:57] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2025-06-02 19:29:57] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2025-06-02 19:29:57] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7412 after 14374
At refinement iteration 14 (OVERLAPS) 1050/1488 variables, 438/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 96/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1490 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1490 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 586 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:29:58] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1050/1488 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1488 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:29:59] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1488 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1488 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1490 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1490 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:30:00] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 2 ms to minimize.
[2025-06-02 19:30:00] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1490 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1490 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1490 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 592 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2610 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 4135ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 729 ms.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 13 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Running 1064 sub problems to find dead transitions.
[2025-06-02 19:30:01] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:30:01] [INFO ] Invariant cache hit.
[2025-06-02 19:30:01] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :43536 after 43644
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:30:12] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2025-06-02 19:30:12] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2025-06-02 19:30:12] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 1 ms to minimize.
[2025-06-02 19:30:12] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:30:12] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2025-06-02 19:30:12] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2025-06-02 19:30:12] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 14 ms to minimize.
[2025-06-02 19:30:12] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 3 ms to minimize.
[2025-06-02 19:30:12] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:30:13] [INFO ] Deduced a trap composed of 172 places in 193 ms of which 3 ms to minimize.
[2025-06-02 19:30:13] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 5 ms to minimize.
[2025-06-02 19:30:14] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :43644 after 89102
[2025-06-02 19:30:23] [INFO ] Deduced a trap composed of 165 places in 195 ms of which 3 ms to minimize.
SMT process timed out in 22062ms, After SMT, problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 22073ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22088 ms. Remains : 440/440 places, 1066/1066 transitions.
RANDOM walk for 40000 steps (17 resets) in 824 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 357 ms. (111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 213777 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 213777 steps, saw 120320 distinct states, run finished after 3003 ms. (steps per millisecond=71 ) properties seen :0
[2025-06-02 19:30:27] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:30:27] [INFO ] Invariant cache hit.
[2025-06-02 19:30:27] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:30:27] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2025-06-02 19:30:27] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2025-06-02 19:30:27] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2025-06-02 19:30:27] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2025-06-02 19:30:27] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2025-06-02 19:30:27] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1050/1488 variables, 438/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 96/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1490 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1490 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 586 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1480 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:30:28] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1050/1488 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1488 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:30:30] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1488 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1488 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1490 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1490 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:30:30] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 3 ms to minimize.
[2025-06-02 19:30:30] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1490 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1490 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1490 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 592 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2523 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 4017ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 744 ms.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 22 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 440/440 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 13 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2025-06-02 19:30:31] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:30:31] [INFO ] Invariant cache hit.
[2025-06-02 19:30:32] [INFO ] Implicit Places using invariants in 393 ms returned []
[2025-06-02 19:30:32] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:30:32] [INFO ] Invariant cache hit.
[2025-06-02 19:30:32] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:30:38] [INFO ] Implicit Places using invariants and state equation in 5792 ms returned []
Implicit Place search using SMT with State Equation took 6188 ms to find 0 implicit places.
[2025-06-02 19:30:38] [INFO ] Redundant transitions in 12 ms returned []
Running 1064 sub problems to find dead transitions.
[2025-06-02 19:30:38] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-02 19:30:38] [INFO ] Invariant cache hit.
[2025-06-02 19:30:38] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :89102 after 236262
Detected timeout of ITS tools.
[2025-06-02 19:30:43] [INFO ] Flatten gal took : 40 ms
[2025-06-02 19:30:43] [INFO ] Applying decomposition
[2025-06-02 19:30:43] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5759814566504120936.txt' '-o' '/tmp/graph5759814566504120936.bin' '-w' '/tmp/graph5759814566504120936.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5759814566504120936.bin' '-l' '-1' '-v' '-w' '/tmp/graph5759814566504120936.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:30:43] [INFO ] Decomposing Gal with order
[2025-06-02 19:30:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:30:44] [INFO ] Removed a total of 733 redundant transitions.
[2025-06-02 19:30:44] [INFO ] Flatten gal took : 101 ms
[2025-06-02 19:30:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 578 labels/synchronizations in 11 ms.
[2025-06-02 19:30:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5067499681172768008.gal : 7 ms
[2025-06-02 19:30:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality474294734310420904.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/ReachabilityCardinality5067499681172768008.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality474294734310420904.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality474294734310420904.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :13 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 50
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :50 after 110
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :110 after 130
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :130 after 206
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :206 after 318
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :318 after 954
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :954 after 1724
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1724 after 4036
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4036 after 12601
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:30:48] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 2 ms to minimize.
[2025-06-02 19:30:48] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2025-06-02 19:30:48] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2025-06-02 19:30:48] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:30:49] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:30:49] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:30:49] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:30:49] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:30:49] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:30:49] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 3 ms to minimize.
[2025-06-02 19:30:50] [INFO ] Deduced a trap composed of 168 places in 213 ms of which 3 ms to minimize.
[2025-06-02 19:30:50] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :12601 after 34098
[2025-06-02 19:31:00] [INFO ] Deduced a trap composed of 165 places in 211 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:31:04] [INFO ] Deduced a trap composed of 268 places in 194 ms of which 3 ms to minimize.
[2025-06-02 19:31:08] [INFO ] Deduced a trap composed of 227 places in 202 ms of which 3 ms to minimize.
[2025-06-02 19:31:09] [INFO ] Deduced a trap composed of 150 places in 202 ms of which 3 ms to minimize.
[2025-06-02 19:31:09] [INFO ] Deduced a trap composed of 159 places in 198 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 59 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2025-06-02 19:31:20] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :43536 after 61077
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Detected timeout of ITS tools.
[2025-06-02 19:31:38] [INFO ] Deduced a trap composed of 159 places in 220 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 9)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 1)
(s320 1)
(s321 0)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 1)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 1)
(s412 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 61 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 19/19 constraints]
After SMT, in 62193ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 62205ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68424 ms. Remains : 440/440 places, 1066/1066 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-15 in 233665 ms.
[2025-06-02 19:31:40] [INFO ] Flatten gal took : 36 ms
[2025-06-02 19:31:40] [INFO ] Applying decomposition
[2025-06-02 19:31:40] [INFO ] Flatten gal took : 36 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/graph2206508572963242382.txt' '-o' '/tmp/graph2206508572963242382.bin' '-w' '/tmp/graph2206508572963242382.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2206508572963242382.bin' '-l' '-1' '-v' '-w' '/tmp/graph2206508572963242382.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:31:40] [INFO ] Decomposing Gal with order
[2025-06-02 19:31:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:31:40] [INFO ] Removed a total of 1028 redundant transitions.
[2025-06-02 19:31:40] [INFO ] Flatten gal took : 84 ms
[2025-06-02 19:31:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 421 labels/synchronizations in 12 ms.
[2025-06-02 19:31:40] [INFO ] Time to serialize gal into /tmp/UpperBounds8876074749110897082.gal : 6 ms
[2025-06-02 19:31:40] [INFO ] Time to serialize properties into /tmp/UpperBounds10448165473268383776.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/UpperBounds8876074749110897082.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10448165473268383776.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/UpperBounds10448165473268383776.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,4.82456e+07,534.712,11296748,2,232798,5,2.00757e+07,6,0,3182,1.71322e+07,0
Total reachable state count : 48245592

Verifying 5 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PolyORBLF-COL-S02J06T08-UpperBounds-01 :0 <= gi6.gu21.NotifyEventJobQueuedE_0+gi6.gu21.NotifyEventJobQueuedE_1+gi6.gu21.NotifyEventJobQueue...329
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-01 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-COL-S02J06T08-UpperBounds-01,0,534.957,11296748,1,0,7,2.00757e+07,9,1,4528,1.71322e+07,4
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property PolyORBLF-COL-S02J06T08-UpperBounds-08 :0 <= gi6.gu21.P_1159_0+gi6.gu21.P_1159_1+gi6.gu21.P_1159_2+gi6.gu21.P_1159_3+gi6.gu21.P_1159_4+gi6....209
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-08 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-COL-S02J06T08-UpperBounds-08,0,535.099,11296748,1,0,7,2.00757e+07,10,1,5072,1.71322e+07,5
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PolyORBLF-COL-S02J06T08-UpperBounds-09 :0 <= gi6.gu21.P_2318_0+gi6.gu21.P_2318_1+gi6.gu21.P_2318_2+gi6.gu21.P_2318_3+gi6.gu21.P_2318_4+gi6....209
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-09 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-COL-S02J06T08-UpperBounds-09,0,535.374,11296748,1,0,8,2.00757e+07,11,1,5950,1.71322e+07,6
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PolyORBLF-COL-S02J06T08-UpperBounds-10 :0 <= gi6.gu21.P_1113_0+gi6.gu21.P_1113_1+gi6.gu21.P_1113_2+gi6.gu21.P_1113_3+gi6.gu21.P_1113_4+gi6....209
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-10 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-COL-S02J06T08-UpperBounds-10,0,535.517,11296748,1,0,9,2.00757e+07,12,1,6554,1.71322e+07,7
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property PolyORBLF-COL-S02J06T08-UpperBounds-15 :0 <= gi6.gu21.P_1160_0+gi6.gu21.P_1160_1+gi6.gu21.P_1160_2+gi6.gu21.P_1160_3+gi6.gu21.P_1160_4+gi6....209
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-15 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-COL-S02J06T08-UpperBounds-15,0,535.632,11296748,1,0,9,2.00757e+07,13,1,7096,1.71322e+07,8
Total runtime 2203180 ms.

BK_STOP 1748893237667

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

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