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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.1K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K 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 58K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 13:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:29 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 98K 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-07-UpperBounds-00
FORMULA_NAME CO4-PT-07-UpperBounds-01
FORMULA_NAME CO4-PT-07-UpperBounds-02
FORMULA_NAME CO4-PT-07-UpperBounds-03
FORMULA_NAME CO4-PT-07-UpperBounds-04
FORMULA_NAME CO4-PT-07-UpperBounds-05
FORMULA_NAME CO4-PT-07-UpperBounds-06
FORMULA_NAME CO4-PT-07-UpperBounds-07
FORMULA_NAME CO4-PT-07-UpperBounds-08
FORMULA_NAME CO4-PT-07-UpperBounds-09
FORMULA_NAME CO4-PT-07-UpperBounds-10
FORMULA_NAME CO4-PT-07-UpperBounds-11
FORMULA_NAME CO4-PT-07-UpperBounds-12
FORMULA_NAME CO4-PT-07-UpperBounds-13
FORMULA_NAME CO4-PT-07-UpperBounds-14
FORMULA_NAME CO4-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779521628384

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-23 07:33:49] [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 07:33:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:33:49] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2026-05-23 07:33:49] [INFO ] Transformed 384 places.
[2026-05-23 07:33:49] [INFO ] Transformed 456 transitions.
[2026-05-23 07:33:49] [INFO ] Found NUPN structural information;
[2026-05-23 07:33:49] [INFO ] Parsed PT model containing 384 places and 456 transitions and 1022 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-07-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-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] 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17437134715390565021.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-716883285386234657.kers'
[2026-05-23 07:33:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17437134715390565021.kers, --Pflows, --basisKERS=/tmp/petrispot-output-716883285386234657.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 336 rows 284 cols 760 entries
Finished phase 1 with 278 SingleSign rule and 0 generalized
[2026-05-23 07:33:49] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-716883285386234657.kers
Total runtime 3 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 (9 resets) in 29 ms. (333 steps per ms)
FORMULA CO4-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90000 steps (49 resets) in 131 ms. (681 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-23 07:33:50] [INFO ] Invariant cache hit.
[2026-05-23 07:33:50] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2026-05-23 07:33:50] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2026-05-23 07:33:50] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 43 ms.
[2026-05-23 07:33:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:33:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2026-05-23 07:33:50] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2026-05-23 07:33:50] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 28 ms.
[2026-05-23 07:33:51] [INFO ] Added : 47 causal constraints over 10 iterations in 310 ms. Result :sat
Minimization took 86 ms.
[2026-05-23 07:33:51] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2026-05-23 07:33:51] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2026-05-23 07:33:51] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 18 ms.
[2026-05-23 07:33:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:33:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 24 ms returned sat
[2026-05-23 07:33:51] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2026-05-23 07:33:51] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 16 ms.
[2026-05-23 07:33:52] [INFO ] Added : 61 causal constraints over 13 iterations in 343 ms. Result :sat
Minimization took 80 ms.
[2026-05-23 07:33:52] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 07:33:52] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-23 07:33:52] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 17 ms.
[2026-05-23 07:33:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:33:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2026-05-23 07:33:52] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-23 07:33:52] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 18 ms.
[2026-05-23 07:33:53] [INFO ] Added : 63 causal constraints over 13 iterations in 277 ms. Result :sat
Minimization took 78 ms.
[2026-05-23 07:33:53] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 07:33:53] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-23 07:33:53] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 17 ms.
[2026-05-23 07:33:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:33:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 07:33:53] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2026-05-23 07:33:53] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 22 ms.
[2026-05-23 07:33:53] [INFO ] Added : 42 causal constraints over 9 iterations in 191 ms. Result :sat
Minimization took 76 ms.
[2026-05-23 07:33:53] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 07:33:54] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2026-05-23 07:33:54] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 20 ms.
[2026-05-23 07:33:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:33:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 07:33:54] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-23 07:33:54] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 18 ms.
[2026-05-23 07:33:54] [INFO ] Added : 41 causal constraints over 9 iterations in 204 ms. Result :sat
Minimization took 84 ms.
[2026-05-23 07:33:54] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2026-05-23 07:33:54] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-23 07:33:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:33:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 07:33:54] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-23 07:33:54] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 16 ms.
[2026-05-23 07:33:55] [INFO ] Added : 42 causal constraints over 9 iterations in 187 ms. Result :sat
Minimization took 74 ms.
[2026-05-23 07:33:55] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 07:33:55] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-23 07:33:55] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 15 ms.
[2026-05-23 07:33:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:33:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 07:33:55] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-23 07:33:55] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 15 ms.
[2026-05-23 07:33:55] [INFO ] Added : 43 causal constraints over 9 iterations in 193 ms. Result :sat
Minimization took 74 ms.
[2026-05-23 07:33:55] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 07:33:55] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2026-05-23 07:33:56] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 23 ms.
[2026-05-23 07:33:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:33:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2026-05-23 07:33:56] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2026-05-23 07:33:56] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 28 ms.
[2026-05-23 07:33:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2026-05-23 07:33:56] [INFO ] Added : 57 causal constraints over 13 iterations in 396 ms. Result :sat
Minimization took 80 ms.
[2026-05-23 07:33:56] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 07:33:56] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-23 07:33:56] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 18 ms.
[2026-05-23 07:33:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:33:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2026-05-23 07:33:57] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-05-23 07:33:57] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 15 ms.
[2026-05-23 07:33:57] [INFO ] Added : 49 causal constraints over 10 iterations in 238 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA CO4-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 336/336 transitions.
Graph (trivial) has 286 edges and 284 vertex of which 2 / 284 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 430 edges and 283 vertex of which 253 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 143 rules applied. Total rules applied 145 place count 253 transition count 174
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 133 rules applied. Total rules applied 278 place count 127 transition count 167
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 285 place count 124 transition count 163
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 288 place count 123 transition count 161
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 291 place count 122 transition count 159
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 294 place count 121 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 295 place count 120 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 295 place count 120 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 297 place count 119 transition count 156
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 314 place count 102 transition count 139
Iterating global reduction 7 with 17 rules applied. Total rules applied 331 place count 102 transition count 139
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 331 place count 102 transition count 134
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 341 place count 97 transition count 134
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 352 place count 86 transition count 123
Iterating global reduction 7 with 11 rules applied. Total rules applied 363 place count 86 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 364 place count 86 transition count 122
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 365 place count 85 transition count 121
Iterating global reduction 8 with 1 rules applied. Total rules applied 366 place count 85 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 367 place count 85 transition count 120
Performed 35 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 9 with 70 rules applied. Total rules applied 437 place count 50 transition count 81
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 461 place count 38 transition count 82
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 469 place count 38 transition count 74
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 479 place count 28 transition count 54
Iterating global reduction 10 with 10 rules applied. Total rules applied 489 place count 28 transition count 54
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 497 place count 28 transition count 46
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 499 place count 26 transition count 40
Iterating global reduction 11 with 2 rules applied. Total rules applied 501 place count 26 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 503 place count 26 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 505 place count 25 transition count 50
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 510 place count 25 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 13 with 10 rules applied. Total rules applied 520 place count 25 transition count 35
Free-agglomeration rule applied 4 times.
Iterating global reduction 13 with 4 rules applied. Total rules applied 524 place count 25 transition count 31
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 529 place count 21 transition count 30
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 530 place count 21 transition count 30
Graph (complete) has 55 edges and 21 vertex of which 20 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 14 with 1 rules applied. Total rules applied 531 place count 20 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 532 place count 20 transition count 29
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 533 place count 20 transition count 29
Graph (complete) has 52 edges and 20 vertex of which 19 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 16 with 1 rules applied. Total rules applied 534 place count 19 transition count 29
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 535 place count 19 transition count 28
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 536 place count 19 transition count 28
Graph (complete) has 49 edges and 19 vertex of which 18 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 18 with 1 rules applied. Total rules applied 537 place count 18 transition count 28
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 538 place count 18 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 539 place count 17 transition count 26
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.t401.t15.t16 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.
Iterating post reduction 20 with 2 rules applied. Total rules applied 541 place count 14 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 544 place count 14 transition count 21
Discarding 2 places :
Symmetric choice reduction at 21 with 2 rule applications. Total rules 546 place count 12 transition count 19
Iterating global reduction 21 with 2 rules applied. Total rules applied 548 place count 12 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 550 place count 12 transition count 17
Free-agglomeration rule applied 2 times.
Iterating global reduction 22 with 2 rules applied. Total rules applied 552 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 554 place count 10 transition count 15
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 555 place count 10 transition count 15
Applied a total of 555 rules in 78 ms. Remains 10 /284 variables (removed 274) and now considering 15/336 (removed 321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 10/284 places, 15/336 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4662468946005140396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6687978021347678299.kers'
[2026-05-23 07:33:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4662468946005140396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6687978021347678299.kers]
Normalized transition count is 12 out of 15 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 10 cols 36 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-23 07:33:57] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6687978021347678299.kers
Total runtime 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 494 ms. (2020 steps per ms)
FORMULA CO4-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 331 ms. (3012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 9052 ms.

BK_STOP 1779521638610

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

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