Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000221.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.8K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11: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 89K 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 MedleyA-PT-16-UpperBounds-00
FORMULA_NAME MedleyA-PT-16-UpperBounds-01
FORMULA_NAME MedleyA-PT-16-UpperBounds-02
FORMULA_NAME MedleyA-PT-16-UpperBounds-03
FORMULA_NAME MedleyA-PT-16-UpperBounds-04
FORMULA_NAME MedleyA-PT-16-UpperBounds-05
FORMULA_NAME MedleyA-PT-16-UpperBounds-06
FORMULA_NAME MedleyA-PT-16-UpperBounds-07
FORMULA_NAME MedleyA-PT-16-UpperBounds-08
FORMULA_NAME MedleyA-PT-16-UpperBounds-09
FORMULA_NAME MedleyA-PT-16-UpperBounds-10
FORMULA_NAME MedleyA-PT-16-UpperBounds-11
FORMULA_NAME MedleyA-PT-16-UpperBounds-12
FORMULA_NAME MedleyA-PT-16-UpperBounds-13
FORMULA_NAME MedleyA-PT-16-UpperBounds-14
FORMULA_NAME MedleyA-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779700615599

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 09:16:57] [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-25 09:16:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:16:57] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2026-05-25 09:16:57] [INFO ] Transformed 196 places.
[2026-05-25 09:16:57] [INFO ] Transformed 392 transitions.
[2026-05-25 09:16:57] [INFO ] Found NUPN structural information;
[2026-05-25 09:16:57] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
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, 0, 0] Max Struct:[1, 1, 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, 0, 0] Max Struct:[1, 1, 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-42195571139644852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14607043689759705394.kers'
[2026-05-25 09:16:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-42195571139644852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14607043689759705394.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 390 rows 196 cols 1182 entries
Finished phase 1 with 188 SingleSign rule and 1 generalized
[2026-05-25 09:16:57] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14607043689759705394.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 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, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 50 ms. (196 steps per ms)
FORMULA MedleyA-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110003 steps (22 resets) in 200 ms. (547 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 09:16:57] [INFO ] Invariant cache hit.
[2026-05-25 09:16:57] [INFO ] [Real]Absence check using 7 positive place invariants in 20 ms returned sat
[2026-05-25 09:16:58] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2026-05-25 09:16:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:16:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:16:58] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2026-05-25 09:16:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 409 ms
[2026-05-25 09:16:58] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 19 ms.
[2026-05-25 09:17:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 499 ms
[2026-05-25 09:17:03] [INFO ] Added : 316 causal constraints over 67 iterations in 4301 ms. Result :sat
Minimization took 127 ms.
[2026-05-25 09:17:03] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:17:03] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2026-05-25 09:17:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:17:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-25 09:17:03] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2026-05-25 09:17:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2026-05-25 09:17:04] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 25 ms.
[2026-05-25 09:17:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1023 ms
[2026-05-25 09:17:07] [INFO ] Added : 304 causal constraints over 61 iterations in 3899 ms. Result :sat
Minimization took 291 ms.
[2026-05-25 09:17:08] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-25 09:17:08] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2026-05-25 09:17:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:17:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:17:08] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2026-05-25 09:17:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 351 ms
[2026-05-25 09:17:09] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 37 ms.
[2026-05-25 09:17:13] [INFO ] Added : 293 causal constraints over 59 iterations in 4461 ms. Result :unknown
[2026-05-25 09:17:13] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:17:13] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2026-05-25 09:17:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:17:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:17:13] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2026-05-25 09:17:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 404 ms
[2026-05-25 09:17:14] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 18 ms.
[2026-05-25 09:17:17] [INFO ] Added : 250 causal constraints over 50 iterations in 3281 ms. Result :unknown
[2026-05-25 09:17:17] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:17:17] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2026-05-25 09:17:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:17:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2026-05-25 09:17:18] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2026-05-25 09:17:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2026-05-25 09:17:18] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 30 ms.
[2026-05-25 09:17:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 603 ms
[2026-05-25 09:17:21] [INFO ] Added : 312 causal constraints over 63 iterations in 3579 ms. Result :sat
Minimization took 501 ms.
[2026-05-25 09:17:22] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 09:17:22] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2026-05-25 09:17:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:17:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-25 09:17:22] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-25 09:17:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2026-05-25 09:17:23] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 17 ms.
[2026-05-25 09:17:26] [INFO ] Added : 278 causal constraints over 56 iterations in 3711 ms. Result :sat
Minimization took 215 ms.
[2026-05-25 09:17:27] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:17:27] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2026-05-25 09:17:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:17:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:17:27] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-25 09:17:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2026-05-25 09:17:27] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 28 ms.
[2026-05-25 09:17:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2026-05-25 09:17:30] [INFO ] Added : 307 causal constraints over 63 iterations in 3057 ms. Result :sat
Minimization took 282 ms.
[2026-05-25 09:17:31] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-25 09:17:31] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2026-05-25 09:17:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:17:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2026-05-25 09:17:31] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2026-05-25 09:17:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 311 ms
[2026-05-25 09:17:31] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 34 ms.
[2026-05-25 09:17:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2026-05-25 09:17:35] [INFO ] Added : 308 causal constraints over 63 iterations in 3409 ms. Result :sat
Minimization took 192 ms.
[2026-05-25 09:17:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 09:17:35] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-25 09:17:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:17:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:17:35] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2026-05-25 09:17:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 511 ms
[2026-05-25 09:17:36] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 17 ms.
[2026-05-25 09:17:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2026-05-25 09:17:40] [INFO ] Added : 332 causal constraints over 67 iterations in 3892 ms. Result :sat
Minimization took 451 ms.
[2026-05-25 09:17:40] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:17:41] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2026-05-25 09:17:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:17:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2026-05-25 09:17:41] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2026-05-25 09:17:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 388 ms
[2026-05-25 09:17:41] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 25 ms.
[2026-05-25 09:17:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2026-05-25 09:17:44] [INFO ] Added : 315 causal constraints over 65 iterations in 2743 ms. Result :sat
Minimization took 231 ms.
[2026-05-25 09:17:44] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 09:17:44] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2026-05-25 09:17:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:17:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2026-05-25 09:17:45] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-25 09:17:45] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 19 ms.
[2026-05-25 09:17:49] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 777 ms
Maximisation of solution failed !
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 390/390 transitions.
Graph (trivial) has 212 edges and 196 vertex of which 13 / 196 are part of one of the 3 SCC in 6 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 186 transition count 344
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 153 transition count 342
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 152 transition count 341
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 151 transition count 341
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 72 place count 151 transition count 337
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 80 place count 147 transition count 337
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 115 place count 112 transition count 279
Iterating global reduction 4 with 35 rules applied. Total rules applied 150 place count 112 transition count 279
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 11 rules applied. Total rules applied 161 place count 112 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 162 place count 111 transition count 268
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 162 place count 111 transition count 260
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 178 place count 103 transition count 260
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 179 place count 103 transition count 259
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 182 place count 100 transition count 250
Iterating global reduction 7 with 3 rules applied. Total rules applied 185 place count 100 transition count 250
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 213 place count 86 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 216 place count 86 transition count 233
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 217 place count 85 transition count 231
Iterating global reduction 8 with 1 rules applied. Total rules applied 218 place count 85 transition count 231
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -135
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 8 with 40 rules applied. Total rules applied 258 place count 65 transition count 366
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 266 place count 65 transition count 358
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 268 place count 64 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 9 with 76 rules applied. Total rules applied 344 place count 64 transition count 295
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 348 place count 62 transition count 323
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 349 place count 62 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 350 place count 62 transition count 321
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 362 place count 62 transition count 302
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 24 rules applied. Total rules applied 386 place count 50 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 11 with 16 rules applied. Total rules applied 402 place count 50 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 403 place count 49 transition count 273
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 25 edges and 47 vertex of which 5 / 47 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 11 with 3 rules applied. Total rules applied 406 place count 44 transition count 273
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 12 with 31 rules applied. Total rules applied 437 place count 44 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 13 with 45 rules applied. Total rules applied 482 place count 44 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 1 rules applied. Total rules applied 483 place count 44 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 484 place count 43 transition count 196
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 15 with 4 rules applied. Total rules applied 488 place count 41 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 489 place count 41 transition count 193
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 490 place count 41 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 491 place count 40 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 16 with 4 rules applied. Total rules applied 495 place count 40 transition count 188
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 497 place count 40 transition count 188
Applied a total of 497 rules in 179 ms. Remains 40 /196 variables (removed 156) and now considering 188/390 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 40/196 places, 188/390 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16023061652938552715.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6795831370721801188.kers'
[2026-05-25 09:17:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16023061652938552715.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6795831370721801188.kers]
Normalized transition count is 169 out of 188 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 169 rows 39 cols 608 entries
Finished phase 1 with 34 SingleSign rule and 1 generalized
[2026-05-25 09:17:51] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6795831370721801188.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (78 resets) in 1141 ms. (875 steps per ms)
FORMULA MedleyA-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (15 resets) in 1113 ms. (897 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 56409 ms.

BK_STOP 1779700673519

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="MedleyA-PT-16"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-16, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969020000221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-16.tgz
mv MedleyA-PT-16 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;