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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.6K Mar 6 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 6 13:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 6 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 6 13:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:31 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 177K 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-12-UpperBounds-00
FORMULA_NAME CO4-PT-12-UpperBounds-01
FORMULA_NAME CO4-PT-12-UpperBounds-02
FORMULA_NAME CO4-PT-12-UpperBounds-03
FORMULA_NAME CO4-PT-12-UpperBounds-04
FORMULA_NAME CO4-PT-12-UpperBounds-05
FORMULA_NAME CO4-PT-12-UpperBounds-06
FORMULA_NAME CO4-PT-12-UpperBounds-07
FORMULA_NAME CO4-PT-12-UpperBounds-08
FORMULA_NAME CO4-PT-12-UpperBounds-09
FORMULA_NAME CO4-PT-12-UpperBounds-10
FORMULA_NAME CO4-PT-12-UpperBounds-11
FORMULA_NAME CO4-PT-12-UpperBounds-12
FORMULA_NAME CO4-PT-12-UpperBounds-13
FORMULA_NAME CO4-PT-12-UpperBounds-14
FORMULA_NAME CO4-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779522988190

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-23 07:56:29] [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:56:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:56:29] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2026-05-23 07:56:29] [INFO ] Transformed 649 places.
[2026-05-23 07:56:29] [INFO ] Transformed 782 transitions.
[2026-05-23 07:56:29] [INFO ] Found NUPN structural information;
[2026-05-23 07:56:29] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 172 places in 10 ms
Reduce places removed 172 places and 219 transitions.
FORMULA CO4-PT-12-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-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-3869842894354594600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15847688499216399536.kers'
[2026-05-23 07:56:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3869842894354594600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15847688499216399536.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 563 rows 477 cols 1370 entries
Finished phase 1 with 458 SingleSign rule and 10 generalized
[2026-05-23 07:56:29] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15847688499216399536.kers
Total runtime 6 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 (56 resets) in 42 ms. (232 steps per ms)
FORMULA CO4-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90002 steps (446 resets) in 114 ms. (782 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:56:29] [INFO ] Invariant cache hit.
[2026-05-23 07:56:30] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2026-05-23 07:56:30] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:56:30] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2026-05-23 07:56:30] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 38 ms.
[2026-05-23 07:56:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:56:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 24 ms returned sat
[2026-05-23 07:56:30] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:56:30] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2026-05-23 07:56:30] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 28 ms.
[2026-05-23 07:56:31] [INFO ] Added : 119 causal constraints over 24 iterations in 931 ms. Result :sat
Minimization took 281 ms.
[2026-05-23 07:56:32] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 07:56:32] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:56:32] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2026-05-23 07:56:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:56:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:56:32] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:56:32] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2026-05-23 07:56:32] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 58 ms.
[2026-05-23 07:56:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 438 ms
[2026-05-23 07:56:34] [INFO ] Added : 121 causal constraints over 25 iterations in 1370 ms. Result :sat
Minimization took 240 ms.
[2026-05-23 07:56:34] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 07:56:34] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:56:34] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2026-05-23 07:56:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:56:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:56:34] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:56:34] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2026-05-23 07:56:34] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 26 ms.
[2026-05-23 07:56:35] [INFO ] Added : 115 causal constraints over 23 iterations in 778 ms. Result :sat
Minimization took 257 ms.
[2026-05-23 07:56:35] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:56:35] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:56:36] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2026-05-23 07:56:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:56:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2026-05-23 07:56:36] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 07:56:36] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2026-05-23 07:56:36] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 30 ms.
[2026-05-23 07:56:37] [INFO ] Added : 85 causal constraints over 17 iterations in 629 ms. Result :sat
Minimization took 259 ms.
[2026-05-23 07:56:37] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:56:37] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:56:37] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2026-05-23 07:56:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:56:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:56:37] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:56:37] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2026-05-23 07:56:37] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 31 ms.
[2026-05-23 07:56:38] [INFO ] Added : 105 causal constraints over 21 iterations in 764 ms. Result :sat
Minimization took 266 ms.
[2026-05-23 07:56:39] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:56:39] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:56:39] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2026-05-23 07:56:39] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 28 ms.
[2026-05-23 07:56:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:56:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:56:39] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:56:39] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2026-05-23 07:56:39] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 28 ms.
[2026-05-23 07:56:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2026-05-23 07:56:40] [INFO ] Added : 135 causal constraints over 27 iterations in 1275 ms. Result :sat
Minimization took 256 ms.
[2026-05-23 07:56:41] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 07:56:41] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 07:56:41] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2026-05-23 07:56:41] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 31 ms.
[2026-05-23 07:56:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:56:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:56:41] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 07:56:41] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2026-05-23 07:56:41] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 28 ms.
[2026-05-23 07:56:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2026-05-23 07:56:43] [INFO ] Added : 132 causal constraints over 27 iterations in 1363 ms. Result :sat
Minimization took 252 ms.
[2026-05-23 07:56:43] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:56:43] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 07:56:43] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2026-05-23 07:56:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:56:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:56:43] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 07:56:43] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2026-05-23 07:56:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1392 ms
[2026-05-23 07:56:45] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 31 ms.
[2026-05-23 07:56:46] [INFO ] Added : 86 causal constraints over 18 iterations in 777 ms. Result :sat
Minimization took 178 ms.
[2026-05-23 07:56:46] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2026-05-23 07:56:46] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:56:46] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2026-05-23 07:56:46] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 25 ms.
[2026-05-23 07:56:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:56:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 07:56:46] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:56:46] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2026-05-23 07:56:46] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 29 ms.
[2026-05-23 07:56:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2026-05-23 07:56:48] [INFO ] Added : 117 causal constraints over 24 iterations in 1173 ms. Result :sat
Minimization took 257 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-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 563/563 transitions.
Graph (trivial) has 481 edges and 477 vertex of which 3 / 477 are part of one of the 1 SCC in 12 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 770 edges and 475 vertex of which 436 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.1 ms
Discarding 39 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 299 rules applied. Total rules applied 301 place count 436 transition count 242
Reduce places removed 275 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 293 rules applied. Total rules applied 594 place count 161 transition count 224
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 20 rules applied. Total rules applied 614 place count 153 transition count 212
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 622 place count 149 transition count 208
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 628 place count 147 transition count 204
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 632 place count 145 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 632 place count 145 transition count 201
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 634 place count 144 transition count 201
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 661 place count 117 transition count 174
Iterating global reduction 6 with 27 rules applied. Total rules applied 688 place count 117 transition count 174
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 688 place count 117 transition count 167
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 702 place count 110 transition count 167
Graph (complete) has 264 edges and 110 vertex of which 108 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 703 place count 108 transition count 166
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 705 place count 108 transition count 164
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 722 place count 91 transition count 129
Iterating global reduction 8 with 17 rules applied. Total rules applied 739 place count 91 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 741 place count 91 transition count 127
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 743 place count 89 transition count 125
Iterating global reduction 9 with 2 rules applied. Total rules applied 745 place count 89 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 747 place count 89 transition count 123
Performed 34 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 10 with 68 rules applied. Total rules applied 815 place count 55 transition count 88
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 822 place count 55 transition count 81
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 826 place count 51 transition count 77
Iterating global reduction 11 with 4 rules applied. Total rules applied 830 place count 51 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 831 place count 51 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 837 place count 48 transition count 73
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 840 place count 48 transition count 70
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 843 place count 45 transition count 67
Iterating global reduction 13 with 3 rules applied. Total rules applied 846 place count 45 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 848 place count 45 transition count 65
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 18 rules applied. Total rules applied 866 place count 36 transition count 66
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 14 with 16 rules applied. Total rules applied 882 place count 36 transition count 50
Discarding 8 places :
Symmetric choice reduction at 15 with 8 rule applications. Total rules 890 place count 28 transition count 42
Iterating global reduction 15 with 8 rules applied. Total rules applied 898 place count 28 transition count 42
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 905 place count 28 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 907 place count 27 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 16 with 5 rules applied. Total rules applied 912 place count 27 transition count 34
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 913 place count 26 transition count 33
Iterating global reduction 16 with 1 rules applied. Total rules applied 914 place count 26 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 916 place count 26 transition count 31
Free-agglomeration rule applied 7 times.
Iterating global reduction 17 with 7 rules applied. Total rules applied 923 place count 26 transition count 24
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 9 rules applied. Total rules applied 932 place count 19 transition count 22
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 933 place count 19 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 934 place count 19 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 935 place count 18 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 937 place count 16 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 941 place count 14 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 944 place count 14 transition count 15
Applied a total of 944 rules in 93 ms. Remains 14 /477 variables (removed 463) and now considering 15/563 (removed 548) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 14/477 places, 15/563 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5478946582733788140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2584766297843437235.kers'
[2026-05-23 07:56:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5478946582733788140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2584766297843437235.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 15 rows 11 cols 48 entries
Finished phase 1 with 7 SingleSign rule and 2 generalized
[2026-05-23 07:56:48] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2584766297843437235.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 (111094 resets) in 600 ms. (1663 steps per ms)
FORMULA CO4-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (31595 resets) in 267 ms. (3731 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 20165 ms.

BK_STOP 1779523009544

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

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