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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 248K 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-17-UpperBounds-00
FORMULA_NAME CO4-PT-17-UpperBounds-01
FORMULA_NAME CO4-PT-17-UpperBounds-02
FORMULA_NAME CO4-PT-17-UpperBounds-03
FORMULA_NAME CO4-PT-17-UpperBounds-04
FORMULA_NAME CO4-PT-17-UpperBounds-05
FORMULA_NAME CO4-PT-17-UpperBounds-06
FORMULA_NAME CO4-PT-17-UpperBounds-07
FORMULA_NAME CO4-PT-17-UpperBounds-08
FORMULA_NAME CO4-PT-17-UpperBounds-09
FORMULA_NAME CO4-PT-17-UpperBounds-10
FORMULA_NAME CO4-PT-17-UpperBounds-11
FORMULA_NAME CO4-PT-17-UpperBounds-12
FORMULA_NAME CO4-PT-17-UpperBounds-13
FORMULA_NAME CO4-PT-17-UpperBounds-14
FORMULA_NAME CO4-PT-17-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748602011057

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:46:52] [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:46:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:46:52] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2025-05-30 10:46:52] [INFO ] Transformed 967 places.
[2025-05-30 10:46:52] [INFO ] Transformed 1150 transitions.
[2025-05-30 10:46:52] [INFO ] Found NUPN structural information;
[2025-05-30 10:46:52] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 198 places in 11 ms
Reduce places removed 198 places and 238 transitions.
FORMULA CO4-PT-17-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-UpperBounds-14 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] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 912 rows 769 cols
[2025-05-30 10:46:52] [INFO ] Computed 9 invariants in 35 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (18 resets) in 35 ms. (277 steps per ms)
FORMULA CO4-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70001 steps (181 resets) in 101 ms. (686 steps per ms)
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-05-30 10:46:52] [INFO ] Invariant cache hit.
[2025-05-30 10:46:53] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2025-05-30 10:46:53] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2025-05-30 10:46:53] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 82 ms.
[2025-05-30 10:46:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2025-05-30 10:46:54] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2025-05-30 10:46:54] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 61 ms.
[2025-05-30 10:46:55] [INFO ] Added : 119 causal constraints over 24 iterations in 1208 ms. Result :sat
Minimization took 263 ms.
[2025-05-30 10:46:55] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2025-05-30 10:46:56] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2025-05-30 10:46:56] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 69 ms.
[2025-05-30 10:46:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2025-05-30 10:46:56] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2025-05-30 10:46:56] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 61 ms.
[2025-05-30 10:46:58] [INFO ] Added : 121 causal constraints over 25 iterations in 1245 ms. Result :sat
Minimization took 262 ms.
[2025-05-30 10:46:58] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2025-05-30 10:46:58] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2025-05-30 10:46:58] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 71 ms.
[2025-05-30 10:46:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2025-05-30 10:46:59] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2025-05-30 10:46:59] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 52 ms.
[2025-05-30 10:47:01] [INFO ] Deduced a trap composed of 93 places in 191 ms of which 30 ms to minimize.
[2025-05-30 10:47:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2025-05-30 10:47:01] [INFO ] Added : 157 causal constraints over 32 iterations in 1835 ms. Result :sat
Minimization took 268 ms.
[2025-05-30 10:47:01] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2025-05-30 10:47:02] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2025-05-30 10:47:02] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 52 ms.
[2025-05-30 10:47:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2025-05-30 10:47:02] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2025-05-30 10:47:02] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 45 ms.
[2025-05-30 10:47:04] [INFO ] Added : 121 causal constraints over 25 iterations in 1168 ms. Result :sat
Minimization took 254 ms.
[2025-05-30 10:47:04] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2025-05-30 10:47:04] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2025-05-30 10:47:04] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 47 ms.
[2025-05-30 10:47:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2025-05-30 10:47:05] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2025-05-30 10:47:05] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 46 ms.
[2025-05-30 10:47:06] [INFO ] Added : 135 causal constraints over 27 iterations in 1256 ms. Result :sat
Minimization took 259 ms.
[2025-05-30 10:47:07] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2025-05-30 10:47:07] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-05-30 10:47:07] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2025-05-30 10:47:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-30 10:47:07] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2025-05-30 10:47:07] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2025-05-30 10:47:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2025-05-30 10:47:08] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 48 ms.
[2025-05-30 10:47:08] [INFO ] Added : 101 causal constraints over 21 iterations in 975 ms. Result :sat
Minimization took 248 ms.
[2025-05-30 10:47:09] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2025-05-30 10:47:09] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2025-05-30 10:47:09] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 46 ms.
[2025-05-30 10:47:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2025-05-30 10:47:10] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2025-05-30 10:47:10] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 47 ms.
[2025-05-30 10:47:11] [INFO ] Added : 124 causal constraints over 25 iterations in 1172 ms. Result :sat
Minimization took 251 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 CO4-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-06 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 769 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 912/912 transitions.
Graph (trivial) has 793 edges and 769 vertex of which 2 / 769 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1145 edges and 768 vertex of which 712 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.2 ms
Discarding 56 places :
Also discarding 34 output transitions
Drop transitions (Output transitions of discarded places.) removed 34 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 373 transitions
Trivial Post-agglo rules discarded 373 transitions
Performed 373 trivial Post agglomeration. Transition count delta: 373
Iterating post reduction 0 with 397 rules applied. Total rules applied 399 place count 712 transition count 479
Reduce places removed 373 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 383 rules applied. Total rules applied 782 place count 339 transition count 469
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 9 rules applied. Total rules applied 791 place count 335 transition count 464
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 3 with 3 rules applied. Total rules applied 794 place count 334 transition count 462
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 797 place count 333 transition count 460
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 801 place count 332 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 803 place count 330 transition count 457
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 803 place count 330 transition count 455
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 807 place count 328 transition count 455
Discarding 39 places :
Symmetric choice reduction at 7 with 39 rule applications. Total rules 846 place count 289 transition count 416
Iterating global reduction 7 with 39 rules applied. Total rules applied 885 place count 289 transition count 416
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 17 Pre rules applied. Total rules applied 885 place count 289 transition count 399
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 919 place count 272 transition count 399
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 946 place count 245 transition count 372
Iterating global reduction 7 with 27 rules applied. Total rules applied 973 place count 245 transition count 372
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 7 with 4 rules applied. Total rules applied 977 place count 245 transition count 368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 978 place count 244 transition count 368
Performed 109 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 9 with 218 rules applied. Total rules applied 1196 place count 135 transition count 245
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1203 place count 135 transition count 238
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1207 place count 131 transition count 234
Iterating global reduction 10 with 4 rules applied. Total rules applied 1211 place count 131 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1212 place count 131 transition count 233
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1216 place count 129 transition count 231
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1218 place count 129 transition count 229
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1220 place count 127 transition count 227
Iterating global reduction 12 with 2 rules applied. Total rules applied 1222 place count 127 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1224 place count 127 transition count 225
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 13 with 82 rules applied. Total rules applied 1306 place count 86 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 13 with 45 rules applied. Total rules applied 1351 place count 86 transition count 183
Discarding 37 places :
Symmetric choice reduction at 14 with 37 rule applications. Total rules 1388 place count 49 transition count 124
Iterating global reduction 14 with 37 rules applied. Total rules applied 1425 place count 49 transition count 124
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 14 with 28 rules applied. Total rules applied 1453 place count 49 transition count 96
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 1460 place count 42 transition count 76
Iterating global reduction 15 with 7 rules applied. Total rules applied 1467 place count 42 transition count 76
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 1472 place count 42 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1474 place count 42 transition count 69
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1475 place count 41 transition count 68
Iterating global reduction 16 with 1 rules applied. Total rules applied 1476 place count 41 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1477 place count 41 transition count 67
Free-agglomeration rule applied 6 times.
Iterating global reduction 17 with 6 rules applied. Total rules applied 1483 place count 41 transition count 61
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 9 rules applied. Total rules applied 1492 place count 35 transition count 58
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 18 with 3 rules applied. Total rules applied 1495 place count 35 transition count 58
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 108 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 18 with 2 rules applied. Total rules applied 1497 place count 34 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1498 place count 34 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 1499 place count 34 transition count 55
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 1500 place count 34 transition count 55
Graph (complete) has 105 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 1 rules applied. Total rules applied 1501 place count 33 transition count 55
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 1502 place count 33 transition count 54
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 1503 place count 33 transition count 54
Graph (complete) has 102 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 22 with 1 rules applied. Total rules applied 1504 place count 32 transition count 54
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 1505 place count 32 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 24 with 1 rules applied. Total rules applied 1506 place count 31 transition count 52
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 t83.t948 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 22 edges and 27 vertex of which 3 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 24 with 3 rules applied. Total rules applied 1509 place count 25 transition count 50
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 t11.t12.t929.t184.t181.t1087.t194.t195 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 21 edges and 23 vertex of which 3 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
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 25 with 10 rules applied. Total rules applied 1519 place count 21 transition count 41
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 26 with 7 rules applied. Total rules applied 1526 place count 19 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 27 with 6 rules applied. Total rules applied 1532 place count 19 transition count 30
Discarding 4 places :
Symmetric choice reduction at 27 with 4 rule applications. Total rules 1536 place count 15 transition count 26
Iterating global reduction 27 with 4 rules applied. Total rules applied 1540 place count 15 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 1544 place count 15 transition count 22
Discarding 2 places :
Symmetric choice reduction at 28 with 2 rule applications. Total rules 1546 place count 13 transition count 20
Iterating global reduction 28 with 2 rules applied. Total rules applied 1548 place count 13 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 1550 place count 13 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 1552 place count 12 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 1553 place count 12 transition count 20
Free-agglomeration rule applied 3 times.
Iterating global reduction 30 with 3 rules applied. Total rules applied 1556 place count 12 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 30 with 3 rules applied. Total rules applied 1559 place count 9 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 31 with 2 rules applied. Total rules applied 1561 place count 9 transition count 15
Applied a total of 1561 rules in 184 ms. Remains 9 /769 variables (removed 760) and now considering 15/912 (removed 897) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 9/769 places, 15/912 transitions.
// Phase 1: matrix 15 rows 9 cols
[2025-05-30 10:47:12] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 433 ms. (2304 steps per ms)
FORMULA CO4-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 261 ms. (3816 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:13] [INFO ] Flatten gal took : 17 ms
[2025-05-30 10:47:13] [INFO ] Flatten gal took : 3 ms
[2025-05-30 10:47:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality143834125923434745.gal : 4 ms
[2025-05-30 10:47:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6675891506068254954.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/ReachabilityCardinality143834125923434745.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6675891506068254954.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 ...327
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 20856 ms.

BK_STOP 1748602033198

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

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