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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.9K 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 4.6K Mar 6 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 6 13:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Mar 6 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 6 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 6 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 13:26 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 255K 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-15-UpperBounds-00
FORMULA_NAME CO4-PT-15-UpperBounds-01
FORMULA_NAME CO4-PT-15-UpperBounds-02
FORMULA_NAME CO4-PT-15-UpperBounds-03
FORMULA_NAME CO4-PT-15-UpperBounds-04
FORMULA_NAME CO4-PT-15-UpperBounds-05
FORMULA_NAME CO4-PT-15-UpperBounds-06
FORMULA_NAME CO4-PT-15-UpperBounds-07
FORMULA_NAME CO4-PT-15-UpperBounds-08
FORMULA_NAME CO4-PT-15-UpperBounds-09
FORMULA_NAME CO4-PT-15-UpperBounds-10
FORMULA_NAME CO4-PT-15-UpperBounds-11
FORMULA_NAME CO4-PT-15-UpperBounds-12
FORMULA_NAME CO4-PT-15-UpperBounds-13
FORMULA_NAME CO4-PT-15-UpperBounds-14
FORMULA_NAME CO4-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779523691194

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-23 08:08:12] [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:08:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:08:12] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2026-05-23 08:08:12] [INFO ] Transformed 833 places.
[2026-05-23 08:08:12] [INFO ] Transformed 1106 transitions.
[2026-05-23 08:08:12] [INFO ] Found NUPN structural information;
[2026-05-23 08:08:12] [INFO ] Parsed PT model containing 833 places and 1106 transitions and 2980 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 124 places in 10 ms
Reduce places removed 124 places and 197 transitions.
FORMULA CO4-PT-15-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5423249073226457353.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16044305829788427979.kers'
[2026-05-23 08:08:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5423249073226457353.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16044305829788427979.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 909 rows 709 cols 2322 entries
Finished phase 1 with 689 SingleSign rule and 8 generalized
[2026-05-23 08:08:12] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16044305829788427979.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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (226 resets) in 55 ms. (178 steps per ms)
FORMULA CO4-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70005 steps (272 resets) in 76 ms. (909 steps per ms)
FORMULA CO4-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-05-23 08:08:12] [INFO ] Invariant cache hit.
[2026-05-23 08:08:13] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2026-05-23 08:08:13] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:08:13] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2026-05-23 08:08:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:08:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2026-05-23 08:08:13] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:08:13] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2026-05-23 08:08:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2026-05-23 08:08:14] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 54 ms.
[2026-05-23 08:08:15] [INFO ] Added : 116 causal constraints over 24 iterations in 1272 ms. Result :sat
Minimization took 454 ms.
[2026-05-23 08:08:16] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2026-05-23 08:08:16] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:08:16] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2026-05-23 08:08:16] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 54 ms.
[2026-05-23 08:08:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:08:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2026-05-23 08:08:16] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 08:08:16] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2026-05-23 08:08:16] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 50 ms.
[2026-05-23 08:08:18] [INFO ] Added : 112 causal constraints over 23 iterations in 1312 ms. Result :sat
Minimization took 467 ms.
[2026-05-23 08:08:18] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2026-05-23 08:08:18] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:08:19] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2026-05-23 08:08:19] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 48 ms.
[2026-05-23 08:08:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:08:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned sat
[2026-05-23 08:08:19] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:08:19] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2026-05-23 08:08:19] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 46 ms.
[2026-05-23 08:08:20] [INFO ] Added : 112 causal constraints over 23 iterations in 1150 ms. Result :sat
Minimization took 435 ms.
[2026-05-23 08:08:21] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2026-05-23 08:08:21] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:08:21] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2026-05-23 08:08:21] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 46 ms.
[2026-05-23 08:08:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:08:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2026-05-23 08:08:22] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:08:22] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2026-05-23 08:08:22] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 46 ms.
[2026-05-23 08:08:23] [INFO ] Added : 107 causal constraints over 22 iterations in 1133 ms. Result :sat
Minimization took 479 ms.
[2026-05-23 08:08:24] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2026-05-23 08:08:24] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 08:08:24] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2026-05-23 08:08:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:08:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned sat
[2026-05-23 08:08:24] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:08:24] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2026-05-23 08:08:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2026-05-23 08:08:25] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 36 ms.
[2026-05-23 08:08:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 901 ms
[2026-05-23 08:08:27] [INFO ] Added : 116 causal constraints over 24 iterations in 2182 ms. Result :sat
Minimization took 418 ms.
[2026-05-23 08:08:27] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2026-05-23 08:08:27] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:08:28] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2026-05-23 08:08:28] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 37 ms.
[2026-05-23 08:08:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:08:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned sat
[2026-05-23 08:08:28] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 08:08:28] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2026-05-23 08:08:28] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 42 ms.
[2026-05-23 08:08:29] [INFO ] Added : 88 causal constraints over 18 iterations in 900 ms. Result :sat
Minimization took 432 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-15-UpperBounds-03 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 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 909/909 transitions.
Graph (trivial) has 738 edges and 709 vertex of which 2 / 709 are part of one of the 1 SCC in 12 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 1304 edges and 708 vertex of which 657 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.2 ms
Discarding 51 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 382 rules applied. Total rules applied 384 place count 657 transition count 502
Reduce places removed 352 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 381 rules applied. Total rules applied 765 place count 305 transition count 473
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 29 rules applied. Total rules applied 794 place count 292 transition count 457
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 803 place count 289 transition count 451
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 812 place count 286 transition count 445
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 7 rules applied. Total rules applied 819 place count 283 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 820 place count 282 transition count 441
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 820 place count 282 transition count 440
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 822 place count 281 transition count 440
Discarding 46 places :
Symmetric choice reduction at 7 with 46 rule applications. Total rules 868 place count 235 transition count 394
Iterating global reduction 7 with 46 rules applied. Total rules applied 914 place count 235 transition count 394
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 15 Pre rules applied. Total rules applied 914 place count 235 transition count 379
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 944 place count 220 transition count 379
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 972 place count 192 transition count 335
Iterating global reduction 7 with 28 rules applied. Total rules applied 1000 place count 192 transition count 335
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 192 transition count 328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1008 place count 191 transition count 328
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1012 place count 187 transition count 323
Iterating global reduction 9 with 4 rules applied. Total rules applied 1016 place count 187 transition count 323
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 187 transition count 319
Performed 73 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 10 with 146 rules applied. Total rules applied 1166 place count 114 transition count 236
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1170 place count 114 transition count 232
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 11 with 76 rules applied. Total rules applied 1246 place count 76 transition count 271
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 11 with 78 rules applied. Total rules applied 1324 place count 76 transition count 193
Discarding 28 places :
Symmetric choice reduction at 12 with 28 rule applications. Total rules 1352 place count 48 transition count 126
Iterating global reduction 12 with 28 rules applied. Total rules applied 1380 place count 48 transition count 126
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 1400 place count 48 transition count 106
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1406 place count 42 transition count 81
Iterating global reduction 13 with 6 rules applied. Total rules applied 1412 place count 42 transition count 81
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1417 place count 42 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1419 place count 41 transition count 83
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1422 place count 41 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 15 with 7 rules applied. Total rules applied 1429 place count 41 transition count 73
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1430 place count 40 transition count 71
Iterating global reduction 15 with 1 rules applied. Total rules applied 1431 place count 40 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1432 place count 40 transition count 70
Free-agglomeration rule applied 8 times.
Iterating global reduction 16 with 8 rules applied. Total rules applied 1440 place count 40 transition count 62
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 1450 place count 32 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1451 place count 32 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1452 place count 31 transition count 59
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 t511.t836 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 17 edges and 27 vertex of which 3 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 17 with 3 rules applied. Total rules applied 1455 place count 25 transition count 57
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 17 edges and 24 vertex of which 6 / 24 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 18 with 8 rules applied. Total rules applied 1463 place count 19 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 19 with 19 rules applied. Total rules applied 1482 place count 19 transition count 32
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 1483 place count 18 transition count 30
Iterating global reduction 20 with 1 rules applied. Total rules applied 1484 place count 18 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1485 place count 18 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 21 with 4 rules applied. Total rules applied 1489 place count 18 transition count 25
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 45 edges and 17 vertex of which 16 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 21 with 3 rules applied. Total rules applied 1492 place count 16 transition count 24
Free-agglomeration rule applied 3 times.
Iterating global reduction 22 with 3 rules applied. Total rules applied 1495 place count 16 transition count 21
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 1498 place count 13 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 23 with 2 rules applied. Total rules applied 1500 place count 13 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 1501 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 1504 place count 12 transition count 16
Applied a total of 1504 rules in 153 ms. Remains 12 /709 variables (removed 697) and now considering 16/909 (removed 893) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 12/709 places, 16/909 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12664159033137164383.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7828290289984959399.kers'
[2026-05-23 08:08:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12664159033137164383.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7828290289984959399.kers]
Normalized transition count is 13 out of 16 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 13 rows 9 cols 28 entries
Finished phase 1 with 5 SingleSign rule and 2 generalized
[2026-05-23 08:08:30] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7828290289984959399.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 744 ms. (1342 steps per ms)
FORMULA CO4-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 258 ms. (3861 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 19232 ms.

BK_STOP 1779523711611

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

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