Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 26K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K 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 174K 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-14-UpperBounds-00
FORMULA_NAME CO4-PT-14-UpperBounds-01
FORMULA_NAME CO4-PT-14-UpperBounds-02
FORMULA_NAME CO4-PT-14-UpperBounds-03
FORMULA_NAME CO4-PT-14-UpperBounds-04
FORMULA_NAME CO4-PT-14-UpperBounds-05
FORMULA_NAME CO4-PT-14-UpperBounds-06
FORMULA_NAME CO4-PT-14-UpperBounds-07
FORMULA_NAME CO4-PT-14-UpperBounds-08
FORMULA_NAME CO4-PT-14-UpperBounds-09
FORMULA_NAME CO4-PT-14-UpperBounds-10
FORMULA_NAME CO4-PT-14-UpperBounds-11
FORMULA_NAME CO4-PT-14-UpperBounds-12
FORMULA_NAME CO4-PT-14-UpperBounds-13
FORMULA_NAME CO4-PT-14-UpperBounds-14
FORMULA_NAME CO4-PT-14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748607464693

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-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-30 12:17:45] [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:17:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:17:46] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2025-05-30 12:17:46] [INFO ] Transformed 680 places.
[2025-05-30 12:17:46] [INFO ] Transformed 812 transitions.
[2025-05-30 12:17:46] [INFO ] Found NUPN structural information;
[2025-05-30 12:17:46] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 100 places in 8 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-14-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 692 rows 580 cols
[2025-05-30 12:17:46] [INFO ] Computed 8 invariants in 25 ms
Current structural bounds on expressions (after invariants) : 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]
RANDOM walk for 10000 steps (20 resets) in 46 ms. (212 steps per ms)
FORMULA CO4-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90002 steps (232 resets) in 159 ms. (562 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 12:17:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:17:46] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2025-05-30 12:17:46] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2025-05-30 12:17:47] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 49 ms.
[2025-05-30 12:17: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:17:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2025-05-30 12:17:47] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2025-05-30 12:17:47] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 36 ms.
[2025-05-30 12:17:48] [INFO ] Added : 122 causal constraints over 25 iterations in 1122 ms. Result :sat
Minimization took 432 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:17:49] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-05-30 12:17:49] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:17:49] [INFO ] Deduced a trap composed of 93 places in 180 ms of which 16 ms to minimize.
[2025-05-30 12:17: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:17:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2025-05-30 12:17:49] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:17:50] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 5 ms to minimize.
[2025-05-30 12:17:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2025-05-30 12:17:50] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 30 ms.
[2025-05-30 12:17:50] [INFO ] Added : 104 causal constraints over 21 iterations in 860 ms. Result :sat
Minimization took 471 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:17:51] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2025-05-30 12:17:51] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2025-05-30 12:17:51] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 31 ms.
[2025-05-30 12:17: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:17:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2025-05-30 12:17:52] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2025-05-30 12:17:52] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 38 ms.
[2025-05-30 12:17:53] [INFO ] Added : 107 causal constraints over 22 iterations in 974 ms. Result :sat
Minimization took 491 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:17:53] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-05-30 12:17:54] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2025-05-30 12:17:54] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 37 ms.
[2025-05-30 12:17:54] [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:17:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2025-05-30 12:17:54] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:17:54] [INFO ] Deduced a trap composed of 277 places in 205 ms of which 6 ms to minimize.
[2025-05-30 12:17:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2025-05-30 12:17:54] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 35 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:17:55] [INFO ] Deduced a trap composed of 274 places in 201 ms of which 57 ms to minimize.
[2025-05-30 12:17:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2025-05-30 12:17:55] [INFO ] Added : 100 causal constraints over 20 iterations in 1136 ms. Result :sat
Minimization took 459 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:17:56] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 12:17:56] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2025-05-30 12:17:56] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 36 ms.
[2025-05-30 12:17:56] [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:17:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2025-05-30 12:17:57] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2025-05-30 12:17:57] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 36 ms.
[2025-05-30 12:17:58] [INFO ] Added : 139 causal constraints over 28 iterations in 1133 ms. Result :sat
Minimization took 446 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:17:58] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 12:17:59] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2025-05-30 12:17:59] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 39 ms.
[2025-05-30 12:17:59] [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:17:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 12:17:59] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2025-05-30 12:17:59] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 38 ms.
[2025-05-30 12:18:00] [INFO ] Added : 66 causal constraints over 14 iterations in 612 ms. Result :sat
Minimization took 455 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:18:00] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-05-30 12:18:01] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2025-05-30 12:18:01] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 36 ms.
[2025-05-30 12:18:01] [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:18:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 21 ms returned sat
[2025-05-30 12:18:01] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2025-05-30 12:18:01] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 37 ms.
[2025-05-30 12:18:02] [INFO ] Added : 131 causal constraints over 27 iterations in 1145 ms. Result :sat
Minimization took 444 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:18:03] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-05-30 12:18:03] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2025-05-30 12:18:03] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 36 ms.
[2025-05-30 12:18:03] [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:18:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 12:18:03] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2025-05-30 12:18:03] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 50 ms.
[2025-05-30 12:18:04] [INFO ] Added : 112 causal constraints over 23 iterations in 956 ms. Result :sat
Minimization took 468 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:18:05] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-05-30 12:18:05] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2025-05-30 12:18:05] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 33 ms.
[2025-05-30 12:18:05] [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:18:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2025-05-30 12:18:06] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-05-30 12:18:06] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 30 ms.
[2025-05-30 12:18:06] [INFO ] Added : 65 causal constraints over 13 iterations in 576 ms. Result :sat
Minimization took 458 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-01 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 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 692/692 transitions.
Graph (trivial) has 595 edges and 580 vertex of which 2 / 580 are part of one of the 1 SCC in 4 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 877 edges and 579 vertex of which 544 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 299 rules applied. Total rules applied 301 place count 544 transition count 372
Reduce places removed 279 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 288 rules applied. Total rules applied 589 place count 265 transition count 363
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 598 place count 261 transition count 358
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 602 place count 260 transition count 355
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 606 place count 257 transition count 354
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 606 place count 257 transition count 353
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 608 place count 256 transition count 353
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 642 place count 222 transition count 319
Iterating global reduction 5 with 34 rules applied. Total rules applied 676 place count 222 transition count 319
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 676 place count 222 transition count 308
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 698 place count 211 transition count 308
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 719 place count 190 transition count 287
Iterating global reduction 5 with 21 rules applied. Total rules applied 740 place count 190 transition count 287
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 743 place count 190 transition count 284
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 745 place count 188 transition count 281
Iterating global reduction 6 with 2 rules applied. Total rules applied 747 place count 188 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 749 place count 188 transition count 279
Performed 81 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 7 with 162 rules applied. Total rules applied 911 place count 107 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 915 place count 107 transition count 184
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 64 rules applied. Total rules applied 979 place count 75 transition count 188
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 999 place count 75 transition count 168
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 1027 place count 47 transition count 112
Iterating global reduction 9 with 28 rules applied. Total rules applied 1055 place count 47 transition count 112
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 1074 place count 47 transition count 93
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1081 place count 40 transition count 73
Iterating global reduction 10 with 7 rules applied. Total rules applied 1088 place count 40 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1092 place count 40 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1094 place count 39 transition count 84
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1097 place count 39 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 12 with 9 rules applied. Total rules applied 1106 place count 39 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1108 place count 38 transition count 82
Free-agglomeration rule applied 5 times.
Iterating global reduction 12 with 5 rules applied. Total rules applied 1113 place count 38 transition count 77
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 1120 place count 33 transition count 75
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1121 place count 33 transition count 75
Graph (complete) has 114 edges and 33 vertex of which 32 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 13 with 1 rules applied. Total rules applied 1122 place count 32 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1123 place count 32 transition count 74
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1124 place count 32 transition count 74
Graph (complete) has 111 edges and 32 vertex of which 31 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 15 with 1 rules applied. Total rules applied 1125 place count 31 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1126 place count 31 transition count 73
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1127 place count 31 transition count 73
Graph (complete) has 108 edges and 31 vertex of which 30 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 17 with 1 rules applied. Total rules applied 1128 place count 30 transition count 73
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1129 place count 30 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1130 place count 29 transition count 71
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 t87.t679.t15.t16 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 19 edges and 25 vertex of which 3 / 25 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 19 with 3 rules applied. Total rules applied 1133 place count 23 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 20 with 5 rules applied. Total rules applied 1138 place count 23 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 21 with 24 rules applied. Total rules applied 1162 place count 23 transition count 40
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 56 edges and 22 vertex of which 16 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Iterating post reduction 21 with 3 rules applied. Total rules applied 1165 place count 16 transition count 34
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 22 with 5 rules applied. Total rules applied 1170 place count 16 transition count 29
Discarding 3 places :
Symmetric choice reduction at 23 with 3 rule applications. Total rules 1173 place count 13 transition count 23
Iterating global reduction 23 with 3 rules applied. Total rules applied 1176 place count 13 transition count 23
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 1179 place count 13 transition count 20
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 1180 place count 12 transition count 18
Iterating global reduction 24 with 1 rules applied. Total rules applied 1181 place count 12 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 1182 place count 12 transition count 17
Free-agglomeration rule applied 3 times.
Iterating global reduction 25 with 3 rules applied. Total rules applied 1185 place count 12 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 25 with 3 rules applied. Total rules applied 1188 place count 9 transition count 14
Applied a total of 1188 rules in 194 ms. Remains 9 /580 variables (removed 571) and now considering 14/692 (removed 678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 9/580 places, 14/692 transitions.
// Phase 1: matrix 14 rows 9 cols
[2025-05-30 12:18:07] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA CO4-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 432 ms. (2309 steps per ms)
FORMULA CO4-PT-14-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 331 ms. (3012 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:18:08] [INFO ] Flatten gal took : 18 ms
[2025-05-30 12:18:08] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:18:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9713478389482456811.gal : 4 ms
[2025-05-30 12:18:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2918447262104035620.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/ReachabilityCardinality9713478389482456811.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2918447262104035620.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 22724 ms.

BK_STOP 1748607488634

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

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