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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 238K 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-22-UpperBounds-00
FORMULA_NAME MedleyA-PT-22-UpperBounds-01
FORMULA_NAME MedleyA-PT-22-UpperBounds-02
FORMULA_NAME MedleyA-PT-22-UpperBounds-03
FORMULA_NAME MedleyA-PT-22-UpperBounds-04
FORMULA_NAME MedleyA-PT-22-UpperBounds-05
FORMULA_NAME MedleyA-PT-22-UpperBounds-06
FORMULA_NAME MedleyA-PT-22-UpperBounds-07
FORMULA_NAME MedleyA-PT-22-UpperBounds-08
FORMULA_NAME MedleyA-PT-22-UpperBounds-09
FORMULA_NAME MedleyA-PT-22-UpperBounds-10
FORMULA_NAME MedleyA-PT-22-UpperBounds-11
FORMULA_NAME MedleyA-PT-22-UpperBounds-12
FORMULA_NAME MedleyA-PT-22-UpperBounds-13
FORMULA_NAME MedleyA-PT-22-UpperBounds-14
FORMULA_NAME MedleyA-PT-22-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717367456938

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-22
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:30:59] [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 22:30:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:31:00] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2024-06-02 22:31:00] [INFO ] Transformed 307 places.
[2024-06-02 22:31:00] [INFO ] Transformed 740 transitions.
[2024-06-02 22:31:00] [INFO ] Found NUPN structural information;
[2024-06-02 22:31:00] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 479 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 740 rows 307 cols
[2024-06-02 22:31:00] [INFO ] Computed 24 invariants in 41 ms
Incomplete random walk after 10000 steps, including 289 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :7
FORMULA MedleyA-PT-22-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :1
FORMULA MedleyA-PT-22-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
[2024-06-02 22:31:00] [INFO ] Invariant cache hit.
[2024-06-02 22:31:01] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2024-06-02 22:31:01] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 8 ms returned sat
[2024-06-02 22:31:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:01] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2024-06-02 22:31:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:31:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-06-02 22:31:01] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 22:31:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:02] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2024-06-02 22:31:02] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 250 ms.
[2024-06-02 22:31:04] [INFO ] Deduced a trap composed of 42 places in 343 ms of which 18 ms to minimize.
[2024-06-02 22:31:04] [INFO ] Deduced a trap composed of 33 places in 600 ms of which 2 ms to minimize.
[2024-06-02 22:31:05] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 1 ms to minimize.
[2024-06-02 22:31:05] [INFO ] Deduced a trap composed of 40 places in 320 ms of which 4 ms to minimize.
[2024-06-02 22:31:05] [INFO ] Deduced a trap composed of 39 places in 305 ms of which 1 ms to minimize.
[2024-06-02 22:31:06] [INFO ] Deduced a trap composed of 51 places in 228 ms of which 1 ms to minimize.
[2024-06-02 22:31:06] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2024-06-02 22:31:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2559 ms
[2024-06-02 22:31:06] [INFO ] Added : 100 causal constraints over 21 iterations in 4178 ms. Result :sat
Minimization took 186 ms.
[2024-06-02 22:31:06] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-06-02 22:31:06] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 12 ms returned sat
[2024-06-02 22:31:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:06] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2024-06-02 22:31:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:31:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-06-02 22:31:07] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 9 ms returned sat
[2024-06-02 22:31:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:07] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2024-06-02 22:31:07] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 3 ms to minimize.
[2024-06-02 22:31:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2024-06-02 22:31:07] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 64 ms.
[2024-06-02 22:31:09] [INFO ] Deduced a trap composed of 35 places in 299 ms of which 0 ms to minimize.
[2024-06-02 22:31:09] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 1 ms to minimize.
[2024-06-02 22:31:09] [INFO ] Deduced a trap composed of 56 places in 227 ms of which 1 ms to minimize.
[2024-06-02 22:31:09] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 2 ms to minimize.
[2024-06-02 22:31:10] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 1 ms to minimize.
[2024-06-02 22:31:10] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 1 ms to minimize.
[2024-06-02 22:31:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1638 ms
[2024-06-02 22:31:10] [INFO ] Added : 94 causal constraints over 20 iterations in 2928 ms. Result :sat
Minimization took 164 ms.
[2024-06-02 22:31:10] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-06-02 22:31:10] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 9 ms returned sat
[2024-06-02 22:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:11] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2024-06-02 22:31:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:31:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-06-02 22:31:11] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 9 ms returned sat
[2024-06-02 22:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:11] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2024-06-02 22:31:11] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 1 ms to minimize.
[2024-06-02 22:31:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2024-06-02 22:31:11] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 64 ms.
[2024-06-02 22:31:13] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 1 ms to minimize.
[2024-06-02 22:31:13] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 1 ms to minimize.
[2024-06-02 22:31:13] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 1 ms to minimize.
[2024-06-02 22:31:13] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 1 ms to minimize.
[2024-06-02 22:31:14] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 1 ms to minimize.
[2024-06-02 22:31:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1431 ms
[2024-06-02 22:31:14] [INFO ] Added : 104 causal constraints over 24 iterations in 2732 ms. Result :sat
Minimization took 165 ms.
[2024-06-02 22:31:14] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-02 22:31:14] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 9 ms returned sat
[2024-06-02 22:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:14] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2024-06-02 22:31:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:31:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-06-02 22:31:15] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 9 ms returned sat
[2024-06-02 22:31:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:15] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2024-06-02 22:31:15] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 65 ms.
[2024-06-02 22:31:16] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 0 ms to minimize.
[2024-06-02 22:31:17] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 1 ms to minimize.
[2024-06-02 22:31:17] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 0 ms to minimize.
[2024-06-02 22:31:17] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 0 ms to minimize.
[2024-06-02 22:31:17] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:31:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1097 ms
[2024-06-02 22:31:17] [INFO ] Added : 103 causal constraints over 22 iterations in 2588 ms. Result :sat
Minimization took 213 ms.
[2024-06-02 22:31:18] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-06-02 22:31:18] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 10 ms returned sat
[2024-06-02 22:31:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:18] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-06-02 22:31:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:31:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-06-02 22:31:18] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 9 ms returned sat
[2024-06-02 22:31:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:18] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2024-06-02 22:31:19] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 61 ms.
[2024-06-02 22:31:20] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 0 ms to minimize.
[2024-06-02 22:31:20] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 1 ms to minimize.
[2024-06-02 22:31:20] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
[2024-06-02 22:31:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 762 ms
[2024-06-02 22:31:20] [INFO ] Added : 84 causal constraints over 18 iterations in 1812 ms. Result :sat
Minimization took 150 ms.
[2024-06-02 22:31:21] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-06-02 22:31:21] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 10 ms returned sat
[2024-06-02 22:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:21] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2024-06-02 22:31:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:31:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-06-02 22:31:21] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 9 ms returned sat
[2024-06-02 22:31:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:21] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2024-06-02 22:31:21] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 64 ms.
[2024-06-02 22:31:22] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 0 ms to minimize.
[2024-06-02 22:31:23] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-06-02 22:31:23] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 0 ms to minimize.
[2024-06-02 22:31:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 473 ms
[2024-06-02 22:31:23] [INFO ] Added : 91 causal constraints over 19 iterations in 1526 ms. Result :sat
Minimization took 187 ms.
[2024-06-02 22:31:23] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-06-02 22:31:23] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 9 ms returned sat
[2024-06-02 22:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:23] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2024-06-02 22:31:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:31:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-06-02 22:31:24] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 10 ms returned sat
[2024-06-02 22:31:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:24] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2024-06-02 22:31:24] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 0 ms to minimize.
[2024-06-02 22:31:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2024-06-02 22:31:24] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 58 ms.
[2024-06-02 22:31:25] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 0 ms to minimize.
[2024-06-02 22:31:25] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 2 ms to minimize.
[2024-06-02 22:31:25] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 4 ms to minimize.
[2024-06-02 22:31:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 744 ms
[2024-06-02 22:31:26] [INFO ] Added : 85 causal constraints over 18 iterations in 1724 ms. Result :sat
Minimization took 145 ms.
[2024-06-02 22:31:26] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-06-02 22:31:26] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 11 ms returned sat
[2024-06-02 22:31:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:26] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2024-06-02 22:31:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:31:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-06-02 22:31:26] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 10 ms returned sat
[2024-06-02 22:31:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:31:27] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2024-06-02 22:31:27] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 1 ms to minimize.
[2024-06-02 22:31:27] [INFO ] Deduced a trap composed of 45 places in 287 ms of which 1 ms to minimize.
[2024-06-02 22:31:27] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 0 ms to minimize.
[2024-06-02 22:31:28] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 1 ms to minimize.
[2024-06-02 22:31:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1103 ms
[2024-06-02 22:31:28] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 61 ms.
[2024-06-02 22:31:29] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 0 ms to minimize.
[2024-06-02 22:31:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2024-06-02 22:31:29] [INFO ] Added : 77 causal constraints over 17 iterations in 1335 ms. Result :sat
Minimization took 167 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA MedleyA-PT-22-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-22-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-22-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 740/740 transitions.
Graph (complete) has 1184 edges and 307 vertex of which 300 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 300 transition count 683
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 117 place count 247 transition count 674
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 117 place count 247 transition count 670
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 125 place count 243 transition count 670
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 192 place count 176 transition count 585
Iterating global reduction 2 with 67 rules applied. Total rules applied 259 place count 176 transition count 585
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 259 place count 176 transition count 582
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 265 place count 173 transition count 582
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 291 place count 147 transition count 514
Iterating global reduction 2 with 26 rules applied. Total rules applied 317 place count 147 transition count 514
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 329 place count 135 transition count 484
Iterating global reduction 2 with 12 rules applied. Total rules applied 341 place count 135 transition count 484
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 347 place count 129 transition count 466
Iterating global reduction 2 with 6 rules applied. Total rules applied 353 place count 129 transition count 466
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 397 place count 107 transition count 444
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 400 place count 104 transition count 441
Iterating global reduction 2 with 3 rules applied. Total rules applied 403 place count 104 transition count 441
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 413 place count 99 transition count 470
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 433 place count 99 transition count 450
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 435 place count 98 transition count 460
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 441 place count 98 transition count 454
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 447 place count 92 transition count 454
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 464 place count 92 transition count 572
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 499 place count 75 transition count 554
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 501 place count 75 transition count 552
Applied a total of 501 rules in 376 ms. Remains 75 /307 variables (removed 232) and now considering 552/740 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 377 ms. Remains : 75/307 places, 552/740 transitions.
Successfully produced net in file /tmp/petri1000_5143426748857347637.dot
Successfully produced net in file /tmp/petri1001_14520904749293801021.dot
Successfully produced net in file /tmp/petri1002_12385209705160786082.dot
Successfully produced net in file /tmp/petri1003_4932149208451508667.dot
Successfully produced net in file /tmp/petri1004_17865212190498781090.dot
Successfully produced net in file /tmp/petri1005_1117898559585982953.dot
Successfully produced net in file /tmp/petri1006_6463587673060857718.dot
Successfully produced net in file /tmp/petri1007_6926005040804744635.dot
Successfully produced net in file /tmp/petri1008_13164381270292215520.dot
Successfully produced net in file /tmp/petri1009_9345439084720638247.dot
Successfully produced net in file /tmp/petri1010_11903606503876399930.dot
Successfully produced net in file /tmp/petri1011_6283704611293661551.dot
Successfully produced net in file /tmp/petri1012_10000896739691093817.dot
Successfully produced net in file /tmp/petri1013_6080602168484138781.dot
Successfully produced net in file /tmp/petri1014_13285135064737347739.dot
Successfully produced net in file /tmp/petri1015_5893786113447755912.dot
Successfully produced net in file /tmp/petri1016_17647932488507445002.dot
Successfully produced net in file /tmp/petri1017_16427710143168833831.dot
Successfully produced net in file /tmp/petri1018_14357412479795010451.dot
Successfully produced net in file /tmp/petri1019_17657240843675533210.dot
Successfully produced net in file /tmp/petri1020_10050129255991399110.dot
Successfully produced net in file /tmp/petri1021_16700106717210932199.dot
Successfully produced net in file /tmp/petri1022_13387524192135315451.dot
Successfully produced net in file /tmp/petri1023_14580619770751280052.dot
Successfully produced net in file /tmp/petri1024_1529044173073924228.dot
Successfully produced net in file /tmp/petri1025_8436350492613121502.dot
Successfully produced net in file /tmp/petri1026_3313619373808552955.dot
Successfully produced net in file /tmp/petri1027_1122334465833748240.dot
Successfully produced net in file /tmp/petri1028_4223677585498223145.dot
Successfully produced net in file /tmp/petri1029_11899529075414201784.dot
Successfully produced net in file /tmp/petri1030_10361462360798219112.dot
Successfully produced net in file /tmp/petri1031_5942420847703553405.dot
Successfully produced net in file /tmp/petri1032_11274757773052994250.dot
Successfully produced net in file /tmp/petri1033_11023462736889603684.dot
Successfully produced net in file /tmp/petri1034_15002618713704892117.dot
Successfully produced net in file /tmp/petri1035_3008169637524957061.dot
Successfully produced net in file /tmp/petri1036_1339775590177496882.dot
Successfully produced net in file /tmp/petri1037_5239370760659620868.dot
Successfully produced net in file /tmp/petri1038_10653756724916785990.dot
Successfully produced net in file /tmp/petri1039_3275054312185742507.dot
Successfully produced net in file /tmp/petri1040_2159401346738451027.dot
Successfully produced net in file /tmp/petri1041_11205259917800851203.dot
Successfully produced net in file /tmp/petri1042_8826758855690469462.dot
Successfully produced net in file /tmp/petri1043_5642936645004388978.dot
Successfully produced net in file /tmp/petri1044_6246156719703576074.dot
Successfully produced net in file /tmp/petri1045_6306367863181653030.dot
Successfully produced net in file /tmp/petri1046_17708266463476028881.dot
Successfully produced net in file /tmp/petri1047_2019353365713653985.dot
Successfully produced net in file /tmp/petri1048_16034383870076143551.dot
Successfully produced net in file /tmp/petri1049_18087188272159651759.dot
Successfully produced net in file /tmp/petri1050_9258774716363668996.dot
Successfully produced net in file /tmp/petri1051_7568965707500352523.dot
Successfully produced net in file /tmp/petri1052_6542308816756323341.dot
Successfully produced net in file /tmp/petri1053_3148108048581501619.dot
Drop transitions removed 54 transitions
Dominated transitions for bounds rules discarded 54 transitions
Normalized transition count is 432 out of 498 initially.
// Phase 1: matrix 432 rows 75 cols
[2024-06-02 22:31:31] [INFO ] Computed 23 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 225661 resets, run finished after 9662 ms. (steps per millisecond=103 ) properties (out of 5) seen :5
FORMULA MedleyA-PT-22-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 41559 ms.

BK_STOP 1717367502508

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

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