Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266000044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is PolyORBLF-COL-S04J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266000044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748891755130

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 19:15:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 19:15:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:15:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 19:15:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 19:15:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 617 ms
[2025-06-02 19:15:57] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 792 PT places and 4336.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-02 19:15:57] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-02 19:15:57] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:15:57] [INFO ] Computed 26 invariants in 18 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 0, 1, 0, 0, 7, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[2, 5, 8, 4, 1, 8, 8, 8, 4, 8, 1, 1, 4, 30, 1, 8]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 19:15:57] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:15:57] [INFO ] Computed 26 invariants in 18 ms
[2025-06-02 19:15:57] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2025-06-02 19:15:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2025-06-02 19:15:57] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-06-02 19:15:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:15:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:15:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:15:57] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 19:15:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 19:15:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2025-06-02 19:15:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 19:15:57] [INFO ] Added : 54 causal constraints over 11 iterations in 127 ms. Result :sat
Minimization took 33 ms.
[2025-06-02 19:15:57] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:15:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned unsat
[2025-06-02 19:15:57] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:15:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:15:57] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:15:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:15:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:15:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2025-06-02 19:15:57] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:15:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:15:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:15:58] [INFO ] Added : 57 causal constraints over 12 iterations in 87 ms. Result :sat
Minimization took 27 ms.
[2025-06-02 19:15:58] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:15:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:15:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:15:58] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 22 ms to minimize.
[2025-06-02 19:15:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2025-06-02 19:15:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:15:58] [INFO ] Added : 31 causal constraints over 7 iterations in 61 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 19:15:58] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:15:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:15:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:15:58] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
[2025-06-02 19:15:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-06-02 19:15:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 19:15:58] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2025-06-02 19:15:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2025-06-02 19:15:58] [INFO ] Added : 54 causal constraints over 11 iterations in 134 ms. Result :sat
Minimization took 27 ms.
[2025-06-02 19:15:58] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-02 19:15:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:15:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 19:15:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:15:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:15:59] [INFO ] Added : 57 causal constraints over 12 iterations in 97 ms. Result :sat
Minimization took 28 ms.
[2025-06-02 19:15:59] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 19:15:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:15:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 13 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:15:59] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2025-06-02 19:15:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2025-06-02 19:15:59] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:15:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:15:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:15:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:15:59] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2025-06-02 19:15:59] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:15:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2025-06-02 19:15:59] [INFO ] Added : 60 causal constraints over 14 iterations in 200 ms. Result :sat
Minimization took 26 ms.
[2025-06-02 19:15:59] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:15:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:15:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:15:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:15:59] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:15:59] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:15:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2025-06-02 19:15:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-02 19:15:59] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-06-02 19:15:59] [INFO ] Added : 40 causal constraints over 9 iterations in 122 ms. Result :sat
Minimization took 46 ms.
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:16:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-02 19:16:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:16:00] [INFO ] Added : 35 causal constraints over 7 iterations in 52 ms. Result :sat
Minimization took 25 ms.
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:16:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:16:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 19:16:00] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 14 ms.
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:16:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:16:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:16:00] [INFO ] Added : 45 causal constraints over 9 iterations in 66 ms. Result :sat
Minimization took 28 ms.
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:16:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:16:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 19:16:00] [INFO ] Added : 3 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:16:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:16:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:16:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:16:01] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:16:01] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2025-06-02 19:16:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2025-06-02 19:16:01] [INFO ] Added : 38 causal constraints over 9 iterations in 168 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 1, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 1, 8, 4, 8, 8, 7, 4, 8, 1, 4, 30, 1, 8]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-01 1 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
[2025-06-02 19:16:01] [INFO ] Unfolded HLPN to a Petri net with 792 places and 4268 transitions 28832 arcs in 101 ms.
[2025-06-02 19:16:01] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 8, 4, 8, 8, 4, 8, 1, 4, 30, 1, 8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 8, 4, 8, 8, 4, 8, 1, 4, 30, 1, 8]
[2025-06-02 19:16:01] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2025-06-02 19:16:01] [INFO ] Computed 58 invariants in 111 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 8, 4, 8, 8, 4, 8, 1, 4, 30, 1, 8]
RANDOM walk for 10000 steps (2 resets) in 96 ms. (103 steps per ms)
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-09 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70004 steps (14 resets) in 275 ms. (253 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 4, 6] Max Struct:[8, 4, 8, 8, 4, 30, 8]
[2025-06-02 19:16:01] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2025-06-02 19:16:01] [INFO ] Invariant cache hit.
[2025-06-02 19:16:01] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2025-06-02 19:16:01] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 33 ms returned unsat
[2025-06-02 19:16:02] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2025-06-02 19:16:02] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 34 ms returned unsat
[2025-06-02 19:16:02] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-06-02 19:16:02] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 32 ms returned unsat
[2025-06-02 19:16:02] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2025-06-02 19:16:02] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 30 ms returned unsat
[2025-06-02 19:16:02] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2025-06-02 19:16:02] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 29 ms returned unsat
[2025-06-02 19:16:02] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2025-06-02 19:16:02] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 14 ms returned unsat
[2025-06-02 19:16:02] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-06-02 19:16:02] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 32 ms returned sat
[2025-06-02 19:16:03] [INFO ] [Real]Absence check using state equation in 1019 ms returned sat
[2025-06-02 19:16:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:16:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2025-06-02 19:16:03] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 42 ms returned sat
[2025-06-02 19:16:05] [INFO ] [Nat]Absence check using state equation in 1385 ms returned sat
[2025-06-02 19:16:05] [INFO ] State equation strengthened by 160 read => feed constraints.
[2025-06-02 19:16:05] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:16:06] [INFO ] [Nat]Added 160 Read/Feed constraints in 1021 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 4, 6] Max Struct:[1, 1, 1, 1, 1, 4, 8]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
Support contains 8 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 788 transition count 2028
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 148 place count 716 transition count 2028
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 148 place count 716 transition count 1932
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 340 place count 620 transition count 1932
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 500 place count 540 transition count 1852
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 516 place count 540 transition count 1836
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 532 place count 524 transition count 1836
Applied a total of 532 rules in 323 ms. Remains 524 /792 variables (removed 268) and now considering 1836/2100 (removed 264) transitions.
Running 1832 sub problems to find dead transitions.
[2025-06-02 19:16:06] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
// Phase 1: matrix 1804 rows 524 cols
[2025-06-02 19:16:06] [INFO ] Computed 54 invariants in 64 ms
[2025-06-02 19:16:06] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2025-06-02 19:16:34] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 2 ms to minimize.
[2025-06-02 19:16:34] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 4 ms to minimize.
[2025-06-02 19:16:34] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2025-06-02 19:16:34] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
[2025-06-02 19:16:34] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2025-06-02 19:16:34] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 0 ms to minimize.
[2025-06-02 19:16:35] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2025-06-02 19:16:35] [INFO ] Deduced a trap composed of 223 places in 395 ms of which 3 ms to minimize.
[2025-06-02 19:16:37] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 2 ms to minimize.
SMT process timed out in 31021ms, After SMT, problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 31063ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31418 ms. Remains : 524/792 places, 1836/2100 transitions.
[2025-06-02 19:16:37] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2025-06-02 19:16:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[8]
RANDOM walk for 1000000 steps (117 resets) in 7671 ms. (130 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 2597 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[8]
[2025-06-02 19:16:48] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2025-06-02 19:16:48] [INFO ] Invariant cache hit.
[2025-06-02 19:16:48] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2025-06-02 19:16:48] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 21 ms returned sat
[2025-06-02 19:16:48] [INFO ] [Real]Absence check using state equation in 741 ms returned sat
[2025-06-02 19:16:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:16:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2025-06-02 19:16:49] [INFO ] [Nat]Absence check using 18 positive and 36 generalized place invariants in 18 ms returned sat
[2025-06-02 19:16:50] [INFO ] [Nat]Absence check using state equation in 1035 ms returned sat
[2025-06-02 19:16:50] [INFO ] State equation strengthened by 160 read => feed constraints.
[2025-06-02 19:16:51] [INFO ] [Nat]Added 160 Read/Feed constraints in 963 ms returned sat
[2025-06-02 19:16:51] [INFO ] Deduced a trap composed of 34 places in 325 ms of which 4 ms to minimize.
[2025-06-02 19:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 400 ms
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[7]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-15 7 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 )
[2025-06-02 19:16:51] [INFO ] Flatten gal took : 225 ms
[2025-06-02 19:16:51] [INFO ] Flatten gal took : 152 ms
[2025-06-02 19:16:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3873517990079875610.gal : 50 ms
[2025-06-02 19:16:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8870342298835862261.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3873517990079875610.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8870342298835862261.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
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 55686 ms.

BK_STOP 1748891812152

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S04J06T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBLF-COL-S04J06T08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-174881266000044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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