fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r044-tall-174854028500461
Last Updated
June 24, 2025

About the Execution of ITS-Tools for CO4-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 12517.00 0.00 0.00 0 1 1 0 1 1 1 0 1 1 0 1 1 0 0 0 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K 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 132K 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-11-UpperBounds-00
FORMULA_NAME CO4-PT-11-UpperBounds-01
FORMULA_NAME CO4-PT-11-UpperBounds-02
FORMULA_NAME CO4-PT-11-UpperBounds-03
FORMULA_NAME CO4-PT-11-UpperBounds-04
FORMULA_NAME CO4-PT-11-UpperBounds-05
FORMULA_NAME CO4-PT-11-UpperBounds-06
FORMULA_NAME CO4-PT-11-UpperBounds-07
FORMULA_NAME CO4-PT-11-UpperBounds-08
FORMULA_NAME CO4-PT-11-UpperBounds-09
FORMULA_NAME CO4-PT-11-UpperBounds-10
FORMULA_NAME CO4-PT-11-UpperBounds-11
FORMULA_NAME CO4-PT-11-UpperBounds-12
FORMULA_NAME CO4-PT-11-UpperBounds-13
FORMULA_NAME CO4-PT-11-UpperBounds-14
FORMULA_NAME CO4-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748606975670

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-30 12:09:36] [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:09:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:09:37] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2025-05-30 12:09:37] [INFO ] Transformed 545 places.
[2025-05-30 12:09:37] [INFO ] Transformed 617 transitions.
[2025-05-30 12:09:37] [INFO ] Found NUPN structural information;
[2025-05-30 12:09:37] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 157 places in 8 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-11-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-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] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 440 rows 388 cols
[2025-05-30 12:09:37] [INFO ] Computed 6 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (18 resets) in 40 ms. (243 steps per ms)
FORMULA CO4-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70000 steps (78 resets) in 86 ms. (804 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-30 12:09:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:09:37] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2025-05-30 12:09:37] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2025-05-30 12:09:37] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 27 ms.
[2025-05-30 12:09: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 12:09:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2025-05-30 12:09:38] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:38] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 10 ms to minimize.
[2025-05-30 12:09:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2025-05-30 12:09:38] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 38 ms.
[2025-05-30 12:09:38] [INFO ] Added : 82 causal constraints over 17 iterations in 568 ms. Result :sat
Minimization took 133 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:09:39] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2025-05-30 12:09:39] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2025-05-30 12:09:39] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 24 ms.
[2025-05-30 12:09: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:09:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2025-05-30 12:09:39] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:39] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 16 ms to minimize.
[2025-05-30 12:09:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2025-05-30 12:09:39] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 24 ms.
[2025-05-30 12:09:40] [INFO ] Added : 76 causal constraints over 16 iterations in 491 ms. Result :sat
Minimization took 144 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:09:40] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2025-05-30 12:09:40] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2025-05-30 12:09:40] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 21 ms.
[2025-05-30 12:09: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 12:09:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2025-05-30 12:09:40] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:41] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 6 ms to minimize.
[2025-05-30 12:09:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2025-05-30 12:09:41] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 20 ms.
[2025-05-30 12:09:41] [INFO ] Added : 74 causal constraints over 15 iterations in 376 ms. Result :sat
Minimization took 123 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:09:41] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2025-05-30 12:09:41] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:41] [INFO ] Deduced a trap composed of 250 places in 155 ms of which 45 ms to minimize.
[2025-05-30 12:09: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:09:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2025-05-30 12:09:42] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:42] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:42] [INFO ] Deduced a trap composed of 257 places in 103 ms of which 5 ms to minimize.
[2025-05-30 12:09:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2025-05-30 12:09:42] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:43] [INFO ] Deduced a trap composed of 249 places in 156 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:43] [INFO ] Deduced a trap composed of 249 places in 149 ms of which 46 ms to minimize.
[2025-05-30 12:09:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 393 ms
[2025-05-30 12:09:43] [INFO ] Added : 106 causal constraints over 22 iterations in 1041 ms. Result :sat
Minimization took 182 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:09:43] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2025-05-30 12:09:43] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:44] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 7 ms to minimize.
[2025-05-30 12:09:44] [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:09:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2025-05-30 12:09:44] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:44] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 6 ms to minimize.
[2025-05-30 12:09:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2025-05-30 12:09:44] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 20 ms.
[2025-05-30 12:09:44] [INFO ] Added : 62 causal constraints over 13 iterations in 334 ms. Result :sat
Minimization took 170 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:09:44] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2025-05-30 12:09:45] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2025-05-30 12:09:45] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 19 ms.
[2025-05-30 12:09: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:09:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2025-05-30 12:09:45] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:45] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 11 ms to minimize.
[2025-05-30 12:09:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2025-05-30 12:09:45] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 20 ms.
[2025-05-30 12:09:45] [INFO ] Added : 78 causal constraints over 16 iterations in 475 ms. Result :sat
Minimization took 154 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:09:46] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2025-05-30 12:09:46] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-05-30 12:09:46] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 22 ms.
[2025-05-30 12:09:46] [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:09:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2025-05-30 12:09:46] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2025-05-30 12:09:46] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 17 ms.
[2025-05-30 12:09:46] [INFO ] Added : 51 causal constraints over 11 iterations in 318 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-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 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 440/440 transitions.
Graph (trivial) has 391 edges and 388 vertex of which 3 / 388 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 533 edges and 386 vertex of which 352 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 244 rules applied. Total rules applied 246 place count 352 transition count 174
Reduce places removed 225 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 234 rules applied. Total rules applied 480 place count 127 transition count 165
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 490 place count 123 transition count 159
Reduce places removed 2 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 4 rules applied. Total rules applied 494 place count 121 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 4 with 3 rules applied. Total rules applied 497 place count 120 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 501 place count 119 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 503 place count 117 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 503 place count 117 transition count 151
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 505 place count 116 transition count 151
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 522 place count 99 transition count 134
Iterating global reduction 7 with 17 rules applied. Total rules applied 539 place count 99 transition count 134
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 539 place count 99 transition count 129
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 549 place count 94 transition count 129
Graph (complete) has 170 edges and 94 vertex of which 92 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 550 place count 92 transition count 128
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 553 place count 92 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 554 place count 91 transition count 125
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 564 place count 81 transition count 115
Iterating global reduction 10 with 10 rules applied. Total rules applied 574 place count 81 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 575 place count 81 transition count 114
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 576 place count 80 transition count 113
Iterating global reduction 11 with 1 rules applied. Total rules applied 577 place count 80 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 578 place count 80 transition count 112
Performed 32 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 12 with 64 rules applied. Total rules applied 642 place count 48 transition count 76
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 645 place count 48 transition count 73
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 648 place count 45 transition count 70
Iterating global reduction 13 with 3 rules applied. Total rules applied 651 place count 45 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 652 place count 45 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 654 place count 44 transition count 68
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 655 place count 44 transition count 67
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 656 place count 43 transition count 66
Iterating global reduction 15 with 1 rules applied. Total rules applied 657 place count 43 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 658 place count 43 transition count 65
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 16 with 22 rules applied. Total rules applied 680 place count 32 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 16 with 18 rules applied. Total rules applied 698 place count 32 transition count 49
Discarding 9 places :
Symmetric choice reduction at 17 with 9 rule applications. Total rules 707 place count 23 transition count 40
Iterating global reduction 17 with 9 rules applied. Total rules applied 716 place count 23 transition count 40
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 724 place count 23 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 726 place count 23 transition count 30
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 727 place count 22 transition count 29
Iterating global reduction 18 with 1 rules applied. Total rules applied 728 place count 22 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 729 place count 22 transition count 28
Free-agglomeration rule applied 4 times.
Iterating global reduction 19 with 4 rules applied. Total rules applied 733 place count 22 transition count 24
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 5 rules applied. Total rules applied 738 place count 18 transition count 23
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 740 place count 18 transition count 23
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 41 edges and 18 vertex of which 17 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 2 rules applied. Total rules applied 742 place count 17 transition count 22
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 743 place count 17 transition count 21
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 744 place count 17 transition count 21
Graph (complete) has 38 edges and 17 vertex of which 16 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 1 rules applied. Total rules applied 745 place count 16 transition count 21
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 746 place count 16 transition count 20
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 747 place count 16 transition count 20
Graph (complete) has 35 edges and 16 vertex of which 15 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 24 with 1 rules applied. Total rules applied 748 place count 15 transition count 20
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 749 place count 15 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 26 with 1 rules applied. Total rules applied 750 place count 14 transition count 18
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 t131.t132.t559 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 26 with 2 rules applied. Total rules applied 752 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 10 edges and 10 vertex of which 4 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
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 27 with 4 rules applied. Total rules applied 756 place count 7 transition count 14
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 28 with 9 rules applied. Total rules applied 765 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 29 with 1 rules applied. Total rules applied 766 place count 5 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 29 with 2 rules applied. Total rules applied 768 place count 5 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 770 place count 3 transition count 4
Applied a total of 770 rules in 76 ms. Remains 3 /388 variables (removed 385) and now considering 4/440 (removed 436) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 3/388 places, 4/440 transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-05-30 12:09:47] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 319 ms. (3125 steps per ms)
FORMULA CO4-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 306 ms. (3257 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:09:48] [INFO ] Flatten gal took : 103 ms
[2025-05-30 12:09:48] [INFO ] Flatten gal took : 2 ms
[2025-05-30 12:09:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7613046174387514987.gal : 3 ms
[2025-05-30 12:09:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17032184375035319550.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/ReachabilityCardinality7613046174387514987.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17032184375035319550.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.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 11290 ms.

BK_STOP 1748606988187

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

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