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.r055-tall-174854041300065.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 CO4-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r055-tall-174854041300065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 8.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 239K 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 CO4-PT-18-UpperBounds-00
FORMULA_NAME CO4-PT-18-UpperBounds-01
FORMULA_NAME CO4-PT-18-UpperBounds-02
FORMULA_NAME CO4-PT-18-UpperBounds-03
FORMULA_NAME CO4-PT-18-UpperBounds-04
FORMULA_NAME CO4-PT-18-UpperBounds-05
FORMULA_NAME CO4-PT-18-UpperBounds-06
FORMULA_NAME CO4-PT-18-UpperBounds-07
FORMULA_NAME CO4-PT-18-UpperBounds-08
FORMULA_NAME CO4-PT-18-UpperBounds-09
FORMULA_NAME CO4-PT-18-UpperBounds-10
FORMULA_NAME CO4-PT-18-UpperBounds-11
FORMULA_NAME CO4-PT-18-UpperBounds-12
FORMULA_NAME CO4-PT-18-UpperBounds-13
FORMULA_NAME CO4-PT-18-UpperBounds-14
FORMULA_NAME CO4-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748602019110

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:47:00] [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-05-30 10:47:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:47:00] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2025-05-30 10:47:00] [INFO ] Transformed 979 places.
[2025-05-30 10:47:00] [INFO ] Transformed 1111 transitions.
[2025-05-30 10:47:00] [INFO ] Found NUPN structural information;
[2025-05-30 10:47:00] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 157 places in 13 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-18-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 934 rows 822 cols
[2025-05-30 10:47:00] [INFO ] Computed 8 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 10000 steps (24 resets) in 30 ms. (322 steps per ms)
FORMULA CO4-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100001 steps (260 resets) in 152 ms. (653 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 10:47:00] [INFO ] Invariant cache hit.
[2025-05-30 10:47:01] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned sat
[2025-05-30 10:47:01] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2025-05-30 10:47:01] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 28 ms to minimize.
[2025-05-30 10:47:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2025-05-30 10:47:02] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2025-05-30 10:47:02] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2025-05-30 10:47:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2025-05-30 10:47:02] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 65 ms.
[2025-05-30 10:47:04] [INFO ] Added : 154 causal constraints over 31 iterations in 1630 ms. Result :sat
Minimization took 339 ms.
[2025-05-30 10:47:04] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 10:47:04] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2025-05-30 10:47:04] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 3 ms to minimize.
[2025-05-30 10:47:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 10:47:05] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2025-05-30 10:47:05] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2025-05-30 10:47:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2025-05-30 10:47:05] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 54 ms.
[2025-05-30 10:47:07] [INFO ] Added : 160 causal constraints over 32 iterations in 1593 ms. Result :sat
Minimization took 331 ms.
[2025-05-30 10:47:07] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-05-30 10:47:07] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2025-05-30 10:47:08] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 58 ms.
[2025-05-30 10:47:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 10:47:08] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2025-05-30 10:47:08] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 55 ms.
[2025-05-30 10:47:10] [INFO ] Added : 158 causal constraints over 32 iterations in 1578 ms. Result :sat
Minimization took 312 ms.
[2025-05-30 10:47:10] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 10:47:10] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2025-05-30 10:47:11] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 52 ms.
[2025-05-30 10:47:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-05-30 10:47:11] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2025-05-30 10:47:11] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 57 ms.
[2025-05-30 10:47:13] [INFO ] Added : 234 causal constraints over 47 iterations in 2259 ms. Result :sat
Minimization took 346 ms.
[2025-05-30 10:47:14] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-05-30 10:47:14] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2025-05-30 10:47:14] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 49 ms.
[2025-05-30 10:47:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 10:47:15] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2025-05-30 10:47:15] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 57 ms.
[2025-05-30 10:47:16] [INFO ] Added : 154 causal constraints over 31 iterations in 1481 ms. Result :sat
Minimization took 336 ms.
[2025-05-30 10:47:17] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-05-30 10:47:17] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2025-05-30 10:47:17] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 48 ms.
[2025-05-30 10:47:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2025-05-30 10:47:18] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2025-05-30 10:47:18] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 47 ms.
[2025-05-30 10:47:19] [INFO ] Added : 166 causal constraints over 34 iterations in 1589 ms. Result :sat
Minimization took 331 ms.
[2025-05-30 10:47:20] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 10:47:20] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2025-05-30 10:47:20] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 52 ms.
[2025-05-30 10:47:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 10:47:21] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2025-05-30 10:47:21] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 45 ms.
[2025-05-30 10:47:23] [INFO ] Added : 212 causal constraints over 43 iterations in 2033 ms. Result :sat
Minimization took 357 ms.
[2025-05-30 10:47:23] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-05-30 10:47:24] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2025-05-30 10:47:24] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 47 ms.
[2025-05-30 10:47:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 10:47:24] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2025-05-30 10:47:24] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 49 ms.
[2025-05-30 10:47:26] [INFO ] Added : 170 causal constraints over 34 iterations in 1671 ms. Result :sat
Minimization took 335 ms.
[2025-05-30 10:47:27] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-05-30 10:47:27] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2025-05-30 10:47:27] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 48 ms.
[2025-05-30 10:47:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 10:47:27] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2025-05-30 10:47:27] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 43 ms.
[2025-05-30 10:47:29] [INFO ] Added : 140 causal constraints over 28 iterations in 1378 ms. Result :sat
Minimization took 325 ms.
[2025-05-30 10:47:29] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2025-05-30 10:47:30] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2025-05-30 10:47:30] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 54 ms.
[2025-05-30 10:47:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 10:47:30] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2025-05-30 10:47:30] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 49 ms.
[2025-05-30 10:47:31] [INFO ] Added : 92 causal constraints over 19 iterations in 950 ms. Result :sat
Minimization took 326 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 822 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 822/822 places, 934/934 transitions.
Graph (trivial) has 838 edges and 822 vertex of which 3 / 822 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1118 edges and 820 vertex of which 778 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2 ms
Discarding 42 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 510 transitions
Trivial Post-agglo rules discarded 510 transitions
Performed 510 trivial Post agglomeration. Transition count delta: 510
Iterating post reduction 0 with 533 rules applied. Total rules applied 535 place count 778 transition count 375
Reduce places removed 510 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 521 rules applied. Total rules applied 1056 place count 268 transition count 364
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 1069 place count 262 transition count 357
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 4 rules applied. Total rules applied 1073 place count 260 transition count 355
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 3 rules applied. Total rules applied 1076 place count 259 transition count 353
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1079 place count 258 transition count 351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1080 place count 257 transition count 351
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1080 place count 257 transition count 349
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1084 place count 255 transition count 349
Discarding 36 places :
Symmetric choice reduction at 7 with 36 rule applications. Total rules 1120 place count 219 transition count 313
Iterating global reduction 7 with 36 rules applied. Total rules applied 1156 place count 219 transition count 313
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1156 place count 219 transition count 301
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1180 place count 207 transition count 301
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 1202 place count 185 transition count 279
Iterating global reduction 7 with 22 rules applied. Total rules applied 1224 place count 185 transition count 279
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1227 place count 185 transition count 276
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1229 place count 183 transition count 273
Iterating global reduction 8 with 2 rules applied. Total rules applied 1231 place count 183 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1233 place count 183 transition count 271
Performed 78 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 9 with 156 rules applied. Total rules applied 1389 place count 105 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1392 place count 105 transition count 180
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 10 with 62 rules applied. Total rules applied 1454 place count 74 transition count 183
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 1474 place count 74 transition count 163
Discarding 27 places :
Symmetric choice reduction at 11 with 27 rule applications. Total rules 1501 place count 47 transition count 109
Iterating global reduction 11 with 27 rules applied. Total rules applied 1528 place count 47 transition count 109
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1547 place count 47 transition count 90
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1553 place count 41 transition count 73
Iterating global reduction 12 with 6 rules applied. Total rules applied 1559 place count 41 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 1563 place count 41 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 1567 place count 39 transition count 97
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 1574 place count 39 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 14 with 11 rules applied. Total rules applied 1585 place count 39 transition count 79
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 1590 place count 39 transition count 74
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 1597 place count 34 transition count 72
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1598 place count 34 transition count 72
Graph (complete) has 108 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 1599 place count 33 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1600 place count 33 transition count 71
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1601 place count 33 transition count 71
Graph (complete) has 105 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 1602 place count 32 transition count 71
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1603 place count 32 transition count 70
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1604 place count 32 transition count 70
Graph (complete) has 102 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 1 rules applied. Total rules applied 1605 place count 31 transition count 70
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1606 place count 31 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 1607 place count 30 transition count 68
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t154.t155.t973.t62.t63.t64 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 20 edges and 26 vertex of which 3 / 26 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 21 with 3 rules applied. Total rules applied 1610 place count 24 transition count 66
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 22 with 5 rules applied. Total rules applied 1615 place count 24 transition count 61
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 1615 place count 24 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 1617 place count 23 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 23 with 17 rules applied. Total rules applied 1634 place count 23 transition count 43
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 52 edges and 22 vertex of which 16 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Iterating post reduction 23 with 3 rules applied. Total rules applied 1637 place count 16 transition count 37
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 24 with 5 rules applied. Total rules applied 1642 place count 16 transition count 32
Discarding 2 places :
Symmetric choice reduction at 25 with 2 rule applications. Total rules 1644 place count 14 transition count 28
Iterating global reduction 25 with 2 rules applied. Total rules applied 1646 place count 14 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 1648 place count 14 transition count 26
Free-agglomeration rule applied 4 times.
Iterating global reduction 26 with 4 rules applied. Total rules applied 1652 place count 14 transition count 22
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 5 rules applied. Total rules applied 1657 place count 10 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 27 with 4 rules applied. Total rules applied 1661 place count 10 transition count 17
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 27 with 1 rules applied. Total rules applied 1662 place count 10 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 1663 place count 10 transition count 16
Applied a total of 1663 rules in 139 ms. Remains 10 /822 variables (removed 812) and now considering 16/934 (removed 918) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 10/822 places, 16/934 transitions.
[2025-05-30 10:47:32] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 10 cols
[2025-05-30 10:47:32] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 516 ms. (1934 steps per ms)
FORMULA CO4-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 222 ms. (4484 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-05-30 10:47:33] [INFO ] Flatten gal took : 18 ms
[2025-05-30 10:47:33] [INFO ] Flatten gal took : 3 ms
[2025-05-30 10:47:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12082062293808881067.gal : 4 ms
[2025-05-30 10:47:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3663387846125918798.prop : 0 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/ReachabilityCardinality12082062293808881067.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3663387846125918798.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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 33051 ms.

BK_STOP 1748602053422

--------------------
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="CO4-PT-18"
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 CO4-PT-18, 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 r055-tall-174854041300065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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