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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 19K 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 145K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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 93K 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-S10J30-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748896506182

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-S10J30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 20:35:07] [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:35:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:35:07] [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:35:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 20:35:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 594 ms
[2025-06-02 20:35:08] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-02 20:35:08] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2025-06-02 20:35:08] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2025-06-02 20:35:08] [INFO ] Computed 13 invariants in 16 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 0, 1, 0, 0, 0] Max Struct:[+inf, +inf, 1, 4, +inf, +inf, +inf, 3, 10, +inf, +inf, +inf, 1, +inf, +inf, +inf]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 20:35:08] [INFO ] Invariant cache hit.
[2025-06-02 20:35:08] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 20:35:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-02 20:35:08] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 20:35:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:35:08] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:08] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 15 ms to minimize.
[2025-06-02 20:35:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-02 20:35:08] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 20:35:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:08] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2025-06-02 20:35:08] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2025-06-02 20:35:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2025-06-02 20:35:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:35:08] [INFO ] Added : 36 causal constraints over 8 iterations in 98 ms. Result :sat
Minimization took 211 ms.
[2025-06-02 20:35:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:08] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 20:35:08] [INFO ] [Real]Added 1 Read/Feed constraints in 12 ms returned sat
[2025-06-02 20:35:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:09] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2025-06-02 20:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2025-06-02 20:35:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:35:09] [INFO ] Added : 36 causal constraints over 8 iterations in 41 ms. Result :sat
Minimization took 19 ms.
[2025-06-02 20:35:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:09] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2025-06-02 20:35:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:09] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2025-06-02 20:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2025-06-02 20:35:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:35:09] [INFO ] Added : 36 causal constraints over 8 iterations in 37 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 20:35:09] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 20:35:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:09] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2025-06-02 20:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2025-06-02 20:35:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:35:09] [INFO ] Added : 22 causal constraints over 5 iterations in 109 ms. Result :sat
Minimization took 144 ms.
[2025-06-02 20:35:09] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:35:09] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2025-06-02 20:35:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 20:35:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:09] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2025-06-02 20:35:09] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2025-06-02 20:35:10] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2025-06-02 20:35:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 87 ms
[2025-06-02 20:35:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:35:10] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2025-06-02 20:35:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2025-06-02 20:35:10] [INFO ] Added : 36 causal constraints over 8 iterations in 74 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:35:10] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[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 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:10] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2025-06-02 20:35:10] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2025-06-02 20:35:10] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2025-06-02 20:35:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 100 ms
[2025-06-02 20:35:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:35:10] [INFO ] Added : 36 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 20 ms.
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Real]Added 1 Read/Feed constraints in 2 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 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:35:10] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 13 ms.
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using state equation in 11 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 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 71 ms returned sat
[2025-06-02 20:35:10] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2025-06-02 20:35:10] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2025-06-02 20:35:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2025-06-02 20:35:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:35:10] [INFO ] Added : 21 causal constraints over 5 iterations in 27 ms. Result :sat
Minimization took 92 ms.
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Real]Added 1 Read/Feed constraints in 1 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 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 20:35:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:10] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2025-06-02 20:35:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2025-06-02 20:35:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:35:11] [INFO ] Added : 23 causal constraints over 5 iterations in 360 ms. Result :sat
Minimization took 156 ms.
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:35:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:35:11] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 15 ms.
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:35:11] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 28 ms.
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:35:11] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 17 ms.
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:11] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 20:35:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:35:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:12] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-02 20:35:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-02 20:35:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:35:12] [INFO ] Added : 36 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 21 ms.
[2025-06-02 20:35:12] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:35:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:35:12] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 20:35:12] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:35:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:35:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-02 20:35:12] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 20:35:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:35:12] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2025-06-02 20:35:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2025-06-02 20:35:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:35:12] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2025-06-02 20:35:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2025-06-02 20:35:12] [INFO ] Added : 36 causal constraints over 8 iterations in 141 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 4, +inf, +inf, +inf, 3, 10, +inf, 10, +inf, +inf, +inf, +inf]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-10 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:35:12] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 206 ms.
[2025-06-02 20:35:12] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 25 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 4, +inf, +inf, +inf, 3, 10, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 4, +inf, +inf, +inf, 3, 10, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 20:35:12] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2025-06-02 20:35:12] [INFO ] Computed 92 invariants in 120 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 31, 1, 4, 11, 11, 11, 3, 10, 31, 11, 11, 124, 31]
RANDOM walk for 10000 steps (559 resets) in 290 ms. (34 steps per ms)
FORMULA PolyORBNT-COL-S10J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130010 steps (1363 resets) in 455 ms. (285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0] Max Struct:[11, 31, 4, 11, 11, 11, 3, 10, 31, 11, 11, 124, 31]
[2025-06-02 20:35:13] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2025-06-02 20:35:13] [INFO ] Invariant cache hit.
[2025-06-02 20:35:13] [INFO ] [Real]Absence check using 85 positive place invariants in 25 ms returned sat
[2025-06-02 20:35:13] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2025-06-02 20:35:14] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2025-06-02 20:35:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:14] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2025-06-02 20:35:14] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2025-06-02 20:35:14] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2025-06-02 20:35:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:35:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 327 ms returned sat
[2025-06-02 20:35:15] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 228 ms.
[2025-06-02 20:35:16] [INFO ] Deduced a trap composed of 89 places in 445 ms of which 5 ms to minimize.
[2025-06-02 20:35:16] [INFO ] Deduced a trap composed of 232 places in 385 ms of which 4 ms to minimize.
[2025-06-02 20:35:17] [INFO ] Deduced a trap composed of 163 places in 385 ms of which 4 ms to minimize.
[2025-06-02 20:35:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1662 ms
[2025-06-02 20:35:17] [INFO ] Added : 27 causal constraints over 6 iterations in 2563 ms. Result :sat
Minimization took 670 ms.
[2025-06-02 20:35:18] [INFO ] [Real]Absence check using 85 positive place invariants in 23 ms returned sat
[2025-06-02 20:35:18] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2025-06-02 20:35:19] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2025-06-02 20:35:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:19] [INFO ] [Nat]Absence check using 85 positive place invariants in 26 ms returned sat
[2025-06-02 20:35:19] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2025-06-02 20:35:19] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2025-06-02 20:35:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 245 ms returned sat
[2025-06-02 20:35:20] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 132 ms.
[2025-06-02 20:35:21] [INFO ] Deduced a trap composed of 12 places in 510 ms of which 4 ms to minimize.
[2025-06-02 20:35:21] [INFO ] Deduced a trap composed of 19 places in 353 ms of which 3 ms to minimize.
[2025-06-02 20:35:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1222 ms
[2025-06-02 20:35:22] [INFO ] Added : 23 causal constraints over 5 iterations in 1999 ms. Result :sat
Minimization took 664 ms.
[2025-06-02 20:35:22] [INFO ] [Real]Absence check using 85 positive place invariants in 27 ms returned sat
[2025-06-02 20:35:22] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2025-06-02 20:35:23] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2025-06-02 20:35:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:23] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2025-06-02 20:35:23] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2025-06-02 20:35:24] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2025-06-02 20:35:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 77 ms returned sat
[2025-06-02 20:35:24] [INFO ] Deduced a trap composed of 282 places in 450 ms of which 3 ms to minimize.
[2025-06-02 20:35:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 828 ms
[2025-06-02 20:35:25] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 135 ms.
[2025-06-02 20:35:25] [INFO ] Added : 11 causal constraints over 3 iterations in 477 ms. Result :sat
Minimization took 932 ms.
[2025-06-02 20:35:26] [INFO ] [Real]Absence check using 85 positive place invariants in 24 ms returned sat
[2025-06-02 20:35:26] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2025-06-02 20:35:27] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2025-06-02 20:35:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:27] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2025-06-02 20:35:27] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2025-06-02 20:35:27] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2025-06-02 20:35:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 403 ms returned sat
[2025-06-02 20:35:28] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 139 ms.
[2025-06-02 20:35:29] [INFO ] Deduced a trap composed of 19 places in 484 ms of which 16 ms to minimize.
[2025-06-02 20:35:29] [INFO ] Deduced a trap composed of 256 places in 391 ms of which 3 ms to minimize.
[2025-06-02 20:35:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1248 ms
[2025-06-02 20:35:29] [INFO ] Added : 23 causal constraints over 5 iterations in 1923 ms. Result :sat
Minimization took 926 ms.
[2025-06-02 20:35:31] [INFO ] [Real]Absence check using 85 positive place invariants in 22 ms returned sat
[2025-06-02 20:35:31] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2025-06-02 20:35:31] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2025-06-02 20:35:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:31] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2025-06-02 20:35:31] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2025-06-02 20:35:32] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2025-06-02 20:35:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 145 ms returned sat
[2025-06-02 20:35:32] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 131 ms.
[2025-06-02 20:35:33] [INFO ] Deduced a trap composed of 19 places in 462 ms of which 4 ms to minimize.
[2025-06-02 20:35:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 686 ms
[2025-06-02 20:35:33] [INFO ] Added : 27 causal constraints over 6 iterations in 1478 ms. Result :sat
Minimization took 667 ms.
[2025-06-02 20:35:34] [INFO ] [Real]Absence check using 85 positive place invariants in 22 ms returned sat
[2025-06-02 20:35:34] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 6 ms returned unsat
[2025-06-02 20:35:34] [INFO ] [Real]Absence check using 85 positive place invariants in 23 ms returned sat
[2025-06-02 20:35:34] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2025-06-02 20:35:35] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2025-06-02 20:35:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:35] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2025-06-02 20:35:35] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2025-06-02 20:35:35] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2025-06-02 20:35:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 211 ms returned sat
[2025-06-02 20:35:36] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 138 ms.
[2025-06-02 20:35:37] [INFO ] Deduced a trap composed of 292 places in 463 ms of which 5 ms to minimize.
[2025-06-02 20:35:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 690 ms
[2025-06-02 20:35:37] [INFO ] Added : 11 causal constraints over 3 iterations in 1246 ms. Result :sat
Minimization took 925 ms.
[2025-06-02 20:35:38] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2025-06-02 20:35:38] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 19 ms returned sat
[2025-06-02 20:35:39] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2025-06-02 20:35:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:39] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2025-06-02 20:35:39] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-02 20:35:40] [INFO ] [Nat]Absence check using state equation in 971 ms returned sat
[2025-06-02 20:35:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 206 ms returned sat
[2025-06-02 20:35:40] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 139 ms.
[2025-06-02 20:35:40] [INFO ] Added : 3 causal constraints over 1 iterations in 329 ms. Result :sat
Minimization took 661 ms.
[2025-06-02 20:35:41] [INFO ] [Real]Absence check using 85 positive place invariants in 22 ms returned sat
[2025-06-02 20:35:41] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-02 20:35:42] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2025-06-02 20:35:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:42] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2025-06-02 20:35:42] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2025-06-02 20:35:42] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2025-06-02 20:35:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 224 ms returned sat
[2025-06-02 20:35:43] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 138 ms.
[2025-06-02 20:35:44] [INFO ] Deduced a trap composed of 19 places in 305 ms of which 1 ms to minimize.
[2025-06-02 20:35:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 567 ms
[2025-06-02 20:35:44] [INFO ] Added : 32 causal constraints over 7 iterations in 1469 ms. Result :sat
Minimization took 911 ms.
[2025-06-02 20:35:45] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2025-06-02 20:35:45] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 6 ms returned unsat
[2025-06-02 20:35:45] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2025-06-02 20:35:45] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned unsat
[2025-06-02 20:35:45] [INFO ] [Real]Absence check using 85 positive place invariants in 23 ms returned sat
[2025-06-02 20:35:45] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2025-06-02 20:35:46] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2025-06-02 20:35:46] [INFO ] [Real]Added 1 Read/Feed constraints in 58 ms returned sat
[2025-06-02 20:35:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:46] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2025-06-02 20:35:46] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-02 20:35:46] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2025-06-02 20:35:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 103 ms returned sat
[2025-06-02 20:35:47] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 137 ms.
[2025-06-02 20:35:48] [INFO ] Deduced a trap composed of 19 places in 304 ms of which 1 ms to minimize.
[2025-06-02 20:35:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 864 ms
[2025-06-02 20:35:48] [INFO ] Added : 32 causal constraints over 7 iterations in 1882 ms. Result :sat
Minimization took 920 ms.
[2025-06-02 20:35:49] [INFO ] [Real]Absence check using 85 positive place invariants in 23 ms returned sat
[2025-06-02 20:35:49] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-02 20:35:50] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2025-06-02 20:35:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:35:50] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2025-06-02 20:35:50] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-02 20:35:51] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2025-06-02 20:35:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 277 ms returned sat
[2025-06-02 20:35:51] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 132 ms.
[2025-06-02 20:35:52] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 2 ms to minimize.
[2025-06-02 20:35:52] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 847 ms
Maximisation of solution failed !
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0] Max Struct:[11, 31, 4, 11, 11, 1, 3, 10, 31, 1, 1, 124, 31]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 31, 4, 11, 11, 3, 10, 31, 124, 31]
Support contains 100 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 654 transition count 1937
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 651 transition count 1937
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 16 place count 651 transition count 1903
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 84 place count 617 transition count 1903
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 616 transition count 1902
Applied a total of 86 rules in 300 ms. Remains 616 /664 variables (removed 48) and now considering 1902/1940 (removed 38) transitions.
Running 1891 sub problems to find dead transitions.
[2025-06-02 20:35:55] [INFO ] Flow matrix only has 1893 transitions (discarded 9 similar events)
// Phase 1: matrix 1893 rows 616 cols
[2025-06-02 20:35:55] [INFO ] Computed 82 invariants in 54 ms
[2025-06-02 20:35:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 1891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 1891 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/2509 variables, and 72 constraints, problems are : Problem set: 0 solved, 1891 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 67/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/616 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1891/891 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 1891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 1891 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 4)
(s203 4)
(s204 4)
(s205 4)
(s206 4)
(s207 4)
(s208 4)
(s209 4)
(s210 4)
(s211 4)
(s212 9)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/2509 variables, and 72 constraints, problems are : Problem set: 0 solved, 1891 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 67/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/616 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/891 constraints, Known Traps: 0/0 constraints]
After SMT, in 55892ms problems are : Problem set: 0 solved, 1891 unsolved
Search for dead transitions found 0 dead transitions in 55929ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56271 ms. Remains : 616/664 places, 1902/1940 transitions.
[2025-06-02 20:36:51] [INFO ] Flow matrix only has 1893 transitions (discarded 9 similar events)
[2025-06-02 20:36:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 31, 4, 11, 11, 3, 10, 31, 124, 31]
RANDOM walk for 1000000 steps (67905 resets) in 15338 ms. (65 steps per ms)
FORMULA PolyORBNT-COL-S10J30-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 9000007 steps (79484 resets) in 24319 ms. (370 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 3, 1, 1, 3, 1, 1, 1] Max Struct:[11, 31, 4, 11, 11, 10, 31, 124, 31]
[2025-06-02 20:37:31] [INFO ] Flow matrix only has 1893 transitions (discarded 9 similar events)
[2025-06-02 20:37:31] [INFO ] Invariant cache hit.
[2025-06-02 20:37:31] [INFO ] [Real]Absence check using 76 positive place invariants in 20 ms returned sat
[2025-06-02 20:37:31] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 8 ms returned unsat
[2025-06-02 20:37:31] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2025-06-02 20:37:31] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 7 ms returned unsat
[2025-06-02 20:37:31] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2025-06-02 20:37:31] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-02 20:37:32] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2025-06-02 20:37:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:37:32] [INFO ] [Nat]Absence check using 76 positive place invariants in 20 ms returned sat
[2025-06-02 20:37:32] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-02 20:37:32] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2025-06-02 20:37:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:37:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 127 ms returned sat
[2025-06-02 20:37:33] [INFO ] Computed and/alt/rep : 1410/4676/1410 causal constraints (skipped 472 transitions) in 118 ms.
[2025-06-02 20:37:33] [INFO ] Added : 6 causal constraints over 2 iterations in 362 ms. Result :sat
Minimization took 2080 ms.
[2025-06-02 20:37:35] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2025-06-02 20:37:35] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 9 ms returned unsat
[2025-06-02 20:37:35] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2025-06-02 20:37:35] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 8 ms returned unsat
[2025-06-02 20:37:35] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2025-06-02 20:37:35] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 11 ms returned sat
[2025-06-02 20:37:36] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2025-06-02 20:37:36] [INFO ] [Real]Added 1 Read/Feed constraints in 45 ms returned sat
[2025-06-02 20:37:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:37:36] [INFO ] [Nat]Absence check using 76 positive place invariants in 19 ms returned sat
[2025-06-02 20:37:36] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 10 ms returned sat
[2025-06-02 20:37:37] [INFO ] [Nat]Absence check using state equation in 722 ms returned sat
[2025-06-02 20:37:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 139 ms returned sat
[2025-06-02 20:37:37] [INFO ] Computed and/alt/rep : 1410/4676/1410 causal constraints (skipped 472 transitions) in 121 ms.
[2025-06-02 20:37:37] [INFO ] Added : 5 causal constraints over 1 iterations in 310 ms. Result :sat
Minimization took 2051 ms.
[2025-06-02 20:37:40] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2025-06-02 20:37:40] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 8 ms returned unsat
[2025-06-02 20:37:40] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2025-06-02 20:37:40] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 8 ms returned unsat
[2025-06-02 20:37:40] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2025-06-02 20:37:40] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 3, 1, 1, 3, 1, 1, 1] Max Struct:[1, 1, 4, 1, 1, 10, 1, 1, 1]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-00 1 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 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 1902/1902 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 616 transition count 1900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 614 transition count 1900
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 4 place count 614 transition count 1869
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 66 place count 583 transition count 1869
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 581 transition count 1867
Applied a total of 70 rules in 137 ms. Remains 581 /616 variables (removed 35) and now considering 1867/1902 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 581/616 places, 1867/1902 transitions.
[2025-06-02 20:37:40] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2025-06-02 20:37:40] [INFO ] Computed 82 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3] Max Struct:[4, 10]
RANDOM walk for 1000000 steps (70653 resets) in 14207 ms. (70 steps per ms)
BEST_FIRST walk for 2000002 steps (17743 resets) in 4782 ms. (418 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[4, 10]
[2025-06-02 20:37:59] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:37:59] [INFO ] Invariant cache hit.
[2025-06-02 20:37:59] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2025-06-02 20:37:59] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 11 ms returned sat
[2025-06-02 20:37:59] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2025-06-02 20:37:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:38:00] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2025-06-02 20:38:00] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 13 ms returned sat
[2025-06-02 20:38:00] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2025-06-02 20:38:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:38:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 164 ms returned sat
[2025-06-02 20:38:00] [INFO ] Computed and/alt/rep : 1375/5196/1375 causal constraints (skipped 472 transitions) in 144 ms.
[2025-06-02 20:38:01] [INFO ] Added : 7 causal constraints over 2 iterations in 458 ms. Result :sat
Minimization took 2473 ms.
[2025-06-02 20:38:03] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2025-06-02 20:38:03] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-02 20:38:04] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2025-06-02 20:38:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:38:04] [INFO ] [Nat]Absence check using 75 positive place invariants in 16 ms returned sat
[2025-06-02 20:38:04] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-02 20:38:04] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2025-06-02 20:38:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 217 ms returned sat
[2025-06-02 20:38:05] [INFO ] Deduced a trap composed of 113 places in 411 ms of which 4 ms to minimize.
[2025-06-02 20:38:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 523 ms
[2025-06-02 20:38:05] [INFO ] Computed and/alt/rep : 1375/5196/1375 causal constraints (skipped 472 transitions) in 124 ms.
[2025-06-02 20:38:06] [INFO ] Added : 9 causal constraints over 3 iterations in 507 ms. Result :sat
Minimization took 2442 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 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1867/1867 transitions.
Applied a total of 0 rules in 65 ms. Remains 581 /581 variables (removed 0) and now considering 1867/1867 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 581/581 places, 1867/1867 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1867/1867 transitions.
Applied a total of 0 rules in 53 ms. Remains 581 /581 variables (removed 0) and now considering 1867/1867 (removed 0) transitions.
[2025-06-02 20:38:08] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:38:08] [INFO ] Invariant cache hit.
[2025-06-02 20:38:09] [INFO ] Implicit Places using invariants in 582 ms returned []
[2025-06-02 20:38:09] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:38:09] [INFO ] Invariant cache hit.
[2025-06-02 20:38:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:38:13] [INFO ] Implicit Places using invariants and state equation in 3867 ms returned []
Implicit Place search using SMT with State Equation took 4451 ms to find 0 implicit places.
[2025-06-02 20:38:13] [INFO ] Redundant transitions in 86 ms returned []
Running 1856 sub problems to find dead transitions.
[2025-06-02 20:38:13] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:38:13] [INFO ] Invariant cache hit.
[2025-06-02 20:38:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2439 variables, and 72 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2025-06-02 20:39:17] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:39:21] [INFO ] Deduced a trap composed of 95 places in 224 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 4)
(s200 4)
(s201 4)
(s202 4)
(s203 4)
(s204 4)
(s205 4)
(s206 4)
(s207 4)
(s208 4)
(s209 9)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2439 variables, and 74 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/856 constraints, Known Traps: 2/2 constraints]
After SMT, in 75497ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 75515ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80117 ms. Remains : 581/581 places, 1867/1867 transitions.
RANDOM walk for 40001 steps (2802 resets) in 2008 ms. (19 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (390 resets) in 394 ms. (101 steps per ms) remains 4/4 properties
[2025-06-02 20:39:29] [INFO ] Flatten gal took : 621 ms
BEST_FIRST walk for 40004 steps (346 resets) in 351 ms. (113 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (364 resets) in 377 ms. (105 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (384 resets) in 307 ms. (129 steps per ms) remains 4/4 properties
[2025-06-02 20:39:30] [INFO ] Flatten gal took : 291 ms
[2025-06-02 20:39:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13560422099908472898.gal : 149 ms
[2025-06-02 20:39:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1402751722631855059.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/ReachabilityCardinality13560422099908472898.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1402751722631855059.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1402751722631855059.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 16
Interrupted probabilistic random walk after 236349 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 4
Probabilistic random walk after 236349 steps, saw 39155 distinct states, run finished after 3005 ms. (steps per millisecond=78 ) properties seen :0
[2025-06-02 20:39:33] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:39:33] [INFO ] Invariant cache hit.
[2025-06-02 20:39:33] [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
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) 107/117 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 453/570 variables, 72/75 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/571 variables, 1/76 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :16 after 64
At refinement iteration 9 (OVERLAPS) 8/579 variables, 5/81 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/580 variables, 1/82 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/580 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1858/2438 variables, 580/662 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2438 variables, 1/663 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2438 variables, 0/663 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/2439 variables, 1/664 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2439 variables, 0/664 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/2439 variables, 0/664 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2439/2439 variables, and 664 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1832 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 581/581 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 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) 107/117 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 453/570 variables, 72/75 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/571 variables, 1/76 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/579 variables, 5/81 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/580 variables, 1/82 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/580 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1858/2438 variables, 580/662 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2438 variables, 1/663 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2438 variables, 1/664 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2438 variables, 0/664 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/2439 variables, 1/665 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2439 variables, 2/667 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2025-06-02 20:39:37] [INFO ] Deduced a trap composed of 104 places in 403 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2439 variables, 1/668 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2439 variables, 0/668 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/2439 variables, 0/668 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2439/2439 variables, and 668 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2843 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 581/581 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4703ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 108 ms.
Support contains 2 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1867/1867 transitions.
Applied a total of 0 rules in 38 ms. Remains 581 /581 variables (removed 0) and now considering 1867/1867 (removed 0) transitions.
Running 1856 sub problems to find dead transitions.
[2025-06-02 20:39:38] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:39:38] [INFO ] Invariant cache hit.
[2025-06-02 20:39:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :64 after 1024
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1024 after 2051
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2051 after 2056
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2056 after 2065
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2065 after 2081
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2439 variables, and 72 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2081 after 14697
Detected timeout of ITS tools.
[2025-06-02 20:40:20] [INFO ] Flatten gal took : 175 ms
[2025-06-02 20:40:20] [INFO ] Applying decomposition
[2025-06-02 20:40:20] [INFO ] Flatten gal took : 206 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/graph9248802739234706021.txt' '-o' '/tmp/graph9248802739234706021.bin' '-w' '/tmp/graph9248802739234706021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9248802739234706021.bin' '-l' '-1' '-v' '-w' '/tmp/graph9248802739234706021.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:40:21] [INFO ] Decomposing Gal with order
[2025-06-02 20:40:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:40:22] [INFO ] Removed a total of 5825 redundant transitions.
[2025-06-02 20:40:22] [INFO ] Flatten gal took : 748 ms
[2025-06-02 20:40:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 394 labels/synchronizations in 176 ms.
[2025-06-02 20:40:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8245581103991087429.gal : 90 ms
[2025-06-02 20:40:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8874221434546496993.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/ReachabilityCardinality8245581103991087429.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8874221434546496993.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/ReachabilityCardinality8874221434546496993.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1
[2025-06-02 20:40:33] [INFO ] Deduced a trap composed of 14 places in 362 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2439 variables, and 73 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/856 constraints, Known Traps: 1/1 constraints]
After SMT, in 55974ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 55994ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56040 ms. Remains : 581/581 places, 1867/1867 transitions.
RANDOM walk for 40000 steps (2854 resets) in 1317 ms. (30 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (366 resets) in 320 ms. (124 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (363 resets) in 225 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (355 resets) in 213 ms. (186 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 299557 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 3
Probabilistic random walk after 299557 steps, saw 48891 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2025-06-02 20:40:37] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:40:37] [INFO ] Invariant cache hit.
[2025-06-02 20:40:37] [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) 107/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 453/570 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/571 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/579 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/580 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/580 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1858/2438 variables, 580/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2438 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2438 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/2439 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2439 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/2439 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2439/2439 variables, and 664 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 581/581 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) 107/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 453/570 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/571 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/579 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/580 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/580 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1858/2438 variables, 580/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2438 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2438 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2438 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/2439 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2439 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 20:40:40] [INFO ] Deduced a trap composed of 104 places in 485 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2439 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2439 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/2439 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2439/2439 variables, and 668 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2423 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 581/581 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3511ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 105 ms.
Support contains 2 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1867/1867 transitions.
Applied a total of 0 rules in 32 ms. Remains 581 /581 variables (removed 0) and now considering 1867/1867 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 581/581 places, 1867/1867 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1867/1867 transitions.
Applied a total of 0 rules in 53 ms. Remains 581 /581 variables (removed 0) and now considering 1867/1867 (removed 0) transitions.
[2025-06-02 20:40:41] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:40:41] [INFO ] Invariant cache hit.
[2025-06-02 20:40:42] [INFO ] Implicit Places using invariants in 875 ms returned []
[2025-06-02 20:40:42] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:40:42] [INFO ] Invariant cache hit.
[2025-06-02 20:40:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:40:46] [INFO ] Implicit Places using invariants and state equation in 3863 ms returned []
Implicit Place search using SMT with State Equation took 4754 ms to find 0 implicit places.
[2025-06-02 20:40:46] [INFO ] Redundant transitions in 79 ms returned []
Running 1856 sub problems to find dead transitions.
[2025-06-02 20:40:46] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:40:46] [INFO ] Invariant cache hit.
[2025-06-02 20:40:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2439 variables, and 72 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2025-06-02 20:41:51] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 4 ms to minimize.
[2025-06-02 20:41:55] [INFO ] Deduced a trap composed of 95 places in 234 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2439 variables, and 74 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/856 constraints, Known Traps: 2/2 constraints]
After SMT, in 76805ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 76824ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81725 ms. Remains : 581/581 places, 1867/1867 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-S10J30-UpperBounds-03
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:42:03] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:42:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (704 resets) in 144 ms. (68 steps per ms)
BEST_FIRST walk for 10001 steps (65 resets) in 23 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2025-06-02 20:42:03] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:42:03] [INFO ] Invariant cache hit.
[2025-06-02 20:42:03] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2025-06-02 20:42:03] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 21 ms returned sat
[2025-06-02 20:42:03] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2025-06-02 20:42:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:42:03] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2025-06-02 20:42:03] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-02 20:42:04] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2025-06-02 20:42:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:42:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 164 ms returned sat
[2025-06-02 20:42:04] [INFO ] Computed and/alt/rep : 1375/5196/1375 causal constraints (skipped 472 transitions) in 119 ms.
[2025-06-02 20:42:05] [INFO ] Added : 7 causal constraints over 2 iterations in 437 ms. Result :sat
Minimization took 1131 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 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1867/1867 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 581 transition count 1866
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 580 transition count 1866
Applied a total of 2 rules in 52 ms. Remains 580 /581 variables (removed 1) and now considering 1866/1867 (removed 1) transitions.
Running 1855 sub problems to find dead transitions.
[2025-06-02 20:42:06] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2025-06-02 20:42:06] [INFO ] Computed 82 invariants in 37 ms
[2025-06-02 20:42:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2025-06-02 20:42:43] [INFO ] Deduced a trap composed of 18 places in 324 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 73 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 1/1 constraints]
After SMT, in 55720ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 55743ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55800 ms. Remains : 580/581 places, 1866/1867 transitions.
[2025-06-02 20:43:01] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2025-06-02 20:43:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72691 resets) in 14671 ms. (68 steps per ms)
BEST_FIRST walk for 1000001 steps (9043 resets) in 2432 ms. (411 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2025-06-02 20:43:19] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2025-06-02 20:43:19] [INFO ] Invariant cache hit.
[2025-06-02 20:43:19] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2025-06-02 20:43:19] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2025-06-02 20:43:19] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2025-06-02 20:43:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:43:19] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2025-06-02 20:43:19] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-02 20:43:20] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2025-06-02 20:43:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:43:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 57 ms returned sat
[2025-06-02 20:43:20] [INFO ] Deduced a trap composed of 104 places in 408 ms of which 3 ms to minimize.
[2025-06-02 20:43:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 552 ms
[2025-06-02 20:43:20] [INFO ] Computed and/alt/rep : 1375/5196/1375 causal constraints (skipped 471 transitions) in 120 ms.
[2025-06-02 20:43:21] [INFO ] Added : 10 causal constraints over 2 iterations in 516 ms. Result :sat
Minimization took 2562 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 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 29 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 28 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2025-06-02 20:43:23] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2025-06-02 20:43:23] [INFO ] Invariant cache hit.
[2025-06-02 20:43:24] [INFO ] Implicit Places using invariants in 532 ms returned []
[2025-06-02 20:43:24] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2025-06-02 20:43:24] [INFO ] Invariant cache hit.
[2025-06-02 20:43:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:43:28] [INFO ] Implicit Places using invariants and state equation in 3703 ms returned []
Implicit Place search using SMT with State Equation took 4237 ms to find 0 implicit places.
[2025-06-02 20:43:28] [INFO ] Redundant transitions in 31 ms returned []
Running 1855 sub problems to find dead transitions.
[2025-06-02 20:43:28] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2025-06-02 20:43:28] [INFO ] Invariant cache hit.
[2025-06-02 20:43:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2025-06-02 20:44:15] [INFO ] Deduced a trap composed of 18 places in 320 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 4)
(s199 4)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 6)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 73 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 1/1 constraints]
After SMT, in 75803ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 75821ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80126 ms. Remains : 580/580 places, 1866/1866 transitions.
[2025-06-02 20:44:44] [INFO ] Flatten gal took : 112 ms
[2025-06-02 20:44:44] [INFO ] Flatten gal took : 236 ms
[2025-06-02 20:44:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1604541600244574982.gal : 49 ms
[2025-06-02 20:44:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12950231395069202125.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/ReachabilityCardinality1604541600244574982.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12950231395069202125.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (2877 resets) in 1563 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (368 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (380 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12950231395069202125.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 64
Interrupted probabilistic random walk after 301769 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 2
Probabilistic random walk after 301769 steps, saw 49119 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2025-06-02 20:44:47] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2025-06-02 20:44:47] [INFO ] Invariant cache hit.
[2025-06-02 20:44:47] [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) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 2 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 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) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2437 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2437 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2437 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 665 constraints, problems are : Problem set: 0 solved, 2 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1902ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 28 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Running 1855 sub problems to find dead transitions.
[2025-06-02 20:44:49] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2025-06-02 20:44:49] [INFO ] Invariant cache hit.
[2025-06-02 20:44:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2025-06-02 20:45:27] [INFO ] Deduced a trap composed of 18 places in 352 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :64 after 1024
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1024 after 2051
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2051 after 2056
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2056 after 2065
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2065 after 2081
Detected timeout of ITS tools.
[2025-06-02 20:45:34] [INFO ] Flatten gal took : 100 ms
[2025-06-02 20:45:34] [INFO ] Applying decomposition
[2025-06-02 20:45:34] [INFO ] Flatten gal took : 94 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/graph11583937008541720843.txt' '-o' '/tmp/graph11583937008541720843.bin' '-w' '/tmp/graph11583937008541720843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11583937008541720843.bin' '-l' '-1' '-v' '-w' '/tmp/graph11583937008541720843.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:45:35] [INFO ] Decomposing Gal with order
[2025-06-02 20:45:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:45:35] [INFO ] Removed a total of 4529 redundant transitions.
[2025-06-02 20:45:35] [INFO ] Flatten gal took : 208 ms
[2025-06-02 20:45:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 417 labels/synchronizations in 49 ms.
[2025-06-02 20:45:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9548422940452904655.gal : 82 ms
[2025-06-02 20:45:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10951278882377081950.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/ReachabilityCardinality9548422940452904655.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10951278882377081950.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/ReachabilityCardinality10951278882377081950.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 73 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 1/1 constraints]
After SMT, in 55712ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 55729ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55761 ms. Remains : 580/580 places, 1866/1866 transitions.
RANDOM walk for 40000 steps (2905 resets) in 849 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (350 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (356 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 296681 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 2
Probabilistic random walk after 296681 steps, saw 48389 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2025-06-02 20:45:48] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2025-06-02 20:45:48] [INFO ] Invariant cache hit.
[2025-06-02 20:45:48] [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) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 2 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 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) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2437 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2437 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2437 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 665 constraints, problems are : Problem set: 0 solved, 2 unsolved in 936 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1886ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 28 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 28 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2025-06-02 20:45:50] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2025-06-02 20:45:50] [INFO ] Invariant cache hit.
[2025-06-02 20:45:51] [INFO ] Implicit Places using invariants in 535 ms returned []
[2025-06-02 20:45:51] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2025-06-02 20:45:51] [INFO ] Invariant cache hit.
[2025-06-02 20:45:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:45:55] [INFO ] Implicit Places using invariants and state equation in 3698 ms returned []
Implicit Place search using SMT with State Equation took 4246 ms to find 0 implicit places.
[2025-06-02 20:45:55] [INFO ] Redundant transitions in 30 ms returned []
Running 1855 sub problems to find dead transitions.
[2025-06-02 20:45:55] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2025-06-02 20:45:55] [INFO ] Invariant cache hit.
[2025-06-02 20:45:55] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2025-06-02 20:46:42] [INFO ] Deduced a trap composed of 18 places in 325 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 73 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 1/1 constraints]
After SMT, in 75958ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 75975ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80292 ms. Remains : 580/580 places, 1866/1866 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Ending property specific reduction for PolyORBNT-COL-S10J30-UpperBounds-03 in 308014 ms.
Starting property specific reduction for PolyORBNT-COL-S10J30-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2025-06-02 20:47:11] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2025-06-02 20:47:11] [INFO ] Computed 82 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (696 resets) in 150 ms. (66 steps per ms)
BEST_FIRST walk for 10001 steps (97 resets) in 28 ms. (344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2025-06-02 20:47:11] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:47:11] [INFO ] Invariant cache hit.
[2025-06-02 20:47:11] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2025-06-02 20:47:11] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-02 20:47:11] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2025-06-02 20:47:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:47:11] [INFO ] [Nat]Absence check using 75 positive place invariants in 18 ms returned sat
[2025-06-02 20:47:12] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-02 20:47:12] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2025-06-02 20:47:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:47:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 232 ms returned sat
[2025-06-02 20:47:13] [INFO ] Deduced a trap composed of 113 places in 449 ms of which 3 ms to minimize.
[2025-06-02 20:47:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 572 ms
[2025-06-02 20:47:13] [INFO ] Computed and/alt/rep : 1375/5196/1375 causal constraints (skipped 472 transitions) in 139 ms.
[2025-06-02 20:47:13] [INFO ] Added : 9 causal constraints over 3 iterations in 532 ms. Result :sat
Minimization took 648 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 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1867/1867 transitions.
Applied a total of 0 rules in 37 ms. Remains 581 /581 variables (removed 0) and now considering 1867/1867 (removed 0) transitions.
Running 1856 sub problems to find dead transitions.
[2025-06-02 20:47:14] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:47:14] [INFO ] Invariant cache hit.
[2025-06-02 20:47:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2439 variables, and 72 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2025-06-02 20:48:08] [INFO ] Deduced a trap composed of 14 places in 240 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 571/2439 variables, and 73 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/856 constraints, Known Traps: 1/1 constraints]
After SMT, in 55695ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 55712ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55753 ms. Remains : 581/581 places, 1867/1867 transitions.
[2025-06-02 20:48:10] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:48:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (70434 resets) in 14370 ms. (69 steps per ms)
BEST_FIRST walk for 1000001 steps (8884 resets) in 2407 ms. (415 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2025-06-02 20:48:27] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:48:27] [INFO ] Invariant cache hit.
[2025-06-02 20:48:27] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2025-06-02 20:48:27] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-02 20:48:27] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2025-06-02 20:48:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:48:27] [INFO ] [Nat]Absence check using 75 positive place invariants in 16 ms returned sat
[2025-06-02 20:48:27] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-02 20:48:28] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2025-06-02 20:48:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:48:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 229 ms returned sat
[2025-06-02 20:48:29] [INFO ] Deduced a trap composed of 113 places in 449 ms of which 4 ms to minimize.
[2025-06-02 20:48:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 569 ms
[2025-06-02 20:48:29] [INFO ] Computed and/alt/rep : 1375/5196/1375 causal constraints (skipped 472 transitions) in 141 ms.
[2025-06-02 20:48:29] [INFO ] Added : 9 causal constraints over 3 iterations in 519 ms. Result :sat
Minimization took 2572 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 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1867/1867 transitions.
Applied a total of 0 rules in 32 ms. Remains 581 /581 variables (removed 0) and now considering 1867/1867 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 581/581 places, 1867/1867 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1867/1867 transitions.
Applied a total of 0 rules in 31 ms. Remains 581 /581 variables (removed 0) and now considering 1867/1867 (removed 0) transitions.
[2025-06-02 20:48:32] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:48:32] [INFO ] Invariant cache hit.
[2025-06-02 20:48:32] [INFO ] Implicit Places using invariants in 554 ms returned []
[2025-06-02 20:48:32] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:48:32] [INFO ] Invariant cache hit.
[2025-06-02 20:48:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:48:36] [INFO ] Implicit Places using invariants and state equation in 3853 ms returned []
Implicit Place search using SMT with State Equation took 4410 ms to find 0 implicit places.
[2025-06-02 20:48:36] [INFO ] Redundant transitions in 34 ms returned []
Running 1856 sub problems to find dead transitions.
[2025-06-02 20:48:36] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:48:36] [INFO ] Invariant cache hit.
[2025-06-02 20:48:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2439 variables, and 72 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2025-06-02 20:49:42] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:49:47] [INFO ] Deduced a trap composed of 95 places in 236 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2439 variables, and 74 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/856 constraints, Known Traps: 2/2 constraints]
After SMT, in 78274ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 78294ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82778 ms. Remains : 581/581 places, 1867/1867 transitions.
[2025-06-02 20:49:55] [INFO ] Flatten gal took : 119 ms
[2025-06-02 20:49:55] [INFO ] Flatten gal took : 90 ms
[2025-06-02 20:49:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5550556904560261066.gal : 29 ms
[2025-06-02 20:49:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1574615755000514116.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/ReachabilityCardinality5550556904560261066.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1574615755000514116.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
RANDOM walk for 40000 steps (2734 resets) in 1252 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (344 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (365 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality1574615755000514116.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 64
Interrupted probabilistic random walk after 245804 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 2
Probabilistic random walk after 245804 steps, saw 40604 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2025-06-02 20:49:58] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:49:58] [INFO ] Invariant cache hit.
[2025-06-02 20:49:58] [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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 457/535 variables, 41/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/567 variables, 32/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/578 variables, 6/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/580 variables, 2/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1858/2438 variables, 580/662 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2438 variables, 1/663 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2438 variables, 0/663 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2439 variables, 1/664 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2439 variables, 0/664 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2439 variables, 0/664 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2439/2439 variables, and 664 constraints, problems are : Problem set: 1 solved, 1 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 581/581 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 457/535 variables, 41/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/567 variables, 32/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/578 variables, 6/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/580 variables, 2/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1858/2438 variables, 580/662 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2438 variables, 1/663 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2438 variables, 1/664 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2438 variables, 0/664 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2439/2439 variables, and 665 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2049 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 581/581 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2814ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1867/1867 transitions.
Applied a total of 0 rules in 45 ms. Remains 581 /581 variables (removed 0) and now considering 1867/1867 (removed 0) transitions.
Running 1856 sub problems to find dead transitions.
[2025-06-02 20:50:01] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:50:01] [INFO ] Invariant cache hit.
[2025-06-02 20:50:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
SDD proceeding with computation,2 properties remain. new max is 16
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 571/2439 variables, and 72 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
SDD size :64 after 1024
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1024 after 2051
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2051 after 2056
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2056 after 2065
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2065 after 2081
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2081 after 14697
Detected timeout of ITS tools.
[2025-06-02 20:50:45] [INFO ] Flatten gal took : 89 ms
[2025-06-02 20:50:45] [INFO ] Applying decomposition
[2025-06-02 20:50:45] [INFO ] Flatten gal took : 85 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/graph7339044256350267840.txt' '-o' '/tmp/graph7339044256350267840.bin' '-w' '/tmp/graph7339044256350267840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7339044256350267840.bin' '-l' '-1' '-v' '-w' '/tmp/graph7339044256350267840.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:50:45] [INFO ] Decomposing Gal with order
[2025-06-02 20:50:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:50:46] [INFO ] Removed a total of 4529 redundant transitions.
[2025-06-02 20:50:46] [INFO ] Flatten gal took : 165 ms
[2025-06-02 20:50:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 415 labels/synchronizations in 28 ms.
[2025-06-02 20:50:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9127673202895094386.gal : 12 ms
[2025-06-02 20:50:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8490632459726255487.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/ReachabilityCardinality9127673202895094386.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8490632459726255487.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/ReachabilityCardinality8490632459726255487.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 2.12519e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.12519e+06 after 2.1252e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.1252e+06 after 2.1252e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.1252e+06 after 3.43989e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.43989e+06 after 3.43991e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.43991e+06 after 3.43996e+06
[2025-06-02 20:50:56] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.43996e+06 after 4.31975e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2439 variables, and 73 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/856 constraints, Known Traps: 1/1 constraints]
After SMT, in 56897ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 56914ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56963 ms. Remains : 581/581 places, 1867/1867 transitions.
RANDOM walk for 40000 steps (2848 resets) in 707 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (346 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 353322 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 353322 steps, saw 57134 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2025-06-02 20:51:01] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:51:01] [INFO ] Invariant cache hit.
[2025-06-02 20:51:01] [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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 457/535 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/567 variables, 32/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/578 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/580 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1858/2438 variables, 580/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2438 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2438 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2439 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2439 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2439 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2439/2439 variables, and 664 constraints, problems are : Problem set: 0 solved, 1 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 581/581 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 457/535 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/567 variables, 32/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/578 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/580 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1858/2438 variables, 580/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2438 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2438 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2438 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.31975e+06 after 5.01546e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.01546e+06 after 5.01759e+06
After SMT solving in domain Int declared 2439/2439 variables, and 665 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6806 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 581/581 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 7469ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1867/1867 transitions.
Applied a total of 0 rules in 30 ms. Remains 581 /581 variables (removed 0) and now considering 1867/1867 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 581/581 places, 1867/1867 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1867/1867 transitions.
Applied a total of 0 rules in 30 ms. Remains 581 /581 variables (removed 0) and now considering 1867/1867 (removed 0) transitions.
[2025-06-02 20:51:09] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:51:09] [INFO ] Invariant cache hit.
[2025-06-02 20:51:09] [INFO ] Implicit Places using invariants in 569 ms returned []
[2025-06-02 20:51:09] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:51:09] [INFO ] Invariant cache hit.
[2025-06-02 20:51:10] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.01759e+06 after 5.02564e+06
[2025-06-02 20:51:13] [INFO ] Implicit Places using invariants and state equation in 3791 ms returned []
Implicit Place search using SMT with State Equation took 4377 ms to find 0 implicit places.
[2025-06-02 20:51:13] [INFO ] Redundant transitions in 27 ms returned []
Running 1856 sub problems to find dead transitions.
[2025-06-02 20:51:13] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2025-06-02 20:51:13] [INFO ] Invariant cache hit.
[2025-06-02 20:51:13] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2439 variables, and 72 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2025-06-02 20:52:18] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:52:22] [INFO ] Deduced a trap composed of 95 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2439 variables, and 74 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/856 constraints, Known Traps: 2/2 constraints]
After SMT, in 76661ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 76678ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81123 ms. Remains : 581/581 places, 1867/1867 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Ending property specific reduction for PolyORBNT-COL-S10J30-UpperBounds-08 in 319341 ms.
[2025-06-02 20:52:30] [INFO ] Flatten gal took : 84 ms
[2025-06-02 20:52:30] [INFO ] Applying decomposition
[2025-06-02 20:52:30] [INFO ] Flatten gal took : 84 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/graph11769072935302666259.txt' '-o' '/tmp/graph11769072935302666259.bin' '-w' '/tmp/graph11769072935302666259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11769072935302666259.bin' '-l' '-1' '-v' '-w' '/tmp/graph11769072935302666259.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:52:30] [INFO ] Decomposing Gal with order
[2025-06-02 20:52:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:52:30] [INFO ] Removed a total of 4222 redundant transitions.
[2025-06-02 20:52:31] [INFO ] Flatten gal took : 153 ms
[2025-06-02 20:52:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 421 labels/synchronizations in 24 ms.
[2025-06-02 20:52:31] [INFO ] Time to serialize gal into /tmp/UpperBounds819905333175544436.gal : 12 ms
[2025-06-02 20:52:31] [INFO ] Time to serialize properties into /tmp/UpperBounds7816861576254580731.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/UpperBounds819905333175544436.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7816861576254580731.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 ...282
Loading property file /tmp/UpperBounds7816861576254580731.prop.
ITS-tools command line returned an error code 137
[2025-06-02 20:56:53] [INFO ] Applying decomposition
[2025-06-02 20:56:53] [INFO ] Flatten gal took : 84 ms
[2025-06-02 20:56:53] [INFO ] Decomposing Gal with order
[2025-06-02 20:56:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:56:53] [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],[CreatedJobs_305],[CreatedJobs_306],[CreatedJobs_307],[CreatedJobs_308],[CreatedJobs_309],[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],[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],[place_482_0],[place_482_1],[place_482_2],[place_482_3],[place_482_4],[place_482_5],[place_482_6],[place_482_7],[place_482_8],[place_482_9],[ModifiedSrc_0, TheSour_0],[ModifiedSrc_1, TheSour_1],[ModifiedSrc_2, TheSour_2],[ModifiedSrc_3, TheSour_3],[ModifiedSrc_4, TheSour_4],[ModifiedSrc_5, TheSour_5],[ModifiedSrc_6, TheSour_6],[ModifiedSrc_7, TheSour_7],[ModifiedSrc_8, TheSour_8],[ModifiedSrc_9, TheSour_9],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 20:56:53] [INFO ] Flatten gal took : 86 ms
[2025-06-02 20:56:53] [INFO ] Time to serialize gal into /tmp/UpperBounds8243101634152626422.gal : 12 ms
[2025-06-02 20:56:53] [INFO ] Time to serialize properties into /tmp/UpperBounds5550592135968119847.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/UpperBounds8243101634152626422.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5550592135968119847.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 ...304
Loading property file /tmp/UpperBounds5550592135968119847.prop.
ITS-tools command line returned an error code 137
[2025-06-02 21:03:16] [INFO ] Flatten gal took : 85 ms
[2025-06-02 21:03:17] [INFO ] Input system was already deterministic with 1867 transitions.
[2025-06-02 21:03:17] [INFO ] Transformed 581 places.
[2025-06-02 21:03:17] [INFO ] Transformed 1867 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:03:47] [INFO ] Time to serialize gal into /tmp/UpperBounds15062158142389842147.gal : 13 ms
[2025-06-02 21:03:47] [INFO ] Time to serialize properties into /tmp/UpperBounds2265683762272903199.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/UpperBounds15062158142389842147.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2265683762272903199.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/UpperBounds2265683762272903199.prop.
ITS-tools command line returned an error code 137
Total runtime 2075905 ms.

BK_STOP 1748898583491

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-S10J30"
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-S10J30, 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-174881266100076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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