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-174881266100073.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is PolyORBNT-COL-S05J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266100073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K 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.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 94K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748895840169

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 20:24:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 20:24:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:24:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 20:24:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 20:24:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 705 ms
[2025-06-02 20:24:02] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2025-06-02 20:24:02] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2025-06-02 20:24:02] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2025-06-02 20:24:02] [INFO ] Computed 13 invariants in 7 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 5, 0, 5, 1, 0, 0, 61, 0, 10, 0, 0, 0, 0] Max Struct:[4, +inf, 2, 5, 10, 5, 1, +inf, +inf, 61, +inf, +inf, +inf, 10, 5, 1]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-09 61 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 20:24:02] [INFO ] Invariant cache hit.
[2025-06-02 20:24:02] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2025-06-02 20:24:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-02 20:24:02] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-02 20:24:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-02 20:24:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-02 20:24:02] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 20:24:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:24:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:24:02] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 9 ms to minimize.
[2025-06-02 20:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2025-06-02 20:24:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 20:24:02] [INFO ] Added : 22 causal constraints over 5 iterations in 132 ms. Result :sat
Minimization took 86 ms.
[2025-06-02 20:24:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-02 20:24:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-02 20:24:03] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
[2025-06-02 20:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2025-06-02 20:24:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 20:24:03] [INFO ] Added : 36 causal constraints over 8 iterations in 51 ms. Result :sat
Minimization took 23 ms.
[2025-06-02 20:24:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 20:24:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:24:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 20:24:03] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2025-06-02 20:24:03] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2025-06-02 20:24:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2025-06-02 20:24:03] [INFO ] Added : 20 causal constraints over 4 iterations in 220 ms. Result :sat
Minimization took 156 ms.
[2025-06-02 20:24:03] [INFO ] [Real]Absence check using 6 positive place invariants in 19 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Real]Added 1 Read/Feed constraints in 10 ms returned sat
[2025-06-02 20:24:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 20:24:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:24:03] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2025-06-02 20:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2025-06-02 20:24:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:24:04] [INFO ] Added : 22 causal constraints over 5 iterations in 121 ms. Result :sat
Minimization took 80 ms.
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:24:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:24:04] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2025-06-02 20:24:04] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2025-06-02 20:24:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2025-06-02 20:24:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 20:24:04] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2025-06-02 20:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2025-06-02 20:24:04] [INFO ] Added : 36 causal constraints over 8 iterations in 93 ms. Result :sat
Minimization took 25 ms.
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-02 20:24:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-02 20:24:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 20:24:04] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Minimization took 16 ms.
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:24:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:24:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:24:04] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 15 ms.
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:24:04] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2025-06-02 20:24:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 20:24:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:24:04] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2025-06-02 20:24:04] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2025-06-02 20:24:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 58 ms
[2025-06-02 20:24:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 20:24:05] [INFO ] Added : 36 causal constraints over 8 iterations in 97 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 20:24:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-02 20:24:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:24:05] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2025-06-02 20:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2025-06-02 20:24:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:24:05] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2025-06-02 20:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-02 20:24:05] [INFO ] Added : 36 causal constraints over 8 iterations in 92 ms. Result :sat
Minimization took 176 ms.
[2025-06-02 20:24:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:24:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:24:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:24:05] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2025-06-02 20:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2025-06-02 20:24:05] [INFO ] Added : 36 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 80 ms.
[2025-06-02 20:24:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:24:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 20:24:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:24:05] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2025-06-02 20:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2025-06-02 20:24:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:24:05] [INFO ] Added : 33 causal constraints over 7 iterations in 89 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0] Max Struct:[4, +inf, 2, 10, +inf, +inf, +inf, 10, +inf, 10, 5, 1]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-02 20:24:06] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 79 ms.
[2025-06-02 20:24:06] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Deduced a syphon composed of 60 places in 10 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[4, +inf, 2, 10, +inf, +inf, +inf, +inf, 10, 5, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, +inf, 2, 10, +inf, +inf, +inf, +inf, 10, 5, 1]
[2025-06-02 20:24:06] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2025-06-02 20:24:06] [INFO ] Computed 142 invariants in 81 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 61, 2, 10, 62, 11, 61, 11, 10, 5, 1]
RANDOM walk for 10000 steps (693 resets) in 153 ms. (64 steps per ms)
FORMULA PolyORBNT-COL-S05J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (1262 resets) in 304 ms. (295 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1, 3, 1, 1, 1, 1, 4, 4] Max Struct:[4, 61, 10, 62, 11, 61, 11, 10, 5]
[2025-06-02 20:24:06] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-02 20:24:06] [INFO ] Invariant cache hit.
[2025-06-02 20:24:06] [INFO ] [Real]Absence check using 135 positive place invariants in 34 ms returned sat
[2025-06-02 20:24:06] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2025-06-02 20:24:07] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2025-06-02 20:24:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:07] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2025-06-02 20:24:07] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2025-06-02 20:24:07] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2025-06-02 20:24:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:24:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2025-06-02 20:24:08] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 148 ms.
[2025-06-02 20:24:08] [INFO ] Deduced a trap composed of 507 places in 427 ms of which 5 ms to minimize.
[2025-06-02 20:24:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 721 ms
[2025-06-02 20:24:09] [INFO ] Added : 19 causal constraints over 4 iterations in 1344 ms. Result :sat
Minimization took 759 ms.
[2025-06-02 20:24:10] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2025-06-02 20:24:10] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 15 ms returned unsat
[2025-06-02 20:24:10] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2025-06-02 20:24:10] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2025-06-02 20:24:10] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2025-06-02 20:24:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:10] [INFO ] [Nat]Absence check using 135 positive place invariants in 37 ms returned sat
[2025-06-02 20:24:10] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned sat
[2025-06-02 20:24:11] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2025-06-02 20:24:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 298 ms returned sat
[2025-06-02 20:24:11] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 68 ms.
[2025-06-02 20:24:12] [INFO ] Added : 18 causal constraints over 4 iterations in 529 ms. Result :sat
Minimization took 736 ms.
[2025-06-02 20:24:12] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2025-06-02 20:24:12] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2025-06-02 20:24:13] [INFO ] [Real]Absence check using 135 positive place invariants in 41 ms returned sat
[2025-06-02 20:24:13] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 13 ms returned unsat
[2025-06-02 20:24:13] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2025-06-02 20:24:13] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2025-06-02 20:24:13] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2025-06-02 20:24:13] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 12 ms returned unsat
[2025-06-02 20:24:13] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2025-06-02 20:24:13] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned sat
[2025-06-02 20:24:13] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2025-06-02 20:24:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:13] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2025-06-02 20:24:14] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 16 ms returned sat
[2025-06-02 20:24:15] [INFO ] [Nat]Absence check using state equation in 1179 ms returned unsat
[2025-06-02 20:24:15] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2025-06-02 20:24:15] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 13 ms returned sat
[2025-06-02 20:24:15] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2025-06-02 20:24:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:24:15] [INFO ] [Nat]Absence check using 135 positive place invariants in 34 ms returned sat
[2025-06-02 20:24:15] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 12 ms returned sat
[2025-06-02 20:24:17] [INFO ] [Nat]Absence check using state equation in 1180 ms returned sat
[2025-06-02 20:24:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 171 ms returned sat
[2025-06-02 20:24:17] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 73 ms.
[2025-06-02 20:24:19] [INFO ] Added : 94 causal constraints over 19 iterations in 1804 ms. Result :sat
Minimization took 529 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 1, 3, 1, 1, 1, 1, 4, 4] Max Struct:[4, 1, 10, 1, 1, 1, 1, 4, 5]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3, 4] Max Struct:[4, 10, 5]
Support contains 307 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 904 transition count 1250
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 136 place count 839 transition count 1249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 137 place count 838 transition count 1185
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 265 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 773 transition count 1184
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 773 transition count 1184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 271 place count 771 transition count 1182
Applied a total of 271 rules in 284 ms. Remains 771 /909 variables (removed 138) and now considering 1182/1315 (removed 133) transitions.
Running 1176 sub problems to find dead transitions.
[2025-06-02 20:24:20] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2025-06-02 20:24:20] [INFO ] Computed 137 invariants in 55 ms
[2025-06-02 20:24:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 132 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
[2025-06-02 20:24:45] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 133 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 1/1 constraints]
After SMT, in 43239ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 43290ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43635 ms. Remains : 771/909 places, 1182/1315 transitions.
[2025-06-02 20:25:03] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 20:25:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3, 4] Max Struct:[4, 10, 5]
RANDOM walk for 1000000 steps (47428 resets) in 9592 ms. (104 steps per ms)
BEST_FIRST walk for 2945027 steps (9799 resets) in 8184 ms. (359 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 4] Max Struct:[4, 10, 5]
[2025-06-02 20:25:21] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 20:25:21] [INFO ] Invariant cache hit.
[2025-06-02 20:25:21] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2025-06-02 20:25:21] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 19 ms returned sat
[2025-06-02 20:25:21] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2025-06-02 20:25:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:25:21] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2025-06-02 20:25:21] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2025-06-02 20:25:22] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2025-06-02 20:25:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:25:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 411 ms returned sat
[2025-06-02 20:25:22] [INFO ] Computed and/alt/rep : 617/2122/617 causal constraints (skipped 555 transitions) in 72 ms.
[2025-06-02 20:25:23] [INFO ] Deduced a trap composed of 168 places in 282 ms of which 4 ms to minimize.
[2025-06-02 20:25:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 399 ms
[2025-06-02 20:25:23] [INFO ] Added : 12 causal constraints over 3 iterations in 794 ms. Result :sat
Minimization took 974 ms.
[2025-06-02 20:25:24] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2025-06-02 20:25:24] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2025-06-02 20:25:25] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2025-06-02 20:25:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:25:25] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2025-06-02 20:25:25] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 13 ms returned sat
[2025-06-02 20:25:25] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2025-06-02 20:25:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 314 ms returned sat
[2025-06-02 20:25:26] [INFO ] Deduced a trap composed of 168 places in 285 ms of which 4 ms to minimize.
[2025-06-02 20:25:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2025-06-02 20:25:26] [INFO ] Computed and/alt/rep : 617/2122/617 causal constraints (skipped 555 transitions) in 66 ms.
[2025-06-02 20:25:26] [INFO ] Added : 11 causal constraints over 3 iterations in 374 ms. Result :sat
Minimization took 884 ms.
[2025-06-02 20:25:27] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2025-06-02 20:25:27] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 11 ms returned sat
[2025-06-02 20:25:28] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2025-06-02 20:25:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:25:28] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2025-06-02 20:25:28] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-02 20:25:31] [INFO ] [Nat]Absence check using state equation in 2738 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 4] Max Struct:[4, 10, 4]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[4, 10]
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 41 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 771/771 places, 1182/1182 transitions.
[2025-06-02 20:25:31] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 20:25:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3] Max Struct:[4, 10]
RANDOM walk for 1000000 steps (47314 resets) in 5142 ms. (194 steps per ms)
BEST_FIRST walk for 2000001 steps (6759 resets) in 2614 ms. (764 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[4, 10]
[2025-06-02 20:25:38] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 20:25:38] [INFO ] Invariant cache hit.
[2025-06-02 20:25:39] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2025-06-02 20:25:39] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2025-06-02 20:25:39] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2025-06-02 20:25:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:25:39] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2025-06-02 20:25:39] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2025-06-02 20:25:40] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2025-06-02 20:25:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:25:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 401 ms returned sat
[2025-06-02 20:25:40] [INFO ] Computed and/alt/rep : 617/2122/617 causal constraints (skipped 555 transitions) in 68 ms.
[2025-06-02 20:25:41] [INFO ] Deduced a trap composed of 168 places in 276 ms of which 4 ms to minimize.
[2025-06-02 20:25:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2025-06-02 20:25:41] [INFO ] Added : 12 causal constraints over 3 iterations in 802 ms. Result :sat
Minimization took 958 ms.
[2025-06-02 20:25:42] [INFO ] [Real]Absence check using 130 positive place invariants in 27 ms returned sat
[2025-06-02 20:25:42] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2025-06-02 20:25:42] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2025-06-02 20:25:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:25:42] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2025-06-02 20:25:42] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2025-06-02 20:25:43] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2025-06-02 20:25:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 315 ms returned sat
[2025-06-02 20:25:43] [INFO ] Deduced a trap composed of 168 places in 302 ms of which 4 ms to minimize.
[2025-06-02 20:25:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 399 ms
[2025-06-02 20:25:44] [INFO ] Computed and/alt/rep : 617/2122/617 causal constraints (skipped 555 transitions) in 62 ms.
[2025-06-02 20:25:44] [INFO ] Added : 11 causal constraints over 3 iterations in 368 ms. Result :sat
Minimization took 888 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3] Max Struct:[4, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[4, 10]
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 34 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 771/771 places, 1182/1182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 34 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
[2025-06-02 20:25:45] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 20:25:45] [INFO ] Invariant cache hit.
[2025-06-02 20:25:46] [INFO ] Implicit Places using invariants in 932 ms returned []
[2025-06-02 20:25:46] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 20:25:46] [INFO ] Invariant cache hit.
[2025-06-02 20:25:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:25:50] [INFO ] Implicit Places using invariants and state equation in 4531 ms returned []
Implicit Place search using SMT with State Equation took 5468 ms to find 0 implicit places.
[2025-06-02 20:25:50] [INFO ] Redundant transitions in 63 ms returned []
Running 1176 sub problems to find dead transitions.
[2025-06-02 20:25:50] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 20:25:50] [INFO ] Invariant cache hit.
[2025-06-02 20:25:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
At refinement iteration 3 (OVERLAPS) 4/770 variables, 4/136 constraints. Problems are: Problem set: 78 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/1949 variables, and 136 constraints, problems are : Problem set: 78 solved, 1098 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 78 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 78 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/132 constraints. Problems are: Problem set: 78 solved, 1098 unsolved
At refinement iteration 3 (OVERLAPS) 4/770 variables, 4/136 constraints. Problems are: Problem set: 78 solved, 1098 unsolved
[2025-06-02 20:26:40] [INFO ] Deduced a trap composed of 13 places in 203 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 Int declared 770/1949 variables, and 137 constraints, problems are : Problem set: 78 solved, 1098 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 1/1 constraints]
After SMT, in 62630ms problems are : Problem set: 78 solved, 1098 unsolved
Search for dead transitions found 78 dead transitions in 62645ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 771/771 places, 1104/1182 transitions.
Applied a total of 0 rules in 27 ms. Remains 771 /771 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
[2025-06-02 20:26:53] [INFO ] Redundant transitions in 13 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68269 ms. Remains : 771/771 places, 1104/1182 transitions.
[2025-06-02 20:26:53] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
// Phase 1: matrix 1100 rows 771 cols
[2025-06-02 20:26:53] [INFO ] Computed 137 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3] Max Struct:[4, 10]
RANDOM walk for 1000000 steps (47290 resets) in 4545 ms. (219 steps per ms)
BEST_FIRST walk for 2000002 steps (6611 resets) in 2554 ms. (782 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[4, 10]
[2025-06-02 20:27:00] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:27:00] [INFO ] Invariant cache hit.
[2025-06-02 20:27:00] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2025-06-02 20:27:00] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 18 ms returned sat
[2025-06-02 20:27:01] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2025-06-02 20:27:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:27:01] [INFO ] [Real]Added 1 Read/Feed constraints in 65 ms returned sat
[2025-06-02 20:27:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:27:01] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2025-06-02 20:27:01] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2025-06-02 20:27:01] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2025-06-02 20:27:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 496 ms returned sat
[2025-06-02 20:27:02] [INFO ] Deduced a trap composed of 156 places in 271 ms of which 4 ms to minimize.
[2025-06-02 20:27:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 501 ms
[2025-06-02 20:27:02] [INFO ] Computed and/alt/rep : 539/1876/539 causal constraints (skipped 555 transitions) in 59 ms.
[2025-06-02 20:27:03] [INFO ] Deduced a trap composed of 267 places in 258 ms of which 4 ms to minimize.
[2025-06-02 20:27:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2025-06-02 20:27:03] [INFO ] Added : 11 causal constraints over 3 iterations in 759 ms. Result :sat
Minimization took 1340 ms.
[2025-06-02 20:27:05] [INFO ] [Real]Absence check using 130 positive place invariants in 30 ms returned sat
[2025-06-02 20:27:05] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2025-06-02 20:27:05] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2025-06-02 20:27:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:27:05] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2025-06-02 20:27:05] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 15 ms returned sat
[2025-06-02 20:27:05] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2025-06-02 20:27:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 648 ms returned sat
[2025-06-02 20:27:06] [INFO ] Computed and/alt/rep : 539/1876/539 causal constraints (skipped 555 transitions) in 58 ms.
[2025-06-02 20:27:07] [INFO ] Deduced a trap composed of 242 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:27:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2025-06-02 20:27:07] [INFO ] Added : 12 causal constraints over 3 iterations in 1131 ms. Result :sat
Minimization took 1372 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3] Max Struct:[4, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[4, 10]
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1104/1104 transitions.
Applied a total of 0 rules in 25 ms. Remains 771 /771 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 771/771 places, 1104/1104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1104/1104 transitions.
Applied a total of 0 rules in 24 ms. Remains 771 /771 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
[2025-06-02 20:27:09] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:27:09] [INFO ] Invariant cache hit.
[2025-06-02 20:27:09] [INFO ] Implicit Places using invariants in 840 ms returned []
[2025-06-02 20:27:09] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:27:09] [INFO ] Invariant cache hit.
[2025-06-02 20:27:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:27:13] [INFO ] Implicit Places using invariants and state equation in 3832 ms returned []
Implicit Place search using SMT with State Equation took 4677 ms to find 0 implicit places.
[2025-06-02 20:27:13] [INFO ] Redundant transitions in 12 ms returned []
Running 1098 sub problems to find dead transitions.
[2025-06-02 20:27:13] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:27:13] [INFO ] Invariant cache hit.
[2025-06-02 20:27:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:27:28] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:27:28] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:27:28] [INFO ] Deduced a trap composed of 197 places in 232 ms of which 4 ms to minimize.
[2025-06-02 20:27:29] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:27:29] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 5 ms to minimize.
[2025-06-02 20:27:29] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:27:30] [INFO ] Deduced a trap composed of 197 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:27:30] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 5 ms to minimize.
[2025-06-02 20:27:30] [INFO ] Deduced a trap composed of 197 places in 241 ms of which 5 ms to minimize.
[2025-06-02 20:27:30] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 7 ms to minimize.
[2025-06-02 20:27:31] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:27:31] [INFO ] Deduced a trap composed of 221 places in 244 ms of which 4 ms to minimize.
[2025-06-02 20:27:31] [INFO ] Deduced a trap composed of 197 places in 238 ms of which 4 ms to minimize.
[2025-06-02 20:27:31] [INFO ] Deduced a trap composed of 197 places in 232 ms of which 4 ms to minimize.
[2025-06-02 20:27:32] [INFO ] Deduced a trap composed of 248 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:27:32] [INFO ] Deduced a trap composed of 197 places in 236 ms of which 4 ms to minimize.
[2025-06-02 20:27:32] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:27:32] [INFO ] Deduced a trap composed of 197 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:27:33] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:27:33] [INFO ] Deduced a trap composed of 197 places in 241 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:27:34] [INFO ] Deduced a trap composed of 198 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:27:34] [INFO ] Deduced a trap composed of 198 places in 236 ms of which 5 ms to minimize.
[2025-06-02 20:27:34] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
[2025-06-02 20:27:35] [INFO ] Deduced a trap composed of 198 places in 239 ms of which 5 ms to minimize.
[2025-06-02 20:27:35] [INFO ] Deduced a trap composed of 198 places in 232 ms of which 4 ms to minimize.
[2025-06-02 20:27:35] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:27:36] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:27:36] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
[2025-06-02 20:27:36] [INFO ] Deduced a trap composed of 198 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:27:37] [INFO ] Deduced a trap composed of 198 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:27:37] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 6 ms to minimize.
[2025-06-02 20:27:46] [INFO ] Deduced a trap composed of 159 places in 278 ms of which 4 ms to minimize.
SMT process timed out in 32358ms, After SMT, problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 32372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37094 ms. Remains : 771/771 places, 1104/1104 transitions.
[2025-06-02 20:27:46] [INFO ] Flatten gal took : 508 ms
RANDOM walk for 40000 steps (1882 resets) in 1514 ms. (26 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (122 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (146 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (131 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
[2025-06-02 20:27:47] [INFO ] Flatten gal took : 253 ms
BEST_FIRST walk for 40004 steps (129 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
[2025-06-02 20:27:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality229455561179467272.gal : 77 ms
[2025-06-02 20:27:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14492590826388125594.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/ReachabilityCardinality229455561179467272.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14492590826388125594.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/ReachabilityCardinality14492590826388125594.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :8 after 32
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :32 after 868817
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :868817 after 2.4616e+06
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2.4616e+06 after 4.82516e+06
Interrupted probabilistic random walk after 229467 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 4
Probabilistic random walk after 229467 steps, saw 70275 distinct states, run finished after 3003 ms. (steps per millisecond=76 ) properties seen :0
[2025-06-02 20:27:50] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:27:50] [INFO ] Invariant cache hit.
[2025-06-02 20:27:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :4.82516e+06 after 6.54557e+06
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX1 is UNSAT
At refinement iteration 3 (OVERLAPS) 192/202 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 558/760 variables, 127/130 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/761 variables, 1/131 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/769 variables, 5/136 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/770 variables, 1/137 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :6.54557e+06 after 8.34414e+06
At refinement iteration 13 (OVERLAPS) 1100/1870 variables, 770/907 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1870 variables, 1/908 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2025-06-02 20:27:52] [INFO ] Deduced a trap composed of 231 places in 495 ms of which 4 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1870 variables, 1/909 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1870 variables, 0/909 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/1871 variables, 1/910 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1871 variables, 0/910 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1871 variables, 0/910 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1871/1871 variables, and 910 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2978 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 771/771 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 192/202 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 558/760 variables, 127/130 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/761 variables, 1/131 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/769 variables, 5/136 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 1/137 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/770 variables, 1/138 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/770 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :8.34414e+06 after 1.88099e+07
At refinement iteration 14 (OVERLAPS) 1100/1870 variables, 770/908 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1870 variables, 1/909 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1870 variables, 0/909 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/1871 variables, 1/910 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1871 variables, 3/913 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1871 variables, 0/913 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1871 variables, 0/913 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1871/1871 variables, and 913 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1198 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 771/771 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4189ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 135 ms.
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1104/1104 transitions.
Applied a total of 0 rules in 23 ms. Remains 771 /771 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Running 1098 sub problems to find dead transitions.
[2025-06-02 20:27:54] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:27:54] [INFO ] Invariant cache hit.
[2025-06-02 20:27:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:28:09] [INFO ] Deduced a trap composed of 197 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:28:09] [INFO ] Deduced a trap composed of 197 places in 266 ms of which 4 ms to minimize.
[2025-06-02 20:28:09] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:28:10] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:28:10] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:28:10] [INFO ] Deduced a trap composed of 197 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:28:11] [INFO ] Deduced a trap composed of 197 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:28:11] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:28:11] [INFO ] Deduced a trap composed of 197 places in 264 ms of which 4 ms to minimize.
[2025-06-02 20:28:11] [INFO ] Deduced a trap composed of 197 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:28:12] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:28:12] [INFO ] Deduced a trap composed of 221 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:28:12] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:28:13] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 5 ms to minimize.
[2025-06-02 20:28:13] [INFO ] Deduced a trap composed of 248 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:28:13] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:28:13] [INFO ] Deduced a trap composed of 197 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:28:14] [INFO ] Deduced a trap composed of 197 places in 267 ms of which 4 ms to minimize.
[2025-06-02 20:28:14] [INFO ] Deduced a trap composed of 197 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:28:14] [INFO ] Deduced a trap composed of 197 places in 272 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:28:15] [INFO ] Deduced a trap composed of 198 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:28:15] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
[2025-06-02 20:28:15] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:28:16] [INFO ] Deduced a trap composed of 198 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:28:16] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:28:16] [INFO ] Deduced a trap composed of 198 places in 237 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1871 variables, and 158 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 26/158 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:28:19] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 2 ms to minimize.
[2025-06-02 20:28:22] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:28:22] [INFO ] Deduced a trap composed of 201 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:28:22] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:28:22] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:28:23] [INFO ] Deduced a trap composed of 197 places in 258 ms of which 5 ms to minimize.
[2025-06-02 20:28:23] [INFO ] Deduced a trap composed of 240 places in 263 ms of which 4 ms to minimize.
[2025-06-02 20:28:23] [INFO ] Deduced a trap composed of 254 places in 259 ms of which 5 ms to minimize.
[2025-06-02 20:28:24] [INFO ] Deduced a trap composed of 197 places in 258 ms of which 4 ms to minimize.
[2025-06-02 20:28:24] [INFO ] Deduced a trap composed of 197 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:28:24] [INFO ] Deduced a trap composed of 197 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:28:24] [INFO ] Deduced a trap composed of 224 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:28:25] [INFO ] Deduced a trap composed of 197 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:28:25] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:28:25] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:28:25] [INFO ] Deduced a trap composed of 197 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:28:26] [INFO ] Deduced a trap composed of 197 places in 264 ms of which 4 ms to minimize.
[2025-06-02 20:28:26] [INFO ] Deduced a trap composed of 197 places in 260 ms of which 5 ms to minimize.
[2025-06-02 20:28:26] [INFO ] Deduced a trap composed of 197 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:28:27] [INFO ] Deduced a trap composed of 201 places in 261 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:28:28] [INFO ] Deduced a trap composed of 245 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:28:28] [INFO ] Deduced a trap composed of 257 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:28:29] [INFO ] Deduced a trap composed of 197 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:28:29] [INFO ] Deduced a trap composed of 197 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:28:29] [INFO ] Deduced a trap composed of 197 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:28:30] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 5 ms to minimize.
[2025-06-02 20:28:30] [INFO ] Deduced a trap composed of 197 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:28:30] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 5 ms to minimize.
[2025-06-02 20:28:30] [INFO ] Deduced a trap composed of 197 places in 258 ms of which 4 ms to minimize.
[2025-06-02 20:28:31] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:28:31] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:28:31] [INFO ] Deduced a trap composed of 197 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:28:32] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:28:32] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 5 ms to minimize.
[2025-06-02 20:28:32] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:28:32] [INFO ] Deduced a trap composed of 197 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:28:33] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:28:33] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 5 ms to minimize.
[2025-06-02 20:28:33] [INFO ] Deduced a trap composed of 197 places in 258 ms of which 4 ms to minimize.
[2025-06-02 20:28:34] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1871 variables, and 198 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 66/66 constraints]
After SMT, in 42537ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 42549ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42576 ms. Remains : 771/771 places, 1104/1104 transitions.
RANDOM walk for 40000 steps (1895 resets) in 477 ms. (83 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (128 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
Detected timeout of ITS tools.
BEST_FIRST walk for 40004 steps (142 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (130 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
[2025-06-02 20:28:37] [INFO ] Flatten gal took : 119 ms
[2025-06-02 20:28:37] [INFO ] Applying decomposition
[2025-06-02 20:28:37] [INFO ] Flatten gal took : 67 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/graph2141878766253076756.txt' '-o' '/tmp/graph2141878766253076756.bin' '-w' '/tmp/graph2141878766253076756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2141878766253076756.bin' '-l' '-1' '-v' '-w' '/tmp/graph2141878766253076756.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:28:37] [INFO ] Decomposing Gal with order
[2025-06-02 20:28:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:28:38] [INFO ] Removed a total of 1261 redundant transitions.
[2025-06-02 20:28:38] [INFO ] Flatten gal took : 287 ms
[2025-06-02 20:28:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 43 ms.
[2025-06-02 20:28:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15535580241292427967.gal : 19 ms
[2025-06-02 20:28:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18371970771148889464.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/ReachabilityCardinality15535580241292427967.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18371970771148889464.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality18371970771148889464.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 66
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :66 after 574
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :574 after 1590
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1590 after 23486
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :23486 after 261296
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :261296 after 736408
Interrupted probabilistic random walk after 234584 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 3
Probabilistic random walk after 234584 steps, saw 71888 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2025-06-02 20:28:40] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:28:40] [INFO ] Invariant cache hit.
[2025-06-02 20:28:40] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 192/202 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 558/760 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/761 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/769 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/770 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1100/1870 variables, 770/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1870 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1870 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/1871 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1871 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1871 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1871/1871 variables, and 909 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1038 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 771/771 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 192/202 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 558/760 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/761 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/769 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/770 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1100/1870 variables, 770/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1870 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1870 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/1871 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1871 variables, 3/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1871 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1871 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1871/1871 variables, and 912 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1038 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 771/771 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2083ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 138 ms.
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1104/1104 transitions.
Applied a total of 0 rules in 32 ms. Remains 771 /771 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 771/771 places, 1104/1104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1104/1104 transitions.
Applied a total of 0 rules in 24 ms. Remains 771 /771 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
[2025-06-02 20:28:42] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:28:42] [INFO ] Invariant cache hit.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :736408 after 1.29689e+08
[2025-06-02 20:28:43] [INFO ] Implicit Places using invariants in 828 ms returned []
[2025-06-02 20:28:43] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:28:43] [INFO ] Invariant cache hit.
[2025-06-02 20:28:43] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.29689e+08 after 1.29702e+08
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.29702e+08 after 1.29704e+08
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.29704e+08 after 1.29708e+08
[2025-06-02 20:28:47] [INFO ] Implicit Places using invariants and state equation in 3924 ms returned []
Implicit Place search using SMT with State Equation took 4768 ms to find 0 implicit places.
[2025-06-02 20:28:47] [INFO ] Redundant transitions in 9 ms returned []
Running 1098 sub problems to find dead transitions.
[2025-06-02 20:28:47] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:28:47] [INFO ] Invariant cache hit.
[2025-06-02 20:28:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:29:02] [INFO ] Deduced a trap composed of 197 places in 265 ms of which 14 ms to minimize.
[2025-06-02 20:29:02] [INFO ] Deduced a trap composed of 197 places in 256 ms of which 5 ms to minimize.
[2025-06-02 20:29:03] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:29:03] [INFO ] Deduced a trap composed of 197 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:29:03] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:29:04] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:29:04] [INFO ] Deduced a trap composed of 197 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:29:04] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:29:04] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:29:05] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:29:05] [INFO ] Deduced a trap composed of 242 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:29:05] [INFO ] Deduced a trap composed of 221 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:29:06] [INFO ] Deduced a trap composed of 197 places in 262 ms of which 4 ms to minimize.
[2025-06-02 20:29:06] [INFO ] Deduced a trap composed of 197 places in 259 ms of which 5 ms to minimize.
[2025-06-02 20:29:06] [INFO ] Deduced a trap composed of 248 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:29:06] [INFO ] Deduced a trap composed of 197 places in 258 ms of which 4 ms to minimize.
[2025-06-02 20:29:07] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 6 ms to minimize.
[2025-06-02 20:29:07] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 5 ms to minimize.
[2025-06-02 20:29:07] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:29:08] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:29:08] [INFO ] Deduced a trap composed of 198 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:29:09] [INFO ] Deduced a trap composed of 198 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:29:09] [INFO ] Deduced a trap composed of 198 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:29:09] [INFO ] Deduced a trap composed of 198 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:29:09] [INFO ] Deduced a trap composed of 198 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:29:10] [INFO ] Deduced a trap composed of 198 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:29:11] [INFO ] Deduced a trap composed of 198 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:29:11] [INFO ] Deduced a trap composed of 198 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:29:11] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
[2025-06-02 20:29:11] [INFO ] Deduced a trap composed of 198 places in 266 ms of which 4 ms to minimize.
[2025-06-02 20:29:12] [INFO ] Deduced a trap composed of 198 places in 251 ms of which 4 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 766/1871 variables, and 163 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 31/163 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:29:21] [INFO ] Deduced a trap composed of 218 places in 391 ms of which 5 ms to minimize.
[2025-06-02 20:29:22] [INFO ] Deduced a trap composed of 224 places in 352 ms of which 4 ms to minimize.
[2025-06-02 20:29:22] [INFO ] Deduced a trap composed of 233 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:29:22] [INFO ] Deduced a trap composed of 231 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:29:23] [INFO ] Deduced a trap composed of 225 places in 244 ms of which 4 ms to minimize.
[2025-06-02 20:29:23] [INFO ] Deduced a trap composed of 222 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:29:23] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 4 ms to minimize.
[2025-06-02 20:29:23] [INFO ] Deduced a trap composed of 221 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:29:24] [INFO ] Deduced a trap composed of 219 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:29:24] [INFO ] Deduced a trap composed of 225 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:29:24] [INFO ] Deduced a trap composed of 227 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:29:25] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:29:25] [INFO ] Deduced a trap composed of 224 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:29:25] [INFO ] Deduced a trap composed of 225 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:29:25] [INFO ] Deduced a trap composed of 219 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:29:26] [INFO ] Deduced a trap composed of 220 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:29:26] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:29:26] [INFO ] Deduced a trap composed of 221 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:29:27] [INFO ] Deduced a trap composed of 222 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:29:27] [INFO ] Deduced a trap composed of 221 places in 243 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Detected timeout of ITS tools.
[2025-06-02 20:29:28] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:29:28] [INFO ] Deduced a trap composed of 197 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:29:29] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:29:29] [INFO ] Deduced a trap composed of 197 places in 238 ms of which 4 ms to minimize.
[2025-06-02 20:29:29] [INFO ] Deduced a trap composed of 197 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:29:30] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:29:30] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:29:30] [INFO ] Deduced a trap composed of 197 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:29:30] [INFO ] Deduced a trap composed of 197 places in 236 ms of which 4 ms to minimize.
[2025-06-02 20:29:31] [INFO ] Deduced a trap composed of 197 places in 236 ms of which 4 ms to minimize.
[2025-06-02 20:29:31] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:29:31] [INFO ] Deduced a trap composed of 197 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:29:31] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:29:32] [INFO ] Deduced a trap composed of 197 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:29:32] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:29:32] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:29:33] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:29:33] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:29:33] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:29:34] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:29:36] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:29:38] [INFO ] Deduced a trap composed of 201 places in 237 ms of which 3 ms to minimize.
[2025-06-02 20:29:39] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:29:39] [INFO ] Deduced a trap composed of 197 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:29:39] [INFO ] Deduced a trap composed of 197 places in 241 ms of which 3 ms to minimize.
[2025-06-02 20:29:39] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:29:40] [INFO ] Deduced a trap composed of 201 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:29:40] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:29:40] [INFO ] Deduced a trap composed of 197 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:29:41] [INFO ] Deduced a trap composed of 201 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:29:41] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:29:41] [INFO ] Deduced a trap composed of 201 places in 241 ms of which 3 ms to minimize.
[2025-06-02 20:29:41] [INFO ] Deduced a trap composed of 197 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:29:42] [INFO ] Deduced a trap composed of 201 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:29:42] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:29:42] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:29:42] [INFO ] Deduced a trap composed of 201 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:29:43] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:29:43] [INFO ] Deduced a trap composed of 197 places in 244 ms of which 3 ms to minimize.
[2025-06-02 20:29:43] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:29:45] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:29:45] [INFO ] Deduced a trap composed of 197 places in 230 ms of which 4 ms to minimize.
[2025-06-02 20:29:45] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 3 ms to minimize.
[2025-06-02 20:29:46] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:29:46] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1871 variables, and 228 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 96/96 constraints]
After SMT, in 62588ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 62600ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67408 ms. Remains : 771/771 places, 1104/1104 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 3] Max Struct:[4, 10]
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-00
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 20:29:49] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:29:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (482 resets) in 48 ms. (204 steps per ms)
BEST_FIRST walk for 10001 steps (32 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2025-06-02 20:29:50] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:29:50] [INFO ] Invariant cache hit.
[2025-06-02 20:29:50] [INFO ] [Real]Absence check using 130 positive place invariants in 30 ms returned sat
[2025-06-02 20:29:50] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2025-06-02 20:29:50] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2025-06-02 20:29:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:29:50] [INFO ] [Real]Added 1 Read/Feed constraints in 60 ms returned sat
[2025-06-02 20:29:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:29:50] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2025-06-02 20:29:50] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2025-06-02 20:29:51] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2025-06-02 20:29:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 463 ms returned sat
[2025-06-02 20:29:51] [INFO ] Deduced a trap composed of 156 places in 264 ms of which 4 ms to minimize.
[2025-06-02 20:29:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 482 ms
[2025-06-02 20:29:52] [INFO ] Computed and/alt/rep : 539/1876/539 causal constraints (skipped 555 transitions) in 58 ms.
[2025-06-02 20:29:52] [INFO ] Deduced a trap composed of 267 places in 270 ms of which 4 ms to minimize.
[2025-06-02 20:29:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2025-06-02 20:29:52] [INFO ] Added : 11 causal constraints over 3 iterations in 778 ms. Result :sat
Minimization took 667 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1104/1104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 771 transition count 1103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 770 transition count 1103
Applied a total of 2 rules in 30 ms. Remains 770 /771 variables (removed 1) and now considering 1103/1104 (removed 1) transitions.
Running 1097 sub problems to find dead transitions.
[2025-06-02 20:29:53] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2025-06-02 20:29:53] [INFO ] Computed 137 invariants in 22 ms
[2025-06-02 20:29:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 20:30:08] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:30:08] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2025-06-02 20:30:08] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 4 ms to minimize.
[2025-06-02 20:30:09] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:30:09] [INFO ] Deduced a trap composed of 239 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:30:09] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:30:09] [INFO ] Deduced a trap composed of 233 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:30:10] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:30:10] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2025-06-02 20:30:10] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:30:11] [INFO ] Deduced a trap composed of 251 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:30:11] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:30:11] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2025-06-02 20:30:12] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:30:12] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 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 765/1869 variables, and 147 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 15/147 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 20:30:17] [INFO ] Deduced a trap composed of 234 places in 227 ms of which 4 ms to minimize.
[2025-06-02 20:30:17] [INFO ] Deduced a trap composed of 230 places in 220 ms of which 4 ms to minimize.
[2025-06-02 20:30:17] [INFO ] Deduced a trap composed of 237 places in 222 ms of which 4 ms to minimize.
[2025-06-02 20:30:18] [INFO ] Deduced a trap composed of 227 places in 217 ms of which 4 ms to minimize.
[2025-06-02 20:30:18] [INFO ] Deduced a trap composed of 230 places in 227 ms of which 4 ms to minimize.
[2025-06-02 20:30:18] [INFO ] Deduced a trap composed of 245 places in 218 ms of which 4 ms to minimize.
[2025-06-02 20:30:19] [INFO ] Deduced a trap composed of 255 places in 229 ms of which 4 ms to minimize.
[2025-06-02 20:30:19] [INFO ] Deduced a trap composed of 242 places in 226 ms of which 4 ms to minimize.
[2025-06-02 20:30:19] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 4 ms to minimize.
[2025-06-02 20:30:20] [INFO ] Deduced a trap composed of 258 places in 215 ms of which 5 ms to minimize.
[2025-06-02 20:30:20] [INFO ] Deduced a trap composed of 239 places in 221 ms of which 4 ms to minimize.
[2025-06-02 20:30:20] [INFO ] Deduced a trap composed of 248 places in 224 ms of which 4 ms to minimize.
[2025-06-02 20:30:21] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2025-06-02 20:30:23] [INFO ] Deduced a trap composed of 200 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:30:24] [INFO ] Deduced a trap composed of 200 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:30:24] [INFO ] Deduced a trap composed of 228 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:30:24] [INFO ] Deduced a trap composed of 200 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:30:25] [INFO ] Deduced a trap composed of 240 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:30:25] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 5 ms to minimize.
[2025-06-02 20:30:25] [INFO ] Deduced a trap composed of 200 places in 241 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 20:30:27] [INFO ] Deduced a trap composed of 240 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:30:28] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:30:28] [INFO ] Deduced a trap composed of 200 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:30:28] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:30:28] [INFO ] Deduced a trap composed of 248 places in 254 ms of which 5 ms to minimize.
[2025-06-02 20:30:29] [INFO ] Deduced a trap composed of 254 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:30:29] [INFO ] Deduced a trap composed of 243 places in 249 ms of which 3 ms to minimize.
[2025-06-02 20:30:29] [INFO ] Deduced a trap composed of 254 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:30:29] [INFO ] Deduced a trap composed of 245 places in 238 ms of which 4 ms to minimize.
[2025-06-02 20:30:30] [INFO ] Deduced a trap composed of 242 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:30:30] [INFO ] Deduced a trap composed of 239 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:30:30] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:30:31] [INFO ] Deduced a trap composed of 257 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:30:31] [INFO ] Deduced a trap composed of 251 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:30:31] [INFO ] Deduced a trap composed of 251 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:30:31] [INFO ] Deduced a trap composed of 201 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:30:32] [INFO ] Deduced a trap composed of 201 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:30:32] [INFO ] Deduced a trap composed of 200 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:30:32] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:30:33] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 187 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 55/55 constraints]
After SMT, in 42288ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 42298ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42331 ms. Remains : 770/771 places, 1103/1104 transitions.
[2025-06-02 20:30:35] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 20:30:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (52235 resets) in 4854 ms. (205 steps per ms)
BEST_FIRST walk for 1000001 steps (3436 resets) in 1267 ms. (788 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2025-06-02 20:30:41] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 20:30:41] [INFO ] Invariant cache hit.
[2025-06-02 20:30:42] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2025-06-02 20:30:42] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2025-06-02 20:30:42] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2025-06-02 20:30:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:30:42] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2025-06-02 20:30:42] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 15 ms returned sat
[2025-06-02 20:30:43] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2025-06-02 20:30:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:30:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 113 ms returned sat
[2025-06-02 20:30:43] [INFO ] Deduced a trap composed of 239 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:30:43] [INFO ] Deduced a trap composed of 245 places in 238 ms of which 4 ms to minimize.
[2025-06-02 20:30:44] [INFO ] Deduced a trap composed of 236 places in 236 ms of which 4 ms to minimize.
[2025-06-02 20:30:44] [INFO ] Deduced a trap composed of 230 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:30:44] [INFO ] Deduced a trap composed of 233 places in 238 ms of which 5 ms to minimize.
[2025-06-02 20:30:45] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:30:45] [INFO ] Deduced a trap composed of 248 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:30:45] [INFO ] Deduced a trap composed of 236 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:30:46] [INFO ] Deduced a trap composed of 246 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:30:46] [INFO ] Deduced a trap composed of 240 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:30:46] [INFO ] Deduced a trap composed of 231 places in 230 ms of which 4 ms to minimize.
[2025-06-02 20:30:46] [INFO ] Deduced a trap composed of 237 places in 226 ms of which 4 ms to minimize.
[2025-06-02 20:30:47] [INFO ] Deduced a trap composed of 244 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:30:47] [INFO ] Deduced a trap composed of 240 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:30:47] [INFO ] Deduced a trap composed of 237 places in 232 ms of which 5 ms to minimize.
[2025-06-02 20:30:48] [INFO ] Deduced a trap composed of 237 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:30:48] [INFO ] Deduced a trap composed of 240 places in 233 ms of which 4 ms to minimize.
[2025-06-02 20:30:48] [INFO ] Deduced a trap composed of 237 places in 234 ms of which 5 ms to minimize.
[2025-06-02 20:30:49] [INFO ] Deduced a trap composed of 249 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:30:49] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:30:49] [INFO ] Deduced a trap composed of 224 places in 228 ms of which 4 ms to minimize.
[2025-06-02 20:30:50] [INFO ] Deduced a trap composed of 251 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:30:50] [INFO ] Deduced a trap composed of 239 places in 231 ms of which 5 ms to minimize.
[2025-06-02 20:30:50] [INFO ] Deduced a trap composed of 245 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:30:51] [INFO ] Deduced a trap composed of 218 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:30:51] [INFO ] Deduced a trap composed of 236 places in 225 ms of which 4 ms to minimize.
[2025-06-02 20:30:52] [INFO ] Deduced a trap composed of 248 places in 233 ms of which 4 ms to minimize.
[2025-06-02 20:30:52] [INFO ] Deduced a trap composed of 239 places in 238 ms of which 4 ms to minimize.
[2025-06-02 20:30:52] [INFO ] Deduced a trap composed of 239 places in 237 ms of which 5 ms to minimize.
[2025-06-02 20:30:53] [INFO ] Deduced a trap composed of 245 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:30:53] [INFO ] Deduced a trap composed of 242 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:30:53] [INFO ] Deduced a trap composed of 263 places in 229 ms of which 4 ms to minimize.
[2025-06-02 20:30:53] [INFO ] Deduced a trap composed of 239 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:30:55] [INFO ] Deduced a trap composed of 254 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:30:55] [INFO ] Deduced a trap composed of 245 places in 231 ms of which 4 ms to minimize.
[2025-06-02 20:30:56] [INFO ] Deduced a trap composed of 236 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:30:56] [INFO ] Deduced a trap composed of 236 places in 231 ms of which 4 ms to minimize.
[2025-06-02 20:30:58] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 4 ms to minimize.
[2025-06-02 20:30:59] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:31:00] [INFO ] Deduced a trap composed of 239 places in 238 ms of which 3 ms to minimize.
[2025-06-02 20:31:02] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 4 ms to minimize.
[2025-06-02 20:31:03] [INFO ] Deduced a trap composed of 245 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:31:03] [INFO ] Deduced a trap composed of 236 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:31:06] [INFO ] Deduced a trap composed of 239 places in 233 ms of which 4 ms to minimize.
[2025-06-02 20:31:07] [INFO ] Deduced a trap composed of 242 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:31:07] [INFO ] Deduced a trap composed of 227 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:31:07] [INFO ] Deduced a trap composed of 239 places in 232 ms of which 4 ms to minimize.
[2025-06-02 20:31:08] [INFO ] Deduced a trap composed of 251 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:31:08] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:31:08] [INFO ] Deduced a trap composed of 242 places in 231 ms of which 4 ms to minimize.
[2025-06-02 20:31:09] [INFO ] Deduced a trap composed of 242 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:31:11] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 4 ms to minimize.
[2025-06-02 20:31:12] [INFO ] Deduced a trap composed of 252 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:31:17] [INFO ] Trap strengthening (SAT) tested/added 53/53 trap constraints in 33970 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 25 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 22 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2025-06-02 20:31:17] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 20:31:17] [INFO ] Invariant cache hit.
[2025-06-02 20:31:18] [INFO ] Implicit Places using invariants in 913 ms returned []
[2025-06-02 20:31:18] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 20:31:18] [INFO ] Invariant cache hit.
[2025-06-02 20:31:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:31:26] [INFO ] Implicit Places using invariants and state equation in 7687 ms returned []
Implicit Place search using SMT with State Equation took 8602 ms to find 0 implicit places.
[2025-06-02 20:31:26] [INFO ] Redundant transitions in 13 ms returned []
Running 1097 sub problems to find dead transitions.
[2025-06-02 20:31:26] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 20:31:26] [INFO ] Invariant cache hit.
[2025-06-02 20:31:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 20:31:40] [INFO ] Deduced a trap composed of 306 places in 252 ms of which 5 ms to minimize.
[2025-06-02 20:31:40] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 3 ms to minimize.
[2025-06-02 20:31:41] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:31:41] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2025-06-02 20:31:41] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:31:41] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 4 ms to minimize.
[2025-06-02 20:31:42] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:31:42] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:31:42] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 4 ms to minimize.
[2025-06-02 20:31:43] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 6 ms to minimize.
[2025-06-02 20:31:43] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:31:43] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2025-06-02 20:31:43] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2025-06-02 20:31:44] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 3 ms to minimize.
[2025-06-02 20:31:44] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:31:44] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:31:44] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2025-06-02 20:31:45] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:31:45] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:31:45] [INFO ] Deduced a trap composed of 248 places in 277 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 20:31:55] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 4 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 765/1869 variables, and 153 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 21/153 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 20:32:01] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 2 ms to minimize.
[2025-06-02 20:32:03] [INFO ] Deduced a trap composed of 200 places in 278 ms of which 4 ms to minimize.
[2025-06-02 20:32:04] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:32:04] [INFO ] Deduced a trap composed of 255 places in 251 ms of which 3 ms to minimize.
[2025-06-02 20:32:04] [INFO ] Deduced a trap composed of 266 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:32:04] [INFO ] Deduced a trap composed of 200 places in 255 ms of which 5 ms to minimize.
[2025-06-02 20:32:05] [INFO ] Deduced a trap composed of 200 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:32:05] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:32:05] [INFO ] Deduced a trap composed of 251 places in 248 ms of which 5 ms to minimize.
[2025-06-02 20:32:06] [INFO ] Deduced a trap composed of 258 places in 252 ms of which 5 ms to minimize.
[2025-06-02 20:32:06] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:32:06] [INFO ] Deduced a trap composed of 248 places in 250 ms of which 5 ms to minimize.
[2025-06-02 20:32:06] [INFO ] Deduced a trap composed of 258 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:32:07] [INFO ] Deduced a trap composed of 245 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:32:07] [INFO ] Deduced a trap composed of 242 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:32:07] [INFO ] Deduced a trap composed of 246 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:32:08] [INFO ] Deduced a trap composed of 236 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:32:08] [INFO ] Deduced a trap composed of 277 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:32:08] [INFO ] Deduced a trap composed of 245 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:32:08] [INFO ] Deduced a trap composed of 227 places in 248 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 5 (OVERLAPS) 4/769 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1869 variables, and 177 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 41/41 constraints]
After SMT, in 62445ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62456ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71098 ms. Remains : 770/770 places, 1103/1103 transitions.
[2025-06-02 20:32:28] [INFO ] Flatten gal took : 104 ms
[2025-06-02 20:32:28] [INFO ] Flatten gal took : 52 ms
RANDOM walk for 40000 steps (2085 resets) in 548 ms. (72 steps per ms) remains 2/2 properties
[2025-06-02 20:32:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6064582438777995120.gal : 11 ms
[2025-06-02 20:32:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality98117315818912307.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/ReachabilityCardinality6064582438777995120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality98117315818912307.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 ...326
BEST_FIRST walk for 40004 steps (136 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (124 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality98117315818912307.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 868813
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :868813 after 2.58101e+06
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.58101e+06 after 4.82519e+06
Interrupted probabilistic random walk after 266866 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 266866 steps, saw 81131 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2025-06-02 20:32:31] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 20:32:31] [INFO ] Invariant cache hit.
[2025-06-02 20:32:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :4.82519e+06 after 6.55947e+06
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:32:33] [INFO ] Deduced a trap composed of 240 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:32:33] [INFO ] Deduced a trap composed of 236 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:32:34] [INFO ] Deduced a trap composed of 248 places in 240 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6.55947e+06 after 8.369e+06
[2025-06-02 20:32:34] [INFO ] Deduced a trap composed of 233 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:32:34] [INFO ] Deduced a trap composed of 257 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:32:34] [INFO ] Deduced a trap composed of 239 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:32:35] [INFO ] Deduced a trap composed of 233 places in 232 ms of which 4 ms to minimize.
[2025-06-02 20:32:35] [INFO ] Deduced a trap composed of 233 places in 230 ms of which 4 ms to minimize.
[2025-06-02 20:32:35] [INFO ] Deduced a trap composed of 224 places in 233 ms of which 4 ms to minimize.
[2025-06-02 20:32:36] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8.369e+06 after 2.05757e+07
[2025-06-02 20:32:36] [INFO ] Deduced a trap composed of 245 places in 236 ms of which 4 ms to minimize.
[2025-06-02 20:32:36] [INFO ] Deduced a trap composed of 236 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:32:36] [INFO ] Deduced a trap composed of 236 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:32:37] [INFO ] Deduced a trap composed of 251 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:32:37] [INFO ] Deduced a trap composed of 242 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:32:37] [INFO ] Deduced a trap composed of 249 places in 243 ms of which 4 ms to minimize.
SMT process timed out in 6009ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 24 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2025-06-02 20:32:37] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 20:32:37] [INFO ] Invariant cache hit.
[2025-06-02 20:32:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 20:32:52] [INFO ] Deduced a trap composed of 306 places in 268 ms of which 4 ms to minimize.
[2025-06-02 20:32:52] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:32:52] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 5 ms to minimize.
[2025-06-02 20:32:52] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:32:53] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:32:53] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:32:53] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:32:53] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 5 ms to minimize.
[2025-06-02 20:32:54] [INFO ] Deduced a trap composed of 242 places in 263 ms of which 4 ms to minimize.
[2025-06-02 20:32:54] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2025-06-02 20:32:54] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:32:55] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:32:55] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:32:55] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:32:55] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:32:56] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:32:56] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2025-06-02 20:32:56] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:32:56] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:32:57] [INFO ] Deduced a trap composed of 248 places in 260 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 152 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 20:33:02] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 3 ms to minimize.
[2025-06-02 20:33:05] [INFO ] Deduced a trap composed of 222 places in 268 ms of which 4 ms to minimize.
[2025-06-02 20:33:06] [INFO ] Deduced a trap composed of 225 places in 268 ms of which 5 ms to minimize.
[2025-06-02 20:33:06] [INFO ] Deduced a trap composed of 284 places in 264 ms of which 4 ms to minimize.
[2025-06-02 20:33:06] [INFO ] Deduced a trap composed of 227 places in 263 ms of which 4 ms to minimize.
[2025-06-02 20:33:06] [INFO ] Deduced a trap composed of 227 places in 262 ms of which 4 ms to minimize.
[2025-06-02 20:33:07] [INFO ] Deduced a trap composed of 225 places in 264 ms of which 4 ms to minimize.
[2025-06-02 20:33:07] [INFO ] Deduced a trap composed of 224 places in 267 ms of which 4 ms to minimize.
[2025-06-02 20:33:07] [INFO ] Deduced a trap composed of 229 places in 263 ms of which 4 ms to minimize.
[2025-06-02 20:33:08] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:33:08] [INFO ] Deduced a trap composed of 306 places in 266 ms of which 4 ms to minimize.
[2025-06-02 20:33:08] [INFO ] Deduced a trap composed of 220 places in 264 ms of which 4 ms to minimize.
[2025-06-02 20:33:08] [INFO ] Deduced a trap composed of 224 places in 262 ms of which 4 ms to minimize.
[2025-06-02 20:33:09] [INFO ] Deduced a trap composed of 220 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:33:09] [INFO ] Deduced a trap composed of 300 places in 263 ms of which 4 ms to minimize.
[2025-06-02 20:33:09] [INFO ] Deduced a trap composed of 294 places in 262 ms of which 4 ms to minimize.
[2025-06-02 20:33:10] [INFO ] Deduced a trap composed of 225 places in 256 ms of which 5 ms to minimize.
[2025-06-02 20:33:10] [INFO ] Deduced a trap composed of 294 places in 265 ms of which 4 ms to minimize.
[2025-06-02 20:33:10] [INFO ] Deduced a trap composed of 296 places in 265 ms of which 4 ms to minimize.
[2025-06-02 20:33:11] [INFO ] Deduced a trap composed of 296 places in 260 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 20:33:16] [INFO ] Deduced a trap composed of 231 places in 271 ms of which 4 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 20:33:18] [INFO ] Flatten gal took : 47 ms
[2025-06-02 20:33:18] [INFO ] Applying decomposition
[2025-06-02 20:33:18] [INFO ] Flatten gal took : 47 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/graph12288959963287591126.txt' '-o' '/tmp/graph12288959963287591126.bin' '-w' '/tmp/graph12288959963287591126.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12288959963287591126.bin' '-l' '-1' '-v' '-w' '/tmp/graph12288959963287591126.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:33:19] [INFO ] Decomposing Gal with order
[2025-06-02 20:33:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:33:19] [INFO ] Removed a total of 1084 redundant transitions.
[2025-06-02 20:33:19] [INFO ] Flatten gal took : 181 ms
[2025-06-02 20:33:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 474 labels/synchronizations in 44 ms.
[2025-06-02 20:33:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7611987097849778139.gal : 15 ms
[2025-06-02 20:33:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1554899972941356474.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/ReachabilityCardinality7611987097849778139.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1554899972941356474.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality1554899972941356474.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 66
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :66 after 68
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :68 after 207
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :207 after 1245
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1245 after 2297
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 765/1869 variables, and 173 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 41/41 constraints]
After SMT, in 42170ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 42180ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42206 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 40000 steps (2116 resets) in 585 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (133 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (138 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2297 after 1.28575e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.28575e+07 after 1.28575e+07
Interrupted probabilistic random walk after 273682 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 2
Probabilistic random walk after 273682 steps, saw 83201 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2025-06-02 20:33:23] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 20:33:23] [INFO ] Invariant cache hit.
[2025-06-02 20:33:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:33:25] [INFO ] Deduced a trap composed of 240 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:33:25] [INFO ] Deduced a trap composed of 236 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:33:25] [INFO ] Deduced a trap composed of 248 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:33:26] [INFO ] Deduced a trap composed of 233 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:33:26] [INFO ] Deduced a trap composed of 257 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:33:26] [INFO ] Deduced a trap composed of 239 places in 295 ms of which 4 ms to minimize.
[2025-06-02 20:33:26] [INFO ] Deduced a trap composed of 233 places in 275 ms of which 4 ms to minimize.
[2025-06-02 20:33:27] [INFO ] Deduced a trap composed of 233 places in 276 ms of which 4 ms to minimize.
[2025-06-02 20:33:27] [INFO ] Deduced a trap composed of 224 places in 284 ms of which 4 ms to minimize.
[2025-06-02 20:33:27] [INFO ] Deduced a trap composed of 239 places in 317 ms of which 4 ms to minimize.
[2025-06-02 20:33:28] [INFO ] Deduced a trap composed of 245 places in 295 ms of which 4 ms to minimize.
[2025-06-02 20:33:28] [INFO ] Deduced a trap composed of 236 places in 274 ms of which 3 ms to minimize.
[2025-06-02 20:33:28] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:33:29] [INFO ] Deduced a trap composed of 251 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:33:29] [INFO ] Deduced a trap composed of 242 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:33:29] [INFO ] Deduced a trap composed of 249 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:33:30] [INFO ] Deduced a trap composed of 245 places in 250 ms of which 5 ms to minimize.
[2025-06-02 20:33:30] [INFO ] Deduced a trap composed of 221 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:33:30] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:33:31] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 20/927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:33:31] [INFO ] Deduced a trap composed of 224 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:33:31] [INFO ] Deduced a trap composed of 233 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:33:31] [INFO ] Deduced a trap composed of 248 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:33:34] [INFO ] Deduced a trap composed of 245 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:33:34] [INFO ] Deduced a trap composed of 249 places in 258 ms of which 4 ms to minimize.
[2025-06-02 20:33:34] [INFO ] Deduced a trap composed of 251 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:33:35] [INFO ] Deduced a trap composed of 260 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:33:37] [INFO ] Deduced a trap composed of 266 places in 267 ms of which 4 ms to minimize.
[2025-06-02 20:33:37] [INFO ] Deduced a trap composed of 248 places in 236 ms of which 4 ms to minimize.
[2025-06-02 20:33:37] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:33:37] [INFO ] Deduced a trap composed of 239 places in 233 ms of which 4 ms to minimize.
[2025-06-02 20:33:38] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:33:39] [INFO ] Deduced a trap composed of 227 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:33:39] [INFO ] Deduced a trap composed of 242 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:33:39] [INFO ] Deduced a trap composed of 245 places in 295 ms of which 5 ms to minimize.
[2025-06-02 20:33:40] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:33:40] [INFO ] Deduced a trap composed of 239 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:33:45] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 4 ms to minimize.
[2025-06-02 20:33:45] [INFO ] Deduced a trap composed of 248 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:33:46] [INFO ] Deduced a trap composed of 242 places in 254 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1868 variables, 20/947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:33:46] [INFO ] Deduced a trap composed of 239 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:33:52] [INFO ] Deduced a trap composed of 236 places in 255 ms of which 6 ms to minimize.
[2025-06-02 20:33:52] [INFO ] Deduced a trap composed of 242 places in 242 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1868/1869 variables, and 950 constraints, problems are : Problem set: 0 solved, 2 unsolved in 34258 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 769/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 43/43 constraints]
After SMT, in 35035ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 24 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 23 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2025-06-02 20:33:58] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 20:33:58] [INFO ] Invariant cache hit.
[2025-06-02 20:33:59] [INFO ] Implicit Places using invariants in 913 ms returned []
[2025-06-02 20:33:59] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 20:33:59] [INFO ] Invariant cache hit.
[2025-06-02 20:33:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:34:07] [INFO ] Implicit Places using invariants and state equation in 7812 ms returned []
Implicit Place search using SMT with State Equation took 8748 ms to find 0 implicit places.
[2025-06-02 20:34:07] [INFO ] Redundant transitions in 8 ms returned []
Running 1097 sub problems to find dead transitions.
[2025-06-02 20:34:07] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2025-06-02 20:34:07] [INFO ] Invariant cache hit.
[2025-06-02 20:34:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 20:34:22] [INFO ] Deduced a trap composed of 306 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:34:22] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:34:23] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2025-06-02 20:34:23] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:34:23] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:34:23] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:34:24] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:34:24] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:34:24] [INFO ] Deduced a trap composed of 242 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:34:24] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:34:25] [INFO ] Deduced a trap composed of 196 places in 368 ms of which 4 ms to minimize.
[2025-06-02 20:34:25] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:34:25] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 4 ms to minimize.
[2025-06-02 20:34:26] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:34:26] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2025-06-02 20:34:26] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:34:26] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:34:27] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:34:27] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:34:27] [INFO ] Deduced a trap composed of 248 places in 261 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 20:34:38] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 4 ms to minimize.
(s725 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.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 (/ 2.0 3.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 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 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 (/ 1.0 3.0))
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 (/ 1.0 3.0))
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 (/ 2.0 3.0))
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.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 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.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 0.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 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 4.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 9.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)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 1.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 0.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0timeout
)
(s726 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 153 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 21/153 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2025-06-02 20:34:42] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:34:45] [INFO ] Deduced a trap composed of 200 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:34:45] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:34:45] [INFO ] Deduced a trap composed of 255 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:34:46] [INFO ] Deduced a trap composed of 266 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:34:46] [INFO ] Deduced a trap composed of 200 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:34:46] [INFO ] Deduced a trap composed of 200 places in 272 ms of which 5 ms to minimize.
[2025-06-02 20:34:46] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:34:47] [INFO ] Deduced a trap composed of 251 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:34:47] [INFO ] Deduced a trap composed of 258 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:34:47] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:34:48] [INFO ] Deduced a trap composed of 248 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:34:48] [INFO ] Deduced a trap composed of 258 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:34:48] [INFO ] Deduced a trap composed of 245 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:34:49] [INFO ] Deduced a trap composed of 242 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:34:49] [INFO ] Deduced a trap composed of 246 places in 263 ms of which 4 ms to minimize.
[2025-06-02 20:34:49] [INFO ] Deduced a trap composed of 236 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:34:49] [INFO ] Deduced a trap composed of 277 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:34:50] [INFO ] Deduced a trap composed of 245 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:34:50] [INFO ] Deduced a trap composed of 227 places in 264 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 5 (OVERLAPS) 4/769 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1869 variables, and 177 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 41/41 constraints]
After SMT, in 62698ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62710ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71502 ms. Remains : 770/770 places, 1103/1103 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-00 in 319874 ms.
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2025-06-02 20:35:09] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
// Phase 1: matrix 1100 rows 771 cols
[2025-06-02 20:35:09] [INFO ] Computed 137 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (486 resets) in 50 ms. (196 steps per ms)
BEST_FIRST walk for 10001 steps (32 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2025-06-02 20:35:09] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:35:09] [INFO ] Invariant cache hit.
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 15 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2025-06-02 20:35:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:10] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2025-06-02 20:35:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:35:11] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 20:35:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 711 ms returned sat
[2025-06-02 20:35:11] [INFO ] Computed and/alt/rep : 539/1876/539 causal constraints (skipped 555 transitions) in 62 ms.
[2025-06-02 20:35:12] [INFO ] Deduced a trap composed of 254 places in 266 ms of which 5 ms to minimize.
[2025-06-02 20:35:12] [INFO ] Deduced a trap composed of 261 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:35:13] [INFO ] Deduced a trap composed of 257 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:35:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1081 ms
[2025-06-02 20:35:13] [INFO ] Added : 12 causal constraints over 3 iterations in 1510 ms. Result :sat
Minimization took 706 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1104/1104 transitions.
Applied a total of 0 rules in 31 ms. Remains 771 /771 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Running 1098 sub problems to find dead transitions.
[2025-06-02 20:35:13] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:35:13] [INFO ] Invariant cache hit.
[2025-06-02 20:35:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:35:28] [INFO ] Deduced a trap composed of 197 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:35:29] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:35:29] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:35:29] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:35:30] [INFO ] Deduced a trap composed of 197 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:35:30] [INFO ] Deduced a trap composed of 197 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:35:30] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:35:30] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 5 ms to minimize.
[2025-06-02 20:35:31] [INFO ] Deduced a trap composed of 197 places in 244 ms of which 4 ms to minimize.
[2025-06-02 20:35:31] [INFO ] Deduced a trap composed of 197 places in 244 ms of which 4 ms to minimize.
[2025-06-02 20:35:31] [INFO ] Deduced a trap composed of 242 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:35:31] [INFO ] Deduced a trap composed of 221 places in 252 ms of which 5 ms to minimize.
[2025-06-02 20:35:32] [INFO ] Deduced a trap composed of 197 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:35:32] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:35:32] [INFO ] Deduced a trap composed of 248 places in 358 ms of which 4 ms to minimize.
[2025-06-02 20:35:33] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:35:33] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:35:33] [INFO ] Deduced a trap composed of 197 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:35:34] [INFO ] Deduced a trap composed of 197 places in 244 ms of which 4 ms to minimize.
[2025-06-02 20:35:34] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:35:34] [INFO ] Deduced a trap composed of 198 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:35:35] [INFO ] Deduced a trap composed of 198 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:35:35] [INFO ] Deduced a trap composed of 198 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:35:35] [INFO ] Deduced a trap composed of 198 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:35:36] [INFO ] Deduced a trap composed of 198 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:35:36] [INFO ] Deduced a trap composed of 198 places in 239 ms of which 4 ms to minimize.
SMT process timed out in 22515ms, After SMT, problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 22527ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22561 ms. Remains : 771/771 places, 1104/1104 transitions.
[2025-06-02 20:35:36] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:35:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (47484 resets) in 4777 ms. (209 steps per ms)
BEST_FIRST walk for 1000001 steps (3452 resets) in 1323 ms. (755 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2025-06-02 20:35:42] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:35:42] [INFO ] Invariant cache hit.
[2025-06-02 20:35:42] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2025-06-02 20:35:42] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 15 ms returned sat
[2025-06-02 20:35:42] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2025-06-02 20:35:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:43] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2025-06-02 20:35:43] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 13 ms returned sat
[2025-06-02 20:35:43] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2025-06-02 20:35:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:35:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 639 ms returned sat
[2025-06-02 20:35:44] [INFO ] Computed and/alt/rep : 539/1876/539 causal constraints (skipped 555 transitions) in 57 ms.
[2025-06-02 20:35:45] [INFO ] Deduced a trap composed of 242 places in 259 ms of which 5 ms to minimize.
[2025-06-02 20:35:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2025-06-02 20:35:45] [INFO ] Added : 12 causal constraints over 3 iterations in 1161 ms. Result :sat
Minimization took 1408 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1104/1104 transitions.
Applied a total of 0 rules in 21 ms. Remains 771 /771 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 771/771 places, 1104/1104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1104/1104 transitions.
Applied a total of 0 rules in 21 ms. Remains 771 /771 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
[2025-06-02 20:35:46] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:35:46] [INFO ] Invariant cache hit.
[2025-06-02 20:35:47] [INFO ] Implicit Places using invariants in 823 ms returned []
[2025-06-02 20:35:47] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:35:47] [INFO ] Invariant cache hit.
[2025-06-02 20:35:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:35:51] [INFO ] Implicit Places using invariants and state equation in 3996 ms returned []
Implicit Place search using SMT with State Equation took 4825 ms to find 0 implicit places.
[2025-06-02 20:35:51] [INFO ] Redundant transitions in 14 ms returned []
Running 1098 sub problems to find dead transitions.
[2025-06-02 20:35:51] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:35:51] [INFO ] Invariant cache hit.
[2025-06-02 20:35:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:36:07] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:36:07] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:36:07] [INFO ] Deduced a trap composed of 197 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:36:08] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:36:08] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:36:08] [INFO ] Deduced a trap composed of 197 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:36:08] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:36:09] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:36:09] [INFO ] Deduced a trap composed of 197 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:36:09] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:36:09] [INFO ] Deduced a trap composed of 242 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:36:10] [INFO ] Deduced a trap composed of 221 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:36:10] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:36:10] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:36:11] [INFO ] Deduced a trap composed of 248 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:36:11] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:36:11] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:36:11] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:36:12] [INFO ] Deduced a trap composed of 197 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:36:12] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:36:13] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 4 ms to minimize.
[2025-06-02 20:36:13] [INFO ] Deduced a trap composed of 198 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:36:13] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:36:13] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:36:14] [INFO ] Deduced a trap composed of 198 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:36:14] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 4 ms to minimize.
[2025-06-02 20:36:15] [INFO ] Deduced a trap composed of 198 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:36:15] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:36:15] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:36:16] [INFO ] Deduced a trap composed of 198 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:36:16] [INFO ] Deduced a trap composed of 198 places in 239 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1871 variables, and 163 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 31/163 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:36:25] [INFO ] Deduced a trap composed of 218 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:36:26] [INFO ] Deduced a trap composed of 224 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:36:26] [INFO ] Deduced a trap composed of 233 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:36:26] [INFO ] Deduced a trap composed of 231 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:36:26] [INFO ] Deduced a trap composed of 225 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:36:27] [INFO ] Deduced a trap composed of 222 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:36:27] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 4 ms to minimize.
[2025-06-02 20:36:27] [INFO ] Deduced a trap composed of 221 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:36:28] [INFO ] Deduced a trap composed of 219 places in 244 ms of which 4 ms to minimize.
[2025-06-02 20:36:28] [INFO ] Deduced a trap composed of 225 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:36:28] [INFO ] Deduced a trap composed of 227 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:36:28] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:36:29] [INFO ] Deduced a trap composed of 224 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:36:29] [INFO ] Deduced a trap composed of 225 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:36:29] [INFO ] Deduced a trap composed of 219 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:36:30] [INFO ] Deduced a trap composed of 220 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:36:30] [INFO ] Deduced a trap composed of 226 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:36:30] [INFO ] Deduced a trap composed of 221 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:36:31] [INFO ] Deduced a trap composed of 222 places in 242 ms of which 5 ms to minimize.
[2025-06-02 20:36:31] [INFO ] Deduced a trap composed of 221 places in 235 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:36:32] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 5 ms to minimize.
[2025-06-02 20:36:32] [INFO ] Deduced a trap composed of 197 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:36:33] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 5 ms to minimize.
[2025-06-02 20:36:33] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:36:33] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:36:34] [INFO ] Deduced a trap composed of 197 places in 246 ms of which 3 ms to minimize.
[2025-06-02 20:36:34] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:36:34] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:36:34] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 5 ms to minimize.
[2025-06-02 20:36:35] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:36:35] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:36:35] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:36:36] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:36:36] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:36:36] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:36:36] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:36:37] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:36:37] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:36:38] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 4 ms to minimize.
[2025-06-02 20:36:38] [INFO ] Deduced a trap composed of 197 places in 249 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:36:41] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 3 ms to minimize.
[2025-06-02 20:36:43] [INFO ] Deduced a trap composed of 201 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:36:43] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:36:44] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:36:44] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:36:44] [INFO ] Deduced a trap composed of 197 places in 244 ms of which 4 ms to minimize.
[2025-06-02 20:36:44] [INFO ] Deduced a trap composed of 201 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:36:45] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:36:45] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:36:45] [INFO ] Deduced a trap composed of 201 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:36:45] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:36:46] [INFO ] Deduced a trap composed of 201 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:36:46] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 5 ms to minimize.
[2025-06-02 20:36:46] [INFO ] Deduced a trap composed of 201 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:36:46] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 5 ms to minimize.
[2025-06-02 20:36:47] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:36:47] [INFO ] Deduced a trap composed of 201 places in 235 ms of which 4 ms to minimize.
[2025-06-02 20:36:47] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:36:48] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:36:48] [INFO ] Deduced a trap composed of 197 places in 238 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:36:50] [INFO ] Deduced a trap composed of 197 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:36:50] [INFO ] Deduced a trap composed of 197 places in 244 ms of which 4 ms to minimize.
[2025-06-02 20:36:50] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:36:50] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:36:51] [INFO ] Deduced a trap composed of 198 places in 247 ms of which 4 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 766/1871 variables, and 228 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 96/96 constraints]
After SMT, in 62604ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 62615ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67482 ms. Remains : 771/771 places, 1104/1104 transitions.
[2025-06-02 20:36:54] [INFO ] Flatten gal took : 58 ms
[2025-06-02 20:36:54] [INFO ] Flatten gal took : 58 ms
[2025-06-02 20:36:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18296790241955897324.gal : 10 ms
[2025-06-02 20:36:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16502243053967831487.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/ReachabilityCardinality18296790241955897324.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16502243053967831487.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (1906 resets) in 523 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (127 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16502243053967831487.prop.
BEST_FIRST walk for 40003 steps (113 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 868817
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :868817 after 2.4616e+06
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.4616e+06 after 4.82516e+06
Interrupted probabilistic random walk after 287982 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 287982 steps, saw 88530 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2025-06-02 20:36:57] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:36:57] [INFO ] Invariant cache hit.
[2025-06-02 20:36:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 132/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 562/695 variables, 66/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/757 variables, 62/129 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/768 variables, 6/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4.82516e+06 after 6.54557e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/770 variables, 2/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1100/1870 variables, 770/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1870 variables, 1/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1870 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1871 variables, 1/909 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1871 variables, 0/909 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1871 variables, 0/909 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1871/1871 variables, and 909 constraints, problems are : Problem set: 1 solved, 1 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 771/771 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/133 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 562/695 variables, 66/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/757 variables, 62/129 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/768 variables, 6/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/770 variables, 2/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1100/1870 variables, 770/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1870 variables, 1/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 20:36:59] [INFO ] Deduced a trap composed of 251 places in 248 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6.54557e+06 after 8.34414e+06
[2025-06-02 20:36:59] [INFO ] Deduced a trap composed of 248 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:36:59] [INFO ] Deduced a trap composed of 242 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:36:59] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:37:00] [INFO ] Deduced a trap composed of 243 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:37:00] [INFO ] Deduced a trap composed of 227 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:37:00] [INFO ] Deduced a trap composed of 239 places in 241 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8.34414e+06 after 1.88099e+07
[2025-06-02 20:37:00] [INFO ] Deduced a trap composed of 233 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:37:01] [INFO ] Deduced a trap composed of 245 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:37:01] [INFO ] Deduced a trap composed of 242 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:37:01] [INFO ] Deduced a trap composed of 245 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:37:02] [INFO ] Deduced a trap composed of 251 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:37:02] [INFO ] Deduced a trap composed of 242 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:37:02] [INFO ] Deduced a trap composed of 222 places in 244 ms of which 4 ms to minimize.
[2025-06-02 20:37:03] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 5 ms to minimize.
SMT process timed out in 5604ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1104/1104 transitions.
Applied a total of 0 rules in 21 ms. Remains 771 /771 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Running 1098 sub problems to find dead transitions.
[2025-06-02 20:37:03] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:37:03] [INFO ] Invariant cache hit.
[2025-06-02 20:37:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:37:18] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:37:19] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:37:19] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:37:19] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 5 ms to minimize.
[2025-06-02 20:37:20] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:37:20] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:37:20] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:37:20] [INFO ] Deduced a trap composed of 197 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:37:21] [INFO ] Deduced a trap composed of 197 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:37:21] [INFO ] Deduced a trap composed of 197 places in 264 ms of which 4 ms to minimize.
[2025-06-02 20:37:21] [INFO ] Deduced a trap composed of 242 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:37:22] [INFO ] Deduced a trap composed of 221 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:37:22] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:37:22] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:37:22] [INFO ] Deduced a trap composed of 248 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:37:23] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:37:23] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:37:23] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:37:23] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 10 ms to minimize.
[2025-06-02 20:37:24] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:37:24] [INFO ] Deduced a trap composed of 198 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:37:25] [INFO ] Deduced a trap composed of 198 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:37:25] [INFO ] Deduced a trap composed of 198 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:37:25] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:37:26] [INFO ] Deduced a trap composed of 198 places in 250 ms of which 4 ms to minimize.
SMT process timed out in 22808ms, After SMT, problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 22818ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22842 ms. Remains : 771/771 places, 1104/1104 transitions.
RANDOM walk for 40002 steps (1906 resets) in 355 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (125 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 339325 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 339325 steps, saw 104562 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
[2025-06-02 20:37:29] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:37:29] [INFO ] Invariant cache hit.
[2025-06-02 20:37:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 562/695 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/757 variables, 62/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/768 variables, 6/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/770 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1100/1870 variables, 770/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1870 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1870 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1871 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1871 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1871 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1871/1871 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 771/771 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 562/695 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/757 variables, 62/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/768 variables, 6/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/770 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1100/1870 variables, 770/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1870 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:37:30] [INFO ] Deduced a trap composed of 251 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:37:30] [INFO ] Deduced a trap composed of 248 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:37:31] [INFO ] Deduced a trap composed of 242 places in 250 ms of which 4 ms to minimize.
[2025-06-02 20:37:31] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:37:31] [INFO ] Deduced a trap composed of 243 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:37:32] [INFO ] Deduced a trap composed of 227 places in 262 ms of which 4 ms to minimize.
[2025-06-02 20:37:32] [INFO ] Deduced a trap composed of 239 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:37:32] [INFO ] Deduced a trap composed of 233 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:37:32] [INFO ] Deduced a trap composed of 245 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:37:33] [INFO ] Deduced a trap composed of 242 places in 277 ms of which 4 ms to minimize.
[2025-06-02 20:37:33] [INFO ] Deduced a trap composed of 245 places in 265 ms of which 4 ms to minimize.
[2025-06-02 20:37:33] [INFO ] Deduced a trap composed of 251 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:37:34] [INFO ] Deduced a trap composed of 242 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:37:34] [INFO ] Deduced a trap composed of 222 places in 271 ms of which 5 ms to minimize.
[2025-06-02 20:37:34] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 4 ms to minimize.
[2025-06-02 20:37:35] [INFO ] Deduced a trap composed of 245 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:37:35] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:37:36] [INFO ] Deduced a trap composed of 227 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:37:36] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 4 ms to minimize.
[2025-06-02 20:37:36] [INFO ] Deduced a trap composed of 248 places in 259 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1870 variables, 20/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:37:37] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:37:38] [INFO ] Deduced a trap composed of 242 places in 262 ms of which 4 ms to minimize.
[2025-06-02 20:37:38] [INFO ] Deduced a trap composed of 248 places in 267 ms of which 4 ms to minimize.
[2025-06-02 20:37:38] [INFO ] Deduced a trap composed of 260 places in 264 ms of which 4 ms to minimize.
[2025-06-02 20:37:39] [INFO ] Deduced a trap composed of 245 places in 268 ms of which 4 ms to minimize.
[2025-06-02 20:37:39] [INFO ] Deduced a trap composed of 251 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:37:39] [INFO ] Deduced a trap composed of 248 places in 261 ms of which 5 ms to minimize.
[2025-06-02 20:37:40] [INFO ] Deduced a trap composed of 266 places in 263 ms of which 4 ms to minimize.
[2025-06-02 20:37:40] [INFO ] Deduced a trap composed of 251 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:37:40] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:37:41] [INFO ] Deduced a trap composed of 221 places in 256 ms of which 5 ms to minimize.
[2025-06-02 20:37:41] [INFO ] Deduced a trap composed of 233 places in 258 ms of which 4 ms to minimize.
[2025-06-02 20:37:41] [INFO ] Deduced a trap composed of 248 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:37:42] [INFO ] Deduced a trap composed of 260 places in 262 ms of which 4 ms to minimize.
[2025-06-02 20:37:42] [INFO ] Deduced a trap composed of 245 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:37:42] [INFO ] Deduced a trap composed of 239 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:37:43] [INFO ] Deduced a trap composed of 245 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:37:43] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:37:43] [INFO ] Deduced a trap composed of 221 places in 261 ms of which 4 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 20:37:44] [INFO ] Flatten gal took : 39 ms
[2025-06-02 20:37:44] [INFO ] Applying decomposition
[2025-06-02 20:37:44] [INFO ] Flatten gal took : 39 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/graph9383772658999154666.txt' '-o' '/tmp/graph9383772658999154666.bin' '-w' '/tmp/graph9383772658999154666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9383772658999154666.bin' '-l' '-1' '-v' '-w' '/tmp/graph9383772658999154666.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:37:44] [INFO ] Decomposing Gal with order
[2025-06-02 20:37:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:37:44] [INFO ] Removed a total of 1081 redundant transitions.
[2025-06-02 20:37:44] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 4 ms to minimize.
[2025-06-02 20:37:44] [INFO ] Flatten gal took : 177 ms
[2025-06-02 20:37:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 483 labels/synchronizations in 34 ms.
At refinement iteration 14 (INCLUDED_ONLY) 0/1870 variables, 20/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:37:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15647355634458598142.gal : 14 ms
[2025-06-02 20:37:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9256307005354886286.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/ReachabilityCardinality15647355634458598142.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9256307005354886286.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9256307005354886286.prop.
[2025-06-02 20:37:45] [INFO ] Deduced a trap composed of 249 places in 265 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 66
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :66 after 68
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :68 after 207
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :207 after 378
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :378 after 1163
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1163 after 2620
[2025-06-02 20:37:45] [INFO ] Deduced a trap composed of 242 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:37:45] [INFO ] Deduced a trap composed of 252 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:37:46] [INFO ] Deduced a trap composed of 242 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:37:46] [INFO ] Deduced a trap composed of 245 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:37:47] [INFO ] Deduced a trap composed of 233 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:37:47] [INFO ] Deduced a trap composed of 233 places in 238 ms of which 3 ms to minimize.
[2025-06-02 20:37:47] [INFO ] Deduced a trap composed of 242 places in 238 ms of which 4 ms to minimize.
[2025-06-02 20:37:48] [INFO ] Deduced a trap composed of 236 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:37:48] [INFO ] Deduced a trap composed of 242 places in 242 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2620 after 1.88099e+07
[2025-06-02 20:37:49] [INFO ] Deduced a trap composed of 242 places in 238 ms of which 4 ms to minimize.
[2025-06-02 20:37:53] [INFO ] Deduced a trap composed of 239 places in 245 ms of which 4 ms to minimize.
[2025-06-02 20:37:53] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 5 ms to minimize.
[2025-06-02 20:37:54] [INFO ] Deduced a trap composed of 245 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:37:54] [INFO ] Deduced a trap composed of 242 places in 235 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.88099e+07 after 1.30506e+08
[2025-06-02 20:37:56] [INFO ] Deduced a trap composed of 245 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:37:57] [INFO ] Deduced a trap composed of 233 places in 236 ms of which 4 ms to minimize.
[2025-06-02 20:37:58] [INFO ] Deduced a trap composed of 233 places in 232 ms of which 4 ms to minimize.
[2025-06-02 20:37:59] [INFO ] Deduced a trap composed of 233 places in 236 ms of which 4 ms to minimize.
[2025-06-02 20:37:59] [INFO ] Deduced a trap composed of 227 places in 238 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1870 variables, 20/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:37:59] [INFO ] Deduced a trap composed of 227 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:38:00] [INFO ] Deduced a trap composed of 254 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:38:00] [INFO ] Deduced a trap composed of 242 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:38:00] [INFO ] Deduced a trap composed of 233 places in 238 ms of which 4 ms to minimize.
[2025-06-02 20:38:01] [INFO ] Deduced a trap composed of 236 places in 237 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1870/1871 variables, and 973 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37877 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/771 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 65/65 constraints]
After SMT, in 38475ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1104/1104 transitions.
Applied a total of 0 rules in 20 ms. Remains 771 /771 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 771/771 places, 1104/1104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1104/1104 transitions.
Applied a total of 0 rules in 19 ms. Remains 771 /771 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
[2025-06-02 20:38:07] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:38:07] [INFO ] Invariant cache hit.
[2025-06-02 20:38:08] [INFO ] Implicit Places using invariants in 844 ms returned []
[2025-06-02 20:38:08] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:38:08] [INFO ] Invariant cache hit.
[2025-06-02 20:38:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:38:12] [INFO ] Implicit Places using invariants and state equation in 3964 ms returned []
Implicit Place search using SMT with State Equation took 4822 ms to find 0 implicit places.
[2025-06-02 20:38:12] [INFO ] Redundant transitions in 9 ms returned []
Running 1098 sub problems to find dead transitions.
[2025-06-02 20:38:12] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2025-06-02 20:38:12] [INFO ] Invariant cache hit.
[2025-06-02 20:38:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:38:28] [INFO ] Deduced a trap composed of 197 places in 262 ms of which 4 ms to minimize.
[2025-06-02 20:38:28] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:38:28] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 5 ms to minimize.
[2025-06-02 20:38:29] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 5 ms to minimize.
[2025-06-02 20:38:29] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:38:29] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:38:30] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:38:30] [INFO ] Deduced a trap composed of 197 places in 258 ms of which 5 ms to minimize.
[2025-06-02 20:38:30] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:38:30] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:38:31] [INFO ] Deduced a trap composed of 242 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:38:31] [INFO ] Deduced a trap composed of 221 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:38:31] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:38:32] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:38:32] [INFO ] Deduced a trap composed of 248 places in 253 ms of which 5 ms to minimize.
[2025-06-02 20:38:32] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:38:32] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:38:33] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 4 ms to minimize.
[2025-06-02 20:38:33] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:38:33] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:38:34] [INFO ] Deduced a trap composed of 198 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:38:34] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 4 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 20:38:35] [INFO ] Deduced a trap composed of 198 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:38:35] [INFO ] Deduced a trap composed of 198 places in 255 ms of which 4 ms to minimize.
[2025-06-02 20:38:35] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
[2025-06-02 20:38:35] [INFO ] Deduced a trap composed of 198 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:38:36] [INFO ] Deduced a trap composed of 198 places in 263 ms of which 4 ms to minimize.
[2025-06-02 20:38:37] [INFO ] Deduced a trap composed of 198 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:38:37] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 4 ms to minimize.
[2025-06-02 20:38:37] [INFO ] Deduced a trap composed of 198 places in 237 ms of which 4 ms to minimize.
[2025-06-02 20:38:37] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1871 variables, and 163 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 31/163 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:38:46] [INFO ] Deduced a trap composed of 218 places in 269 ms of which 5 ms to minimize.
[2025-06-02 20:38:47] [INFO ] Deduced a trap composed of 224 places in 266 ms of which 4 ms to minimize.
[2025-06-02 20:38:47] [INFO ] Deduced a trap composed of 233 places in 269 ms of which 4 ms to minimize.
[2025-06-02 20:38:47] [INFO ] Deduced a trap composed of 231 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:38:48] [INFO ] Deduced a trap composed of 225 places in 246 ms of which 4 ms to minimize.
[2025-06-02 20:38:48] [INFO ] Deduced a trap composed of 222 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:38:48] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 4 ms to minimize.
[2025-06-02 20:38:49] [INFO ] Deduced a trap composed of 221 places in 262 ms of which 5 ms to minimize.
[2025-06-02 20:38:49] [INFO ] Deduced a trap composed of 219 places in 288 ms of which 4 ms to minimize.
[2025-06-02 20:38:49] [INFO ] Deduced a trap composed of 225 places in 275 ms of which 4 ms to minimize.
[2025-06-02 20:38:50] [INFO ] Deduced a trap composed of 227 places in 275 ms of which 5 ms to minimize.
[2025-06-02 20:38:50] [INFO ] Deduced a trap composed of 228 places in 267 ms of which 4 ms to minimize.
[2025-06-02 20:38:50] [INFO ] Deduced a trap composed of 224 places in 267 ms of which 4 ms to minimize.
[2025-06-02 20:38:50] [INFO ] Deduced a trap composed of 225 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:38:51] [INFO ] Deduced a trap composed of 219 places in 267 ms of which 4 ms to minimize.
[2025-06-02 20:38:51] [INFO ] Deduced a trap composed of 220 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:38:51] [INFO ] Deduced a trap composed of 226 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:38:52] [INFO ] Deduced a trap composed of 221 places in 243 ms of which 4 ms to minimize.
[2025-06-02 20:38:52] [INFO ] Deduced a trap composed of 222 places in 257 ms of which 5 ms to minimize.
[2025-06-02 20:38:53] [INFO ] Deduced a trap composed of 221 places in 263 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:38:54] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
[2025-06-02 20:38:54] [INFO ] Deduced a trap composed of 197 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:38:54] [INFO ] Deduced a trap composed of 197 places in 266 ms of which 4 ms to minimize.
[2025-06-02 20:38:54] [INFO ] Deduced a trap composed of 197 places in 262 ms of which 4 ms to minimize.
[2025-06-02 20:38:55] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:38:55] [INFO ] Deduced a trap composed of 197 places in 264 ms of which 4 ms to minimize.
[2025-06-02 20:38:55] [INFO ] Deduced a trap composed of 197 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:38:56] [INFO ] Deduced a trap composed of 197 places in 260 ms of which 5 ms to minimize.
[2025-06-02 20:38:56] [INFO ] Deduced a trap composed of 197 places in 264 ms of which 4 ms to minimize.
[2025-06-02 20:38:56] [INFO ] Deduced a trap composed of 197 places in 258 ms of which 4 ms to minimize.
[2025-06-02 20:38:57] [INFO ] Deduced a trap composed of 197 places in 269 ms of which 5 ms to minimize.
[2025-06-02 20:38:57] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:38:57] [INFO ] Deduced a trap composed of 197 places in 259 ms of which 5 ms to minimize.
[2025-06-02 20:38:58] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:38:58] [INFO ] Deduced a trap composed of 197 places in 266 ms of which 4 ms to minimize.
[2025-06-02 20:38:58] [INFO ] Deduced a trap composed of 197 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:38:59] [INFO ] Deduced a trap composed of 197 places in 263 ms of which 4 ms to minimize.
[2025-06-02 20:38:59] [INFO ] Deduced a trap composed of 197 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:38:59] [INFO ] Deduced a trap composed of 197 places in 262 ms of which 4 ms to minimize.
[2025-06-02 20:39:00] [INFO ] Deduced a trap composed of 197 places in 241 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:39:02] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 2 ms to minimize.
[2025-06-02 20:39:05] [INFO ] Deduced a trap composed of 201 places in 267 ms of which 4 ms to minimize.
[2025-06-02 20:39:05] [INFO ] Deduced a trap composed of 197 places in 257 ms of which 5 ms to minimize.
[2025-06-02 20:39:05] [INFO ] Deduced a trap composed of 197 places in 262 ms of which 4 ms to minimize.
[2025-06-02 20:39:06] [INFO ] Deduced a trap composed of 197 places in 259 ms of which 4 ms to minimize.
[2025-06-02 20:39:06] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:39:06] [INFO ] Deduced a trap composed of 201 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:39:06] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:39:07] [INFO ] Deduced a trap composed of 197 places in 269 ms of which 4 ms to minimize.
[2025-06-02 20:39:07] [INFO ] Deduced a trap composed of 201 places in 278 ms of which 4 ms to minimize.
[2025-06-02 20:39:07] [INFO ] Deduced a trap composed of 197 places in 278 ms of which 4 ms to minimize.
[2025-06-02 20:39:08] [INFO ] Deduced a trap composed of 201 places in 266 ms of which 5 ms to minimize.
[2025-06-02 20:39:08] [INFO ] Deduced a trap composed of 197 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:39:08] [INFO ] Deduced a trap composed of 201 places in 263 ms of which 4 ms to minimize.
[2025-06-02 20:39:08] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:39:09] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:39:09] [INFO ] Deduced a trap composed of 201 places in 267 ms of which 4 ms to minimize.
[2025-06-02 20:39:09] [INFO ] Deduced a trap composed of 197 places in 257 ms of which 4 ms to minimize.
[2025-06-02 20:39:10] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 4 ms to minimize.
[2025-06-02 20:39:10] [INFO ] Deduced a trap composed of 197 places in 263 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-02 20:39:12] [INFO ] Deduced a trap composed of 197 places in 264 ms of which 4 ms to minimize.
[2025-06-02 20:39:12] [INFO ] Deduced a trap composed of 197 places in 263 ms of which 4 ms to minimize.
[2025-06-02 20:39:12] [INFO ] Deduced a trap composed of 197 places in 268 ms of which 4 ms to minimize.
[2025-06-02 20:39:13] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
[2025-06-02 20:39:13] [INFO ] Deduced a trap composed of 198 places in 265 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1871 variables, and 228 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 96/96 constraints]
After SMT, in 62789ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 62802ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67660 ms. Remains : 771/771 places, 1104/1104 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-04 in 245547 ms.
[2025-06-02 20:39:15] [INFO ] Flatten gal took : 38 ms
[2025-06-02 20:39:15] [INFO ] Applying decomposition
[2025-06-02 20:39:15] [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/graph14490863279247087884.txt' '-o' '/tmp/graph14490863279247087884.bin' '-w' '/tmp/graph14490863279247087884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14490863279247087884.bin' '-l' '-1' '-v' '-w' '/tmp/graph14490863279247087884.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:39:15] [INFO ] Decomposing Gal with order
[2025-06-02 20:39:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:39:15] [INFO ] Removed a total of 1081 redundant transitions.
[2025-06-02 20:39:15] [INFO ] Flatten gal took : 183 ms
[2025-06-02 20:39:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 483 labels/synchronizations in 33 ms.
[2025-06-02 20:39:15] [INFO ] Time to serialize gal into /tmp/UpperBounds12119395799078199818.gal : 12 ms
[2025-06-02 20:39:15] [INFO ] Time to serialize properties into /tmp/UpperBounds3030640406454164427.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/UpperBounds12119395799078199818.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3030640406454164427.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds3030640406454164427.prop.
ITS-tools command line returned an error code 137
[2025-06-02 20:52:05] [INFO ] Applying decomposition
[2025-06-02 20:52:05] [INFO ] Flatten gal took : 37 ms
[2025-06-02 20:52:05] [INFO ] Decomposing Gal with order
[2025-06-02 20:52:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:52:06] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to block in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[CreatedJobs_30],[CreatedJobs_31],[CreatedJobs_32],[CreatedJobs_33],[CreatedJobs_34],[CreatedJobs_35],[CreatedJobs_36],[CreatedJobs_37],[CreatedJobs_38],[CreatedJobs_39],[CreatedJobs_40],[CreatedJobs_41],[CreatedJobs_42],[CreatedJobs_43],[CreatedJobs_44],[CreatedJobs_45],[CreatedJobs_46],[CreatedJobs_47],[CreatedJobs_48],[CreatedJobs_49],[CreatedJobs_50],[CreatedJobs_51],[CreatedJobs_52],[CreatedJobs_53],[CreatedJobs_54],[CreatedJobs_55],[CreatedJobs_56],[CreatedJobs_57],[CreatedJobs_58],[CreatedJobs_59],[CreatedJobs_60],[CreatedJobs_61],[CreatedJobs_62],[CreatedJobs_63],[CreatedJobs_64],[CreatedJobs_65],[CreatedJobs_66],[CreatedJobs_67],[CreatedJobs_68],[CreatedJobs_69],[CreatedJobs_70],[CreatedJobs_71],[CreatedJobs_72],[CreatedJobs_73],[CreatedJobs_74],[CreatedJobs_75],[CreatedJobs_76],[CreatedJobs_77],[CreatedJobs_78],[CreatedJobs_79],[CreatedJobs_80],[CreatedJobs_81],[CreatedJobs_82],[CreatedJobs_83],[CreatedJobs_84],[CreatedJobs_85],[CreatedJobs_86],[CreatedJobs_87],[CreatedJobs_88],[CreatedJobs_89],[CreatedJobs_90],[CreatedJobs_91],[CreatedJobs_92],[CreatedJobs_93],[CreatedJobs_94],[CreatedJobs_95],[CreatedJobs_96],[CreatedJobs_97],[CreatedJobs_98],[CreatedJobs_99],[CreatedJobs_100],[CreatedJobs_101],[CreatedJobs_102],[CreatedJobs_103],[CreatedJobs_104],[CreatedJobs_105],[CreatedJobs_106],[CreatedJobs_107],[CreatedJobs_108],[CreatedJobs_109],[CreatedJobs_110],[CreatedJobs_111],[CreatedJobs_112],[CreatedJobs_113],[CreatedJobs_114],[CreatedJobs_115],[CreatedJobs_116],[CreatedJobs_117],[CreatedJobs_118],[CreatedJobs_119],[CreatedJobs_120],[CreatedJobs_121],[CreatedJobs_122],[CreatedJobs_123],[CreatedJobs_124],[CreatedJobs_125],[CreatedJobs_126],[CreatedJobs_127],[CreatedJobs_128],[CreatedJobs_129],[CreatedJobs_130],[CreatedJobs_131],[CreatedJobs_132],[CreatedJobs_133],[CreatedJobs_134],[CreatedJobs_135],[CreatedJobs_136],[CreatedJobs_137],[CreatedJobs_138],[CreatedJobs_139],[CreatedJobs_140],[CreatedJobs_141],[CreatedJobs_142],[CreatedJobs_143],[CreatedJobs_144],[CreatedJobs_145],[CreatedJobs_146],[CreatedJobs_147],[CreatedJobs_148],[CreatedJobs_149],[CreatedJobs_150],[CreatedJobs_151],[CreatedJobs_152],[CreatedJobs_153],[CreatedJobs_154],[CreatedJobs_155],[CreatedJobs_156],[CreatedJobs_157],[CreatedJobs_158],[CreatedJobs_159],[CreatedJobs_160],[CreatedJobs_161],[CreatedJobs_162],[CreatedJobs_163],[CreatedJobs_164],[CreatedJobs_165],[CreatedJobs_166],[CreatedJobs_167],[CreatedJobs_168],[CreatedJobs_169],[CreatedJobs_170],[CreatedJobs_171],[CreatedJobs_172],[CreatedJobs_173],[CreatedJobs_174],[CreatedJobs_175],[CreatedJobs_176],[CreatedJobs_177],[CreatedJobs_178],[CreatedJobs_179],[CreatedJobs_180],[CreatedJobs_181],[CreatedJobs_182],[CreatedJobs_183],[CreatedJobs_184],[CreatedJobs_185],[CreatedJobs_186],[CreatedJobs_187],[CreatedJobs_188],[CreatedJobs_189],[CreatedJobs_190],[CreatedJobs_191],[CreatedJobs_192],[CreatedJobs_193],[CreatedJobs_194],[CreatedJobs_195],[CreatedJobs_196],[CreatedJobs_197],[CreatedJobs_198],[CreatedJobs_199],[CreatedJobs_200],[CreatedJobs_201],[CreatedJobs_202],[CreatedJobs_203],[CreatedJobs_204],[CreatedJobs_205],[CreatedJobs_206],[CreatedJobs_207],[CreatedJobs_208],[CreatedJobs_209],[CreatedJobs_210],[CreatedJobs_211],[CreatedJobs_212],[CreatedJobs_213],[CreatedJobs_214],[CreatedJobs_215],[CreatedJobs_216],[CreatedJobs_217],[CreatedJobs_218],[CreatedJobs_219],[CreatedJobs_220],[CreatedJobs_221],[CreatedJobs_222],[CreatedJobs_223],[CreatedJobs_224],[CreatedJobs_225],[CreatedJobs_226],[CreatedJobs_227],[CreatedJobs_228],[CreatedJobs_229],[CreatedJobs_230],[CreatedJobs_231],[CreatedJobs_232],[CreatedJobs_233],[CreatedJobs_234],[CreatedJobs_235],[CreatedJobs_236],[CreatedJobs_237],[CreatedJobs_238],[CreatedJobs_239],[CreatedJobs_240],[CreatedJobs_241],[CreatedJobs_242],[CreatedJobs_243],[CreatedJobs_244],[CreatedJobs_245],[CreatedJobs_246],[CreatedJobs_247],[CreatedJobs_248],[CreatedJobs_249],[CreatedJobs_250],[CreatedJobs_251],[CreatedJobs_252],[CreatedJobs_253],[CreatedJobs_254],[CreatedJobs_255],[CreatedJobs_256],[CreatedJobs_257],[CreatedJobs_258],[CreatedJobs_259],[CreatedJobs_260],[CreatedJobs_261],[CreatedJobs_262],[CreatedJobs_263],[CreatedJobs_264],[CreatedJobs_265],[CreatedJobs_266],[CreatedJobs_267],[CreatedJobs_268],[CreatedJobs_269],[CreatedJobs_270],[CreatedJobs_271],[CreatedJobs_272],[CreatedJobs_273],[CreatedJobs_274],[CreatedJobs_275],[CreatedJobs_276],[CreatedJobs_277],[CreatedJobs_278],[CreatedJobs_279],[CreatedJobs_280],[CreatedJobs_281],[CreatedJobs_282],[CreatedJobs_283],[CreatedJobs_284],[CreatedJobs_285],[CreatedJobs_286],[CreatedJobs_287],[CreatedJobs_288],[CreatedJobs_289],[CreatedJobs_290],[CreatedJobs_291],[CreatedJobs_292],[CreatedJobs_293],[CreatedJobs_294],[CreatedJobs_295],[CreatedJobs_296],[CreatedJobs_297],[CreatedJobs_298],[CreatedJobs_299],[CreatedJobs_300],[CreatedJobs_301],[CreatedJobs_302],[CreatedJobs_303],[CreatedJobs_304],[f3_0, f2_0, f1_0, AvailableJobId_0],[f3_1, f2_1, f1_1, AvailableJobId_1],[f3_2, f2_2, f1_2, AvailableJobId_2],[f3_3, f2_3, f1_3, AvailableJobId_3],[f3_4, f2_4, f1_4, AvailableJobId_4],[f3_5, f2_5, f1_5, AvailableJobId_5],[f3_6, f2_6, f1_6, AvailableJobId_6],[f3_7, f2_7, f1_7, AvailableJobId_7],[f3_8, f2_8, f1_8, AvailableJobId_8],[f3_9, f2_9, f1_9, AvailableJobId_9],[f3_10, f2_10, f1_10, AvailableJobId_10],[f3_11, f2_11, f1_11, AvailableJobId_11],[f3_12, f2_12, f1_12, AvailableJobId_12],[f3_13, f2_13, f1_13, AvailableJobId_13],[f3_14, f2_14, f1_14, AvailableJobId_14],[f3_15, f2_15, f1_15, AvailableJobId_15],[f3_16, f2_16, f1_16, AvailableJobId_16],[f3_17, f2_17, f1_17, AvailableJobId_17],[f3_18, f2_18, f1_18, AvailableJobId_18],[f3_19, f2_19, f1_19, AvailableJobId_19],[f3_20, f2_20, f1_20, AvailableJobId_20],[f3_21, f2_21, f1_21, AvailableJobId_21],[f3_22, f2_22, f1_22, AvailableJobId_22],[f3_23, f2_23, f1_23, AvailableJobId_23],[f3_24, f2_24, f1_24, AvailableJobId_24],[f3_25, f2_25, f1_25, AvailableJobId_25],[f3_26, f2_26, f1_26, AvailableJobId_26],[f3_27, f2_27, f1_27, AvailableJobId_27],[f3_28, f2_28, f1_28, AvailableJobId_28],[f3_29, f2_29, f1_29, AvailableJobId_29],[f3_30, f2_30, f1_30, AvailableJobId_30],[f3_31, f2_31, f1_31, AvailableJobId_31],[f3_32, f2_32, f1_32, AvailableJobId_32],[f3_33, f2_33, f1_33, AvailableJobId_33],[f3_34, f2_34, f1_34, AvailableJobId_34],[f3_35, f2_35, f1_35, AvailableJobId_35],[f3_36, f2_36, f1_36, AvailableJobId_36],[f3_37, f2_37, f1_37, AvailableJobId_37],[f3_38, f2_38, f1_38, AvailableJobId_38],[f3_39, f2_39, f1_39, AvailableJobId_39],[f3_40, f2_40, f1_40, AvailableJobId_40],[f3_41, f2_41, f1_41, AvailableJobId_41],[f3_42, f2_42, f1_42, AvailableJobId_42],[f3_43, f2_43, f1_43, AvailableJobId_43],[f3_44, f2_44, f1_44, AvailableJobId_44],[f3_45, f2_45, f1_45, AvailableJobId_45],[f3_46, f2_46, f1_46, AvailableJobId_46],[f3_47, f2_47, f1_47, AvailableJobId_47],[f3_48, f2_48, f1_48, AvailableJobId_48],[f3_49, f2_49, f1_49, AvailableJobId_49],[f3_50, f2_50, f1_50, AvailableJobId_50],[f3_51, f2_51, f1_51, AvailableJobId_51],[f3_52, f2_52, f1_52, AvailableJobId_52],[f3_53, f2_53, f1_53, AvailableJobId_53],[f3_54, f2_54, f1_54, AvailableJobId_54],[f3_55, f2_55, f1_55, AvailableJobId_55],[f3_56, f2_56, f1_56, AvailableJobId_56],[f3_57, f2_57, f1_57, AvailableJobId_57],[f3_58, f2_58, f1_58, AvailableJobId_58],[f3_59, f2_59, f1_59, AvailableJobId_59],[f3_60, f2_60, f1_60, AvailableJobId_60],[FetchJobE_0, QueueJobB_0, NotifyEventJobQueuedB_0],[FetchJobE_1, QueueJobB_1, NotifyEventJobQueuedB_1],[FetchJobE_2, QueueJobB_2, NotifyEventJobQueuedB_2],[FetchJobE_3, QueueJobB_3, NotifyEventJobQueuedB_3],[FetchJobE_4, QueueJobB_4, NotifyEventJobQueuedB_4],[FetchJobE_5, QueueJobB_5, NotifyEventJobQueuedB_5],[FetchJobE_6, QueueJobB_6, NotifyEventJobQueuedB_6],[FetchJobE_7, QueueJobB_7, NotifyEventJobQueuedB_7],[FetchJobE_8, QueueJobB_8, NotifyEventJobQueuedB_8],[FetchJobE_9, QueueJobB_9, NotifyEventJobQueuedB_9],[FetchJobE_10, QueueJobB_10, NotifyEventJobQueuedB_10],[FetchJobE_11, QueueJobB_11, NotifyEventJobQueuedB_11],[FetchJobE_12, QueueJobB_12, NotifyEventJobQueuedB_12],[FetchJobE_13, QueueJobB_13, NotifyEventJobQueuedB_13],[FetchJobE_14, QueueJobB_14, NotifyEventJobQueuedB_14],[FetchJobE_15, QueueJobB_15, NotifyEventJobQueuedB_15],[FetchJobE_16, QueueJobB_16, NotifyEventJobQueuedB_16],[FetchJobE_17, QueueJobB_17, NotifyEventJobQueuedB_17],[FetchJobE_18, QueueJobB_18, NotifyEventJobQueuedB_18],[FetchJobE_19, QueueJobB_19, NotifyEventJobQueuedB_19],[FetchJobE_20, QueueJobB_20, NotifyEventJobQueuedB_20],[FetchJobE_21, QueueJobB_21, NotifyEventJobQueuedB_21],[FetchJobE_22, QueueJobB_22, NotifyEventJobQueuedB_22],[FetchJobE_23, QueueJobB_23, NotifyEventJobQueuedB_23],[FetchJobE_24, QueueJobB_24, NotifyEventJobQueuedB_24],[FetchJobE_25, QueueJobB_25, NotifyEventJobQueuedB_25],[FetchJobE_26, QueueJobB_26, NotifyEventJobQueuedB_26],[FetchJobE_27, QueueJobB_27, NotifyEventJobQueuedB_27],[FetchJobE_28, QueueJobB_28, NotifyEventJobQueuedB_28],[FetchJobE_29, QueueJobB_29, NotifyEventJobQueuedB_29],[FetchJobE_30, QueueJobB_30, NotifyEventJobQueuedB_30],[FetchJobE_31, QueueJobB_31, NotifyEventJobQueuedB_31],[FetchJobE_32, QueueJobB_32, NotifyEventJobQueuedB_32],[FetchJobE_33, QueueJobB_33, NotifyEventJobQueuedB_33],[FetchJobE_34, QueueJobB_34, NotifyEventJobQueuedB_34],[FetchJobE_35, QueueJobB_35, NotifyEventJobQueuedB_35],[FetchJobE_36, QueueJobB_36, NotifyEventJobQueuedB_36],[FetchJobE_37, QueueJobB_37, NotifyEventJobQueuedB_37],[FetchJobE_38, QueueJobB_38, NotifyEventJobQueuedB_38],[FetchJobE_39, QueueJobB_39, NotifyEventJobQueuedB_39],[FetchJobE_40, QueueJobB_40, NotifyEventJobQueuedB_40],[FetchJobE_41, QueueJobB_41, NotifyEventJobQueuedB_41],[FetchJobE_42, QueueJobB_42, NotifyEventJobQueuedB_42],[FetchJobE_43, QueueJobB_43, NotifyEventJobQueuedB_43],[FetchJobE_44, QueueJobB_44, NotifyEventJobQueuedB_44],[FetchJobE_45, QueueJobB_45, NotifyEventJobQueuedB_45],[FetchJobE_46, QueueJobB_46, NotifyEventJobQueuedB_46],[FetchJobE_47, QueueJobB_47, NotifyEventJobQueuedB_47],[FetchJobE_48, QueueJobB_48, NotifyEventJobQueuedB_48],[FetchJobE_49, QueueJobB_49, NotifyEventJobQueuedB_49],[FetchJobE_50, QueueJobB_50, NotifyEventJobQueuedB_50],[FetchJobE_51, QueueJobB_51, NotifyEventJobQueuedB_51],[FetchJobE_52, QueueJobB_52, NotifyEventJobQueuedB_52],[FetchJobE_53, QueueJobB_53, NotifyEventJobQueuedB_53],[FetchJobE_54, QueueJobB_54, NotifyEventJobQueuedB_54],[FetchJobE_55, QueueJobB_55, NotifyEventJobQueuedB_55],[FetchJobE_56, QueueJobB_56, NotifyEventJobQueuedB_56],[FetchJobE_57, QueueJobB_57, NotifyEventJobQueuedB_57],[FetchJobE_58, QueueJobB_58, NotifyEventJobQueuedB_58],[FetchJobE_59, QueueJobB_59, NotifyEventJobQueuedB_59],[FetchJobE_60, QueueJobB_60, NotifyEventJobQueuedB_60],[place_482_0],[place_482_1],[place_482_2],[place_482_3],[place_482_4],[ModifiedSrc_0, TheSour_0],[ModifiedSrc_1, TheSour_1],[ModifiedSrc_2, TheSour_2],[ModifiedSrc_3, TheSour_3],[ModifiedSrc_4, TheSour_4],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 20:52:06] [INFO ] Flatten gal took : 37 ms
[2025-06-02 20:52:06] [INFO ] Time to serialize gal into /tmp/UpperBounds11007522436025985995.gal : 7 ms
[2025-06-02 20:52:06] [INFO ] Time to serialize properties into /tmp/UpperBounds2743138957444679027.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/UpperBounds11007522436025985995.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2743138957444679027.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/UpperBounds2743138957444679027.prop.
ITS-tools command line returned an error code 137
[2025-06-02 21:00:46] [INFO ] Flatten gal took : 37 ms
[2025-06-02 21:00:46] [INFO ] Input system was already deterministic with 1104 transitions.
[2025-06-02 21:00:46] [INFO ] Transformed 771 places.
[2025-06-02 21:00:46] [INFO ] Transformed 1104 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 21:01:16] [INFO ] Time to serialize gal into /tmp/UpperBounds14813322310543144894.gal : 11 ms
[2025-06-02 21:01:16] [INFO ] Time to serialize properties into /tmp/UpperBounds8753383325878545912.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/UpperBounds14813322310543144894.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8753383325878545912.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds8753383325878545912.prop.
ITS-tools command line returned an error code 137
Total runtime 2767153 ms.

BK_STOP 1748898608618

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBNT-COL-S05J60, 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-174881266100073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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