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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 8.5K Mar 8 15:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 8 15:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 8 15:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 8 15:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Mar 16 08:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 16 08:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 16 08:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 8 15:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 8 15:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 8 15:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 121K Mar 8 15:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-S04J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779815309639

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2026-05-26 17:08:32] [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:08:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 17:08:32] [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:08:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 17:08:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1544 ms
[2026-05-26 17:08:34] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 966 PT places and 5456.0 transition bindings in 55 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
[2026-05-26 17:08:34] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 12 ms.
[2026-05-26 17:08:34] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2026-05-26 17:08:34] [INFO ] Computed 26 invariants in 24 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 9, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 10, 4, 10, 10, 4, 10, 10, 3, 10, 4, 1, 30, 1, 1, 30]
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-26 17:08:34] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2026-05-26 17:08:34] [INFO ] Computed 26 invariants in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:35] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2026-05-26 17:08:35] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 19 ms returned sat
[2026-05-26 17:08:35] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2026-05-26 17:08:35] [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:08:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:08:35] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2026-05-26 17:08:35] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2026-05-26 17:08:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 17:08:35] [INFO ] [Nat]Added 8 Read/Feed constraints in 64 ms returned sat
[2026-05-26 17:08:35] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 18 ms.
[2026-05-26 17:08:35] [INFO ] Added : 3 causal constraints over 1 iterations in 86 ms. Result :sat
Minimization took 42 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:35] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2026-05-26 17:08:35] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:08:35] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2026-05-26 17:08:35] [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:08:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2026-05-26 17:08:36] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 27 ms returned sat
[2026-05-26 17:08:36] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2026-05-26 17:08:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 30 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:36] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 20 ms to minimize.
[2026-05-26 17:08:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 132 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:36] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2026-05-26 17:08:36] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2026-05-26 17:08:36] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2026-05-26 17:08:36] [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:08:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2026-05-26 17:08:36] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:08:36] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-26 17:08:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2026-05-26 17:08:36] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-26 17:08:36] [INFO ] Added : 39 causal constraints over 8 iterations in 160 ms. Result :sat
Minimization took 48 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:37] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2026-05-26 17:08:37] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:08:37] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-26 17:08:37] [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:08:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:37] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:08:37] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2026-05-26 17:08:37] [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:08:37] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:37] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 6 ms to minimize.
[2026-05-26 17:08:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2026-05-26 17:08:37] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 14 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:37] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:37] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:37] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:38] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 6 ms to minimize.
[2026-05-26 17:08:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 433 ms
[2026-05-26 17:08:38] [INFO ] Added : 42 causal constraints over 9 iterations in 611 ms. Result :sat
Minimization took 97 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:38] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:08:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-26 17:08:38] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-26 17:08:38] [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:08:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:08:38] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:08:38] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2026-05-26 17:08:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2026-05-26 17:08:38] [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:08:38] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:38] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 7 ms to minimize.
[2026-05-26 17:08:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2026-05-26 17:08:39] [INFO ] Added : 58 causal constraints over 13 iterations in 480 ms. Result :sat
Minimization took 57 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:39] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:08:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:08:39] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-26 17:08:39] [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:08:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:08:39] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-26 17:08:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 54 ms returned sat
[2026-05-26 17:08:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 13 ms.
[2026-05-26 17:08:39] [INFO ] Added : 54 causal constraints over 11 iterations in 321 ms. Result :sat
Minimization took 68 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:39] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:08:39] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-26 17:08:39] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:08:39] [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:08:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:08:40] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2026-05-26 17:08:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:40] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 9 ms to minimize.
[2026-05-26 17:08:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2026-05-26 17:08:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-26 17:08:40] [INFO ] Added : 29 causal constraints over 6 iterations in 108 ms. Result :sat
Minimization took 53 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:40] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:08:40] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-26 17:08:40] [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:08:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:08:40] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2026-05-26 17:08:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 53 ms returned sat
[2026-05-26 17:08:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-26 17:08:41] [INFO ] Added : 54 causal constraints over 11 iterations in 270 ms. Result :sat
Minimization took 101 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:41] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:08:41] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-26 17:08: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:08:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:08:41] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-26 17:08:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2026-05-26 17:08:41] [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:08:41] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:41] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:41] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:41] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:42] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 6 ms to minimize.
[2026-05-26 17:08:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 559 ms
[2026-05-26 17:08:42] [INFO ] Added : 58 causal constraints over 12 iterations in 754 ms. Result :sat
Minimization took 57 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:42] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:42] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:08:42] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-26 17:08:42] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:08: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:08:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:42] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:08:42] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-26 17:08:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2026-05-26 17:08:42] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-26 17:08:42] [INFO ] Added : 8 causal constraints over 2 iterations in 54 ms. Result :sat
Minimization took 35 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:42] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:42] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:08:42] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-26 17:08: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:08:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:42] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:08:42] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-26 17:08:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2026-05-26 17:08:42] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 17:08:43] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 12 ms to minimize.
[2026-05-26 17:08:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2026-05-26 17:08:43] [INFO ] Added : 22 causal constraints over 6 iterations in 197 ms. Result :sat
Minimization took 37 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:43] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-05-26 17:08:43] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:08:43] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-26 17:08: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:08:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:43] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:08:43] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:08:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2026-05-26 17:08:43] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-26 17:08:43] [INFO ] Added : 54 causal constraints over 11 iterations in 180 ms. Result :sat
Minimization took 48 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:43] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:43] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 17:08:43] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:08: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:08:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:43] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:08:43] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:08:43] [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:08:44] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 10 ms to minimize.
[2026-05-26 17:08:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2026-05-26 17:08:44] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-26 17:08:44] [INFO ] Added : 54 causal constraints over 11 iterations in 170 ms. Result :sat
Minimization took 47 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:44] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:44] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:08:44] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-26 17:08: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:08:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2026-05-26 17:08:44] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 17:08:44] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-26 17:08:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2026-05-26 17:08:44] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-26 17:08:44] [INFO ] Added : 1 causal constraints over 1 iterations in 35 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:44] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:44] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-26 17:08:44] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:08: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:08:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:08:44] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 17:08:44] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-26 17:08:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:08:44] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-26 17:08:44] [INFO ] Added : 54 causal constraints over 11 iterations in 173 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 9, 4, 10, 10, 4, 10, 3, 10, 4, 1, 30, 1, 1, 30]
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-01 9 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
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:08:45] [INFO ] Unfolded HLPN to a Petri net with 966 places and 5354 transitions 36134 arcs in 242 ms.
[2026-05-26 17:08:45] [INFO ] Unfolded 14 HLPN properties in 1 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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 4, 10, 10, 4, 10, 3, 10, 4, 1, 30, 1, 1, 30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 4, 10, 10, 4, 10, 3, 10, 4, 1, 30, 1, 1, 30]
[2026-05-26 17:08:45] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 966 cols
[2026-05-26 17:08:45] [INFO ] Computed 62 invariants in 321 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 4, 10, 10, 4, 10, 3, 10, 4, 1, 30, 1, 1, 30]
RANDOM walk for 10000 steps (2 resets) in 282 ms. (35 steps per ms)
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60001 steps (12 resets) in 447 ms. (133 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 4, 4] Max Struct:[4, 10, 10, 10, 30, 30]
[2026-05-26 17:08:46] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
[2026-05-26 17:08:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:47] [INFO ] [Real]Absence check using 14 positive place invariants in 27 ms returned sat
[2026-05-26 17:08:47] [INFO ] [Real]Absence check using 14 positive and 48 generalized place invariants in 132 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:47] [INFO ] [Real]Absence check using 14 positive place invariants in 28 ms returned sat
[2026-05-26 17:08:47] [INFO ] [Real]Absence check using 14 positive and 48 generalized place invariants in 120 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:47] [INFO ] [Real]Absence check using 14 positive place invariants in 27 ms returned sat
[2026-05-26 17:08:47] [INFO ] [Real]Absence check using 14 positive and 48 generalized place invariants in 111 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:48] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2026-05-26 17:08:48] [INFO ] [Real]Absence check using 14 positive and 48 generalized place invariants in 105 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:48] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned sat
[2026-05-26 17:08:48] [INFO ] [Real]Absence check using 14 positive and 48 generalized place invariants in 56 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 17:08:49] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2026-05-26 17:08:49] [INFO ] [Real]Absence check using 14 positive and 48 generalized place invariants in 54 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 4, 4] Max Struct:[1, 1, 1, 1, 4, 4]
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-02 1 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 5 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:08:49] [INFO ] Flatten gal took : 686 ms
[2026-05-26 17:08:50] [INFO ] Flatten gal took : 231 ms
[2026-05-26 17:08:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4691176898651965179.gal : 122 ms
[2026-05-26 17:08:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6522704230018352343.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/ReachabilityCardinality4691176898651965179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6522704230018352343.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 18489 ms.

BK_STOP 1779815330931

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

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