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.r139-smll-174876533100028.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 MedleyA-PT-16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533100028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 89K 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 MedleyA-PT-16-UpperBounds-00
FORMULA_NAME MedleyA-PT-16-UpperBounds-01
FORMULA_NAME MedleyA-PT-16-UpperBounds-02
FORMULA_NAME MedleyA-PT-16-UpperBounds-03
FORMULA_NAME MedleyA-PT-16-UpperBounds-04
FORMULA_NAME MedleyA-PT-16-UpperBounds-05
FORMULA_NAME MedleyA-PT-16-UpperBounds-06
FORMULA_NAME MedleyA-PT-16-UpperBounds-07
FORMULA_NAME MedleyA-PT-16-UpperBounds-08
FORMULA_NAME MedleyA-PT-16-UpperBounds-09
FORMULA_NAME MedleyA-PT-16-UpperBounds-10
FORMULA_NAME MedleyA-PT-16-UpperBounds-11
FORMULA_NAME MedleyA-PT-16-UpperBounds-12
FORMULA_NAME MedleyA-PT-16-UpperBounds-13
FORMULA_NAME MedleyA-PT-16-UpperBounds-14
FORMULA_NAME MedleyA-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748896016212

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:26:58] [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 20:26:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:26:59] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2025-06-02 20:26:59] [INFO ] Transformed 196 places.
[2025-06-02 20:26:59] [INFO ] Transformed 392 transitions.
[2025-06-02 20:26:59] [INFO ] Found NUPN structural information;
[2025-06-02 20:26:59] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 390 rows 196 cols
[2025-06-02 20:26:59] [INFO ] Computed 7 invariants in 53 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 88 ms. (112 steps per ms)
FORMULA MedleyA-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100006 steps (20 resets) in 331 ms. (301 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 20:26:59] [INFO ] Invariant cache hit.
[2025-06-02 20:27:00] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2025-06-02 20:27:00] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2025-06-02 20:27:01] [INFO ] Deduced a trap composed of 41 places in 326 ms of which 26 ms to minimize.
[2025-06-02 20:27:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:27:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2025-06-02 20:27:01] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2025-06-02 20:27:01] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 4 ms to minimize.
[2025-06-02 20:27:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2025-06-02 20:27:01] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 45 ms.
[2025-06-02 20:27:05] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
[2025-06-02 20:27:05] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 3 ms to minimize.
[2025-06-02 20:27:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 476 ms
[2025-06-02 20:27:05] [INFO ] Added : 302 causal constraints over 61 iterations in 3981 ms. Result :sat
Minimization took 311 ms.
[2025-06-02 20:27:06] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-02 20:27:06] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2025-06-02 20:27:06] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 3 ms to minimize.
[2025-06-02 20:27:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:27:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:27:06] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2025-06-02 20:27:07] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2025-06-02 20:27:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2025-06-02 20:27:07] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 39 ms.
[2025-06-02 20:27:10] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2025-06-02 20:27:10] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 3 ms to minimize.
[2025-06-02 20:27:10] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 3 ms to minimize.
[2025-06-02 20:27:10] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 4 ms to minimize.
[2025-06-02 20:27:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 911 ms
[2025-06-02 20:27:11] [INFO ] Added : 312 causal constraints over 64 iterations in 4256 ms. Result :sat
Minimization took 399 ms.
[2025-06-02 20:27:11] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:27:11] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2025-06-02 20:27:12] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 3 ms to minimize.
[2025-06-02 20:27:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:27:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:27:12] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2025-06-02 20:27:12] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 4 ms to minimize.
[2025-06-02 20:27:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2025-06-02 20:27:12] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 55 ms.
[2025-06-02 20:27:16] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 3 ms to minimize.
[2025-06-02 20:27:17] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2025-06-02 20:27:17] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2025-06-02 20:27:17] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 667 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-02 20:27:17] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-02 20:27:17] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2025-06-02 20:27:17] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 3 ms to minimize.
[2025-06-02 20:27:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:27:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:27:17] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2025-06-02 20:27:18] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 3 ms to minimize.
[2025-06-02 20:27:18] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2025-06-02 20:27:18] [INFO ] Deduced a trap composed of 100 places in 165 ms of which 3 ms to minimize.
[2025-06-02 20:27:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 454 ms
[2025-06-02 20:27:18] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 51 ms.
[2025-06-02 20:27:21] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 3 ms to minimize.
[2025-06-02 20:27:22] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 4 ms to minimize.
[2025-06-02 20:27:22] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 4 ms to minimize.
[2025-06-02 20:27:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 873 ms
[2025-06-02 20:27:22] [INFO ] Added : 303 causal constraints over 61 iterations in 4201 ms. Result :sat
Minimization took 157 ms.
[2025-06-02 20:27:22] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:27:23] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2025-06-02 20:27:23] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2025-06-02 20:27:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:27:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:27:23] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2025-06-02 20:27:23] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 3 ms to minimize.
[2025-06-02 20:27:23] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 3 ms to minimize.
[2025-06-02 20:27:24] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 3 ms to minimize.
[2025-06-02 20:27:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 646 ms
[2025-06-02 20:27:24] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 46 ms.
[2025-06-02 20:27:28] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 4 ms to minimize.
[2025-06-02 20:27:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2025-06-02 20:27:28] [INFO ] Added : 298 causal constraints over 61 iterations in 4024 ms. Result :sat
Minimization took 59 ms.
[2025-06-02 20:27:28] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-02 20:27:28] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2025-06-02 20:27:28] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 4 ms to minimize.
[2025-06-02 20:27:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:27:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:27:29] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2025-06-02 20:27:29] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 4 ms to minimize.
[2025-06-02 20:27:29] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 3 ms to minimize.
[2025-06-02 20:27:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 460 ms
[2025-06-02 20:27:29] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 45 ms.
[2025-06-02 20:27:33] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 3 ms to minimize.
[2025-06-02 20:27:33] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 3 ms to minimize.
[2025-06-02 20:27:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 536 ms
[2025-06-02 20:27:33] [INFO ] Added : 307 causal constraints over 62 iterations in 3993 ms. Result :sat
Minimization took 257 ms.
[2025-06-02 20:27:33] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-02 20:27:34] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2025-06-02 20:27:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:27:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:27:34] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2025-06-02 20:27:34] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 3 ms to minimize.
[2025-06-02 20:27:34] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2025-06-02 20:27:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 302 ms
[2025-06-02 20:27:34] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 51 ms.
[2025-06-02 20:27:37] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 5 ms to minimize.
[2025-06-02 20:27:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2025-06-02 20:27:37] [INFO ] Added : 312 causal constraints over 63 iterations in 3286 ms. Result :sat
Minimization took 500 ms.
[2025-06-02 20:27:38] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 20:27:38] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2025-06-02 20:27:39] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:27:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:27:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:27:39] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2025-06-02 20:27:39] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 3 ms to minimize.
[2025-06-02 20:27:39] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 3 ms to minimize.
[2025-06-02 20:27:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2025-06-02 20:27:39] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 51 ms.
[2025-06-02 20:27:43] [INFO ] Added : 316 causal constraints over 64 iterations in 3516 ms. Result :sat
Minimization took 380 ms.
[2025-06-02 20:27:43] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 20:27:44] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2025-06-02 20:27:44] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 50 ms.
[2025-06-02 20:27:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:27:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-02 20:27:44] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2025-06-02 20:27:44] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 59 ms.
[2025-06-02 20:27:48] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 2 ms to minimize.
[2025-06-02 20:27:48] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 3 ms to minimize.
[2025-06-02 20:27:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 528 ms
[2025-06-02 20:27:48] [INFO ] Added : 318 causal constraints over 65 iterations in 4411 ms. Result :sat
Minimization took 284 ms.
[2025-06-02 20:27:49] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-02 20:27:49] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2025-06-02 20:27:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:27:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-02 20:27:49] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2025-06-02 20:27:49] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2025-06-02 20:27:50] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 3 ms to minimize.
[2025-06-02 20:27:50] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2025-06-02 20:27:50] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2025-06-02 20:27:50] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2025-06-02 20:27:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 626 ms
[2025-06-02 20:27:50] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 46 ms.
[2025-06-02 20:27:53] [INFO ] Added : 302 causal constraints over 61 iterations in 3512 ms. Result :sat
Minimization took 500 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 390/390 transitions.
Graph (trivial) has 208 edges and 196 vertex of which 13 / 196 are part of one of the 3 SCC in 5 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 186 transition count 339
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 81 place count 148 transition count 335
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 146 transition count 335
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 83 place count 146 transition count 331
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 91 place count 142 transition count 331
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 125 place count 108 transition count 275
Iterating global reduction 3 with 34 rules applied. Total rules applied 159 place count 108 transition count 275
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 13 rules applied. Total rules applied 172 place count 108 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 173 place count 107 transition count 262
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 173 place count 107 transition count 254
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 189 place count 99 transition count 254
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 190 place count 99 transition count 253
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 193 place count 96 transition count 244
Iterating global reduction 6 with 3 rules applied. Total rules applied 196 place count 96 transition count 244
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 224 place count 82 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 228 place count 82 transition count 226
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 229 place count 81 transition count 224
Iterating global reduction 7 with 1 rules applied. Total rules applied 230 place count 81 transition count 224
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -135
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 270 place count 61 transition count 359
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 279 place count 61 transition count 350
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 281 place count 60 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 8 with 64 rules applied. Total rules applied 345 place count 60 transition count 303
Free-agglomeration rule applied 11 times with reduction of 3 identical transitions.
Iterating global reduction 8 with 11 rules applied. Total rules applied 356 place count 60 transition count 289
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 378 place count 49 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 9 with 30 rules applied. Total rules applied 408 place count 49 transition count 248
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 409 place count 49 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 410 place count 48 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 411 place count 47 transition count 246
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 21 edges and 45 vertex of which 2 / 45 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 3 rules applied. Total rules applied 414 place count 44 transition count 246
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 424 place count 44 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 12 with 54 rules applied. Total rules applied 478 place count 44 transition count 182
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 479 place count 43 transition count 180
Iterating global reduction 12 with 1 rules applied. Total rules applied 480 place count 43 transition count 180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 482 place count 42 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 484 place count 41 transition count 184
Applied a total of 484 rules in 201 ms. Remains 41 /196 variables (removed 155) and now considering 184/390 (removed 206) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 41/196 places, 184/390 transitions.
[2025-06-02 20:27:55] [INFO ] Flow matrix only has 171 transitions (discarded 13 similar events)
// Phase 1: matrix 171 rows 41 cols
[2025-06-02 20:27:55] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (125 resets) in 1314 ms. (760 steps per ms)
FORMULA MedleyA-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (23 resets) in 1258 ms. (794 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 20:27:58] [INFO ] Flow matrix only has 171 transitions (discarded 13 similar events)
[2025-06-02 20:27:58] [INFO ] Invariant cache hit.
[2025-06-02 20:27:58] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-02 20:27:58] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-06-02 20:27:58] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-02 20:27:58] [INFO ] [Real]Added 32 Read/Feed constraints in 7 ms returned sat
[2025-06-02 20:27:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:27:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-02 20:27:58] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-06-02 20:27:58] [INFO ] [Nat]Added 32 Read/Feed constraints in 7 ms returned sat
[2025-06-02 20:27:58] [INFO ] Computed and/alt/rep : 59/337/59 causal constraints (skipped 111 transitions) in 16 ms.
[2025-06-02 20:27:58] [INFO ] Added : 42 causal constraints over 11 iterations in 194 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 41 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p7) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 182/182 transitions.
Graph (trivial) has 30 edges and 41 vertex of which 9 / 41 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 36 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 35 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 34 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 place count 34 transition count 162
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 13 place count 31 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 42 place count 31 transition count 142
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 31 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 30 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 44 place count 30 transition count 140
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 46 place count 29 transition count 140
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 47 place count 28 transition count 138
Iterating global reduction 5 with 1 rules applied. Total rules applied 48 place count 28 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 50 place count 27 transition count 137
Applied a total of 50 rules in 33 ms. Remains 27 /41 variables (removed 14) and now considering 137/182 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 27/41 places, 137/182 transitions.
[2025-06-02 20:27:58] [INFO ] Flow matrix only has 125 transitions (discarded 12 similar events)
// Phase 1: matrix 125 rows 27 cols
[2025-06-02 20:27:58] [INFO ] Computed 5 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA MedleyA-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (111 resets) in 1532 ms. (652 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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 20:28:00] [INFO ] Flatten gal took : 95 ms
[2025-06-02 20:28:00] [INFO ] Flatten gal took : 32 ms
[2025-06-02 20:28:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11279706998452714818.gal : 23 ms
[2025-06-02 20:28:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5593738765490464441.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11279706998452714818.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5593738765490464441.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 ...329
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 62088 ms.

BK_STOP 1748896080906

--------------------
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="MedleyA-PT-16"
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 MedleyA-PT-16, 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 r139-smll-174876533100028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-16.tgz
mv MedleyA-PT-16 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 ;