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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 24K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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 184K 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-19-UpperBounds-00
FORMULA_NAME MedleyA-PT-19-UpperBounds-01
FORMULA_NAME MedleyA-PT-19-UpperBounds-02
FORMULA_NAME MedleyA-PT-19-UpperBounds-03
FORMULA_NAME MedleyA-PT-19-UpperBounds-04
FORMULA_NAME MedleyA-PT-19-UpperBounds-05
FORMULA_NAME MedleyA-PT-19-UpperBounds-06
FORMULA_NAME MedleyA-PT-19-UpperBounds-07
FORMULA_NAME MedleyA-PT-19-UpperBounds-08
FORMULA_NAME MedleyA-PT-19-UpperBounds-09
FORMULA_NAME MedleyA-PT-19-UpperBounds-10
FORMULA_NAME MedleyA-PT-19-UpperBounds-11
FORMULA_NAME MedleyA-PT-19-UpperBounds-12
FORMULA_NAME MedleyA-PT-19-UpperBounds-13
FORMULA_NAME MedleyA-PT-19-UpperBounds-14
FORMULA_NAME MedleyA-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717363533270

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-19
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 21:25:35] [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:25:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:25:36] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2024-06-02 21:25:36] [INFO ] Transformed 272 places.
[2024-06-02 21:25:36] [INFO ] Transformed 586 transitions.
[2024-06-02 21:25:36] [INFO ] Found NUPN structural information;
[2024-06-02 21:25:36] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 3 transitions.
// Phase 1: matrix 583 rows 269 cols
[2024-06-02 21:25:36] [INFO ] Computed 24 invariants in 34 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 16) seen :6
FORMULA MedleyA-PT-19-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-19-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :1
FORMULA MedleyA-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
[2024-06-02 21:25:36] [INFO ] Invariant cache hit.
[2024-06-02 21:25:37] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2024-06-02 21:25:37] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 9 ms returned sat
[2024-06-02 21:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:37] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2024-06-02 21:25:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:25:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-02 21:25:37] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 6 ms returned sat
[2024-06-02 21:25:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:37] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2024-06-02 21:25:38] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 99 ms.
[2024-06-02 21:25:39] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 7 ms to minimize.
[2024-06-02 21:25:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2024-06-02 21:25:39] [INFO ] Added : 142 causal constraints over 29 iterations in 1597 ms. Result :sat
Minimization took 173 ms.
[2024-06-02 21:25:39] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-02 21:25:39] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 5 ms returned sat
[2024-06-02 21:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:40] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2024-06-02 21:25:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:25:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-02 21:25:40] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:40] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-06-02 21:25:40] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 58 ms.
[2024-06-02 21:25:41] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2024-06-02 21:25:41] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:25:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2024-06-02 21:25:41] [INFO ] Added : 158 causal constraints over 33 iterations in 1468 ms. Result :sat
Minimization took 132 ms.
[2024-06-02 21:25:42] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-06-02 21:25:42] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:42] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2024-06-02 21:25:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:25:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-02 21:25:42] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 8 ms returned sat
[2024-06-02 21:25:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:42] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2024-06-02 21:25:42] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-06-02 21:25:42] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 46 ms.
[2024-06-02 21:25:43] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 1 ms to minimize.
[2024-06-02 21:25:43] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 0 ms to minimize.
[2024-06-02 21:25:44] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 0 ms to minimize.
[2024-06-02 21:25:44] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 1 ms to minimize.
[2024-06-02 21:25:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 775 ms
[2024-06-02 21:25:44] [INFO ] Added : 134 causal constraints over 28 iterations in 1814 ms. Result :sat
Minimization took 211 ms.
[2024-06-02 21:25:44] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-02 21:25:44] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:25:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:44] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-06-02 21:25:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:25:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-02 21:25:45] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:25:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:45] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2024-06-02 21:25:45] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:25:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-06-02 21:25:45] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 48 ms.
[2024-06-02 21:25:46] [INFO ] Added : 139 causal constraints over 28 iterations in 982 ms. Result :sat
Minimization took 143 ms.
[2024-06-02 21:25:46] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-02 21:25:46] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:25:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:46] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-06-02 21:25:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:25:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-02 21:25:46] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:25:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:47] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-06-02 21:25:47] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 0 ms to minimize.
[2024-06-02 21:25:47] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 0 ms to minimize.
[2024-06-02 21:25:47] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:25:47] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:25:47] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:25:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 449 ms
[2024-06-02 21:25:47] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 41 ms.
[2024-06-02 21:25:48] [INFO ] Added : 155 causal constraints over 31 iterations in 1009 ms. Result :sat
Minimization took 158 ms.
[2024-06-02 21:25:48] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-02 21:25:48] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:25:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:49] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2024-06-02 21:25:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:25:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-02 21:25:49] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 8 ms returned sat
[2024-06-02 21:25:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:49] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2024-06-02 21:25:49] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 0 ms to minimize.
[2024-06-02 21:25:49] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:25:49] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2024-06-02 21:25:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 310 ms
[2024-06-02 21:25:49] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 42 ms.
[2024-06-02 21:25:50] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:25:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-06-02 21:25:50] [INFO ] Added : 134 causal constraints over 27 iterations in 1075 ms. Result :sat
Minimization took 160 ms.
[2024-06-02 21:25:50] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-02 21:25:50] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 11 ms returned sat
[2024-06-02 21:25:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:51] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2024-06-02 21:25:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:25:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-06-02 21:25:51] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 8 ms returned sat
[2024-06-02 21:25:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:51] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-06-02 21:25:51] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 46 ms.
[2024-06-02 21:25:52] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2024-06-02 21:25:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2024-06-02 21:25:52] [INFO ] Added : 155 causal constraints over 32 iterations in 1287 ms. Result :sat
Minimization took 159 ms.
[2024-06-02 21:25:53] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-02 21:25:53] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:53] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-06-02 21:25:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:25:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-02 21:25:53] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:53] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-06-02 21:25:53] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 46 ms.
[2024-06-02 21:25:54] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2024-06-02 21:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2024-06-02 21:25:54] [INFO ] Added : 147 causal constraints over 31 iterations in 1259 ms. Result :sat
Minimization took 144 ms.
[2024-06-02 21:25:55] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-02 21:25:55] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:55] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-06-02 21:25:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:25:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-02 21:25:55] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:25:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:25:55] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-06-02 21:25:55] [INFO ] Computed and/alt/rep : 205/568/205 causal constraints (skipped 377 transitions) in 37 ms.
[2024-06-02 21:25:56] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
[2024-06-02 21:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2024-06-02 21:25:56] [INFO ] Added : 150 causal constraints over 31 iterations in 1263 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA MedleyA-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-19-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-19-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 583/583 transitions.
Graph (complete) has 909 edges and 269 vertex of which 263 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 263 transition count 529
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 105 place count 214 transition count 524
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 212 transition count 523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 211 transition count 523
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 109 place count 211 transition count 516
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 123 place count 204 transition count 516
Discarding 71 places :
Symmetric choice reduction at 4 with 71 rule applications. Total rules 194 place count 133 transition count 427
Iterating global reduction 4 with 71 rules applied. Total rules applied 265 place count 133 transition count 427
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 265 place count 133 transition count 424
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 271 place count 130 transition count 424
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 333 place count 99 transition count 393
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 337 place count 99 transition count 389
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 5 with 10 rules applied. Total rules applied 347 place count 94 transition count 418
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 383 place count 94 transition count 382
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 385 place count 93 transition count 392
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 391 place count 93 transition count 386
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 397 place count 87 transition count 386
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 6 with 16 rules applied. Total rules applied 413 place count 87 transition count 502
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 44 rules applied. Total rules applied 457 place count 71 transition count 474
Applied a total of 457 rules in 246 ms. Remains 71 /269 variables (removed 198) and now considering 474/583 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 71/269 places, 474/583 transitions.
Successfully produced net in file /tmp/petri1000_887653328908890133.dot
Successfully produced net in file /tmp/petri1001_4442624135072933912.dot
Successfully produced net in file /tmp/petri1002_2423923553184883354.dot
Successfully produced net in file /tmp/petri1003_12853684795582514580.dot
Successfully produced net in file /tmp/petri1004_13555988477402966285.dot
Successfully produced net in file /tmp/petri1005_3417886430902212522.dot
Successfully produced net in file /tmp/petri1006_7110088611173875556.dot
Successfully produced net in file /tmp/petri1007_11968399936141421502.dot
Successfully produced net in file /tmp/petri1008_7578748644327992055.dot
Successfully produced net in file /tmp/petri1009_2357728903917082995.dot
Successfully produced net in file /tmp/petri1010_13740207938692934011.dot
Successfully produced net in file /tmp/petri1011_16881074115695191499.dot
Successfully produced net in file /tmp/petri1012_13448834449429213051.dot
Successfully produced net in file /tmp/petri1013_16193646742141559835.dot
Successfully produced net in file /tmp/petri1014_221438923232001783.dot
Successfully produced net in file /tmp/petri1015_10436798069874383785.dot
Successfully produced net in file /tmp/petri1016_1999377061631653653.dot
Successfully produced net in file /tmp/petri1017_10545483159015304459.dot
Successfully produced net in file /tmp/petri1018_5545063746909870904.dot
Successfully produced net in file /tmp/petri1019_15451765068092258500.dot
Successfully produced net in file /tmp/petri1020_2682134276321174183.dot
Successfully produced net in file /tmp/petri1021_4044270522380789297.dot
Successfully produced net in file /tmp/petri1022_16663128922096874337.dot
Successfully produced net in file /tmp/petri1023_8095011665933671482.dot
Successfully produced net in file /tmp/petri1024_2848511617073741905.dot
Successfully produced net in file /tmp/petri1025_13285704724082265152.dot
Successfully produced net in file /tmp/petri1026_17169118606320387677.dot
Successfully produced net in file /tmp/petri1027_9560122909241235514.dot
Successfully produced net in file /tmp/petri1028_3297053006646473888.dot
Successfully produced net in file /tmp/petri1029_208681986685166648.dot
Successfully produced net in file /tmp/petri1030_2781539179807180593.dot
Successfully produced net in file /tmp/petri1031_16975161576061103071.dot
Successfully produced net in file /tmp/petri1032_12018607042155382209.dot
Successfully produced net in file /tmp/petri1033_16186842377519299218.dot
Successfully produced net in file /tmp/petri1034_6865265165775770451.dot
Successfully produced net in file /tmp/petri1035_4577607810532588045.dot
Successfully produced net in file /tmp/petri1036_11055319419002262144.dot
Successfully produced net in file /tmp/petri1037_6299674439880850110.dot
Successfully produced net in file /tmp/petri1038_1376654588348608331.dot
Successfully produced net in file /tmp/petri1039_17374542940050619693.dot
Successfully produced net in file /tmp/petri1040_9070013951353126182.dot
Successfully produced net in file /tmp/petri1041_7954504196792987021.dot
Successfully produced net in file /tmp/petri1042_9610874190218115002.dot
Successfully produced net in file /tmp/petri1043_18203087745211105462.dot
Successfully produced net in file /tmp/petri1044_5420083973644423827.dot
Successfully produced net in file /tmp/petri1045_166368217430325705.dot
Successfully produced net in file /tmp/petri1046_56085318092301435.dot
Successfully produced net in file /tmp/petri1047_15319558588297535898.dot
Successfully produced net in file /tmp/petri1048_7170222123002904729.dot
Successfully produced net in file /tmp/petri1049_18383909495461821948.dot
Drop transitions removed 50 transitions
Dominated transitions for bounds rules discarded 50 transitions
Normalized transition count is 354 out of 424 initially.
// Phase 1: matrix 354 rows 71 cols
[2024-06-02 21:25:58] [INFO ] Computed 23 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 161988 resets, run finished after 5826 ms. (steps per millisecond=171 ) properties (out of 2) seen :2
FORMULA MedleyA-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 27956 ms.

BK_STOP 1717363564944

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

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