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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 6.9K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 6 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 260K 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-16-UpperBounds-00
FORMULA_NAME CO4-PT-16-UpperBounds-01
FORMULA_NAME CO4-PT-16-UpperBounds-02
FORMULA_NAME CO4-PT-16-UpperBounds-03
FORMULA_NAME CO4-PT-16-UpperBounds-04
FORMULA_NAME CO4-PT-16-UpperBounds-05
FORMULA_NAME CO4-PT-16-UpperBounds-06
FORMULA_NAME CO4-PT-16-UpperBounds-07
FORMULA_NAME CO4-PT-16-UpperBounds-08
FORMULA_NAME CO4-PT-16-UpperBounds-09
FORMULA_NAME CO4-PT-16-UpperBounds-10
FORMULA_NAME CO4-PT-16-UpperBounds-11
FORMULA_NAME CO4-PT-16-UpperBounds-12
FORMULA_NAME CO4-PT-16-UpperBounds-13
FORMULA_NAME CO4-PT-16-UpperBounds-14
FORMULA_NAME CO4-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779524236175

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-23 08:17: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:17:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:17:17] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2026-05-23 08:17:17] [INFO ] Transformed 837 places.
[2026-05-23 08:17:17] [INFO ] Transformed 1122 transitions.
[2026-05-23 08:17:17] [INFO ] Found NUPN structural information;
[2026-05-23 08:17:17] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 116 places in 10 ms
Reduce places removed 116 places and 180 transitions.
FORMULA CO4-PT-16-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-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] Max Struct:[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] Max Struct:[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-13491511684970874164.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13274329874880293.kers'
[2026-05-23 08:17:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13491511684970874164.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13274329874880293.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 942 rows 721 cols 2478 entries
Finished phase 1 with 699 SingleSign rule and 10 generalized
[2026-05-23 08:17:17] [INFO ] Computed 12 invariants in 4 ms
Computed 12 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13274329874880293.kers
Total runtime 7 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 10000 steps (221 resets) in 53 ms. (185 steps per ms)
FORMULA CO4-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60004 steps (235 resets) in 90 ms. (659 steps per ms)
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:17:17] [INFO ] Invariant cache hit.
[2026-05-23 08:17:18] [INFO ] [Real]Absence check using 11 positive place invariants in 26 ms returned sat
[2026-05-23 08:17:18] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 08:17:18] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2026-05-23 08:17:18] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 76 ms.
[2026-05-23 08:17:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:17:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2026-05-23 08:17:18] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:17:19] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2026-05-23 08:17:19] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 74 ms.
[2026-05-23 08:17:20] [INFO ] Added : 118 causal constraints over 24 iterations in 1407 ms. Result :sat
Minimization took 502 ms.
[2026-05-23 08:17:21] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2026-05-23 08:17:21] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 08:17:21] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2026-05-23 08:17:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:17:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2026-05-23 08:17:21] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 08:17:22] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2026-05-23 08:17:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2026-05-23 08:17:22] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 56 ms.
[2026-05-23 08:17:23] [INFO ] Added : 109 causal constraints over 22 iterations in 1299 ms. Result :sat
Minimization took 507 ms.
[2026-05-23 08:17:24] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2026-05-23 08:17:24] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 9 ms returned sat
[2026-05-23 08:17:24] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2026-05-23 08:17:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:17:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2026-05-23 08:17:24] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:17:25] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2026-05-23 08:17:25] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 72 ms.
[2026-05-23 08:17:26] [INFO ] Added : 105 causal constraints over 21 iterations in 1112 ms. Result :sat
Minimization took 501 ms.
[2026-05-23 08:17:26] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2026-05-23 08:17:26] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:17:27] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2026-05-23 08:17:27] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 56 ms.
[2026-05-23 08:17:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:17:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2026-05-23 08:17:27] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:17:27] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2026-05-23 08:17:27] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 56 ms.
[2026-05-23 08:17:29] [INFO ] Added : 127 causal constraints over 26 iterations in 1397 ms. Result :sat
Minimization took 503 ms.
[2026-05-23 08:17:29] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2026-05-23 08:17:29] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 08:17:29] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2026-05-23 08:17:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:17:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2026-05-23 08:17:30] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 6 ms returned sat
[2026-05-23 08:17:30] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2026-05-23 08:17:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2026-05-23 08:17:30] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 49 ms.
[2026-05-23 08:17:32] [INFO ] Added : 130 causal constraints over 26 iterations in 1375 ms. Result :sat
Minimization took 507 ms.
[2026-05-23 08:17:32] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2026-05-23 08:17:32] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:17:33] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2026-05-23 08:17:33] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 56 ms.
[2026-05-23 08:17:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:17:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2026-05-23 08:17:33] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 4 ms returned sat
[2026-05-23 08:17:33] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2026-05-23 08:17:33] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 50 ms.
[2026-05-23 08:17:34] [INFO ] Added : 118 causal constraints over 24 iterations in 1298 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 721/721 places, 942/942 transitions.
Graph (trivial) has 737 edges and 721 vertex of which 2 / 721 are part of one of the 1 SCC in 9 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 1392 edges and 720 vertex of which 675 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.3 ms
Discarding 45 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 378 rules applied. Total rules applied 380 place count 675 transition count 542
Reduce places removed 347 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 373 rules applied. Total rules applied 753 place count 328 transition count 516
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 25 rules applied. Total rules applied 778 place count 317 transition count 502
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 787 place count 314 transition count 496
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 796 place count 311 transition count 490
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 9 rules applied. Total rules applied 805 place count 308 transition count 484
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 808 place count 305 transition count 484
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 808 place count 305 transition count 483
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 810 place count 304 transition count 483
Discarding 49 places :
Symmetric choice reduction at 7 with 49 rule applications. Total rules 859 place count 255 transition count 434
Iterating global reduction 7 with 49 rules applied. Total rules applied 908 place count 255 transition count 434
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 908 place count 255 transition count 420
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 936 place count 241 transition count 420
Discarding 32 places :
Symmetric choice reduction at 7 with 32 rule applications. Total rules 968 place count 209 transition count 363
Iterating global reduction 7 with 32 rules applied. Total rules applied 1000 place count 209 transition count 363
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 1007 place count 209 transition count 356
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1008 place count 208 transition count 356
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1012 place count 204 transition count 351
Iterating global reduction 9 with 4 rules applied. Total rules applied 1016 place count 204 transition count 351
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1020 place count 204 transition count 347
Performed 76 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 10 with 152 rules applied. Total rules applied 1172 place count 128 transition count 261
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1177 place count 128 transition count 256
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 11 with 70 rules applied. Total rules applied 1247 place count 93 transition count 291
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 11 with 53 rules applied. Total rules applied 1300 place count 93 transition count 238
Discarding 24 places :
Symmetric choice reduction at 12 with 24 rule applications. Total rules 1324 place count 69 transition count 166
Iterating global reduction 12 with 24 rules applied. Total rules applied 1348 place count 69 transition count 166
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1365 place count 69 transition count 149
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1370 place count 64 transition count 127
Iterating global reduction 13 with 5 rules applied. Total rules applied 1375 place count 64 transition count 127
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1379 place count 64 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1381 place count 64 transition count 121
Free-agglomeration rule applied 15 times.
Iterating global reduction 14 with 15 rules applied. Total rules applied 1396 place count 64 transition count 106
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 19 rules applied. Total rules applied 1415 place count 49 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1416 place count 49 transition count 101
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 1417 place count 49 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1418 place count 48 transition count 100
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 27 edges and 45 vertex of which 5 / 45 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 15 with 4 rules applied. Total rules applied 1422 place count 42 transition count 100
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 33 edges and 41 vertex of which 10 / 41 are part of one of the 1 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 16 with 10 rules applied. Total rules applied 1432 place count 32 transition count 92
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 17 with 26 rules applied. Total rules applied 1458 place count 32 transition count 66
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 1460 place count 30 transition count 61
Iterating global reduction 18 with 2 rules applied. Total rules applied 1462 place count 30 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1463 place count 30 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 1465 place count 29 transition count 68
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 1468 place count 29 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 20 with 10 rules applied. Total rules applied 1478 place count 29 transition count 55
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 1479 place count 28 transition count 53
Iterating global reduction 20 with 1 rules applied. Total rules applied 1480 place count 28 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 1482 place count 28 transition count 51
Free-agglomeration rule applied 2 times.
Iterating global reduction 21 with 2 rules applied. Total rules applied 1484 place count 28 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 1486 place count 26 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 1488 place count 26 transition count 47
Applied a total of 1488 rules in 260 ms. Remains 26 /721 variables (removed 695) and now considering 47/942 (removed 895) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 26/721 places, 47/942 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-538516966192270916.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16198885779575231149.kers'
[2026-05-23 08:17:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-538516966192270916.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16198885779575231149.kers]
Normalized transition count is 45 out of 47 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 45 rows 24 cols 127 entries
Finished phase 1 with 19 SingleSign rule and 1 generalized
[2026-05-23 08:17:35] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16198885779575231149.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1098 ms. (909 steps per ms)
FORMULA CO4-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 349 ms. (2857 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 19886 ms.

BK_STOP 1779524257280

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

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