Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r223-smll-177969946400049.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is PolyORBLF-COL-S06J06T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-smll-177969946400049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 6.5K Mar 8 15:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 8 15:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 8 15:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 8 15:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Mar 16 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 16 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 16 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 8 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Mar 8 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 8 15:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Mar 8 15:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 16 08:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 154K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779815676279

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2026-05-26 17:14:38] [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]
[2026-05-26 17:14:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 17:14:38] [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.
[2026-05-26 17:14:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 17:14:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1417 ms
[2026-05-26 17:14:40] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 506 PT places and 7196.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
[2026-05-26 17:14:40] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 8 ms.
[2026-05-26 17:14:40] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2026-05-26 17:14:40] [INFO ] Computed 26 invariants in 13 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0] Max Struct:[3, 6, 4, 10, 3, 36, 1, 4, 1, 4, 40, 6, 6, 4, 4, 4]
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-26 17:14:40] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2026-05-26 17:14:40] [INFO ] Computed 26 invariants in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:40] [INFO ] [Real]Absence check using 11 positive place invariants in 22 ms returned sat
[2026-05-26 17:14:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 20 ms returned sat
[2026-05-26 17:14:41] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2026-05-26 17:14:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2026-05-26 17:14:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:14:41] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2026-05-26 17:14:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 17:14:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2026-05-26 17:14:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 17 ms.
[2026-05-26 17:14:42] [INFO ] Added : 57 causal constraints over 12 iterations in 451 ms. Result :sat
Minimization took 270 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:42] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:14:42] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:14:42] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-26 17:14:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:14:42] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2026-05-26 17:14:42] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2026-05-26 17:14:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2026-05-26 17:14:42] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 14 ms.
[2026-05-26 17:14:42] [INFO ] Added : 7 causal constraints over 2 iterations in 63 ms. Result :sat
Minimization took 48 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:42] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:14:42] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:14:42] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-26 17:14:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:14:42] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 17 ms returned sat
[2026-05-26 17:14:43] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-26 17:14:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2026-05-26 17:14:43] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:14:43] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 22 ms to minimize.
[2026-05-26 17:14:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2026-05-26 17:14:43] [INFO ] Added : 58 causal constraints over 12 iterations in 397 ms. Result :sat
Minimization took 60 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:43] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:14:43] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:14:43] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-26 17:14:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:14:43] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:14:43] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-26 17:14:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2026-05-26 17:14:43] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-26 17:14:43] [INFO ] Added : 3 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:43] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:14:43] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:14:43] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2026-05-26 17:14:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:14:44] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:14:44] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2026-05-26 17:14:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2026-05-26 17:14:44] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-26 17:14:44] [INFO ] Added : 54 causal constraints over 11 iterations in 172 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:44] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:14:44] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:14:44] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-26 17:14:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:14:44] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:14:44] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-26 17:14:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2026-05-26 17:14:44] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:14:44] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 10 ms to minimize.
[2026-05-26 17:14:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2026-05-26 17:14:44] [INFO ] Added : 35 causal constraints over 7 iterations in 205 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:44] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:14:44] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:14:44] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:14:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:14:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:14:45] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-26 17:14:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2026-05-26 17:14:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-26 17:14:45] [INFO ] Added : 3 causal constraints over 1 iterations in 37 ms. Result :sat
Minimization took 40 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:45] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:14:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2026-05-26 17:14:45] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:14:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:14:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:14:45] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-26 17:14:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:14:45] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 7 ms to minimize.
[2026-05-26 17:14:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2026-05-26 17:14:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-26 17:14:45] [INFO ] Added : 52 causal constraints over 11 iterations in 220 ms. Result :sat
Minimization took 56 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-26 17:14:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2026-05-26 17:14:45] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-26 17:14:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-26 17:14:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2026-05-26 17:14:46] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-26 17:14:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2026-05-26 17:14:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:14:46] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 12 ms to minimize.
[2026-05-26 17:14:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2026-05-26 17:14:46] [INFO ] Added : 57 causal constraints over 12 iterations in 219 ms. Result :sat
Minimization took 37 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:46] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-26 17:14:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2026-05-26 17:14:46] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2026-05-26 17:14:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-26 17:14:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2026-05-26 17:14:46] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2026-05-26 17:14:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2026-05-26 17:14:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-26 17:14:46] [INFO ] Added : 28 causal constraints over 6 iterations in 83 ms. Result :sat
Minimization took 59 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:46] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-26 17:14:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:14:46] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2026-05-26 17:14:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:14:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:14:46] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2026-05-26 17:14:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:14:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 16 ms.
[2026-05-26 17:14:47] [INFO ] Added : 54 causal constraints over 11 iterations in 161 ms. Result :sat
Minimization took 66 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:47] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:14:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:14:47] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2026-05-26 17:14:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:14:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:14:47] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2026-05-26 17:14:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:14:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-26 17:14:47] [INFO ] Added : 3 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:47] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:14:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:14:47] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-26 17:14:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:14:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:14:47] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-26 17:14:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2026-05-26 17:14:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:14:47] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 5 ms to minimize.
[2026-05-26 17:14:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2026-05-26 17:14:48] [INFO ] Added : 36 causal constraints over 8 iterations in 190 ms. Result :sat
Minimization took 59 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:48] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:14:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:14:48] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-26 17:14:48] [INFO ] [Real]Added 8 Read/Feed constraints in 8 ms returned sat
[2026-05-26 17:14:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-26 17:14:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:14:48] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-26 17:14:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:14:48] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
[2026-05-26 17:14:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:48] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:14:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2026-05-26 17:14:48] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:14:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-26 17:14:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:14:48] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2026-05-26 17:14:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:14:48] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 4 ms to minimize.
[2026-05-26 17:14:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2026-05-26 17:14:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-26 17:14:48] [INFO ] Added : 23 causal constraints over 5 iterations in 80 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0] Max Struct:[3, 6, 4, 3, 36, 1, 4, 1, 4, 40, 6, 6, 4, 3, 4]
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2026-05-26 17:14:49] [INFO ] Unfolded HLPN to a Petri net with 506 places and 7154 transitions 59824 arcs in 288 ms.
[2026-05-26 17:14:49] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 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:[3, 6, 4, 3, 36, 1, 4, 1, 4, 40, 6, 6, 4, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[3, 6, 4, 3, 36, 1, 4, 1, 4, 40, 6, 6, 4, 4]
[2026-05-26 17:14:49] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2026-05-26 17:14:49] [INFO ] Computed 54 invariants in 168 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:[3, 6, 4, 3, 36, 1, 4, 1, 4, 40, 6, 6, 4, 4]
RANDOM walk for 10000 steps (50 resets) in 202 ms. (49 steps per ms)
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90005 steps (160 resets) in 587 ms. (153 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 4, 1, 4, 4, 4, 1, 2] Max Struct:[6, 4, 36, 4, 40, 6, 6, 4, 4]
[2026-05-26 17:14:50] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2026-05-26 17:14:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:50] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2026-05-26 17:14:50] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 36 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:50] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2026-05-26 17:14:50] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 36 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:50] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2026-05-26 17:14:50] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 36 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:50] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2026-05-26 17:14:50] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 35 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:51] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned sat
[2026-05-26 17:14:51] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 34 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:51] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2026-05-26 17:14:51] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 42 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:51] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2026-05-26 17:14:51] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 37 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:51] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2026-05-26 17:14:51] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 37 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:51] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2026-05-26 17:14:51] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 37 ms returned sat
[2026-05-26 17:14:52] [INFO ] [Real]Absence check using state equation in 1074 ms returned sat
[2026-05-26 17:14:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:14:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2026-05-26 17:14:53] [INFO ] [Nat]Absence check using 17 positive and 37 generalized place invariants in 48 ms returned sat
[2026-05-26 17:14:54] [INFO ] [Nat]Absence check using state equation in 1568 ms returned sat
[2026-05-26 17:14:54] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-26 17:14:55] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 17:14:55] [INFO ] [Nat]Added 112 Read/Feed constraints in 1016 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 4, 1, 4, 4, 4, 1, 2] Max Struct:[2, 1, 4, 1, 4, 4, 4, 1, 4]
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 24 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 500 transition count 1738
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 464 transition count 1738
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 78 place count 464 transition count 1682
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 190 place count 408 transition count 1682
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 286 place count 360 transition count 1634
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 294 place count 360 transition count 1626
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 302 place count 352 transition count 1626
Applied a total of 302 rules in 365 ms. Remains 352 /506 variables (removed 154) and now considering 1626/1774 (removed 148) transitions.
Running 1620 sub problems to find dead transitions.
[2026-05-26 17:14:56] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
// Phase 1: matrix 1602 rows 352 cols
[2026-05-26 17:14:56] [INFO ] Computed 48 invariants in 61 ms
[2026-05-26 17:14:56] [INFO ] State equation strengthened by 112 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:15:19] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:15:19] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:15:19] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 5 ms to minimize.
SMT process timed out in 23551ms, After SMT, problems are : Problem set: 0 solved, 1620 unsolved
Search for dead transitions found 0 dead transitions in 23602ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24000 ms. Remains : 352/506 places, 1626/1774 transitions.
[2026-05-26 17:15:19] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
[2026-05-26 17:15:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (9918 resets) in 10110 ms. (98 steps per ms)
BEST_FIRST walk for 1000001 steps (429 resets) in 3859 ms. (259 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2026-05-26 17:15:33] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
[2026-05-26 17:15:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 17:15:33] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2026-05-26 17:15:33] [INFO ] [Real]Absence check using 18 positive and 30 generalized place invariants in 21 ms returned sat
[2026-05-26 17:15:35] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2026-05-26 17:15:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 17:15:35] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2026-05-26 17:15:35] [INFO ] [Nat]Absence check using 18 positive and 30 generalized place invariants in 25 ms returned sat
[2026-05-26 17:15:36] [INFO ] [Nat]Absence check using state equation in 1008 ms returned sat
[2026-05-26 17:15:36] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-26 17:15:36] [INFO ] [Nat]Added 112 Read/Feed constraints in 460 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:15:37] [INFO ] Deduced a trap composed of 78 places in 889 ms of which 55 ms to minimize.
[2026-05-26 17:15:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1144 ms
[2026-05-26 17:15:38] [INFO ] Computed and/alt/rep : 1190/4818/1185 causal constraints (skipped 411 transitions) in 306 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:15:41] [INFO ] Deduced a trap composed of 18 places in 600 ms of which 35 ms to minimize.
[2026-05-26 17:15:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 826 ms
[2026-05-26 17:15:41] [INFO ] Added : 84 causal constraints over 17 iterations in 4054 ms. Result :sat
Minimization took 6898 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 24 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1626/1626 transitions.
Applied a total of 0 rules in 56 ms. Remains 352 /352 variables (removed 0) and now considering 1626/1626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 352/352 places, 1626/1626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1626/1626 transitions.
Applied a total of 0 rules in 81 ms. Remains 352 /352 variables (removed 0) and now considering 1626/1626 (removed 0) transitions.
[2026-05-26 17:15:48] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
[2026-05-26 17:15:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 17:15:50] [INFO ] Implicit Places using invariants in 2012 ms returned [306, 307, 308, 309]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2025 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 348/352 places, 1626/1626 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 344 transition count 1622
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 344 transition count 1622
Applied a total of 8 rules in 107 ms. Remains 344 /348 variables (removed 4) and now considering 1622/1626 (removed 4) transitions.
[2026-05-26 17:15:51] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
// Phase 1: matrix 1598 rows 344 cols
[2026-05-26 17:15:51] [INFO ] Computed 44 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 17:15:52] [INFO ] Implicit Places using invariants in 1846 ms returned []
[2026-05-26 17:15:52] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-26 17:15:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 17:15:53] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-26 17:16:01] [INFO ] Implicit Places using invariants and state equation in 8229 ms returned []
Implicit Place search using SMT with State Equation took 10082 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 344/352 places, 1622/1626 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12301 ms. Remains : 344/352 places, 1622/1626 transitions.
[2026-05-26 17:16:01] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-26 17:16:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (9754 resets) in 9718 ms. (102 steps per ms)
BEST_FIRST walk for 1000000 steps (366 resets) in 3882 ms. (257 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2026-05-26 17:16:14] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-26 17:16:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 17:16:14] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2026-05-26 17:16:14] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 24 ms returned sat
[2026-05-26 17:16:15] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2026-05-26 17:16:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 17:16:15] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2026-05-26 17:16:15] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 24 ms returned sat
[2026-05-26 17:16:16] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2026-05-26 17:16:16] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-26 17:16:17] [INFO ] [Nat]Added 112 Read/Feed constraints in 777 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:16:18] [INFO ] Deduced a trap composed of 78 places in 625 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:16:18] [INFO ] Deduced a trap composed of 18 places in 527 ms of which 34 ms to minimize.
[2026-05-26 17:16:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1485 ms
[2026-05-26 17:16:19] [INFO ] Computed and/alt/rep : 1186/4813/1181 causal constraints (skipped 411 transitions) in 350 ms.
[2026-05-26 17:16:26] [INFO ] Added : 132 causal constraints over 27 iterations in 7704 ms. Result :sat
Minimization took 5014 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1622/1622 transitions.
Applied a total of 0 rules in 39 ms. Remains 344 /344 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 344/344 places, 1622/1622 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1622/1622 transitions.
Applied a total of 0 rules in 34 ms. Remains 344 /344 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
[2026-05-26 17:16:31] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-26 17:16:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 17:16:33] [INFO ] Implicit Places using invariants in 1725 ms returned []
[2026-05-26 17:16:33] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-26 17:16:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 17:16:34] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-26 17:16:41] [INFO ] Implicit Places using invariants and state equation in 8163 ms returned []
Implicit Place search using SMT with State Equation took 9893 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 17:16:41] [INFO ] Redundant transitions in 159 ms returned []
Running 1616 sub problems to find dead transitions.
[2026-05-26 17:16:41] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-26 17:16:41] [INFO ] Invariant cache hit.
[2026-05-26 17:16:41] [INFO ] State equation strengthened by 112 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:04] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:04] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:04] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:05] [INFO ] Deduced a trap composed of 132 places in 911 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:06] [INFO ] Deduced a trap composed of 135 places in 926 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:07] [INFO ] Deduced a trap composed of 128 places in 900 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:08] [INFO ] Deduced a trap composed of 36 places in 876 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:09] [INFO ] Deduced a trap composed of 36 places in 865 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:09] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:11] [INFO ] Deduced a trap composed of 18 places in 871 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:11] [INFO ] Deduced a trap composed of 35 places in 778 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:14] [INFO ] Deduced a trap composed of 78 places in 724 ms of which 39 ms to minimize.
SMT process timed out in 32835ms, After SMT, problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 32844ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42958 ms. Remains : 344/344 places, 1622/1622 transitions.
RANDOM walk for 40000 steps (366 resets) in 1926 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (35 resets) in 593 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (29 resets) in 483 ms. (82 steps per ms) remains 2/2 properties
[2026-05-26 17:17:15] [INFO ] Flatten gal took : 635 ms
[2026-05-26 17:17:16] [INFO ] Flatten gal took : 382 ms
[2026-05-26 17:17:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7057706496332012208.gal : 129 ms
[2026-05-26 17:17:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9328420505864537760.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7057706496332012208.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9328420505864537760.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9328420505864537760.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 22
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :22 after 31
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :31 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 67
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :67 after 329
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :329 after 1444
Interrupted probabilistic random walk after 97703 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 2
Probabilistic random walk after 97703 steps, saw 64183 distinct states, run finished after 3006 ms. (steps per millisecond=32 ) properties seen :0
[2026-05-26 17:17:18] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-26 17:17:18] [INFO ] Invariant cache hit.
[2026-05-26 17:17:18] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 90/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/130 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1444 after 3832
At refinement iteration 5 (OVERLAPS) 200/330 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/334 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/342 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:19] [INFO ] Deduced a trap composed of 18 places in 750 ms of which 39 ms to minimize.
Problem MAX0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:20] [INFO ] Deduced a trap composed of 56 places in 219 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:20] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:20] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 4/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3832 after 28053
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1940/1942 variables, and 389 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3179 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 342/344 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/114 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/130 variables, 8/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/330 variables, 20/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/334 variables, 4/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/342 variables, 6/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 2/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1940/1942 variables, and 389 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1516 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 342/344 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4758ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 108 ms.
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1622/1622 transitions.
Applied a total of 0 rules in 35 ms. Remains 344 /344 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
Running 1616 sub problems to find dead transitions.
[2026-05-26 17:17:23] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-26 17:17:23] [INFO ] Invariant cache hit.
[2026-05-26 17:17:23] [INFO ] State equation strengthened by 112 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,2 properties remain. new max is 8192
Excessive predecessor constraint size, skipping predecessor.
SDD size :28053 after 108547
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :108547 after 390104
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:41] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:42] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:42] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:42] [INFO ] Deduced a trap composed of 132 places in 744 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:43] [INFO ] Deduced a trap composed of 135 places in 748 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:44] [INFO ] Deduced a trap composed of 128 places in 749 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:45] [INFO ] Deduced a trap composed of 36 places in 730 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:46] [INFO ] Deduced a trap composed of 36 places in 739 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:17:46] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 338/1942 variables, and 47 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 20081 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/344 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1616/720 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :390104 after 2.35067e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:18:01] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 11 ms to minimize.
Detected timeout of ITS tools.
[2026-05-26 17:18:06] [INFO ] Flatten gal took : 122 ms
[2026-05-26 17:18:06] [INFO ] Applying decomposition
[2026-05-26 17:18:06] [INFO ] Flatten gal took : 112 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 338/1942 variables, and 48 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/344 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 896/720 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43165ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 43174ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43216 ms. Remains : 344/344 places, 1622/1622 transitions.
RANDOM walk for 40000 steps (403 resets) in 808 ms. (49 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (19 resets) in 391 ms. (102 steps per ms) remains 1/1 properties
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph900429967108151484.txt' '-o' '/tmp/graph900429967108151484.bin' '-w' '/tmp/graph900429967108151484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph900429967108151484.bin' '-l' '-1' '-v' '-w' '/tmp/graph900429967108151484.weights' '-q' '0' '-e' '0.001'
[2026-05-26 17:18:07] [INFO ] Decomposing Gal with order
[2026-05-26 17:18:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 17:18:08] [INFO ] Removed a total of 702 redundant transitions.
[2026-05-26 17:18:08] [INFO ] Flatten gal took : 435 ms
[2026-05-26 17:18:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 60 ms.
[2026-05-26 17:18:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12622774365338706330.gal : 62 ms
[2026-05-26 17:18:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5123879055576455902.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12622774365338706330.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5123879055576455902.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5123879055576455902.prop.
Interrupted probabilistic random walk after 170545 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 170545 steps, saw 112932 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2026-05-26 17:18:10] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2026-05-26 17:18:10] [INFO ] Invariant cache hit.
[2026-05-26 17:18:10] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/130 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 8
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 16
At refinement iteration 5 (OVERLAPS) 200/330 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 27
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/334 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/342 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :27 after 59
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :59 after 125
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :125 after 217
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :217 after 461
At refinement iteration 11 (OVERLAPS) 1598/1940 variables, 342/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1940 variables, 112/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1940 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1942 variables, 2/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1942 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1942 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1942 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1942/1942 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1876 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 344/344 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/130 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/330 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:18:12] [INFO ] Deduced a trap composed of 28 places in 644 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:18:13] [INFO ] Deduced a trap composed of 38 places in 513 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:18:13] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1 properties remain. new max is 2048
[2026-05-26 17:18:13] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 4 ms to minimize.
SDD size :461 after 1795
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/334 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/342 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1598/1940 variables, 342/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1940 variables, 112/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 1940/1942 variables, and 502 constraints, problems are : Problem set: 1 solved, 0 unsolved in 3695 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 342/344 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5611ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-15 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 217119 ms.

BK_STOP 1779815895880

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S06J06T04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is PolyORBLF-COL-S06J06T04, 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 r223-smll-177969946400049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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