Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967700389.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is CO4-PT-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700389
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 6.8K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 6 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 6 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Mar 6 13:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 174K Mar 3 18:30 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-14-UpperBounds-00
FORMULA_NAME CO4-PT-14-UpperBounds-01
FORMULA_NAME CO4-PT-14-UpperBounds-02
FORMULA_NAME CO4-PT-14-UpperBounds-03
FORMULA_NAME CO4-PT-14-UpperBounds-04
FORMULA_NAME CO4-PT-14-UpperBounds-05
FORMULA_NAME CO4-PT-14-UpperBounds-06
FORMULA_NAME CO4-PT-14-UpperBounds-07
FORMULA_NAME CO4-PT-14-UpperBounds-08
FORMULA_NAME CO4-PT-14-UpperBounds-09
FORMULA_NAME CO4-PT-14-UpperBounds-10
FORMULA_NAME CO4-PT-14-UpperBounds-11
FORMULA_NAME CO4-PT-14-UpperBounds-12
FORMULA_NAME CO4-PT-14-UpperBounds-13
FORMULA_NAME CO4-PT-14-UpperBounds-14
FORMULA_NAME CO4-PT-14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779523336001

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-23 08:02:17] [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]
[2026-05-23 08:02:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:02:17] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2026-05-23 08:02:17] [INFO ] Transformed 680 places.
[2026-05-23 08:02:17] [INFO ] Transformed 812 transitions.
[2026-05-23 08:02:17] [INFO ] Found NUPN structural information;
[2026-05-23 08:02:17] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 100 places in 7 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-14-UpperBounds-05 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, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-281951212793717344.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18411088097247932837.kers'
[2026-05-23 08:02:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-281951212793717344.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18411088097247932837.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 692 rows 580 cols 1560 entries
Finished phase 1 with 572 SingleSign rule and 0 generalized
[2026-05-23 08:02:17] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18411088097247932837.kers
Total runtime 4 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 40 ms. (243 steps per ms)
FORMULA CO4-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80000 steps (156 resets) in 121 ms. (655 steps per ms)
FORMULA CO4-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-05-23 08:02:17] [INFO ] Invariant cache hit.
[2026-05-23 08:02:17] [INFO ] [Real]Absence check using 8 positive place invariants in 21 ms returned sat
[2026-05-23 08:02:18] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2026-05-23 08:02:18] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 45 ms.
[2026-05-23 08:02:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:02:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2026-05-23 08:02:18] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2026-05-23 08:02:18] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 42 ms.
[2026-05-23 08:02:19] [INFO ] Added : 114 causal constraints over 23 iterations in 997 ms. Result :sat
Minimization took 208 ms.
[2026-05-23 08:02:20] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2026-05-23 08:02:20] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2026-05-23 08:02:20] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 45 ms.
[2026-05-23 08:02:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:02:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2026-05-23 08:02:20] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2026-05-23 08:02:21] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 47 ms.
[2026-05-23 08:02:22] [INFO ] Added : 135 causal constraints over 27 iterations in 1147 ms. Result :sat
Minimization took 501 ms.
[2026-05-23 08:02:22] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2026-05-23 08:02:23] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2026-05-23 08:02:23] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 42 ms.
[2026-05-23 08:02:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:02:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2026-05-23 08:02:23] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2026-05-23 08:02:23] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 44 ms.
[2026-05-23 08:02:24] [INFO ] Added : 142 causal constraints over 29 iterations in 1162 ms. Result :sat
Minimization took 211 ms.
[2026-05-23 08:02:25] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2026-05-23 08:02:25] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2026-05-23 08:02:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:02:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2026-05-23 08:02:25] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2026-05-23 08:02:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2026-05-23 08:02:26] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 43 ms.
[2026-05-23 08:02:26] [INFO ] Added : 93 causal constraints over 19 iterations in 801 ms. Result :sat
Minimization took 205 ms.
[2026-05-23 08:02:27] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2026-05-23 08:02:27] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2026-05-23 08:02:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:02:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2026-05-23 08:02:28] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2026-05-23 08:02:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2026-05-23 08:02:28] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 49 ms.
[2026-05-23 08:02:29] [INFO ] Added : 91 causal constraints over 19 iterations in 821 ms. Result :sat
Minimization took 215 ms.
[2026-05-23 08:02:29] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2026-05-23 08:02:29] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2026-05-23 08:02:29] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 33 ms.
[2026-05-23 08:02:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:02:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2026-05-23 08:02:30] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2026-05-23 08:02:30] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 45 ms.
[2026-05-23 08:02:31] [INFO ] Added : 133 causal constraints over 27 iterations in 1099 ms. Result :sat
Minimization took 213 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-14-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA CO4-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 1 out of 580 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p467) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 691/691 transitions.
Graph (trivial) has 601 edges and 580 vertex of which 2 / 580 are part of one of the 1 SCC in 13 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 876 edges and 579 vertex of which 544 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.4 ms
Discarding 35 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 285 transitions
Trivial Post-agglo rules discarded 285 transitions
Performed 285 trivial Post agglomeration. Transition count delta: 285
Iterating post reduction 0 with 305 rules applied. Total rules applied 307 place count 544 transition count 365
Reduce places removed 285 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 296 rules applied. Total rules applied 603 place count 259 transition count 354
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 11 rules applied. Total rules applied 614 place count 254 transition count 348
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 617 place count 253 transition count 346
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 620 place count 252 transition count 344
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 622 place count 251 transition count 343
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 622 place count 251 transition count 341
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 3 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 628 place count 247 transition count 338
Discarding 35 places :
Symmetric choice reduction at 6 with 35 rule applications. Total rules 663 place count 212 transition count 303
Iterating global reduction 6 with 35 rules applied. Total rules applied 698 place count 212 transition count 303
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 698 place count 212 transition count 291
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 722 place count 200 transition count 291
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 745 place count 177 transition count 268
Iterating global reduction 6 with 23 rules applied. Total rules applied 768 place count 177 transition count 268
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 6 with 5 rules applied. Total rules applied 773 place count 177 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 774 place count 176 transition count 263
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 776 place count 174 transition count 260
Iterating global reduction 8 with 2 rules applied. Total rules applied 778 place count 174 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 780 place count 174 transition count 258
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 936 place count 96 transition count 170
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 943 place count 96 transition count 163
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 947 place count 92 transition count 159
Iterating global reduction 10 with 4 rules applied. Total rules applied 951 place count 92 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 952 place count 92 transition count 158
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 958 place count 89 transition count 155
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 961 place count 89 transition count 152
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 964 place count 86 transition count 149
Iterating global reduction 12 with 3 rules applied. Total rules applied 967 place count 86 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 969 place count 86 transition count 147
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 970 place count 85 transition count 146
Iterating global reduction 13 with 1 rules applied. Total rules applied 971 place count 85 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 972 place count 85 transition count 145
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 14 with 54 rules applied. Total rules applied 1026 place count 58 transition count 147
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 14 with 35 rules applied. Total rules applied 1061 place count 58 transition count 112
Discarding 24 places :
Symmetric choice reduction at 15 with 24 rule applications. Total rules 1085 place count 34 transition count 77
Iterating global reduction 15 with 24 rules applied. Total rules applied 1109 place count 34 transition count 77
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 15 with 20 rules applied. Total rules applied 1129 place count 34 transition count 57
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 1132 place count 31 transition count 48
Iterating global reduction 16 with 3 rules applied. Total rules applied 1135 place count 31 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 1137 place count 31 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 1139 place count 30 transition count 53
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 1142 place count 30 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 18 with 5 rules applied. Total rules applied 1147 place count 30 transition count 45
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1148 place count 29 transition count 44
Iterating global reduction 18 with 1 rules applied. Total rules applied 1149 place count 29 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1150 place count 29 transition count 43
Free-agglomeration rule applied 5 times.
Iterating global reduction 19 with 5 rules applied. Total rules applied 1155 place count 29 transition count 38
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 19 with 7 rules applied. Total rules applied 1162 place count 24 transition count 36
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 1163 place count 24 transition count 36
Graph (complete) has 68 edges and 24 vertex of which 23 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 20 with 1 rules applied. Total rules applied 1164 place count 23 transition count 36
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 1165 place count 23 transition count 35
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 1166 place count 23 transition count 35
Graph (complete) has 65 edges and 23 vertex of which 22 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 1167 place count 22 transition count 35
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 1168 place count 22 transition count 34
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 1169 place count 22 transition count 34
Graph (complete) has 62 edges and 22 vertex of which 21 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 24 with 1 rules applied. Total rules applied 1170 place count 21 transition count 34
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 1171 place count 21 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 26 with 1 rules applied. Total rules applied 1172 place count 20 transition count 32
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 t87.t679 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 15 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 26 with 3 rules applied. Total rules applied 1175 place count 14 transition count 30
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 t15.t16.t661.t188.t185.t773.t198.t199 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 11 edges and 12 vertex of which 3 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 27 with 8 rules applied. Total rules applied 1183 place count 10 transition count 23
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 17 edges and 10 vertex of which 3 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Iterating post reduction 28 with 11 rules applied. Total rules applied 1194 place count 3 transition count 7
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 29 with 5 rules applied. Total rules applied 1199 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 30 with 1 Pre rules applied. Total rules applied 1199 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 1201 place count 2 transition count 1
Applied a total of 1201 rules in 147 ms. Remains 2 /580 variables (removed 578) and now considering 1/691 (removed 690) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 2/580 places, 1/691 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8622585432540229356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3485204296398005870.kers'
[2026-05-23 08:02:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8622585432540229356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3485204296398005870.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1 rows 1 cols 1 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-23 08:02:31] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3485204296398005870.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (500000 resets) in 222 ms. (4484 steps per ms)
FORMULA CO4-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (500000 resets) in 128 ms. (7751 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 15136 ms.

BK_STOP 1779523352372

--------------------
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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-14"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5973"
echo " Executing tool itstools"
echo " Input is CO4-PT-14, 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 r066-tall-177946967700389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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