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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.6K Mar 6 13:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 6 13:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 6 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 6 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 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 138K 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-08-UpperBounds-00
FORMULA_NAME CO4-PT-08-UpperBounds-01
FORMULA_NAME CO4-PT-08-UpperBounds-02
FORMULA_NAME CO4-PT-08-UpperBounds-03
FORMULA_NAME CO4-PT-08-UpperBounds-04
FORMULA_NAME CO4-PT-08-UpperBounds-05
FORMULA_NAME CO4-PT-08-UpperBounds-06
FORMULA_NAME CO4-PT-08-UpperBounds-07
FORMULA_NAME CO4-PT-08-UpperBounds-08
FORMULA_NAME CO4-PT-08-UpperBounds-09
FORMULA_NAME CO4-PT-08-UpperBounds-10
FORMULA_NAME CO4-PT-08-UpperBounds-11
FORMULA_NAME CO4-PT-08-UpperBounds-12
FORMULA_NAME CO4-PT-08-UpperBounds-13
FORMULA_NAME CO4-PT-08-UpperBounds-14
FORMULA_NAME CO4-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779521949334

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-23 07:39:10] [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:39:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:39:10] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2026-05-23 07:39:10] [INFO ] Transformed 467 places.
[2026-05-23 07:39:10] [INFO ] Transformed 600 transitions.
[2026-05-23 07:39:10] [INFO ] Found NUPN structural information;
[2026-05-23 07:39:10] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 155 transitions.
FORMULA CO4-PT-08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6614792177591790603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3080678006802998618.kers'
[2026-05-23 07:39:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6614792177591790603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3080678006802998618.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 445 rows 359 cols 1134 entries
Finished phase 1 with 340 SingleSign rule and 10 generalized
[2026-05-23 07:39:10] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3080678006802998618.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (54 resets) in 31 ms. (312 steps per ms)
FORMULA CO4-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80003 steps (442 resets) in 99 ms. (800 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-23 07:39:10] [INFO ] Invariant cache hit.
[2026-05-23 07:39:11] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2026-05-23 07:39:11] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 4 ms returned sat
[2026-05-23 07:39:11] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2026-05-23 07:39:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:39:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2026-05-23 07:39:11] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 4 ms returned sat
[2026-05-23 07:39:11] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2026-05-23 07:39:11] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 48 ms.
[2026-05-23 07:39:12] [INFO ] Added : 101 causal constraints over 21 iterations in 778 ms. Result :sat
Minimization took 130 ms.
[2026-05-23 07:39:12] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2026-05-23 07:39:12] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 07:39:13] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2026-05-23 07:39:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:39:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 31 ms returned sat
[2026-05-23 07:39:13] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 4 ms returned sat
[2026-05-23 07:39:13] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2026-05-23 07:39:13] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 27 ms.
[2026-05-23 07:39:13] [INFO ] Added : 88 causal constraints over 18 iterations in 532 ms. Result :sat
Minimization took 155 ms.
[2026-05-23 07:39:14] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2026-05-23 07:39:14] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 4 ms returned sat
[2026-05-23 07:39:14] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2026-05-23 07:39:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:39:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2026-05-23 07:39:14] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 6 ms returned sat
[2026-05-23 07:39:14] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2026-05-23 07:39:14] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 24 ms.
[2026-05-23 07:39:14] [INFO ] Added : 47 causal constraints over 10 iterations in 295 ms. Result :sat
Minimization took 161 ms.
[2026-05-23 07:39:14] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2026-05-23 07:39:14] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 07:39:15] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2026-05-23 07:39:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:39:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2026-05-23 07:39:15] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 07:39:15] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2026-05-23 07:39:15] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 23 ms.
[2026-05-23 07:39:15] [INFO ] Added : 57 causal constraints over 12 iterations in 341 ms. Result :sat
Minimization took 234 ms.
[2026-05-23 07:39:15] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2026-05-23 07:39:15] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 07:39:16] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2026-05-23 07:39:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:39:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2026-05-23 07:39:16] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 6 ms returned sat
[2026-05-23 07:39:16] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2026-05-23 07:39:16] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 31 ms.
[2026-05-23 07:39:16] [INFO ] Added : 48 causal constraints over 10 iterations in 334 ms. Result :sat
Minimization took 151 ms.
[2026-05-23 07:39:16] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2026-05-23 07:39:16] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 07:39:17] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2026-05-23 07:39:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:39:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2026-05-23 07:39:17] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 4 ms returned sat
[2026-05-23 07:39:17] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2026-05-23 07:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2026-05-23 07:39:17] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 23 ms.
[2026-05-23 07:39:17] [INFO ] Added : 78 causal constraints over 16 iterations in 450 ms. Result :sat
Minimization took 196 ms.
[2026-05-23 07:39:18] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2026-05-23 07:39:18] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 07:39:18] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2026-05-23 07:39:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:39:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2026-05-23 07:39:18] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 4 ms returned sat
[2026-05-23 07:39:18] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2026-05-23 07:39:18] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 21 ms.
[2026-05-23 07:39:19] [INFO ] Added : 88 causal constraints over 18 iterations in 506 ms. Result :sat
Minimization took 158 ms.
[2026-05-23 07:39:19] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-23 07:39:19] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:39:19] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2026-05-23 07:39:19] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 22 ms.
[2026-05-23 07:39:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:39:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-23 07:39:19] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 07:39:19] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2026-05-23 07:39:19] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 20 ms.
[2026-05-23 07:39:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2026-05-23 07:39:20] [INFO ] Added : 92 causal constraints over 20 iterations in 673 ms. Result :sat
Minimization took 148 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 445/445 transitions.
Graph (trivial) has 352 edges and 359 vertex of which 2 / 359 are part of one of the 1 SCC in 6 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 653 edges and 358 vertex of which 323 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 179 rules applied. Total rules applied 181 place count 323 transition count 247
Reduce places removed 158 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 176 rules applied. Total rules applied 357 place count 165 transition count 229
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 18 rules applied. Total rules applied 375 place count 157 transition count 219
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 3 with 6 rules applied. Total rules applied 381 place count 155 transition count 215
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 387 place count 153 transition count 211
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 5 with 8 rules applied. Total rules applied 395 place count 151 transition count 205
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 399 place count 147 transition count 205
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 427 place count 119 transition count 177
Iterating global reduction 7 with 28 rules applied. Total rules applied 455 place count 119 transition count 177
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 455 place count 119 transition count 170
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 469 place count 112 transition count 170
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 485 place count 96 transition count 137
Iterating global reduction 7 with 16 rules applied. Total rules applied 501 place count 96 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 503 place count 96 transition count 135
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 505 place count 94 transition count 133
Iterating global reduction 8 with 2 rules applied. Total rules applied 507 place count 94 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 509 place count 94 transition count 131
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 9 with 68 rules applied. Total rules applied 577 place count 60 transition count 96
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 584 place count 60 transition count 89
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 588 place count 56 transition count 85
Iterating global reduction 10 with 4 rules applied. Total rules applied 592 place count 56 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 593 place count 56 transition count 84
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 11 with 4 rules applied. Total rules applied 597 place count 54 transition count 82
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 599 place count 54 transition count 80
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 601 place count 52 transition count 78
Iterating global reduction 12 with 2 rules applied. Total rules applied 603 place count 52 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 604 place count 52 transition count 77
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 605 place count 51 transition count 76
Iterating global reduction 13 with 1 rules applied. Total rules applied 606 place count 51 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 607 place count 51 transition count 75
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 14 with 14 rules applied. Total rules applied 621 place count 44 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 14 with 13 rules applied. Total rules applied 634 place count 44 transition count 62
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 641 place count 37 transition count 55
Iterating global reduction 15 with 7 rules applied. Total rules applied 648 place count 37 transition count 55
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 654 place count 37 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 656 place count 36 transition count 66
Free-agglomeration rule applied 8 times.
Iterating global reduction 16 with 8 rules applied. Total rules applied 664 place count 36 transition count 58
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 11 rules applied. Total rules applied 675 place count 28 transition count 55
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 676 place count 28 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 677 place count 27 transition count 54
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 17 with 4 rules applied. Total rules applied 681 place count 25 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 683 place count 23 transition count 52
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 687 place count 21 transition count 50
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 19 with 9 rules applied. Total rules applied 696 place count 21 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 698 place count 20 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 702 place count 20 transition count 40
Applied a total of 702 rules in 89 ms. Remains 20 /359 variables (removed 339) and now considering 40/445 (removed 405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 20/359 places, 40/445 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2262925637802988857.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3608957325274853509.kers'
[2026-05-23 07:39:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2262925637802988857.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3608957325274853509.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 40 rows 18 cols 149 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-23 07:39:20] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3608957325274853509.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (37973 resets) in 741 ms. (1347 steps per ms)
FORMULA CO4-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (10124 resets) in 292 ms. (3412 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 11565 ms.

BK_STOP 1779521962051

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

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