Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 107K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748895809518

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:23:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 20:23:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:23:32] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2025-06-02 20:23:32] [INFO ] Transformed 149 places.
[2025-06-02 20:23:32] [INFO ] Transformed 340 transitions.
[2025-06-02 20:23:32] [INFO ] Found NUPN structural information;
[2025-06-02 20:23:32] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 553 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 340 rows 149 cols
[2025-06-02 20:23:32] [INFO ] Computed 12 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (437 resets) in 97 ms. (102 steps per ms)
FORMULA MedleyA-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (858 resets) in 198 ms. (402 steps per ms)
FORMULA MedleyA-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-06-02 20:23:32] [INFO ] Invariant cache hit.
[2025-06-02 20:23:33] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:23:33] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 6 ms returned sat
[2025-06-02 20:23:33] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2025-06-02 20:23:33] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 16 ms to minimize.
[2025-06-02 20:23:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:23:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:23:33] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 7 ms returned sat
[2025-06-02 20:23:34] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2025-06-02 20:23:34] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 68 ms.
[2025-06-02 20:23:34] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 2 ms to minimize.
[2025-06-02 20:23:34] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 2 ms to minimize.
[2025-06-02 20:23:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2025-06-02 20:23:35] [INFO ] Added : 55 causal constraints over 12 iterations in 935 ms. Result :sat
Minimization took 149 ms.
[2025-06-02 20:23:35] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:23:35] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:23:35] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2025-06-02 20:23:35] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 2 ms to minimize.
[2025-06-02 20:23:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:23:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 20:23:35] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:23:35] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2025-06-02 20:23:36] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 3 ms to minimize.
[2025-06-02 20:23:36] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 3 ms to minimize.
[2025-06-02 20:23:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2025-06-02 20:23:36] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 61 ms.
[2025-06-02 20:23:36] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 3 ms to minimize.
[2025-06-02 20:23:37] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 3 ms to minimize.
[2025-06-02 20:23:37] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 2 ms to minimize.
[2025-06-02 20:23:37] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2025-06-02 20:23:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 847 ms
[2025-06-02 20:23:37] [INFO ] Added : 62 causal constraints over 14 iterations in 1385 ms. Result :sat
Minimization took 229 ms.
[2025-06-02 20:23:38] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 20:23:38] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 20:23:38] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2025-06-02 20:23:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:23:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:23:38] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:23:38] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2025-06-02 20:23:38] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 55 ms.
[2025-06-02 20:23:39] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2025-06-02 20:23:39] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:23:39] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:23:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 565 ms
[2025-06-02 20:23:39] [INFO ] Added : 67 causal constraints over 15 iterations in 1248 ms. Result :sat
Minimization took 213 ms.
[2025-06-02 20:23:40] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 20:23:40] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:23:40] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2025-06-02 20:23:40] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 48 ms.
[2025-06-02 20:23:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:23:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-02 20:23:40] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:23:40] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-06-02 20:23:40] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 46 ms.
[2025-06-02 20:23:41] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 2 ms to minimize.
[2025-06-02 20:23:41] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 2 ms to minimize.
[2025-06-02 20:23:41] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2025-06-02 20:23:41] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 2 ms to minimize.
[2025-06-02 20:23:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 793 ms
[2025-06-02 20:23:42] [INFO ] Added : 60 causal constraints over 13 iterations in 1378 ms. Result :sat
Minimization took 198 ms.
[2025-06-02 20:23:42] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:23:42] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:23:42] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-06-02 20:23:42] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2025-06-02 20:23:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:23:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-02 20:23:42] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 20:23:42] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2025-06-02 20:23:43] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 2 ms to minimize.
[2025-06-02 20:23:43] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 3 ms to minimize.
[2025-06-02 20:23:43] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 3 ms to minimize.
[2025-06-02 20:23:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 505 ms
[2025-06-02 20:23:43] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 41 ms.
[2025-06-02 20:23:43] [INFO ] Added : 56 causal constraints over 12 iterations in 480 ms. Result :sat
Minimization took 210 ms.
[2025-06-02 20:23:44] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 20:23:44] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:23:44] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2025-06-02 20:23:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:23:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 20:23:44] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:23:44] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2025-06-02 20:23:44] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 46 ms.
[2025-06-02 20:23:45] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 2 ms to minimize.
[2025-06-02 20:23:45] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2025-06-02 20:23:45] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 2 ms to minimize.
[2025-06-02 20:23:45] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2025-06-02 20:23:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 674 ms
[2025-06-02 20:23:45] [INFO ] Added : 62 causal constraints over 13 iterations in 1235 ms. Result :sat
Minimization took 203 ms.
[2025-06-02 20:23:46] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:23:46] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:23:46] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2025-06-02 20:23:46] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 2 ms to minimize.
[2025-06-02 20:23:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:23:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 20:23:46] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:23:46] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-06-02 20:23:46] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 2 ms to minimize.
[2025-06-02 20:23:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2025-06-02 20:23:46] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 39 ms.
[2025-06-02 20:23:47] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:23:47] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 3 ms to minimize.
[2025-06-02 20:23:47] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2025-06-02 20:23:47] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2025-06-02 20:23:47] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2025-06-02 20:23:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 779 ms
[2025-06-02 20:23:48] [INFO ] Added : 56 causal constraints over 12 iterations in 1172 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 340/340 transitions.
Graph (complete) has 543 edges and 149 vertex of which 144 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 144 transition count 314
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 54 place count 121 transition count 308
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 120 transition count 307
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 56 place count 120 transition count 304
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 62 place count 117 transition count 304
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 93 place count 86 transition count 265
Iterating global reduction 3 with 31 rules applied. Total rules applied 124 place count 86 transition count 265
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 124 place count 86 transition count 263
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 128 place count 84 transition count 263
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 138 place count 74 transition count 239
Iterating global reduction 3 with 10 rules applied. Total rules applied 148 place count 74 transition count 239
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 152 place count 70 transition count 229
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 70 transition count 229
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 68 transition count 223
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 68 transition count 223
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 188 place count 54 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 189 place count 54 transition count 208
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 191 place count 52 transition count 206
Iterating global reduction 4 with 2 rules applied. Total rules applied 193 place count 52 transition count 206
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 201 place count 48 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 210 place count 48 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 210 place count 48 transition count 204
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 47 transition count 204
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 216 place count 45 transition count 227
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 221 place count 45 transition count 222
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 226 place count 40 transition count 222
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 228 place count 40 transition count 220
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 230 place count 38 transition count 220
Applied a total of 230 rules in 182 ms. Remains 38 /149 variables (removed 111) and now considering 220/340 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 38/149 places, 220/340 transitions.
[2025-06-02 20:23:49] [INFO ] Flow matrix only has 172 transitions (discarded 48 similar events)
// Phase 1: matrix 172 rows 38 cols
[2025-06-02 20:23:49] [INFO ] Computed 11 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (225468 resets) in 4602 ms. (217 steps per ms)
FORMULA MedleyA-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (41625 resets) in 1013 ms. (986 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 20:23:55] [INFO ] Flatten gal took : 132 ms
[2025-06-02 20:23:55] [INFO ] Flatten gal took : 53 ms
[2025-06-02 20:23:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3283965366553990910.gal : 39 ms
[2025-06-02 20:23:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15477774454754491420.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3283965366553990910.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15477774454754491420.prop' '--nowitness' '--gen-order' 'FOLLOW'

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

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 23556 ms.

BK_STOP 1748895835419

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is MedleyA-PT-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r139-smll-174876533100022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-10.tgz
mv MedleyA-PT-10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;