Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r597-smll-171734926400071.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is MedleyA-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926400071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 110K Jun 2 16:33 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

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

=== Now, execution of the tool begins

BK_START 1717362734560

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-15
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 21:12:17] [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]
[2024-06-02 21:12:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:12:17] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-06-02 21:12:17] [INFO ] Transformed 192 places.
[2024-06-02 21:12:17] [INFO ] Transformed 475 transitions.
[2024-06-02 21:12:17] [INFO ] Found NUPN structural information;
[2024-06-02 21:12:17] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
// Phase 1: matrix 473 rows 192 cols
[2024-06-02 21:12:17] [INFO ] Computed 7 invariants in 31 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :3
FORMULA MedleyA-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
[2024-06-02 21:12:17] [INFO ] Invariant cache hit.
[2024-06-02 21:12:18] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 21:12:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:18] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2024-06-02 21:12:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:12:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:18] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-06-02 21:12:19] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 4 ms to minimize.
[2024-06-02 21:12:19] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2024-06-02 21:12:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 344 ms
[2024-06-02 21:12:19] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 58 ms.
[2024-06-02 21:12:21] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 2 ms to minimize.
[2024-06-02 21:12:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2024-06-02 21:12:21] [INFO ] Added : 235 causal constraints over 49 iterations in 2191 ms. Result :sat
Minimization took 193 ms.
[2024-06-02 21:12:21] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 21:12:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:21] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-06-02 21:12:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:12:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:22] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2024-06-02 21:12:22] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 3 ms to minimize.
[2024-06-02 21:12:22] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 5 ms to minimize.
[2024-06-02 21:12:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 353 ms
[2024-06-02 21:12:22] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 51 ms.
[2024-06-02 21:12:24] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-06-02 21:12:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2024-06-02 21:12:24] [INFO ] Added : 239 causal constraints over 49 iterations in 2097 ms. Result :sat
Minimization took 187 ms.
[2024-06-02 21:12:24] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:12:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:25] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-06-02 21:12:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:12:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:25] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-06-02 21:12:25] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:12:25] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:12:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2024-06-02 21:12:25] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 45 ms.
[2024-06-02 21:12:27] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2024-06-02 21:12:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2024-06-02 21:12:27] [INFO ] Added : 223 causal constraints over 45 iterations in 1757 ms. Result :sat
Minimization took 159 ms.
[2024-06-02 21:12:27] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:12:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:27] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-06-02 21:12:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:12:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:27] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-06-02 21:12:27] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 0 ms to minimize.
[2024-06-02 21:12:28] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 0 ms to minimize.
[2024-06-02 21:12:28] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 0 ms to minimize.
[2024-06-02 21:12:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 400 ms
[2024-06-02 21:12:28] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 44 ms.
[2024-06-02 21:12:30] [INFO ] Added : 247 causal constraints over 50 iterations in 2039 ms. Result :sat
Minimization took 247 ms.
[2024-06-02 21:12:30] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:30] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-06-02 21:12:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:31] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-06-02 21:12:31] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2024-06-02 21:12:31] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2024-06-02 21:12:31] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 0 ms to minimize.
[2024-06-02 21:12:31] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 1 ms to minimize.
[2024-06-02 21:12:31] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:12:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 568 ms
[2024-06-02 21:12:31] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 35 ms.
[2024-06-02 21:12:33] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:12:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2024-06-02 21:12:33] [INFO ] Added : 244 causal constraints over 49 iterations in 2095 ms. Result :sat
Minimization took 620 ms.
[2024-06-02 21:12:34] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:12:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:34] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-06-02 21:12:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:12:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:34] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-06-02 21:12:34] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 1 ms to minimize.
[2024-06-02 21:12:35] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2024-06-02 21:12:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2024-06-02 21:12:35] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 35 ms.
[2024-06-02 21:12:37] [INFO ] Added : 269 causal constraints over 55 iterations in 2024 ms. Result :sat
Minimization took 251 ms.
[2024-06-02 21:12:37] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:12:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:37] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-06-02 21:12:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:12:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:37] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-06-02 21:12:37] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2024-06-02 21:12:37] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 0 ms to minimize.
[2024-06-02 21:12:38] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:12:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 356 ms
[2024-06-02 21:12:38] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 40 ms.
[2024-06-02 21:12:40] [INFO ] Added : 250 causal constraints over 51 iterations in 1929 ms. Result :sat
Minimization took 210 ms.
[2024-06-02 21:12:40] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 21:12:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:40] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-06-02 21:12:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:40] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-06-02 21:12:40] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 0 ms to minimize.
[2024-06-02 21:12:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-06-02 21:12:40] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 34 ms.
[2024-06-02 21:12:42] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2024-06-02 21:12:42] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 1 ms to minimize.
[2024-06-02 21:12:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 366 ms
[2024-06-02 21:12:43] [INFO ] Added : 248 causal constraints over 50 iterations in 2225 ms. Result :sat
Minimization took 235 ms.
[2024-06-02 21:12:43] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:43] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-06-02 21:12:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:12:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:43] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-06-02 21:12:43] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 1 ms to minimize.
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 1 ms to minimize.
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2024-06-02 21:12:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 677 ms
[2024-06-02 21:12:44] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 38 ms.
[2024-06-02 21:12:46] [INFO ] Added : 257 causal constraints over 52 iterations in 1946 ms. Result :sat
Minimization took 244 ms.
[2024-06-02 21:12:46] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:46] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-06-02 21:12:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:12:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:47] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-06-02 21:12:47] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2024-06-02 21:12:47] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2024-06-02 21:12:47] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2024-06-02 21:12:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 367 ms
[2024-06-02 21:12:47] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 37 ms.
[2024-06-02 21:12:49] [INFO ] Added : 255 causal constraints over 51 iterations in 1976 ms. Result :sat
Minimization took 251 ms.
[2024-06-02 21:12:49] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:49] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-06-02 21:12:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:12:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:50] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-06-02 21:12:50] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2024-06-02 21:12:50] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 1 ms to minimize.
[2024-06-02 21:12:50] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 1 ms to minimize.
[2024-06-02 21:12:50] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 1 ms to minimize.
[2024-06-02 21:12:50] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 0 ms to minimize.
[2024-06-02 21:12:50] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 1 ms to minimize.
[2024-06-02 21:12:51] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2024-06-02 21:12:51] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 1 ms to minimize.
[2024-06-02 21:12:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1165 ms
[2024-06-02 21:12:51] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 34 ms.
[2024-06-02 21:12:53] [INFO ] Added : 233 causal constraints over 47 iterations in 1768 ms. Result :sat
Minimization took 195 ms.
[2024-06-02 21:12:53] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:53] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-06-02 21:12:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:12:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:53] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-06-02 21:12:53] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2024-06-02 21:12:54] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 1 ms to minimize.
[2024-06-02 21:12:54] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 0 ms to minimize.
[2024-06-02 21:12:54] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:12:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 482 ms
[2024-06-02 21:12:54] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 35 ms.
[2024-06-02 21:12:56] [INFO ] Added : 242 causal constraints over 49 iterations in 1910 ms. Result :sat
Minimization took 340 ms.
[2024-06-02 21:12:56] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:12:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:56] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-06-02 21:12:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:12:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:12:56] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-06-02 21:12:56] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2024-06-02 21:12:57] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 0 ms to minimize.
[2024-06-02 21:12:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2024-06-02 21:12:57] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 31 ms.
[2024-06-02 21:12:58] [INFO ] Added : 223 causal constraints over 45 iterations in 1632 ms. Result :sat
Minimization took 196 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA MedleyA-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 473/473 transitions.
Graph (trivial) has 201 edges and 192 vertex of which 9 / 192 are part of one of the 3 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 186 transition count 437
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 159 transition count 435
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 57 place count 159 transition count 429
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 69 place count 153 transition count 429
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 110 place count 112 transition count 358
Iterating global reduction 2 with 41 rules applied. Total rules applied 151 place count 112 transition count 358
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 165 place count 112 transition count 344
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 165 place count 112 transition count 336
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 181 place count 104 transition count 336
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 182 place count 104 transition count 335
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 184 place count 102 transition count 328
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 102 transition count 328
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 202 place count 94 transition count 320
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -139
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 240 place count 75 transition count 459
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 245 place count 75 transition count 454
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 5 with 58 rules applied. Total rules applied 303 place count 75 transition count 396
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 305 place count 74 transition count 409
Free-agglomeration rule applied 15 times with reduction of 6 identical transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 320 place count 74 transition count 388
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 351 place count 59 transition count 372
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 363 place count 59 transition count 360
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 364 place count 58 transition count 359
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 36 edges and 56 vertex of which 9 / 56 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 367 place count 51 transition count 359
Drop transitions removed 33 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 7 with 45 rules applied. Total rules applied 412 place count 51 transition count 314
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 413 place count 50 transition count 304
Iterating global reduction 8 with 1 rules applied. Total rules applied 414 place count 50 transition count 304
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 426 place count 50 transition count 292
Drop transitions removed 81 transitions
Redundant transition composition rules discarded 81 transitions
Iterating global reduction 9 with 81 rules applied. Total rules applied 507 place count 50 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 508 place count 50 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 509 place count 49 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 509 place count 49 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 511 place count 48 transition count 209
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 513 place count 46 transition count 199
Iterating global reduction 11 with 2 rules applied. Total rules applied 515 place count 46 transition count 199
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 11 with 2 rules applied. Total rules applied 517 place count 45 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 519 place count 44 transition count 209
Applied a total of 519 rules in 249 ms. Remains 44 /192 variables (removed 148) and now considering 209/473 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 44/192 places, 209/473 transitions.
Normalized transition count is 193 out of 209 initially.
// Phase 1: matrix 193 rows 44 cols
[2024-06-02 21:13:00] [INFO ] Computed 5 invariants in 13 ms
Incomplete random walk after 1000000 steps, including 46 resets, run finished after 1608 ms. (steps per millisecond=621 ) properties (out of 11) seen :11
FORMULA MedleyA-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 44841 ms.

BK_STOP 1717362783212

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is MedleyA-PT-15, 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 r597-smll-171734926400071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-15.tgz
mv MedleyA-PT-15 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;