Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028500477.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-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028500477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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 191K 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-13-UpperBounds-00
FORMULA_NAME CO4-PT-13-UpperBounds-01
FORMULA_NAME CO4-PT-13-UpperBounds-02
FORMULA_NAME CO4-PT-13-UpperBounds-03
FORMULA_NAME CO4-PT-13-UpperBounds-04
FORMULA_NAME CO4-PT-13-UpperBounds-05
FORMULA_NAME CO4-PT-13-UpperBounds-06
FORMULA_NAME CO4-PT-13-UpperBounds-07
FORMULA_NAME CO4-PT-13-UpperBounds-08
FORMULA_NAME CO4-PT-13-UpperBounds-09
FORMULA_NAME CO4-PT-13-UpperBounds-10
FORMULA_NAME CO4-PT-13-UpperBounds-11
FORMULA_NAME CO4-PT-13-UpperBounds-12
FORMULA_NAME CO4-PT-13-UpperBounds-13
FORMULA_NAME CO4-PT-13-UpperBounds-14
FORMULA_NAME CO4-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748607217222

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-30 12:13:38] [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 12:13:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:13:38] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2025-05-30 12:13:38] [INFO ] Transformed 649 places.
[2025-05-30 12:13:38] [INFO ] Transformed 816 transitions.
[2025-05-30 12:13:38] [INFO ] Found NUPN structural information;
[2025-05-30 12:13:38] [INFO ] Parsed PT model containing 649 places and 816 transitions and 2232 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 172 places in 10 ms
Reduce places removed 172 places and 227 transitions.
FORMULA CO4-PT-13-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 589 rows 477 cols
[2025-05-30 12:13:38] [INFO ] Computed 9 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (30 resets) in 37 ms. (263 steps per ms)
FORMULA CO4-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80000 steps (211 resets) in 113 ms. (701 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]
[2025-05-30 12:13:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:13:39] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2025-05-30 12:13:39] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 12:13:39] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:39] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 13 ms to minimize.
[2025-05-30 12:13: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 12:13:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2025-05-30 12:13:39] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:13:39] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:40] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 8 ms to minimize.
[2025-05-30 12:13:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2025-05-30 12:13:40] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 37 ms.
[2025-05-30 12:13:40] [INFO ] Added : 76 causal constraints over 16 iterations in 627 ms. Result :sat
Minimization took 301 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:13:41] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:13:41] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:13:41] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:41] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 20 ms to minimize.
[2025-05-30 12:13: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 12:13:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2025-05-30 12:13:41] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:13:41] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:41] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 18 ms to minimize.
[2025-05-30 12:13:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2025-05-30 12:13:41] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 28 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:42] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 12 ms to minimize.
[2025-05-30 12:13:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2025-05-30 12:13:42] [INFO ] Added : 86 causal constraints over 18 iterations in 883 ms. Result :sat
Minimization took 205 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:13:43] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-05-30 12:13:43] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:13:43] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2025-05-30 12:13:43] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 35 ms.
[2025-05-30 12:13:43] [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 12:13:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2025-05-30 12:13:43] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 12:13:43] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2025-05-30 12:13:43] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 32 ms.
[2025-05-30 12:13:44] [INFO ] Added : 112 causal constraints over 23 iterations in 847 ms. Result :sat
Minimization took 356 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:13:45] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:13:45] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:13:45] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:45] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 6 ms to minimize.
[2025-05-30 12:13:45] [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 12:13:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:13:45] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 12:13:45] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:45] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 6 ms to minimize.
[2025-05-30 12:13:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2025-05-30 12:13:45] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 39 ms.
[2025-05-30 12:13:46] [INFO ] Added : 118 causal constraints over 24 iterations in 872 ms. Result :sat
Minimization took 317 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:13:47] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-05-30 12:13:47] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 12:13:47] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-05-30 12:13:47] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 29 ms.
[2025-05-30 12:13:47] [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 12:13:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2025-05-30 12:13:47] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 5 ms returned sat
[2025-05-30 12:13:47] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2025-05-30 12:13:47] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 29 ms.
[2025-05-30 12:13:48] [INFO ] Added : 108 causal constraints over 22 iterations in 747 ms. Result :sat
Minimization took 403 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:13:48] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:13:48] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:13:48] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2025-05-30 12:13:48] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 29 ms.
[2025-05-30 12:13:49] [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 12:13:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-05-30 12:13:49] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:13:49] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2025-05-30 12:13:49] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 31 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:50] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 14 ms to minimize.
[2025-05-30 12:13:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:50] [INFO ] Deduced a trap composed of 306 places in 212 ms of which 72 ms to minimize.
[2025-05-30 12:13:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2025-05-30 12:13:50] [INFO ] Added : 124 causal constraints over 27 iterations in 1599 ms. Result :sat
Minimization took 443 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:13:51] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:13:51] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:13:51] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2025-05-30 12:13:51] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 28 ms.
[2025-05-30 12:13:51] [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 12:13:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:13:51] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 12:13:51] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2025-05-30 12:13:52] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 24 ms.
[2025-05-30 12:13:52] [INFO ] Added : 98 causal constraints over 20 iterations in 700 ms. Result :sat
Minimization took 501 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:13:53] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-05-30 12:13:53] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:13:53] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:53] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 6 ms to minimize.
[2025-05-30 12:13:53] [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 12:13:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:13:53] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:13:53] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:53] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 6 ms to minimize.
[2025-05-30 12:13:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2025-05-30 12:13:54] [INFO ] Computed and/alt/rep : 484/755/484 causal constraints (skipped 104 transitions) in 25 ms.
[2025-05-30 12:13:54] [INFO ] Added : 139 causal constraints over 28 iterations in 943 ms. Result :sat
Minimization took 273 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-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 589/589 transitions.
Graph (trivial) has 476 edges and 477 vertex of which 3 / 477 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 874 edges and 475 vertex of which 434 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Discarding 41 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 294 rules applied. Total rules applied 296 place count 434 transition count 272
Reduce places removed 269 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 287 rules applied. Total rules applied 583 place count 165 transition count 254
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 20 rules applied. Total rules applied 603 place count 157 transition count 242
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 611 place count 153 transition count 238
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 617 place count 151 transition count 234
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 623 place count 149 transition count 230
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 626 place count 146 transition count 230
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 626 place count 146 transition count 229
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 628 place count 145 transition count 229
Discarding 25 places :
Symmetric choice reduction at 7 with 25 rule applications. Total rules 653 place count 120 transition count 204
Iterating global reduction 7 with 25 rules applied. Total rules applied 678 place count 120 transition count 204
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 678 place count 120 transition count 199
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 688 place count 115 transition count 199
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 704 place count 99 transition count 159
Iterating global reduction 7 with 16 rules applied. Total rules applied 720 place count 99 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 722 place count 99 transition count 157
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 724 place count 97 transition count 155
Iterating global reduction 8 with 2 rules applied. Total rules applied 726 place count 97 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 728 place count 97 transition count 153
Performed 34 Post agglomeration using F-continuation condition with reduction of 4 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 796 place count 63 transition count 115
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 797 place count 63 transition count 114
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 827 place count 48 transition count 129
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 848 place count 48 transition count 108
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 857 place count 39 transition count 81
Iterating global reduction 11 with 9 rules applied. Total rules applied 866 place count 39 transition count 81
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 873 place count 39 transition count 74
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 875 place count 37 transition count 64
Iterating global reduction 12 with 2 rules applied. Total rules applied 877 place count 37 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 879 place count 37 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 881 place count 37 transition count 60
Free-agglomeration rule applied 8 times.
Iterating global reduction 13 with 8 rules applied. Total rules applied 889 place count 37 transition count 52
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 899 place count 29 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 900 place count 28 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 902 place count 26 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 906 place count 26 transition count 45
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 907 place count 25 transition count 43
Iterating global reduction 15 with 1 rules applied. Total rules applied 908 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 909 place count 25 transition count 42
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 913 place count 25 transition count 38
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 918 place count 21 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 920 place count 21 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 921 place count 21 transition count 34
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 924 place count 20 transition count 32
Applied a total of 924 rules in 88 ms. Remains 20 /477 variables (removed 457) and now considering 32/589 (removed 557) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 20/477 places, 32/589 transitions.
[2025-05-30 12:13:55] [INFO ] Flow matrix only has 30 transitions (discarded 2 similar events)
// Phase 1: matrix 30 rows 20 cols
[2025-05-30 12:13:55] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA CO4-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 871 ms. (1146 steps per ms)
FORMULA CO4-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 296 ms. (3367 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 12:13:56] [INFO ] Flatten gal took : 24 ms
[2025-05-30 12:13:56] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:13:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11265133468078656135.gal : 4 ms
[2025-05-30 12:13:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8183807150437142556.prop : 0 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/ReachabilityCardinality11265133468078656135.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8183807150437142556.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
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 18550 ms.

BK_STOP 1748607237006

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

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