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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.3K Mar 8 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 8 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 8 15:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 8 15:04 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:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 16 08:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 16 08:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 16 08:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 8 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 8 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 8 15:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 8 15:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 16 08:43 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-S04J04T10-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S04J04T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779815076029

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2026-05-26 17:04:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 17:04:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 17:04:39] [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:04:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 17:04:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1583 ms
[2026-05-26 17:04:40] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 870 PT places and 5136.0 transition bindings in 57 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
[2026-05-26 17:04:40] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 12 ms.
[2026-05-26 17:04:40] [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:04:40] [INFO ] Computed 26 invariants in 21 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0] Max Struct:[2, 10, 10, 10, 4, 1, 3, 30, 4, 10, 4, 182, 10, 5, 1, 4]
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-26 17:04:40] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2026-05-26 17:04:40] [INFO ] Computed 26 invariants in 8 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:41] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2026-05-26 17:04:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 22 ms returned sat
[2026-05-26 17:04:41] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2026-05-26 17:04:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2026-05-26 17:04:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 15 ms returned sat
[2026-05-26 17:04:41] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2026-05-26 17:04:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 17:04:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2026-05-26 17:04:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 17 ms.
[2026-05-26 17:04:42] [INFO ] Added : 30 causal constraints over 7 iterations in 261 ms. Result :sat
Minimization took 114 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:42] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2026-05-26 17:04:42] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:04:42] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2026-05-26 17:04:42] [INFO ] [Real]Added 8 Read/Feed constraints in 10 ms returned sat
[2026-05-26 17:04:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2026-05-26 17:04:42] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:04:42] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2026-05-26 17:04:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2026-05-26 17:04:42] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 17 ms.
[2026-05-26 17:04:42] [INFO ] Added : 54 causal constraints over 11 iterations in 196 ms. Result :sat
Minimization took 101 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:43] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2026-05-26 17:04:43] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:04:43] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2026-05-26 17:04:43] [INFO ] [Real]Added 8 Read/Feed constraints in 6 ms returned sat
[2026-05-26 17:04:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2026-05-26 17:04:43] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:04:43] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-26 17:04:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:04:43] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 23 ms to minimize.
[2026-05-26 17:04:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2026-05-26 17:04:43] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 13 ms.
[2026-05-26 17:04:43] [INFO ] Added : 26 causal constraints over 6 iterations in 112 ms. Result :sat
Minimization took 52 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:43] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:04:43] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:04:43] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-26 17:04:43] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:04:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:04:43] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:04:43] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-26 17:04:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2026-05-26 17:04:43] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-26 17:04:44] [INFO ] Added : 31 causal constraints over 7 iterations in 132 ms. Result :sat
Minimization took 56 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:44] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:04:44] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:04:44] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-26 17:04:44] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:04:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:04:44] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:04:44] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2026-05-26 17:04:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2026-05-26 17:04:44] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 25 ms.
[2026-05-26 17:04:44] [INFO ] Added : 9 causal constraints over 3 iterations in 97 ms. Result :sat
Minimization took 36 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:44] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:04:44] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:04:44] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-26 17:04:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:04:44] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:04:44] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-26 17:04:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 19 ms returned sat
[2026-05-26 17:04:44] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-26 17:04:44] [INFO ] Added : 20 causal constraints over 4 iterations in 79 ms. Result :sat
Minimization took 37 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:45] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:04:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:04:45] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-26 17:04:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2026-05-26 17:04:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:04:45] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2026-05-26 17:04:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2026-05-26 17:04:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-26 17:04:45] [INFO ] Added : 26 causal constraints over 6 iterations in 100 ms. Result :sat
Minimization took 54 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:45] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:04:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:04:45] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-26 17:04:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:04:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:04:45] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2026-05-26 17:04:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2026-05-26 17:04:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-26 17:04:46] [INFO ] Added : 54 causal constraints over 11 iterations in 192 ms. Result :sat
Minimization took 48 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:46] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:04:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:04:46] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-26 17:04:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:04:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 13 ms returned sat
[2026-05-26 17:04:46] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2026-05-26 17:04:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2026-05-26 17:04:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-26 17:04:46] [INFO ] Added : 3 causal constraints over 1 iterations in 45 ms. Result :sat
Minimization took 47 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:46] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:04:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:04:46] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-26 17:04:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:04:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:04:46] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2026-05-26 17:04:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2026-05-26 17:04:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:04:47] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:04:47] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:04:47] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 6 ms to minimize.
[2026-05-26 17:04:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 292 ms
[2026-05-26 17:04:47] [INFO ] Added : 62 causal constraints over 14 iterations in 539 ms. Result :sat
Minimization took 60 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:47] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:04:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:04:47] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-26 17:04:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:04:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:04:47] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-26 17:04:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2026-05-26 17:04:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:04:48] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 13 ms to minimize.
[2026-05-26 17:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2026-05-26 17:04:48] [INFO ] Added : 23 causal constraints over 5 iterations in 189 ms. Result :sat
Minimization took 58 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:48] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:04:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:04:48] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-26 17:04:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:04:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:04:48] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:04:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:04:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-26 17:04:48] [INFO ] Added : 6 causal constraints over 2 iterations in 49 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:48] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:04:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:04:48] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-26 17:04:48] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:04:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-26 17:04:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:04:48] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2026-05-26 17:04:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:04:48] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 14 ms to minimize.
[2026-05-26 17:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2026-05-26 17:04:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-26 17:04:48] [INFO ] Added : 29 causal constraints over 6 iterations in 98 ms. Result :sat
Minimization took 56 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:49] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:04:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:04:49] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2026-05-26 17:04:49] [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:04:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-26 17:04:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:04:49] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2026-05-26 17:04:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2026-05-26 17:04:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:04:49] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 12 ms to minimize.
[2026-05-26 17:04:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2026-05-26 17:04:49] [INFO ] Added : 22 causal constraints over 6 iterations in 161 ms. Result :sat
Minimization took 38 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:49] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:04:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:04:49] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:04:49] [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:04:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:04:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:04:49] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-26 17:04:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2026-05-26 17:04:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-26 17:04:49] [INFO ] Added : 10 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 10, 10, 10, 4, 1, 3, 30, 4, 10, 4, 182, 10, 1, 4]
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2026-05-26 17:04:50] [INFO ] Unfolded HLPN to a Petri net with 870 places and 5034 transitions 34774 arcs in 325 ms.
[2026-05-26 17:04:50] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 10, 10, 10, 4, 1, 3, 30, 4, 10, 4, 182, 10, 1, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 10, 10, 10, 4, 1, 3, 30, 4, 10, 4, 182, 10, 1, 4]
[2026-05-26 17:04:50] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 870 cols
[2026-05-26 17:04:50] [INFO ] Computed 58 invariants in 242 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 10, 10, 10, 4, 1, 3, 30, 4, 10, 4, 10, 10, 1, 4]
RANDOM walk for 10000 steps (2 resets) in 145 ms. (68 steps per ms)
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100005 steps (23 resets) in 474 ms. (210 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 1, 1, 2, 4, 1, 3, 4, 1, 2] Max Struct:[10, 10, 10, 4, 30, 10, 4, 10, 10, 4]
[2026-05-26 17:04:51] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2026-05-26 17:04:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:51] [INFO ] [Real]Absence check using 16 positive place invariants in 35 ms returned sat
[2026-05-26 17:04:51] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 73 ms returned sat
[2026-05-26 17:04:53] [INFO ] [Real]Absence check using state equation in 2146 ms returned sat
[2026-05-26 17:04:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 38 ms returned sat
[2026-05-26 17:04:54] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 75 ms returned sat
[2026-05-26 17:04:56] [INFO ] [Nat]Absence check using state equation in 2663 ms returned sat
[2026-05-26 17:04:56] [INFO ] State equation strengthened by 200 read => feed constraints.
[2026-05-26 17:04:57] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 17:04:57] [INFO ] [Nat]Added 200 Read/Feed constraints in 820 ms returned sat
[2026-05-26 17:04:58] [INFO ] Computed and/alt/rep : 1350/3496/1320 causal constraints (skipped 960 transitions) in 306 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:59] [INFO ] [Real]Absence check using 16 positive place invariants in 38 ms returned sat
[2026-05-26 17:04:59] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 78 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:59] [INFO ] [Real]Absence check using 16 positive place invariants in 38 ms returned sat
[2026-05-26 17:04:59] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 72 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:04:59] [INFO ] [Real]Absence check using 16 positive place invariants in 37 ms returned sat
[2026-05-26 17:04:59] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 48 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:05:00] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:05:00] [INFO ] [Real]Absence check using 16 positive place invariants in 35 ms returned sat
[2026-05-26 17:05:00] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 74 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:05:00] [INFO ] [Real]Absence check using 16 positive place invariants in 35 ms returned sat
[2026-05-26 17:05:00] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 79 ms returned sat
[2026-05-26 17:05:02] [INFO ] [Real]Absence check using state equation in 1954 ms returned sat
[2026-05-26 17:05:02] [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:05:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 41 ms returned sat
[2026-05-26 17:05:03] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 84 ms returned sat
[2026-05-26 17:05:04] [INFO ] [Nat]Absence check using state equation in 1733 ms returned sat
[2026-05-26 17:05:05] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 17:05:05] [INFO ] [Nat]Added 200 Read/Feed constraints in 615 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:05:07] [INFO ] Deduced a trap composed of 75 places in 1561 ms of which 230 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:05:09] [INFO ] Deduced a trap composed of 75 places in 1668 ms of which 179 ms to minimize.
[2026-05-26 17:05:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:05:09] [INFO ] [Real]Absence check using 16 positive place invariants in 36 ms returned sat
[2026-05-26 17:05:09] [INFO ] [Real]Absence check using 16 positive and 42 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:05:09] [INFO ] [Real]Absence check using 16 positive place invariants in 36 ms returned sat
[2026-05-26 17:05:09] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 71 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:05:09] [INFO ] [Real]Absence check using 16 positive place invariants in 38 ms returned sat
[2026-05-26 17:05:10] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 74 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[6, 1, 1, 2, 4, 1, 3, 4, 1, 2] Max Struct:[10, 1, 1, 2, 4, 1, 4, 4, 1, 2]
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 3] Max Struct:[10, 4]
Support contains 50 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 866 transition count 2234
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 184 place count 776 transition count 2234
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 184 place count 776 transition count 2134
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 384 place count 676 transition count 2134
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 7 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 584 place count 576 transition count 2034
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 604 place count 576 transition count 2014
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 624 place count 556 transition count 2014
Applied a total of 624 rules in 770 ms. Remains 556 /870 variables (removed 314) and now considering 2014/2324 (removed 310) transitions.
Running 2010 sub problems to find dead transitions.
[2026-05-26 17:05:10] [INFO ] Flow matrix only has 1974 transitions (discarded 40 similar events)
// Phase 1: matrix 1974 rows 556 cols
[2026-05-26 17:05:11] [INFO ] Computed 54 invariants in 69 ms
[2026-05-26 17:05:11] [INFO ] State equation strengthened by 200 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2010 unsolved
SMT process timed out in 24724ms, After SMT, problems are : Problem set: 0 solved, 2010 unsolved
Search for dead transitions found 0 dead transitions in 24779ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25607 ms. Remains : 556/870 places, 2014/2324 transitions.
[2026-05-26 17:05:35] [INFO ] Flow matrix only has 1974 transitions (discarded 40 similar events)
[2026-05-26 17:05:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 3] Max Struct:[10, 4]
RANDOM walk for 1000000 steps (76 resets) in 12752 ms. (78 steps per ms)
BEST_FIRST walk for 1753665 steps (551 resets) in 8886 ms. (197 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 3] Max Struct:[10, 4]
[2026-05-26 17:05:57] [INFO ] Flow matrix only has 1974 transitions (discarded 40 similar events)
[2026-05-26 17:05:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 17:05:57] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2026-05-26 17:05:57] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 60 ms returned sat
[2026-05-26 17:05:58] [INFO ] [Real]Absence check using state equation in 1356 ms returned sat
[2026-05-26 17:05:59] [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:05:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2026-05-26 17:05:59] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 44 ms returned sat
[2026-05-26 17:06:01] [INFO ] [Nat]Absence check using state equation in 2157 ms returned sat
[2026-05-26 17:06:01] [INFO ] State equation strengthened by 200 read => feed constraints.
[2026-05-26 17:06:03] [INFO ] [Nat]Added 200 Read/Feed constraints in 1844 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:06:04] [INFO ] Deduced a trap composed of 42 places in 1092 ms of which 99 ms to minimize.
[2026-05-26 17:06:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1211 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 17:06:04] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2026-05-26 17:06:04] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 62 ms returned sat
[2026-05-26 17:06:07] [INFO ] [Real]Absence check using state equation in 2540 ms returned sat
[2026-05-26 17:06: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:06:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2026-05-26 17:06:07] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 52 ms returned sat
[2026-05-26 17:06:12] [INFO ] [Nat]Absence check using state equation in 4905 ms returned sat
[2026-05-26 17:06:14] [INFO ] [Nat]Added 200 Read/Feed constraints in 2111 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:06:15] [INFO ] Deduced a trap composed of 39 places in 1095 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:06:16] [INFO ] Deduced a trap composed of 109 places in 1027 ms of which 132 ms to minimize.
[2026-05-26 17:06:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 2343 ms
Current structural bounds on expressions (after SMT) : Max Seen:[9, 3] Max Struct:[9, 3]
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T10-UpperBounds-01 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-26 17:06:17] [INFO ] Flatten gal took : 644 ms
[2026-05-26 17:06:18] [INFO ] Flatten gal took : 233 ms
[2026-05-26 17:06:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17877491027279988254.gal : 80 ms
[2026-05-26 17:06:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17286133350860462716.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17877491027279988254.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17286133350860462716.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 99531 ms.

BK_STOP 1779815178401

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

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