Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266100077.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-S10J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266100077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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-S10J40-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748896571196

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-S10J40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 20:36:12] [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:36:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:36:12] [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:36:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 20:36:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 600 ms
[2025-06-02 20:36:13] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-02 20:36:13] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2025-06-02 20:36:13] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2025-06-02 20:36:13] [INFO ] Computed 13 invariants in 18 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 10, 4, +inf, 1, 1, +inf, 3, +inf, 10, +inf, 2, +inf, 10, +inf, 1]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 20:36:13] [INFO ] Invariant cache hit.
[2025-06-02 20:36:13] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 20:36:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2025-06-02 20:36:13] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-02 20:36:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-02 20:36:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:36:13] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 20:36:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:36:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-02 20:36:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 20:36:13] [INFO ] Added : 36 causal constraints over 8 iterations in 52 ms. Result :sat
Minimization took 203 ms.
[2025-06-02 20:36:13] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:36:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:36:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:36:13] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:36:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:36:13] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:36:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:36:13] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 15 ms to minimize.
[2025-06-02 20:36:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2025-06-02 20:36:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 20:36:14] [INFO ] Added : 11 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 39 ms.
[2025-06-02 20:36:14] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 20:36:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:14] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 3 ms to minimize.
[2025-06-02 20:36:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2025-06-02 20:36:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:36:14] [INFO ] Added : 22 causal constraints over 5 iterations in 107 ms. Result :sat
Minimization took 139 ms.
[2025-06-02 20:36:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:36:14] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2025-06-02 20:36:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2025-06-02 20:36:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:36:14] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2025-06-02 20:36:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-02 20:36:14] [INFO ] Added : 36 causal constraints over 8 iterations in 151 ms. Result :sat
Minimization took 23 ms.
[2025-06-02 20:36:14] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:36:14] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:14] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2025-06-02 20:36:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:36:15] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2025-06-02 20:36:15] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2025-06-02 20:36:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2025-06-02 20:36:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 20:36:15] [INFO ] Added : 12 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 16 ms.
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 20:36:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-02 20:36:15] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2025-06-02 20:36:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2025-06-02 20:36:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:36:15] [INFO ] Added : 36 causal constraints over 8 iterations in 34 ms. Result :sat
Minimization took 21 ms.
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:36:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:15] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-06-02 20:36:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2025-06-02 20:36:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:36:15] [INFO ] Added : 22 causal constraints over 5 iterations in 174 ms. Result :sat
Minimization took 49 ms.
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 20:36:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:36:16] [INFO ] Added : 21 causal constraints over 5 iterations in 308 ms. Result :sat
Minimization took 96 ms.
[2025-06-02 20:36:16] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:16] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:36:16] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 14 ms.
[2025-06-02 20:36:16] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 20:36:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:16] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:36:16] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2025-06-02 20:36:16] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2025-06-02 20:36:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2025-06-02 20:36:16] [INFO ] Added : 20 causal constraints over 4 iterations in 195 ms. Result :sat
Minimization took 120 ms.
[2025-06-02 20:36:16] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:16] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2025-06-02 20:36:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:36:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:16] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2025-06-02 20:36:16] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2025-06-02 20:36:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2025-06-02 20:36:16] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:36:17] [INFO ] Added : 36 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 18 ms.
[2025-06-02 20:36:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 20:36:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:17] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 20:36:17] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 27 ms.
[2025-06-02 20:36:17] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:17] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:36:17] [INFO ] Added : 36 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 19 ms.
[2025-06-02 20:36:17] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 20:36:17] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2025-06-02 20:36:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 20:36:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 20:36:17] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2025-06-02 20:36:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2025-06-02 20:36:17] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 20:36:17] [INFO ] Added : 36 causal constraints over 8 iterations in 37 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 10, 4, +inf, 1, +inf, 3, 3, 10, +inf, 2, +inf, 10, +inf, 1]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-08 3 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:36:17] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 212 ms.
[2025-06-02 20:36:17] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 40 places in 32 ms
Reduce places removed 40 places and 40 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, 10, 4, +inf, 1, +inf, 3, 10, +inf, 2, +inf, 10, +inf, 1]
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, 10, 4, +inf, 1, +inf, 3, 10, +inf, 2, +inf, 10, +inf, 1]
[2025-06-02 20:36:17] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2025-06-02 20:36:17] [INFO ] Computed 112 invariants in 135 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:[164, 10, 4, 41, 1, 41, 3, 10, 52, 2, 11, 10, 11, 1]
RANDOM walk for 10000 steps (560 resets) in 255 ms. (39 steps per ms)
FORMULA PolyORBNT-COL-S10J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120008 steps (1257 resets) in 499 ms. (240 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[164, 10, 4, 41, 1, 41, 3, 10, 52, 2, 11, 11]
[2025-06-02 20:36:18] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2025-06-02 20:36:18] [INFO ] Invariant cache hit.
[2025-06-02 20:36:18] [INFO ] [Real]Absence check using 105 positive place invariants in 31 ms returned sat
[2025-06-02 20:36:18] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2025-06-02 20:36:19] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2025-06-02 20:36:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:19] [INFO ] [Nat]Absence check using 105 positive place invariants in 28 ms returned sat
[2025-06-02 20:36:19] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned sat
[2025-06-02 20:36:20] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2025-06-02 20:36:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:36:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 131 ms returned sat
[2025-06-02 20:36:20] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 251 ms.
[2025-06-02 20:36:21] [INFO ] Deduced a trap composed of 19 places in 351 ms of which 2 ms to minimize.
[2025-06-02 20:36:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 937 ms
[2025-06-02 20:36:22] [INFO ] Added : 29 causal constraints over 7 iterations in 2047 ms. Result :sat
Minimization took 651 ms.
[2025-06-02 20:36:23] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2025-06-02 20:36:23] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 28 ms returned sat
[2025-06-02 20:36:23] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2025-06-02 20:36:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:23] [INFO ] [Nat]Absence check using 105 positive place invariants in 29 ms returned sat
[2025-06-02 20:36:23] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2025-06-02 20:36:24] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2025-06-02 20:36:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 333 ms returned sat
[2025-06-02 20:36:25] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 471 ms.
[2025-06-02 20:36:25] [INFO ] Added : 7 causal constraints over 2 iterations in 773 ms. Result :sat
Minimization took 658 ms.
[2025-06-02 20:36:26] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2025-06-02 20:36:26] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2025-06-02 20:36:27] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2025-06-02 20:36:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:27] [INFO ] [Nat]Absence check using 105 positive place invariants in 30 ms returned sat
[2025-06-02 20:36:27] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned sat
[2025-06-02 20:36:27] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2025-06-02 20:36:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 230 ms returned sat
[2025-06-02 20:36:28] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 154 ms.
[2025-06-02 20:36:29] [INFO ] Added : 10 causal constraints over 2 iterations in 1312 ms. Result :unknown
[2025-06-02 20:36:29] [INFO ] [Real]Absence check using 105 positive place invariants in 38 ms returned sat
[2025-06-02 20:36:29] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 13 ms returned sat
[2025-06-02 20:36:30] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2025-06-02 20:36:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:30] [INFO ] [Nat]Absence check using 105 positive place invariants in 30 ms returned sat
[2025-06-02 20:36:30] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 12 ms returned sat
[2025-06-02 20:36:31] [INFO ] [Nat]Absence check using state equation in 763 ms returned sat
[2025-06-02 20:36:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 93 ms returned sat
[2025-06-02 20:36:31] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 176 ms.
[2025-06-02 20:36:31] [INFO ] Added : 7 causal constraints over 2 iterations in 471 ms. Result :sat
Minimization took 729 ms.
[2025-06-02 20:36:32] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2025-06-02 20:36:32] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 21 ms returned sat
[2025-06-02 20:36:33] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2025-06-02 20:36:33] [INFO ] [Real]Added 1 Read/Feed constraints in 58 ms returned sat
[2025-06-02 20:36:33] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 145 ms.
[2025-06-02 20:36:33] [INFO ] Added : 7 causal constraints over 2 iterations in 480 ms. Result :sat
Minimization took 663 ms.
[2025-06-02 20:36:34] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2025-06-02 20:36:34] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2025-06-02 20:36:35] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2025-06-02 20:36:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:35] [INFO ] [Nat]Absence check using 105 positive place invariants in 32 ms returned sat
[2025-06-02 20:36:35] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 20 ms returned sat
[2025-06-02 20:36:36] [INFO ] [Nat]Absence check using state equation in 739 ms returned sat
[2025-06-02 20:36:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 427 ms returned sat
[2025-06-02 20:36:37] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 202 ms.
[2025-06-02 20:36:38] [INFO ] Deduced a trap composed of 19 places in 358 ms of which 1 ms to minimize.
[2025-06-02 20:36:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 709 ms
[2025-06-02 20:36:38] [INFO ] Added : 22 causal constraints over 5 iterations in 1552 ms. Result :sat
Minimization took 652 ms.
[2025-06-02 20:36:39] [INFO ] [Real]Absence check using 105 positive place invariants in 30 ms returned sat
[2025-06-02 20:36:39] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned sat
[2025-06-02 20:36:39] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2025-06-02 20:36:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:40] [INFO ] [Nat]Absence check using 105 positive place invariants in 31 ms returned sat
[2025-06-02 20:36:40] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2025-06-02 20:36:40] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2025-06-02 20:36:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 133 ms returned sat
[2025-06-02 20:36:41] [INFO ] Deduced a trap composed of 415 places in 592 ms of which 12 ms to minimize.
[2025-06-02 20:36:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 747 ms
[2025-06-02 20:36:41] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 143 ms.
[2025-06-02 20:36:42] [INFO ] Added : 10 causal constraints over 2 iterations in 1303 ms. Result :unknown
[2025-06-02 20:36:42] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2025-06-02 20:36:42] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned sat
[2025-06-02 20:36:43] [INFO ] [Real]Absence check using state equation in 792 ms returned sat
[2025-06-02 20:36:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:43] [INFO ] [Nat]Absence check using 105 positive place invariants in 28 ms returned sat
[2025-06-02 20:36:43] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned sat
[2025-06-02 20:36:44] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2025-06-02 20:36:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2025-06-02 20:36:44] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 183 ms.
[2025-06-02 20:36:45] [INFO ] Added : 6 causal constraints over 2 iterations in 481 ms. Result :sat
Minimization took 658 ms.
[2025-06-02 20:36:46] [INFO ] [Real]Absence check using 105 positive place invariants in 30 ms returned sat
[2025-06-02 20:36:46] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned unsat
[2025-06-02 20:36:46] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2025-06-02 20:36:46] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned sat
[2025-06-02 20:36:46] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2025-06-02 20:36:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:46] [INFO ] [Nat]Absence check using 105 positive place invariants in 29 ms returned sat
[2025-06-02 20:36:46] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 14 ms returned sat
[2025-06-02 20:36:48] [INFO ] [Nat]Absence check using state equation in 1590 ms returned unknown
[2025-06-02 20:36:48] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2025-06-02 20:36:48] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 31 ms returned sat
[2025-06-02 20:36:49] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2025-06-02 20:36:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:49] [INFO ] [Nat]Absence check using 105 positive place invariants in 30 ms returned sat
[2025-06-02 20:36:49] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2025-06-02 20:36:49] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2025-06-02 20:36:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 170 ms returned sat
[2025-06-02 20:36:50] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 155 ms.
[2025-06-02 20:36:51] [INFO ] Deduced a trap composed of 19 places in 536 ms of which 5 ms to minimize.
[2025-06-02 20:36:52] [INFO ] Deduced a trap composed of 221 places in 471 ms of which 5 ms to minimize.
[2025-06-02 20:36:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1572 ms
[2025-06-02 20:36:52] [INFO ] Added : 27 causal constraints over 6 iterations in 2702 ms. Result :sat
Minimization took 634 ms.
[2025-06-02 20:36:53] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2025-06-02 20:36:53] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2025-06-02 20:36:54] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2025-06-02 20:36:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:36:54] [INFO ] [Nat]Absence check using 105 positive place invariants in 29 ms returned sat
[2025-06-02 20:36:54] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2025-06-02 20:36:54] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2025-06-02 20:36:55] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 20:36:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 542 ms returned sat
[2025-06-02 20:36:55] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 152 ms.
[2025-06-02 20:36:56] [INFO ] Deduced a trap composed of 19 places in 356 ms of which 2 ms to minimize.
[2025-06-02 20:36:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 608 ms
[2025-06-02 20:36:57] [INFO ] Added : 27 causal constraints over 6 iterations in 1560 ms. Result :sat
Minimization took 775 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[164, 10, 4, 41, 1, 41, 3, 10, 1, 2, 11, 11]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 1, 0, 0, 1, 0, 1, 0] Max Struct:[164, 10, 4, 41, 41, 3, 10, 2, 11, 11]
Support contains 99 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 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 844 transition count 2227
Reduce places removed 3 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 1 with 46 rules applied. Total rules applied 59 place count 841 transition count 2184
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 102 place count 798 transition count 2184
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 102 place count 798 transition count 2181
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 795 transition count 2181
Applied a total of 108 rules in 287 ms. Remains 795 /854 variables (removed 59) and now considering 2181/2230 (removed 49) transitions.
Running 2170 sub problems to find dead transitions.
[2025-06-02 20:36:58] [INFO ] Flow matrix only has 2172 transitions (discarded 9 similar events)
// Phase 1: matrix 2172 rows 795 cols
[2025-06-02 20:36:58] [INFO ] Computed 102 invariants in 72 ms
[2025-06-02 20:36:58] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/785 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 2170 unsolved
SMT process timed out in 36440ms, After SMT, problems are : Problem set: 0 solved, 2170 unsolved
Search for dead transitions found 0 dead transitions in 36482ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36798 ms. Remains : 795/854 places, 2181/2230 transitions.
[2025-06-02 20:37:34] [INFO ] Flow matrix only has 2172 transitions (discarded 9 similar events)
[2025-06-02 20:37:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 1, 0, 0, 1, 0, 1, 0] Max Struct:[164, 10, 4, 41, 41, 3, 10, 2, 11, 11]
RANDOM walk for 1000000 steps (68084 resets) in 17166 ms. (58 steps per ms)
FORMULA PolyORBNT-COL-S10J40-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 8000007 steps (62485 resets) in 23201 ms. (344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 3, 3, 1, 1, 4, 1, 1] Max Struct:[164, 10, 4, 41, 41, 10, 11, 11]
[2025-06-02 20:38:15] [INFO ] Flow matrix only has 2172 transitions (discarded 9 similar events)
[2025-06-02 20:38:15] [INFO ] Invariant cache hit.
[2025-06-02 20:38:15] [INFO ] [Real]Absence check using 96 positive place invariants in 26 ms returned sat
[2025-06-02 20:38:15] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 17 ms returned unsat
[2025-06-02 20:38:15] [INFO ] [Real]Absence check using 96 positive place invariants in 26 ms returned sat
[2025-06-02 20:38:15] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 16 ms returned sat
[2025-06-02 20:38:15] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2025-06-02 20:38:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:38:16] [INFO ] [Nat]Absence check using 96 positive place invariants in 25 ms returned sat
[2025-06-02 20:38:16] [INFO ] [Nat]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned sat
[2025-06-02 20:38:17] [INFO ] [Nat]Absence check using state equation in 909 ms returned sat
[2025-06-02 20:38:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:38:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 233 ms returned sat
[2025-06-02 20:38:17] [INFO ] Computed and/alt/rep : 1538/4934/1538 causal constraints (skipped 623 transitions) in 158 ms.
[2025-06-02 20:38:17] [INFO ] Added : 6 causal constraints over 2 iterations in 465 ms. Result :sat
Minimization took 2435 ms.
[2025-06-02 20:38:20] [INFO ] [Real]Absence check using 96 positive place invariants in 26 ms returned sat
[2025-06-02 20:38:20] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 16 ms returned sat
[2025-06-02 20:38:21] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2025-06-02 20:38:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:38:21] [INFO ] [Nat]Absence check using 96 positive place invariants in 29 ms returned sat
[2025-06-02 20:38:21] [INFO ] [Nat]Absence check using 96 positive and 6 generalized place invariants in 11 ms returned sat
[2025-06-02 20:38:21] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2025-06-02 20:38:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 364 ms returned sat
[2025-06-02 20:38:22] [INFO ] Deduced a trap composed of 140 places in 504 ms of which 4 ms to minimize.
[2025-06-02 20:38:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 646 ms
[2025-06-02 20:38:22] [INFO ] Computed and/alt/rep : 1538/4934/1538 causal constraints (skipped 623 transitions) in 155 ms.
[2025-06-02 20:38:23] [INFO ] Added : 8 causal constraints over 2 iterations in 550 ms. Result :sat
Minimization took 2927 ms.
[2025-06-02 20:38:26] [INFO ] [Real]Absence check using 96 positive place invariants in 30 ms returned sat
[2025-06-02 20:38:26] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 9 ms returned unsat
[2025-06-02 20:38:26] [INFO ] [Real]Absence check using 96 positive place invariants in 27 ms returned sat
[2025-06-02 20:38:26] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 12 ms returned unsat
[2025-06-02 20:38:26] [INFO ] [Real]Absence check using 96 positive place invariants in 25 ms returned sat
[2025-06-02 20:38:26] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 10 ms returned unsat
[2025-06-02 20:38:26] [INFO ] [Real]Absence check using 96 positive place invariants in 27 ms returned sat
[2025-06-02 20:38:26] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 14 ms returned unsat
[2025-06-02 20:38:26] [INFO ] [Real]Absence check using 96 positive place invariants in 25 ms returned sat
[2025-06-02 20:38:26] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 16 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 3, 3, 1, 1, 4, 1, 1] Max Struct:[1, 10, 4, 1, 1, 4, 1, 1]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[10, 4]
Support contains 2 out of 795 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 795/795 places, 2181/2181 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 0 place count 795 transition count 2140
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 754 transition count 2140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 753 transition count 2139
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 753 transition count 2139
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 0 with 4 rules applied. Total rules applied 88 place count 751 transition count 2137
Applied a total of 88 rules in 218 ms. Remains 751 /795 variables (removed 44) and now considering 2137/2181 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 751/795 places, 2137/2181 transitions.
[2025-06-02 20:38:27] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
// Phase 1: matrix 2128 rows 751 cols
[2025-06-02 20:38:27] [INFO ] Computed 102 invariants in 37 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3] Max Struct:[10, 4]
RANDOM walk for 1000000 steps (70455 resets) in 16042 ms. (62 steps per ms)
BEST_FIRST walk for 2000002 steps (16401 resets) in 5190 ms. (385 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[10, 4]
[2025-06-02 20:38:48] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:38:48] [INFO ] Invariant cache hit.
[2025-06-02 20:38:48] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2025-06-02 20:38:48] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2025-06-02 20:38:49] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2025-06-02 20:38:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:38:49] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2025-06-02 20:38:49] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2025-06-02 20:38:49] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2025-06-02 20:38:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:38:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 283 ms returned sat
[2025-06-02 20:38:50] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 139 ms.
[2025-06-02 20:38:50] [INFO ] Added : 5 causal constraints over 1 iterations in 339 ms. Result :sat
Minimization took 2726 ms.
[2025-06-02 20:38:53] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2025-06-02 20:38:53] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2025-06-02 20:38:54] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2025-06-02 20:38:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:38:54] [INFO ] [Nat]Absence check using 95 positive place invariants in 24 ms returned sat
[2025-06-02 20:38:54] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2025-06-02 20:38:54] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2025-06-02 20:38:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 240 ms returned sat
[2025-06-02 20:38:55] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 139 ms.
[2025-06-02 20:38:55] [INFO ] Added : 10 causal constraints over 2 iterations in 514 ms. Result :sat
Minimization took 2611 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3] Max Struct:[10, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[10, 4]
Support contains 2 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 65 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 42 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2025-06-02 20:38:58] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:38:58] [INFO ] Invariant cache hit.
[2025-06-02 20:38:59] [INFO ] Implicit Places using invariants in 719 ms returned []
[2025-06-02 20:38:59] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:38:59] [INFO ] Invariant cache hit.
[2025-06-02 20:39:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:39:03] [INFO ] Implicit Places using invariants and state equation in 4507 ms returned []
Implicit Place search using SMT with State Equation took 5238 ms to find 0 implicit places.
[2025-06-02 20:39:04] [INFO ] Redundant transitions in 181 ms returned []
Running 2126 sub problems to find dead transitions.
[2025-06-02 20:39:04] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:39:04] [INFO ] Invariant cache hit.
[2025-06-02 20:39:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 (/ 2.0 3.0))
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 (/ 1.0 3.0))
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 (/ 1.0 3.0))
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 (/ 2.0 3.0))
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 4.0)
(s260 4.0)
(s261 4.0)
(s262 4.0)
(s263 4.0)
(s264 4.0)
(s265 4.0)
(s266 4.0)
(s267 4.0)
(s268 4.0)
(s269 9.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2025-06-02 20:39:53] [INFO ] Deduced a trap composed of 18 places in 346 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 76928ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 76950ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82447 ms. Remains : 751/751 places, 2137/2137 transitions.
RANDOM walk for 40000 steps (2831 resets) in 2188 ms. (18 steps per ms) remains 4/4 properties
[2025-06-02 20:40:21] [INFO ] Flatten gal took : 604 ms
BEST_FIRST walk for 40004 steps (324 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (339 resets) in 324 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (348 resets) in 341 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (319 resets) in 290 ms. (137 steps per ms) remains 4/4 properties
[2025-06-02 20:40:22] [INFO ] Flatten gal took : 367 ms
[2025-06-02 20:40:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6112180040019036937.gal : 100 ms
[2025-06-02 20:40:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3609822079825982559.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/ReachabilityCardinality6112180040019036937.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3609822079825982559.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3609822079825982559.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
Interrupted probabilistic random walk after 246968 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 4
Probabilistic random walk after 246968 steps, saw 40859 distinct states, run finished after 3004 ms. (steps per millisecond=82 ) properties seen :0
[2025-06-02 20:40:25] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:40:25] [INFO ] Invariant cache hit.
[2025-06-02 20:40:25] [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 MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 137/147 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 593/740 variables, 92/95 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 128
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/741 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/749 variables, 5/101 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/749 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/750 variables, 1/102 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2088 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 751/751 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) 137/147 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 593/740 variables, 92/95 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/741 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/749 variables, 5/101 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/749 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/750 variables, 1/102 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 3/857 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 857 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1690 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3840ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 176 ms.
Support contains 2 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 51 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Running 2126 sub problems to find dead transitions.
[2025-06-02 20:40:29] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:40:29] [INFO ] Invariant cache hit.
[2025-06-02 20:40:29] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
SMT process timed out in 36343ms, After SMT, problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 36366ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36425 ms. Remains : 751/751 places, 2137/2137 transitions.
RANDOM walk for 40000 steps (2806 resets) in 1258 ms. (31 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (349 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (363 resets) in 240 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (287 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 274634 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 3
Probabilistic random walk after 274634 steps, saw 45064 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2025-06-02 20:41:09] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:41:09] [INFO ] Invariant cache hit.
[2025-06-02 20:41:09] [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) 137/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 593/740 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/741 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/749 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/749 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/750 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1135 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 751/751 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) 137/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 593/740 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/741 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/749 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/749 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/750 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 3/857 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 857 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1562 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2715ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 117 ms.
Support contains 2 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 41 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 41 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2025-06-02 20:41:12] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:41:12] [INFO ] Invariant cache hit.
Detected timeout of ITS tools.
[2025-06-02 20:41:12] [INFO ] Flatten gal took : 130 ms
[2025-06-02 20:41:12] [INFO ] Applying decomposition
[2025-06-02 20:41:12] [INFO ] Flatten gal took : 123 ms
[2025-06-02 20:41:12] [INFO ] Implicit Places using invariants in 705 ms returned []
[2025-06-02 20:41:12] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:41:12] [INFO ] Invariant cache hit.
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/graph13734265035047714605.txt' '-o' '/tmp/graph13734265035047714605.bin' '-w' '/tmp/graph13734265035047714605.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13734265035047714605.bin' '-l' '-1' '-v' '-w' '/tmp/graph13734265035047714605.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:41:13] [INFO ] Decomposing Gal with order
[2025-06-02 20:41:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:41:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:41:14] [INFO ] Removed a total of 4233 redundant transitions.
[2025-06-02 20:41:14] [INFO ] Flatten gal took : 498 ms
[2025-06-02 20:41:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 517 labels/synchronizations in 87 ms.
[2025-06-02 20:41:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9638690150323882968.gal : 31 ms
[2025-06-02 20:41:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2428832100133342222.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/ReachabilityCardinality9638690150323882968.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2428832100133342222.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/ReachabilityCardinality2428832100133342222.prop.
[2025-06-02 20:41:17] [INFO ] Implicit Places using invariants and state equation in 4683 ms returned []
Implicit Place search using SMT with State Equation took 5391 ms to find 0 implicit places.
[2025-06-02 20:41:17] [INFO ] Redundant transitions in 54 ms returned []
Running 2126 sub problems to find dead transitions.
[2025-06-02 20:41:17] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:41:17] [INFO ] Invariant cache hit.
[2025-06-02 20:41:17] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2049
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2049 after 5443
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5443 after 671499
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2126 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 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2025-06-02 20:42:06] [INFO ] Deduced a trap composed of 18 places in 360 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 76319ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 76339ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81835 ms. Remains : 751/751 places, 2137/2137 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 3] Max Struct:[10, 4]
Starting property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2025-06-02 20:42:34] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:42:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (722 resets) in 159 ms. (62 steps per ms)
BEST_FIRST walk for 10001 steps (92 resets) in 29 ms. (333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2025-06-02 20:42:34] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:42:34] [INFO ] Invariant cache hit.
[2025-06-02 20:42:34] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2025-06-02 20:42:34] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2025-06-02 20:42:34] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2025-06-02 20:42:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:42:34] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2025-06-02 20:42:34] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2025-06-02 20:42:35] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2025-06-02 20:42:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:42:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 278 ms returned sat
[2025-06-02 20:42:36] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 139 ms.
[2025-06-02 20:42:36] [INFO ] Added : 5 causal constraints over 1 iterations in 341 ms. Result :sat
Minimization took 644 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 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 46 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Running 2126 sub problems to find dead transitions.
[2025-06-02 20:42:36] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:42:36] [INFO ] Invariant cache hit.
[2025-06-02 20:42:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
SMT process timed out in 36098ms, After SMT, problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 36118ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36169 ms. Remains : 751/751 places, 2137/2137 transitions.
[2025-06-02 20:43:13] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:43:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (70287 resets) in 15625 ms. (63 steps per ms)
BEST_FIRST walk for 1000000 steps (8248 resets) in 2598 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2025-06-02 20:43:31] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:43:31] [INFO ] Invariant cache hit.
[2025-06-02 20:43:31] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2025-06-02 20:43:31] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2025-06-02 20:43:31] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2025-06-02 20:43:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:43:32] [INFO ] [Nat]Absence check using 95 positive place invariants in 21 ms returned sat
[2025-06-02 20:43:32] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 17 ms returned sat
[2025-06-02 20:43:32] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2025-06-02 20:43:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:43:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 276 ms returned sat
[2025-06-02 20:43:33] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 138 ms.
[2025-06-02 20:43:33] [INFO ] Added : 5 causal constraints over 1 iterations in 342 ms. Result :sat
Minimization took 3096 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 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 38 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 38 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2025-06-02 20:43:36] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:43:36] [INFO ] Invariant cache hit.
[2025-06-02 20:43:37] [INFO ] Implicit Places using invariants in 677 ms returned []
[2025-06-02 20:43:37] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:43:37] [INFO ] Invariant cache hit.
[2025-06-02 20:43:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:43:41] [INFO ] Implicit Places using invariants and state equation in 4455 ms returned []
Implicit Place search using SMT with State Equation took 5141 ms to find 0 implicit places.
[2025-06-02 20:43:41] [INFO ] Redundant transitions in 33 ms returned []
Running 2126 sub problems to find dead transitions.
[2025-06-02 20:43:41] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:43:41] [INFO ] Invariant cache hit.
[2025-06-02 20:43:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2025-06-02 20:44:31] [INFO ] Deduced a trap composed of 18 places in 357 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 77001ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 77020ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82247 ms. Remains : 751/751 places, 2137/2137 transitions.
[2025-06-02 20:44:59] [INFO ] Flatten gal took : 236 ms
[2025-06-02 20:44:59] [INFO ] Flatten gal took : 107 ms
[2025-06-02 20:44:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5019474839305217595.gal : 21 ms
[2025-06-02 20:44:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16291385344843162125.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/ReachabilityCardinality5019474839305217595.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16291385344843162125.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 (2849 resets) in 1200 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (281 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (317 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16291385344843162125.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
Interrupted probabilistic random walk after 241740 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 241740 steps, saw 39997 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2025-06-02 20:45:02] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:45:02] [INFO ] Invariant cache hit.
[2025-06-02 20:45:02] [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) 97/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 597/695 variables, 51/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/737 variables, 42/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 128
At refinement iteration 6 (INCLUDED_ONLY) 0/737 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/748 variables, 6/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/750 variables, 2/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1133 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 751/751 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) 97/98 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 597/695 variables, 51/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/737 variables, 42/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/737 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/748 variables, 6/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/750 variables, 2/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 1/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2879 variables, 0/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2879 variables, 0/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 855 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1025 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2169ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 42 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Running 2126 sub problems to find dead transitions.
[2025-06-02 20:45:04] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:45:04] [INFO ] Invariant cache hit.
[2025-06-02 20:45:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
SMT process timed out in 37274ms, After SMT, problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 37297ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37344 ms. Remains : 751/751 places, 2137/2137 transitions.
RANDOM walk for 40000 steps (2813 resets) in 882 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (338 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 296556 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 1
Probabilistic random walk after 296556 steps, saw 48484 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2025-06-02 20:45:45] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:45:45] [INFO ] Invariant cache hit.
[2025-06-02 20:45:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 97/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 597/695 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/737 variables, 42/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/737 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/748 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/750 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 0 solved, 1 unsolved in 792 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 751/751 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) 97/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 597/695 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/737 variables, 42/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/737 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/748 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/750 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 1/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2879 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2879 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 855 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1031 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1836ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 41 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 41 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2025-06-02 20:45:47] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:45:47] [INFO ] Invariant cache hit.
[2025-06-02 20:45:47] [INFO ] Implicit Places using invariants in 692 ms returned []
[2025-06-02 20:45:47] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:45:47] [INFO ] Invariant cache hit.
[2025-06-02 20:45:48] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-02 20:45:49] [INFO ] Flatten gal took : 105 ms
[2025-06-02 20:45:49] [INFO ] Applying decomposition
[2025-06-02 20:45:49] [INFO ] Flatten gal took : 104 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/graph8606960737413295629.txt' '-o' '/tmp/graph8606960737413295629.bin' '-w' '/tmp/graph8606960737413295629.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8606960737413295629.bin' '-l' '-1' '-v' '-w' '/tmp/graph8606960737413295629.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:45:49] [INFO ] Decomposing Gal with order
[2025-06-02 20:45:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:45:49] [INFO ] Removed a total of 4233 redundant transitions.
[2025-06-02 20:45:50] [INFO ] Flatten gal took : 222 ms
[2025-06-02 20:45:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 518 labels/synchronizations in 50 ms.
[2025-06-02 20:45:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14313515411847294618.gal : 13 ms
[2025-06-02 20:45:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12813711339422924671.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/ReachabilityCardinality14313515411847294618.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12813711339422924671.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12813711339422924671.prop.
[2025-06-02 20:45:52] [INFO ] Implicit Places using invariants and state equation in 4478 ms returned []
Implicit Place search using SMT with State Equation took 5184 ms to find 0 implicit places.
[2025-06-02 20:45:52] [INFO ] Redundant transitions in 33 ms returned []
Running 2126 sub problems to find dead transitions.
[2025-06-02 20:45:52] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:45:52] [INFO ] Invariant cache hit.
[2025-06-02 20:45:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Detected timeout of ITS tools.
(s365 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 (/ 2.0 3.0))
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 (/ 1.0 3.0))
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 (/ 1.0 3.0))
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 (/ 2.0 3.0))
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 4.0)
(s260 4.0)
(s261 4.0)
(s262 4.0)
(s263 4.0)
(s264 4.0)
(s265 4.0)
(s266 4.0)
(s267 4.0)
(s268 4.0)
(s269 9.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 (/ 1.0 3.0))
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0timeout
)
(s366 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2025-06-02 20:46:44] [INFO ] Deduced a trap composed of 18 places in 381 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 79199ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 79222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84492 ms. Remains : 751/751 places, 2137/2137 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Ending property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-01 in 277677 ms.
Starting property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-02
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:47:11] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2025-06-02 20:47:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (699 resets) in 161 ms. (61 steps per ms)
BEST_FIRST walk for 10001 steps (87 resets) in 29 ms. (333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2025-06-02 20:47:11] [INFO ] Flow matrix only has 2128 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 95 positive place invariants in 21 ms returned sat
[2025-06-02 20:47:12] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2025-06-02 20:47:12] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2025-06-02 20:47:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:47:12] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2025-06-02 20:47:12] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2025-06-02 20:47:13] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2025-06-02 20:47:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:47:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 238 ms returned sat
[2025-06-02 20:47:13] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 161 ms.
[2025-06-02 20:47:14] [INFO ] Added : 10 causal constraints over 2 iterations in 543 ms. Result :sat
Minimization took 1159 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 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 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 751 transition count 2136
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 750 transition count 2136
Applied a total of 2 rules in 59 ms. Remains 750 /751 variables (removed 1) and now considering 2136/2137 (removed 1) transitions.
Running 2125 sub problems to find dead transitions.
[2025-06-02 20:47:15] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
// Phase 1: matrix 2127 rows 750 cols
[2025-06-02 20:47:15] [INFO ] Computed 102 invariants in 37 ms
[2025-06-02 20:47:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
SMT process timed out in 38953ms, After SMT, problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 38975ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39040 ms. Remains : 750/751 places, 2136/2137 transitions.
[2025-06-02 20:47:54] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2025-06-02 20:47:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72584 resets) in 16507 ms. (60 steps per ms)
BEST_FIRST walk for 1000001 steps (8355 resets) in 2597 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2025-06-02 20:48:13] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2025-06-02 20:48:13] [INFO ] Invariant cache hit.
[2025-06-02 20:48:13] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2025-06-02 20:48:13] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2025-06-02 20:48:14] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2025-06-02 20:48:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:48:14] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2025-06-02 20:48:14] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2025-06-02 20:48:15] [INFO ] [Nat]Absence check using state equation in 815 ms returned sat
[2025-06-02 20:48:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:48:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 396 ms returned sat
[2025-06-02 20:48:15] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 621 transitions) in 143 ms.
[2025-06-02 20:48:16] [INFO ] Added : 5 causal constraints over 1 iterations in 342 ms. Result :sat
Minimization took 4127 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 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 39 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 750/750 places, 2136/2136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 38 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
[2025-06-02 20:48:20] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2025-06-02 20:48:20] [INFO ] Invariant cache hit.
[2025-06-02 20:48:20] [INFO ] Implicit Places using invariants in 659 ms returned []
[2025-06-02 20:48:20] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2025-06-02 20:48:20] [INFO ] Invariant cache hit.
[2025-06-02 20:48:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:48:27] [INFO ] Implicit Places using invariants and state equation in 6333 ms returned []
Implicit Place search using SMT with State Equation took 6995 ms to find 0 implicit places.
[2025-06-02 20:48:27] [INFO ] Redundant transitions in 41 ms returned []
Running 2125 sub problems to find dead transitions.
[2025-06-02 20:48:27] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2025-06-02 20:48:27] [INFO ] Invariant cache hit.
[2025-06-02 20:48:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 (/ 2.0 3.0))
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 (/ 1.0 3.0))
(s141 0.0)
(s142 0.0)
(s143 (/ 1.0 3.0))
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 (/ 2.0 3.0))
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2125/1125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
[2025-06-02 20:49:16] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/2877 variables, and 93 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1125 constraints, Known Traps: 1/1 constraints]
After SMT, in 76973ms problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 76992ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84078 ms. Remains : 750/750 places, 2136/2136 transitions.
[2025-06-02 20:49:44] [INFO ] Flatten gal took : 127 ms
[2025-06-02 20:49:44] [INFO ] Flatten gal took : 156 ms
[2025-06-02 20:49:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16417681660874142305.gal : 53 ms
[2025-06-02 20:49:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4330893089271705762.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/ReachabilityCardinality16417681660874142305.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4330893089271705762.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 (2918 resets) in 1236 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (332 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (350 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality4330893089271705762.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
Interrupted probabilistic random walk after 245353 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 2
Probabilistic random walk after 245353 steps, saw 40525 distinct states, run finished after 3002 ms. (steps per millisecond=81 ) properties seen :0
[2025-06-02 20:49:47] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2025-06-02 20:49:47] [INFO ] Invariant cache hit.
[2025-06-02 20:49: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) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 128
At refinement iteration 18 (OVERLAPS) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2877/2877 variables, and 853 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1389 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 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) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2877 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2877 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2877/2877 variables, and 855 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1400 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2804ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 38 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Running 2125 sub problems to find dead transitions.
[2025-06-02 20:49:50] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2025-06-02 20:49:50] [INFO ] Invariant cache hit.
[2025-06-02 20:49:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
SMT process timed out in 37462ms, After SMT, problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 37483ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37526 ms. Remains : 750/750 places, 2136/2136 transitions.
RANDOM walk for 40000 steps (2879 resets) in 1384 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (335 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (329 resets) in 258 ms. (154 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 269439 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 2
Probabilistic random walk after 269439 steps, saw 44257 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2025-06-02 20:50:31] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2025-06-02 20:50:31] [INFO ] Invariant cache hit.
[2025-06-02 20:50:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2877/2877 variables, and 853 constraints, problems are : Problem set: 0 solved, 2 unsolved in 979 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 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) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2877 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2877 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2877/2877 variables, and 855 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1342 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2355ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 50 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 750/750 places, 2136/2136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 39 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
[2025-06-02 20:50:34] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2025-06-02 20:50:34] [INFO ] Invariant cache hit.
Detected timeout of ITS tools.
[2025-06-02 20:50:34] [INFO ] Flatten gal took : 107 ms
[2025-06-02 20:50:34] [INFO ] Applying decomposition
[2025-06-02 20:50:35] [INFO ] Flatten gal took : 104 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/graph3121600263325472817.txt' '-o' '/tmp/graph3121600263325472817.bin' '-w' '/tmp/graph3121600263325472817.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3121600263325472817.bin' '-l' '-1' '-v' '-w' '/tmp/graph3121600263325472817.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:50:35] [INFO ] Decomposing Gal with order
[2025-06-02 20:50:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:50:35] [INFO ] Removed a total of 4555 redundant transitions.
[2025-06-02 20:50:35] [INFO ] Flatten gal took : 187 ms
[2025-06-02 20:50:35] [INFO ] Implicit Places using invariants in 1148 ms returned []
[2025-06-02 20:50:35] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2025-06-02 20:50:35] [INFO ] Invariant cache hit.
[2025-06-02 20:50:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 504 labels/synchronizations in 50 ms.
[2025-06-02 20:50:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16767268495206686192.gal : 14 ms
[2025-06-02 20:50:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16963406202906446304.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/ReachabilityCardinality16767268495206686192.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16963406202906446304.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16963406202906446304.prop.
[2025-06-02 20:50:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 20:50:42] [INFO ] Implicit Places using invariants and state equation in 6538 ms returned []
Implicit Place search using SMT with State Equation took 7699 ms to find 0 implicit places.
[2025-06-02 20:50:42] [INFO ] Redundant transitions in 34 ms returned []
Running 2125 sub problems to find dead transitions.
[2025-06-02 20:50:42] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2025-06-02 20:50:42] [INFO ] Invariant cache hit.
[2025-06-02 20:50:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Detected timeout of ITS tools.
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 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2125/1125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
[2025-06-02 20:51:31] [INFO ] Deduced a trap composed of 18 places in 301 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/2877 variables, and 93 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1125 constraints, Known Traps: 1/1 constraints]
After SMT, in 77059ms problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 77078ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84860 ms. Remains : 750/750 places, 2136/2136 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Ending property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-02 in 287609 ms.
[2025-06-02 20:51:59] [INFO ] Flatten gal took : 92 ms
[2025-06-02 20:51:59] [INFO ] Applying decomposition
[2025-06-02 20:51:59] [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/graph15156438953133960724.txt' '-o' '/tmp/graph15156438953133960724.bin' '-w' '/tmp/graph15156438953133960724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15156438953133960724.bin' '-l' '-1' '-v' '-w' '/tmp/graph15156438953133960724.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:51:59] [INFO ] Decomposing Gal with order
[2025-06-02 20:51:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:51:59] [INFO ] Removed a total of 4233 redundant transitions.
[2025-06-02 20:51:59] [INFO ] Flatten gal took : 197 ms
[2025-06-02 20:52:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 517 labels/synchronizations in 32 ms.
[2025-06-02 20:52:00] [INFO ] Time to serialize gal into /tmp/UpperBounds4021980013847948780.gal : 13 ms
[2025-06-02 20:52:00] [INFO ] Time to serialize properties into /tmp/UpperBounds6917604216986326418.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/UpperBounds4021980013847948780.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6917604216986326418.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds6917604216986326418.prop.

BK_STOP 1748897719603

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J40"
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-S10J40, 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-174881266100077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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