Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028400421.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CO4-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028400421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 97K May 29 14:32 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-06-UpperBounds-00
FORMULA_NAME CO4-PT-06-UpperBounds-01
FORMULA_NAME CO4-PT-06-UpperBounds-02
FORMULA_NAME CO4-PT-06-UpperBounds-03
FORMULA_NAME CO4-PT-06-UpperBounds-04
FORMULA_NAME CO4-PT-06-UpperBounds-05
FORMULA_NAME CO4-PT-06-UpperBounds-06
FORMULA_NAME CO4-PT-06-UpperBounds-07
FORMULA_NAME CO4-PT-06-UpperBounds-08
FORMULA_NAME CO4-PT-06-UpperBounds-09
FORMULA_NAME CO4-PT-06-UpperBounds-10
FORMULA_NAME CO4-PT-06-UpperBounds-11
FORMULA_NAME CO4-PT-06-UpperBounds-12
FORMULA_NAME CO4-PT-06-UpperBounds-13
FORMULA_NAME CO4-PT-06-UpperBounds-14
FORMULA_NAME CO4-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748605531662

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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-30 11:45:32] [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]
[2025-05-30 11:45:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:45:33] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2025-05-30 11:45:33] [INFO ] Transformed 383 places.
[2025-05-30 11:45:33] [INFO ] Transformed 454 transitions.
[2025-05-30 11:45:33] [INFO ] Found NUPN structural information;
[2025-05-30 11:45:33] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-10 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]
// Phase 1: matrix 334 rows 283 cols
[2025-05-30 11:45:33] [INFO ] Computed 6 invariants in 17 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 (41 resets) in 27 ms. (357 steps per ms)
FORMULA CO4-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110000 steps (115 resets) in 163 ms. (670 steps per ms)
FORMULA CO4-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 11:45:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:33] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2025-05-30 11:45:33] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-05-30 11:45:33] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 32 ms.
[2025-05-30 11:45:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2025-05-30 11:45:33] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-05-30 11:45:34] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 23 ms.
[2025-05-30 11:45:34] [INFO ] Added : 48 causal constraints over 10 iterations in 291 ms. Result :sat
Minimization took 84 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:34] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 11:45:34] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:34] [INFO ] Deduced a trap composed of 195 places in 119 ms of which 30 ms to minimize.
[2025-05-30 11:45:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 11:45:34] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-05-30 11:45:34] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 20 ms.
[2025-05-30 11:45:35] [INFO ] Added : 49 causal constraints over 10 iterations in 253 ms. Result :sat
Minimization took 99 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:35] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 11:45:35] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2025-05-30 11:45:35] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 21 ms.
[2025-05-30 11:45:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2025-05-30 11:45:35] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-05-30 11:45:35] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 20 ms.
[2025-05-30 11:45:35] [INFO ] Added : 43 causal constraints over 9 iterations in 217 ms. Result :sat
Minimization took 76 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:36] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 11:45:36] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-05-30 11:45:36] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 25 ms.
[2025-05-30 11:45:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-05-30 11:45:36] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-05-30 11:45:36] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 19 ms.
[2025-05-30 11:45:36] [INFO ] Added : 42 causal constraints over 9 iterations in 201 ms. Result :sat
Minimization took 87 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:36] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 11:45:36] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-05-30 11:45:36] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 17 ms.
[2025-05-30 11:45:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 11:45:37] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:37] [INFO ] Deduced a trap composed of 195 places in 104 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:37] [INFO ] Deduced a trap composed of 197 places in 81 ms of which 5 ms to minimize.
[2025-05-30 11:45:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2025-05-30 11:45:37] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 23 ms.
[2025-05-30 11:45:37] [INFO ] Added : 49 causal constraints over 10 iterations in 242 ms. Result :sat
Minimization took 82 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:37] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 11:45:37] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-05-30 11:45:37] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 16 ms.
[2025-05-30 11:45:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-05-30 11:45:38] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-05-30 11:45:38] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 15 ms.
[2025-05-30 11:45:38] [INFO ] Added : 55 causal constraints over 11 iterations in 241 ms. Result :sat
Minimization took 82 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:38] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 11:45:38] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-05-30 11:45:38] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 15 ms.
[2025-05-30 11:45:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-05-30 11:45:38] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:38] [INFO ] Deduced a trap composed of 195 places in 112 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:38] [INFO ] Deduced a trap composed of 197 places in 83 ms of which 5 ms to minimize.
[2025-05-30 11:45:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
[2025-05-30 11:45:38] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 15 ms.
[2025-05-30 11:45:39] [INFO ] Added : 56 causal constraints over 12 iterations in 262 ms. Result :sat
Minimization took 111 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:39] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 11:45:39] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-05-30 11:45:39] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 16 ms.
[2025-05-30 11:45:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 11:45:39] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:39] [INFO ] Deduced a trap composed of 195 places in 99 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:39] [INFO ] Deduced a trap composed of 197 places in 78 ms of which 5 ms to minimize.
[2025-05-30 11:45:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2025-05-30 11:45:39] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 15 ms.
[2025-05-30 11:45:40] [INFO ] Added : 46 causal constraints over 10 iterations in 211 ms. Result :sat
Minimization took 81 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:40] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 11:45:40] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-05-30 11:45:40] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 19 ms.
[2025-05-30 11:45:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-05-30 11:45:40] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-05-30 11:45:40] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 18 ms.
[2025-05-30 11:45:40] [INFO ] Added : 46 causal constraints over 10 iterations in 236 ms. Result :sat
Minimization took 100 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:41] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 11:45:41] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-05-30 11:45:41] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 16 ms.
[2025-05-30 11:45:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 11:45:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-05-30 11:45:41] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-05-30 11:45:41] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 17 ms.
[2025-05-30 11:45:41] [INFO ] Added : 61 causal constraints over 13 iterations in 257 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-02 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 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 334/334 transitions.
Graph (trivial) has 286 edges and 283 vertex of which 2 / 283 are part of one of the 1 SCC in 3 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 426 edges and 282 vertex of which 252 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 144 rules applied. Total rules applied 146 place count 252 transition count 171
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 137 rules applied. Total rules applied 283 place count 124 transition count 162
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 292 place count 120 transition count 157
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 295 place count 119 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 298 place count 118 transition count 153
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 301 place count 117 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 302 place count 116 transition count 151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 302 place count 116 transition count 149
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 306 place count 114 transition count 149
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 324 place count 96 transition count 131
Iterating global reduction 7 with 18 rules applied. Total rules applied 342 place count 96 transition count 131
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 342 place count 96 transition count 125
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 354 place count 90 transition count 125
Graph (complete) has 163 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 355 place count 88 transition count 124
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 8 with 3 rules applied. Total rules applied 358 place count 88 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 359 place count 87 transition count 121
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 369 place count 77 transition count 111
Iterating global reduction 10 with 10 rules applied. Total rules applied 379 place count 77 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 380 place count 77 transition count 110
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 381 place count 76 transition count 109
Iterating global reduction 11 with 1 rules applied. Total rules applied 382 place count 76 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 383 place count 76 transition count 108
Performed 30 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 12 with 60 rules applied. Total rules applied 443 place count 46 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 446 place count 46 transition count 71
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 449 place count 43 transition count 68
Iterating global reduction 13 with 3 rules applied. Total rules applied 452 place count 43 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 453 place count 43 transition count 67
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 14 with 4 rules applied. Total rules applied 457 place count 41 transition count 65
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 459 place count 41 transition count 63
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 461 place count 39 transition count 61
Iterating global reduction 15 with 2 rules applied. Total rules applied 463 place count 39 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 464 place count 39 transition count 60
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 465 place count 38 transition count 59
Iterating global reduction 16 with 1 rules applied. Total rules applied 466 place count 38 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 467 place count 38 transition count 58
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 17 with 20 rules applied. Total rules applied 487 place count 28 transition count 59
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 17 with 17 rules applied. Total rules applied 504 place count 28 transition count 42
Discarding 8 places :
Symmetric choice reduction at 18 with 8 rule applications. Total rules 512 place count 20 transition count 34
Iterating global reduction 18 with 8 rules applied. Total rules applied 520 place count 20 transition count 34
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 527 place count 20 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 528 place count 20 transition count 26
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 529 place count 19 transition count 25
Iterating global reduction 19 with 1 rules applied. Total rules applied 530 place count 19 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 531 place count 19 transition count 24
Free-agglomeration rule applied 4 times.
Iterating global reduction 20 with 4 rules applied. Total rules applied 535 place count 19 transition count 20
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 34 edges and 15 vertex of which 14 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 20 with 6 rules applied. Total rules applied 541 place count 14 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 542 place count 14 transition count 18
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 544 place count 14 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 30 edges and 14 vertex of which 13 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 22 with 2 rules applied. Total rules applied 546 place count 13 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 547 place count 13 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 24 with 1 rules applied. Total rules applied 548 place count 12 transition count 15
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 t86.t400 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 550 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 7 edges and 8 vertex of which 3 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
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 25 with 3 rules applied. Total rules applied 553 place count 6 transition count 12
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 26 with 6 rules applied. Total rules applied 559 place count 5 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 27 with 1 rules applied. Total rules applied 560 place count 5 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 27 with 2 rules applied. Total rules applied 562 place count 5 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 564 place count 3 transition count 4
Applied a total of 564 rules in 78 ms. Remains 3 /283 variables (removed 280) and now considering 4/334 (removed 330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 3/283 places, 4/334 transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-05-30 11:45:41] [INFO ] Computed 1 invariants in 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 392 ms. (2544 steps per ms)
FORMULA CO4-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 202 ms. (4926 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-30 11:45:42] [INFO ] Flatten gal took : 98 ms
[2025-05-30 11:45:42] [INFO ] Flatten gal took : 1 ms
[2025-05-30 11:45:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17206616631225060195.gal : 3 ms
[2025-05-30 11:45:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2671694674507775021.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17206616631225060195.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2671694674507775021.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 9771 ms.

BK_STOP 1748605542644

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-06"
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-5832"
echo " Executing tool itstools"
echo " Input is CO4-PT-06, 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 r044-tall-174854028400421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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