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-177969946400046.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-S06J04T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-smll-177969946400046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 9.1K Mar 8 15:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 8 15:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 8 15:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 8 15:08 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:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 16 08:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 8 15:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 8 15:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 8 15:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 8 15:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 16 08:44 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-S06J04T04-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779815344262

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2026-05-26 17:09:06] [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:09:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 17:09:06] [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:09:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 17:09:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1157 ms
[2026-05-26 17:09:08] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
[2026-05-26 17:09:08] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2026-05-26 17:09:08] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2026-05-26 17:09:08] [INFO ] Computed 26 invariants in 26 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 10] Max Struct:[1, 1, 1, 4, 4, 4, 4, 1, 1, 4, 1, 5, 4, 4, 4, 19]
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-26 17:09:08] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2026-05-26 17:09:08] [INFO ] Computed 26 invariants in 9 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:08] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2026-05-26 17:09:08] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 19 ms returned sat
[2026-05-26 17:09:08] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2026-05-26 17:09:08] [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:09:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2026-05-26 17:09:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 38 ms returned sat
[2026-05-26 17:09:09] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2026-05-26 17:09:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 17:09:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 15 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:09:09] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 23 ms to minimize.
[2026-05-26 17:09:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2026-05-26 17:09:09] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 17 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:09:09] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 19 ms to minimize.
[2026-05-26 17:09:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2026-05-26 17:09:09] [INFO ] Added : 35 causal constraints over 7 iterations in 385 ms. Result :sat
Minimization took 49 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:09] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:09:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:09:09] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-26 17:09:09] [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:09:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:09:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:09:10] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2026-05-26 17:09:10] [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:09:10] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 4 ms to minimize.
[2026-05-26 17:09:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2026-05-26 17:09:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 19 ms.
[2026-05-26 17:09:10] [INFO ] Added : 23 causal constraints over 5 iterations in 121 ms. Result :sat
Minimization took 59 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:10] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:09:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:09:10] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2026-05-26 17:09:10] [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:09:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2026-05-26 17:09:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:09:10] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-26 17:09:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 23 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:09:10] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 10 ms to minimize.
[2026-05-26 17:09:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2026-05-26 17:09:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-26 17:09:10] [INFO ] Added : 31 causal constraints over 7 iterations in 137 ms. Result :sat
Minimization took 52 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:11] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:09:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:09:11] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-26 17:09:11] [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:09:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:09:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 15 ms returned sat
[2026-05-26 17:09:11] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-26 17:09:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:09:11] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 7 ms to minimize.
[2026-05-26 17:09:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2026-05-26 17:09:11] [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:09:11] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:09:11] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 7 ms to minimize.
[2026-05-26 17:09:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2026-05-26 17:09:11] [INFO ] Added : 58 causal constraints over 12 iterations in 447 ms. Result :sat
Minimization took 64 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:11] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:09:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:09:12] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-26 17:09:12] [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:09:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:09:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:09:12] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-26 17:09:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 57 ms returned sat
[2026-05-26 17:09:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 29 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:09:12] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 5 ms to minimize.
[2026-05-26 17:09:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2026-05-26 17:09:12] [INFO ] Added : 57 causal constraints over 12 iterations in 301 ms. Result :sat
Minimization took 57 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:12] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2026-05-26 17:09:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:09:12] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-26 17:09:12] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:09:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-26 17:09:12] [INFO ] Added : 1 causal constraints over 1 iterations in 42 ms. Result :sat
Minimization took 54 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:12] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:09:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:09:13] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-26 17:09:13] [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:09:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:09:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:09:13] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2026-05-26 17:09:13] [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:09:13] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 10 ms to minimize.
[2026-05-26 17:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2026-05-26 17:09:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-26 17:09:13] [INFO ] Added : 54 causal constraints over 11 iterations in 207 ms. Result :sat
Minimization took 53 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:13] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:09:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:09:13] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-26 17:09:13] [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:09:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:09:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:09:13] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-26 17:09:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2026-05-26 17:09:14] [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:09:14] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 11 ms to minimize.
[2026-05-26 17:09:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2026-05-26 17:09:14] [INFO ] Added : 38 causal constraints over 8 iterations in 282 ms. Result :sat
Minimization took 42 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:14] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:09:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:09:14] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-26 17:09:14] [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:09:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:09:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:09:14] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2026-05-26 17:09:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2026-05-26 17:09:14] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-26 17:09:14] [INFO ] Added : 10 causal constraints over 3 iterations in 66 ms. Result :sat
Minimization took 53 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:14] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:09:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:09:14] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-26 17:09:14] [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:09:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:09:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:09:15] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2026-05-26 17:09:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2026-05-26 17:09:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-26 17:09:15] [INFO ] Added : 32 causal constraints over 7 iterations in 135 ms. Result :sat
Minimization took 66 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:15] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:09:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:09:15] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-26 17:09:15] [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:09:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:09:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:09:15] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-26 17:09:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2026-05-26 17:09:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:09:15] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 6 ms to minimize.
[2026-05-26 17:09:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2026-05-26 17:09:15] [INFO ] Added : 58 causal constraints over 12 iterations in 328 ms. Result :sat
Minimization took 61 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:16] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:09:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:09:16] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-26 17:09:16] [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:09:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:09:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:09:16] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-26 17:09:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 19 ms returned sat
[2026-05-26 17:09:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-26 17:09:16] [INFO ] Added : 39 causal constraints over 8 iterations in 142 ms. Result :sat
Minimization took 57 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:16] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:09:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10] Max Struct:[1, 4, 4, 4, 4, 1, 4, 1, 5, 4, 4, 4, 10]
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2026-05-26 17:09:16] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 320 ms.
[2026-05-26 17:09:16] [INFO ] Unfolded 12 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] Max Struct:[+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] Max Struct:[1, 4, 4, 4, 4, 1, 4, 1, 5, 4, 4, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 4, 4, 4, 4, 1, 4, 1, 5, 4, 4, 4]
[2026-05-26 17:09:16] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2026-05-26 17:09:17] [INFO ] Computed 50 invariants in 170 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 4, 4, 4, 4, 1, 4, 1, 5, 4, 4, 4]
RANDOM walk for 10000 steps (49 resets) in 191 ms. (52 steps per ms)
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (177 resets) in 356 ms. (224 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 1, 1, 1, 2, 1, 1] Max Struct:[4, 4, 4, 4, 4, 5, 4, 4]
[2026-05-26 17:09:17] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2026-05-26 17:09:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:17] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2026-05-26 17:09:17] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 34 ms returned sat
[2026-05-26 17:09:19] [INFO ] [Real]Absence check using state equation in 1507 ms returned sat
[2026-05-26 17:09:19] [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:09:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2026-05-26 17:09:19] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 32 ms returned sat
[2026-05-26 17:09:21] [INFO ] [Nat]Absence check using state equation in 1394 ms returned sat
[2026-05-26 17:09:21] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-26 17:09:21] [INFO ] [Nat]Added 112 Read/Feed constraints in 329 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:09:22] [INFO ] Deduced a trap composed of 85 places in 1287 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:09:24] [INFO ] Deduced a trap composed of 228 places in 1417 ms of which 236 ms to minimize.
[2026-05-26 17:09:24] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 3093 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:24] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2026-05-26 17:09:24] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 49 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:24] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2026-05-26 17:09:24] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 59 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:25] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2026-05-26 17:09:25] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 46 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:25] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2026-05-26 17:09:25] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 54 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:25] [INFO ] [Real]Absence check using 19 positive place invariants in 23 ms returned sat
[2026-05-26 17:09:25] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 39 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:25] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2026-05-26 17:09:25] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 43 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:09:25] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2026-05-26 17:09:26] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 43 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 1, 1, 1, 2, 1, 1] Max Struct:[4, 1, 1, 1, 1, 2, 1, 1]
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-04 1 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 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 1614/1614 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 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 78 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 4 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 364 transition count 1530
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 4 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 270 place count 316 transition count 1482
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 278 place count 316 transition count 1474
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 286 place count 308 transition count 1474
Applied a total of 286 rules in 583 ms. Remains 308 /454 variables (removed 146) and now considering 1474/1614 (removed 140) transitions.
Running 1468 sub problems to find dead transitions.
[2026-05-26 17:09:26] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
// Phase 1: matrix 1450 rows 308 cols
[2026-05-26 17:09:26] [INFO ] Computed 44 invariants in 59 ms
[2026-05-26 17:09:26] [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/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:09:49] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:09:49] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:09:49] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:09:50] [INFO ] Deduced a trap composed of 116 places in 1071 ms of which 54 ms to minimize.
SMT process timed out in 24106ms, After SMT, problems are : Problem set: 0 solved, 1468 unsolved
Search for dead transitions found 0 dead transitions in 24151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24795 ms. Remains : 308/454 places, 1474/1614 transitions.
[2026-05-26 17:09:51] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2026-05-26 17:09:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (11069 resets) in 10833 ms. (92 steps per ms)
BEST_FIRST walk for 1000001 steps (436 resets) in 4402 ms. (227 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2026-05-26 17:10:06] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2026-05-26 17:10:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 17:10:06] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2026-05-26 17:10:06] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 30 ms returned sat
[2026-05-26 17:10:07] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2026-05-26 17:10:07] [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:10:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2026-05-26 17:10:07] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 26 ms returned sat
[2026-05-26 17:10:08] [INFO ] [Nat]Absence check using state equation in 1127 ms returned sat
[2026-05-26 17:10:08] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-26 17:10:09] [INFO ] [Nat]Added 112 Read/Feed constraints in 721 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:10:10] [INFO ] Deduced a trap composed of 70 places in 775 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:10:11] [INFO ] Deduced a trap composed of 18 places in 837 ms of which 50 ms to minimize.
[2026-05-26 17:10:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1939 ms
[2026-05-26 17:10:11] [INFO ] Computed and/alt/rep : 1142/4554/1137 causal constraints (skipped 307 transitions) in 327 ms.
[2026-05-26 17:10:16] [INFO ] Added : 97 causal constraints over 20 iterations in 5042 ms. Result :sat
Minimization took 5242 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 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1474/1474 transitions.
Applied a total of 0 rules in 74 ms. Remains 308 /308 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 308/308 places, 1474/1474 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1474/1474 transitions.
Applied a total of 0 rules in 76 ms. Remains 308 /308 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
[2026-05-26 17:10:21] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2026-05-26 17:10:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 17:10:23] [INFO ] Implicit Places using invariants in 1603 ms returned [262, 263, 264, 265]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1615 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 304/308 places, 1474/1474 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 300 transition count 1470
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 300 transition count 1470
Applied a total of 8 rules in 81 ms. Remains 300 /304 variables (removed 4) and now considering 1470/1474 (removed 4) transitions.
[2026-05-26 17:10:23] [INFO ] Flow matrix only has 1446 transitions (discarded 24 similar events)
// Phase 1: matrix 1446 rows 300 cols
[2026-05-26 17:10:23] [INFO ] Computed 40 invariants in 55 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 17:10:25] [INFO ] Implicit Places using invariants in 1616 ms returned []
[2026-05-26 17:10:25] [INFO ] Flow matrix only has 1446 transitions (discarded 24 similar events)
[2026-05-26 17:10:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 17:10:25] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-26 17:10:33] [INFO ] Implicit Places using invariants and state equation in 7966 ms returned []
Implicit Place search using SMT with State Equation took 9590 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 300/308 places, 1470/1474 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11371 ms. Remains : 300/308 places, 1470/1474 transitions.
[2026-05-26 17:10:33] [INFO ] Flow matrix only has 1446 transitions (discarded 24 similar events)
[2026-05-26 17:10:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000001 steps (10943 resets) in 10149 ms. (98 steps per ms)
BEST_FIRST walk for 1000000 steps (473 resets) in 4548 ms. (219 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2026-05-26 17:10:47] [INFO ] Flow matrix only has 1446 transitions (discarded 24 similar events)
[2026-05-26 17:10:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 17:10:47] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-26 17:10:47] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 20 ms returned sat
[2026-05-26 17:10:48] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2026-05-26 17:10:48] [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:10:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 14 ms returned sat
[2026-05-26 17:10:49] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 34 ms returned sat
[2026-05-26 17:10:50] [INFO ] [Nat]Absence check using state equation in 1224 ms returned sat
[2026-05-26 17:10:50] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-26 17:10:51] [INFO ] [Nat]Added 112 Read/Feed constraints in 1096 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:10:52] [INFO ] Deduced a trap composed of 50 places in 939 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:10:53] [INFO ] Deduced a trap composed of 50 places in 863 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:10:54] [INFO ] Deduced a trap composed of 50 places in 771 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:10:55] [INFO ] Deduced a trap composed of 70 places in 928 ms of which 83 ms to minimize.
[2026-05-26 17:10:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4519 ms
[2026-05-26 17:10:56] [INFO ] Computed and/alt/rep : 1138/4549/1133 causal constraints (skipped 307 transitions) in 464 ms.
[2026-05-26 17:11:01] [INFO ] Added : 118 causal constraints over 24 iterations in 5721 ms. Result :sat
Minimization took 4973 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 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1470/1470 transitions.
Applied a total of 0 rules in 33 ms. Remains 300 /300 variables (removed 0) and now considering 1470/1470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 300/300 places, 1470/1470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1470/1470 transitions.
Applied a total of 0 rules in 31 ms. Remains 300 /300 variables (removed 0) and now considering 1470/1470 (removed 0) transitions.
[2026-05-26 17:11:06] [INFO ] Flow matrix only has 1446 transitions (discarded 24 similar events)
[2026-05-26 17:11:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 17:11:07] [INFO ] Implicit Places using invariants in 1266 ms returned []
[2026-05-26 17:11:07] [INFO ] Flow matrix only has 1446 transitions (discarded 24 similar events)
[2026-05-26 17:11:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 17:11:08] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-26 17:11:16] [INFO ] Implicit Places using invariants and state equation in 8313 ms returned []
Implicit Place search using SMT with State Equation took 9586 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 17:11:16] [INFO ] Redundant transitions in 167 ms returned []
Running 1464 sub problems to find dead transitions.
[2026-05-26 17:11:16] [INFO ] Flow matrix only has 1446 transitions (discarded 24 similar events)
[2026-05-26 17:11:16] [INFO ] Invariant cache hit.
[2026-05-26 17:11:16] [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/294 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:11:38] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:11:38] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:11:38] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:11:39] [INFO ] Deduced a trap composed of 116 places in 1043 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:11:40] [INFO ] Deduced a trap composed of 119 places in 1023 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:11:41] [INFO ] Deduced a trap composed of 112 places in 979 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:11:42] [INFO ] Deduced a trap composed of 34 places in 970 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:11:43] [INFO ] Deduced a trap composed of 34 places in 945 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:11:44] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:11:45] [INFO ] Deduced a trap composed of 18 places in 863 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:11:46] [INFO ] Deduced a trap composed of 35 places in 805 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:11:48] [INFO ] Deduced a trap composed of 83 places in 919 ms of which 85 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 294/1746 variables, and 46 constraints, problems are : Problem set: 0 solved, 1464 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/300 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1464/568 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:11:54] [INFO ] Deduced a trap composed of 23 places in 620 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:11:56] [INFO ] Deduced a trap composed of 114 places in 867 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:06] [INFO ] Deduced a trap composed of 86 places in 939 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:08] [INFO ] Deduced a trap composed of 70 places in 783 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:09] [INFO ] Deduced a trap composed of 11 places in 1010 ms of which 42 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 294/1746 variables, and 51 constraints, problems are : Problem set: 0 solved, 1464 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/300 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 896/568 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62983ms problems are : Problem set: 0 solved, 1464 unsolved
Search for dead transitions found 0 dead transitions in 62996ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72807 ms. Remains : 300/300 places, 1470/1470 transitions.
RANDOM walk for 40000 steps (468 resets) in 2095 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (42 resets) in 894 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (22 resets) in 629 ms. (63 steps per ms) remains 2/2 properties
[2026-05-26 17:12:20] [INFO ] Flatten gal took : 703 ms
[2026-05-26 17:12:20] [INFO ] Flatten gal took : 292 ms
[2026-05-26 17:12:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality93351145402707435.gal : 102 ms
[2026-05-26 17:12:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3392813157830395841.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/ReachabilityCardinality93351145402707435.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3392813157830395841.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 ...326
Loading property file /tmp/ReachabilityCardinality3392813157830395841.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 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 15
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :15 after 20
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :20 after 28
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :28 after 49
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :49 after 236
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :236 after 356
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :356 after 562
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :562 after 5603
Interrupted probabilistic random walk after 104375 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 2
Probabilistic random walk after 104375 steps, saw 66672 distinct states, run finished after 3012 ms. (steps per millisecond=34 ) properties seen :0
[2026-05-26 17:12:23] [INFO ] Flow matrix only has 1446 transitions (discarded 24 similar events)
[2026-05-26 17:12:23] [INFO ] Invariant cache hit.
[2026-05-26 17:12:23] [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) 80/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/116 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 169/285 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/289 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/298 variables, 6/39 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:12:24] [INFO ] Deduced a trap composed of 18 places in 550 ms of which 36 ms to minimize.
Problem MAX0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5603 after 29307
[2026-05-26 17:12:24] [INFO ] Deduced a trap composed of 50 places in 605 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:25] [INFO ] Deduced a trap composed of 50 places in 737 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:26] [INFO ] Deduced a trap composed of 70 places in 604 ms of which 36 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 4/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1446/1744 variables, 298/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1744 variables, 112/453 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1744 variables, 0/453 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1746 variables, 2/455 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1746 variables, 1/456 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1746 variables, 0/456 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1746 variables, 0/456 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1746/1746 variables, and 456 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3943 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 300/300 constraints, ReadFeed: 112/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) 80/104 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/116 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 169/285 variables, 18/29 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/289 variables, 4/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/298 variables, 6/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 3/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:27] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:27] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 2/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1744/1746 variables, and 343 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1536 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 298/300 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5504ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 95 ms.
Support contains 24 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1470/1470 transitions.
Applied a total of 0 rules in 38 ms. Remains 300 /300 variables (removed 0) and now considering 1470/1470 (removed 0) transitions.
Running 1464 sub problems to find dead transitions.
[2026-05-26 17:12:29] [INFO ] Flow matrix only has 1446 transitions (discarded 24 similar events)
[2026-05-26 17:12:29] [INFO ] Invariant cache hit.
[2026-05-26 17:12:29] [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.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :29307 after 377555
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/294 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :377555 after 5.5065e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:47] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:48] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:48] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:49] [INFO ] Deduced a trap composed of 116 places in 795 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:49] [INFO ] Deduced a trap composed of 119 places in 639 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:50] [INFO ] Deduced a trap composed of 112 places in 628 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:51] [INFO ] Deduced a trap composed of 34 places in 772 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:12:51] [INFO ] Deduced a trap composed of 34 places in 734 ms of which 61 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 294/1746 variables, and 42 constraints, problems are : Problem set: 0 solved, 1464 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/300 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1464/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1464 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :5.5065e+06 after 1.76732e+07
[2026-05-26 17:13:00] [INFO ] Deduced a trap composed of 23 places in 487 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:13:05] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2026-05-26 17:13:11] [INFO ] Flatten gal took : 128 ms
[2026-05-26 17:13:11] [INFO ] Applying decomposition
[2026-05-26 17:13:11] [INFO ] Flatten gal took : 115 ms
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/graph13030970681029304302.txt' '-o' '/tmp/graph13030970681029304302.bin' '-w' '/tmp/graph13030970681029304302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13030970681029304302.bin' '-l' '-1' '-v' '-w' '/tmp/graph13030970681029304302.weights' '-q' '0' '-e' '0.001'
[2026-05-26 17:13:12] [INFO ] Decomposing Gal with order
[2026-05-26 17:13:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 17:13:12] [INFO ] Removed a total of 635 redundant transitions.
[2026-05-26 17:13:12] [INFO ] Flatten gal took : 435 ms
[2026-05-26 17:13:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 36 ms.
[2026-05-26 17:13:13] [INFO ] Deduced a trap composed of 86 places in 2151 ms of which 53 ms to minimize.
SMT process timed out in 43958ms, After SMT, problems are : Problem set: 0 solved, 1464 unsolved
Search for dead transitions found 0 dead transitions in 43967ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44012 ms. Remains : 300/300 places, 1470/1470 transitions.
RANDOM walk for 40000 steps (438 resets) in 938 ms. (42 steps per ms) remains 1/1 properties
[2026-05-26 17:13:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17478348432411633703.gal : 67 ms
[2026-05-26 17:13:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13132296184440057187.prop : 5 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/ReachabilityCardinality17478348432411633703.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13132296184440057187.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (26 resets) in 551 ms. (72 steps per ms) remains 1/1 properties

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 ...330
Loading property file /tmp/ReachabilityCardinality13132296184440057187.prop.
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
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 22
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :22 after 39
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :39 after 121
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :121 after 230
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :230 after 353
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :353 after 756
Interrupted probabilistic random walk after 175417 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 175417 steps, saw 112809 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2026-05-26 17:13:16] [INFO ] Flow matrix only has 1446 transitions (discarded 24 similar events)
[2026-05-26 17:13:16] [INFO ] Invariant cache hit.
[2026-05-26 17:13:16] [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) 80/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/116 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 169/285 variables, 18/29 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:13:17] [INFO ] Deduced a trap composed of 23 places in 602 ms of which 40 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/289 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/298 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1446/1744 variables, 298/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1744 variables, 112/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1744 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1746 variables, 2/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1746 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1746 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1746 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1746/1746 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2211 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 300/300 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 80/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/116 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 169/285 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/289 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/298 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1 properties remain. new max is 4096
[2026-05-26 17:13:19] [INFO ] Deduced a trap composed of 50 places in 526 ms of which 41 ms to minimize.
SDD size :756 after 4452
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:13:20] [INFO ] Deduced a trap composed of 50 places in 494 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:13:20] [INFO ] Deduced a trap composed of 50 places in 536 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:13:21] [INFO ] Deduced a trap composed of 70 places in 479 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:13:21] [INFO ] Deduced a trap composed of 38 places in 606 ms of which 47 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1446/1744 variables, 298/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1744 variables, 112/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 1744/1746 variables, and 456 constraints, problems are : Problem set: 1 solved, 0 unsolved in 5554 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 298/300 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7795ms 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-S06J04T04-UpperBounds-03 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 257695 ms.

BK_STOP 1779815604473

--------------------
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-S06J04T04"
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-S06J04T04, 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-177969946400046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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