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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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 90K 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-08-UpperBounds-00
FORMULA_NAME MedleyA-PT-08-UpperBounds-01
FORMULA_NAME MedleyA-PT-08-UpperBounds-02
FORMULA_NAME MedleyA-PT-08-UpperBounds-03
FORMULA_NAME MedleyA-PT-08-UpperBounds-04
FORMULA_NAME MedleyA-PT-08-UpperBounds-05
FORMULA_NAME MedleyA-PT-08-UpperBounds-06
FORMULA_NAME MedleyA-PT-08-UpperBounds-07
FORMULA_NAME MedleyA-PT-08-UpperBounds-08
FORMULA_NAME MedleyA-PT-08-UpperBounds-09
FORMULA_NAME MedleyA-PT-08-UpperBounds-10
FORMULA_NAME MedleyA-PT-08-UpperBounds-11
FORMULA_NAME MedleyA-PT-08-UpperBounds-12
FORMULA_NAME MedleyA-PT-08-UpperBounds-13
FORMULA_NAME MedleyA-PT-08-UpperBounds-14
FORMULA_NAME MedleyA-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748895752811

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:22: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]
[2025-06-02 20:22:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:22:35] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2025-06-02 20:22:35] [INFO ] Transformed 147 places.
[2025-06-02 20:22:35] [INFO ] Transformed 312 transitions.
[2025-06-02 20:22:35] [INFO ] Found NUPN structural information;
[2025-06-02 20:22:35] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 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 312 rows 147 cols
[2025-06-02 20:22:35] [INFO ] Computed 11 invariants in 45 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 (498 resets) in 56 ms. (175 steps per ms)
FORMULA MedleyA-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (677 resets) in 85 ms. (581 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-02 20:22:35] [INFO ] Invariant cache hit.
[2025-06-02 20:22:36] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2025-06-02 20:22:36] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 20:22:36] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2025-06-02 20:22:36] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 102 ms.
[2025-06-02 20:22:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:22:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-06-02 20:22:36] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:22:37] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2025-06-02 20:22:37] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 45 ms.
[2025-06-02 20:22:37] [INFO ] Added : 77 causal constraints over 16 iterations in 492 ms. Result :sat
Minimization took 314 ms.
[2025-06-02 20:22:38] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-02 20:22:38] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 9 ms returned sat
[2025-06-02 20:22:38] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2025-06-02 20:22:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:22:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-02 20:22:38] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 20:22:38] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2025-06-02 20:22:38] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 46 ms.
[2025-06-02 20:22:39] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 19 ms to minimize.
[2025-06-02 20:22:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2025-06-02 20:22:39] [INFO ] Added : 75 causal constraints over 16 iterations in 749 ms. Result :sat
Minimization took 338 ms.
[2025-06-02 20:22:39] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-06-02 20:22:39] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:22:39] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-06-02 20:22:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:22:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-06-02 20:22:39] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:22:40] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2025-06-02 20:22:40] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2025-06-02 20:22:40] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 2 ms to minimize.
[2025-06-02 20:22:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2025-06-02 20:22:40] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 47 ms.
[2025-06-02 20:22:40] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 2 ms to minimize.
[2025-06-02 20:22:41] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 2 ms to minimize.
[2025-06-02 20:22:41] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2025-06-02 20:22:41] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2025-06-02 20:22:41] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2025-06-02 20:22:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 747 ms
[2025-06-02 20:22:41] [INFO ] Added : 73 causal constraints over 16 iterations in 1300 ms. Result :sat
Minimization took 220 ms.
[2025-06-02 20:22:41] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-06-02 20:22:41] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 20:22:42] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2025-06-02 20:22:42] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 41 ms.
[2025-06-02 20:22:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:22:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-02 20:22:42] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:22:42] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2025-06-02 20:22:42] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 42 ms.
[2025-06-02 20:22:42] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2025-06-02 20:22:42] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2025-06-02 20:22:43] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2025-06-02 20:22:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 289 ms
[2025-06-02 20:22:43] [INFO ] Added : 79 causal constraints over 16 iterations in 707 ms. Result :sat
Minimization took 220 ms.
[2025-06-02 20:22:43] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 20:22:43] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2025-06-02 20:22:43] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2025-06-02 20:22:43] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 64 ms.
[2025-06-02 20:22:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:22:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2025-06-02 20:22:43] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 20:22:43] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2025-06-02 20:22:43] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 33 ms.
[2025-06-02 20:22:44] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2025-06-02 20:22:44] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2025-06-02 20:22:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2025-06-02 20:22:44] [INFO ] Added : 76 causal constraints over 16 iterations in 598 ms. Result :sat
Minimization took 214 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA MedleyA-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-03 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 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 312/312 transitions.
Graph (complete) has 508 edges and 147 vertex of which 140 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 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 34 rules applied. Total rules applied 35 place count 140 transition count 275
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 64 place count 117 transition count 269
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 64 place count 117 transition count 266
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 114 transition count 266
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 100 place count 84 transition count 228
Iterating global reduction 2 with 30 rules applied. Total rules applied 130 place count 84 transition count 228
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 130 place count 84 transition count 226
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 134 place count 82 transition count 226
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 144 place count 72 transition count 202
Iterating global reduction 2 with 10 rules applied. Total rules applied 154 place count 72 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 69 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 69 transition count 194
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 188 place count 55 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 190 place count 55 transition count 178
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 192 place count 53 transition count 176
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 53 transition count 176
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 206 place count 47 transition count 202
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 238 place count 47 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 242 place count 45 transition count 193
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 246 place count 45 transition count 189
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 250 place count 41 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 254 place count 41 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 256 place count 41 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 258 place count 39 transition count 183
Applied a total of 258 rules in 169 ms. Remains 39 /147 variables (removed 108) and now considering 183/312 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 39/147 places, 183/312 transitions.
[2025-06-02 20:22:45] [INFO ] Flow matrix only has 149 transitions (discarded 34 similar events)
// Phase 1: matrix 149 rows 39 cols
[2025-06-02 20:22:45] [INFO ] Computed 11 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (27 resets) in 813 ms. (1228 steps per ms)
FORMULA MedleyA-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (23 resets) in 489 ms. (2040 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 20:22:46] [INFO ] Flow matrix only has 149 transitions (discarded 34 similar events)
[2025-06-02 20:22:46] [INFO ] Invariant cache hit.
[2025-06-02 20:22:46] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-02 20:22:46] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 20:22:46] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-06-02 20:22:46] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-06-02 20:22:46] [INFO ] [Real]Added 81 Read/Feed constraints in 12 ms returned sat
[2025-06-02 20:22:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:22:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-02 20:22:46] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 20:22:46] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-02 20:22:46] [INFO ] [Nat]Added 81 Read/Feed constraints in 14 ms returned sat
[2025-06-02 20:22:46] [INFO ] Computed and/alt/rep : 17/113/17 causal constraints (skipped 128 transitions) in 14 ms.
[2025-06-02 20:22:46] [INFO ] Added : 1 causal constraints over 1 iterations in 36 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 39 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p119) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 181/181 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 38 transition count 180
Applied a total of 2 rules in 11 ms. Remains 38 /39 variables (removed 1) and now considering 180/181 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 38/39 places, 180/181 transitions.
[2025-06-02 20:22:46] [INFO ] Flow matrix only has 146 transitions (discarded 34 similar events)
// Phase 1: matrix 146 rows 38 cols
[2025-06-02 20:22:46] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA MedleyA-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (10 resets) in 628 ms. (1589 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 20:22:48] [INFO ] Flatten gal took : 119 ms
[2025-06-02 20:22:48] [INFO ] Flatten gal took : 50 ms
[2025-06-02 20:22:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4056090327760282569.gal : 28 ms
[2025-06-02 20:22:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17331072574341855580.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/ReachabilityCardinality4056090327760282569.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17331072574341855580.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 13021 ms.

BK_STOP 1748895768363

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

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