About the Execution of 2025-gold for DNAwalker-PT-12ringLLLarge
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 842.680 | 339369.00 | 382852.00 | 1026.00 | 2 2 2 2 2 2 1 2 2 2 2 1 2 2 2 2 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r111-tall-177955700900103.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is DNAwalker-PT-12ringLLLarge, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-tall-177955700900103
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 8.2K Mar 6 15:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 6 15:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 6 15:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 6 15:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 09:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 15 09:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 09:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 15:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Mar 6 15:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 15:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Mar 6 15:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 14 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 135K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-00
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-01
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-02
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-03
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-04
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-05
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-06
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-07
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-08
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-09
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-10
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-11
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-12
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-13
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-14
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779628394193
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-12ringLLLarge
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-24 13:13:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 13:13:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:13:15] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2026-05-24 13:13:15] [INFO ] Transformed 33 places.
[2026-05-24 13:13:15] [INFO ] Transformed 312 transitions.
[2026-05-24 13:13:15] [INFO ] Parsed PT model containing 33 places and 312 transitions and 916 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-24 13:13:15] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
// Phase 1: matrix 311 rows 33 cols
[2026-05-24 13:13:15] [INFO ] Computed 0 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (777 resets) in 59 ms. (166 steps per ms)
BEST_FIRST walk for 160015 steps (963 resets) in 198 ms. (804 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-24 13:13:16] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-24 13:13:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:16] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2026-05-24 13:13:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:16] [INFO ] [Nat]Absence check using state equation in 563 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:17] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-24 13:13:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:17] [INFO ] [Nat]Absence check using state equation in 575 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:17] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-24 13:13:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:18] [INFO ] [Nat]Absence check using state equation in 545 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:18] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-24 13:13:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:18] [INFO ] [Nat]Absence check using state equation in 551 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:19] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-24 13:13:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:19] [INFO ] [Nat]Absence check using state equation in 542 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:19] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-24 13:13:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:20] [INFO ] [Nat]Absence check using state equation in 540 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:20] [INFO ] [Real]Absence check using state equation in 37 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:20] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2026-05-24 13:13:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:20] [INFO ] [Nat]Absence check using state equation in 534 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:21] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2026-05-24 13:13:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:21] [INFO ] [Nat]Absence check using state equation in 537 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:21] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2026-05-24 13:13:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:22] [INFO ] [Nat]Absence check using state equation in 535 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:22] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-24 13:13:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:22] [INFO ] [Nat]Absence check using state equation in 541 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:22] [INFO ] [Real]Absence check using state equation in 37 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:22] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2026-05-24 13:13:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:23] [INFO ] [Nat]Absence check using state equation in 538 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:23] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2026-05-24 13:13:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:24] [INFO ] [Nat]Absence check using state equation in 538 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:24] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2026-05-24 13:13:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:24] [INFO ] [Nat]Absence check using state equation in 542 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:24] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2026-05-24 13:13:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 13:13:25] [INFO ] [Nat]Absence check using state equation in 543 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf, +inf]
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 14 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 33 transition count 304
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 29 transition count 300
Applied a total of 12 rules in 37 ms. Remains 29 /33 variables (removed 4) and now considering 300/312 (removed 12) transitions.
Running 276 sub problems to find dead transitions.
// Phase 1: matrix 300 rows 29 cols
[2026-05-24 13:13:25] [INFO ] Computed 0 invariants in 2 ms
[2026-05-24 13:13:25] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 300/327 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 30/57 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 2/329 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/329 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 59 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10435 ms.
Refiners :[State Equation: 29/29 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 300/327 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 30/57 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 276/333 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 2/329 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 335 constraints, problems are : Problem set: 0 solved, 276 unsolved in 20037 ms.
Refiners :[State Equation: 29/29 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30660ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 30670ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30723 ms. Remains : 29/33 places, 300/312 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
[2026-05-24 13:13:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (102176 resets) in 3022 ms. (330 steps per ms)
BEST_FIRST walk for 14000012 steps (146269 resets) in 9087 ms. (1540 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-24 13:14:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:08] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2026-05-24 13:14:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:13] [INFO ] [Nat]Absence check using state equation in 4537 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:13] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2026-05-24 13:14:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:17] [INFO ] [Nat]Absence check using state equation in 4553 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:17] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2026-05-24 13:14:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:22] [INFO ] [Nat]Absence check using state equation in 4544 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:22] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2026-05-24 13:14:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:26] [INFO ] [Nat]Absence check using state equation in 4536 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:26] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-24 13:14:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:31] [INFO ] [Nat]Absence check using state equation in 4535 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:31] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-24 13:14:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:36] [INFO ] [Nat]Absence check using state equation in 4541 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:36] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2026-05-24 13:14:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:40] [INFO ] [Nat]Absence check using state equation in 4538 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:40] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-24 13:14:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:45] [INFO ] [Nat]Absence check using state equation in 4539 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:45] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-24 13:14:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:50] [INFO ] [Nat]Absence check using state equation in 4539 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:50] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-24 13:14:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:54] [INFO ] [Nat]Absence check using state equation in 4536 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:54] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2026-05-24 13:14:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:59] [INFO ] [Nat]Absence check using state equation in 4536 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:14:59] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-24 13:14:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:15:03] [INFO ] [Nat]Absence check using state equation in 4539 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:15:04] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-24 13:15:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:15:08] [INFO ] [Nat]Absence check using state equation in 4534 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:15:08] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2026-05-24 13:15:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:15:13] [INFO ] [Nat]Absence check using state equation in 4536 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 14 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 300/300 transitions.
Applied a total of 0 rules in 15 ms. Remains 29 /29 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 29/29 places, 300/300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 300/300 transitions.
Applied a total of 0 rules in 7 ms. Remains 29 /29 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2026-05-24 13:15:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 13:15:13] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-24 13:15:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 13:15:13] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-24 13:15:13] [INFO ] Implicit Places using invariants and state equation in 263 ms returned [23]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Implicit Place search using SMT with State Equation took 309 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 28/29 places, 293/300 transitions.
Applied a total of 0 rules in 6 ms. Remains 28 /28 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 324 ms. Remains : 28/29 places, 293/300 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 293 rows 28 cols
[2026-05-24 13:15:13] [INFO ] Computed 0 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (87578 resets) in 3084 ms. (324 steps per ms)
BEST_FIRST walk for 14000014 steps (141476 resets) in 9037 ms. (1549 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-24 13:15:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:15:25] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2026-05-24 13:15:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:15:34] [INFO ] [Nat]Absence check using state equation in 9039 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:15:34] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2026-05-24 13:15:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:15:43] [INFO ] [Nat]Absence check using state equation in 9037 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:15:44] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2026-05-24 13:15:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:15:53] [INFO ] [Nat]Absence check using state equation in 9037 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:15:53] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2026-05-24 13:15:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:16:02] [INFO ] [Nat]Absence check using state equation in 9036 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:16:02] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2026-05-24 13:16:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:16:11] [INFO ] [Nat]Absence check using state equation in 9036 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:16:11] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2026-05-24 13:16:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:16:20] [INFO ] [Nat]Absence check using state equation in 9035 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:16:20] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2026-05-24 13:16:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:16:29] [INFO ] [Nat]Absence check using state equation in 9040 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:16:29] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2026-05-24 13:16:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:16:38] [INFO ] [Nat]Absence check using state equation in 9036 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:16:38] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-24 13:16:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:16:47] [INFO ] [Nat]Absence check using state equation in 9040 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:16:47] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2026-05-24 13:16:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:16:57] [INFO ] [Nat]Absence check using state equation in 9037 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:16:57] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-24 13:16:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:17:06] [INFO ] [Nat]Absence check using state equation in 9037 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:17:06] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-24 13:17:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:17:15] [INFO ] [Nat]Absence check using state equation in 9038 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:17:15] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-24 13:17:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:17:24] [INFO ] [Nat]Absence check using state equation in 9038 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:17:24] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2026-05-24 13:17:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 13:17:33] [INFO ] [Nat]Absence check using state equation in 9036 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 14 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 293/293 transitions.
Applied a total of 0 rules in 16 ms. Remains 28 /28 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 28/28 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 28 /28 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2026-05-24 13:17:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 13:17:33] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 13:17:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 13:17:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-24 13:17:34] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 13:17:34] [INFO ] Redundant transitions in 15 ms returned []
Running 270 sub problems to find dead transitions.
[2026-05-24 13:17:34] [INFO ] Invariant cache hit.
[2026-05-24 13:17:34] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 293/319 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 30/56 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 2/321 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/321 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 58 constraints, problems are : Problem set: 0 solved, 270 unsolved in 9923 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 293/319 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 30/56 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 270/326 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/321 variables, and 328 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30016 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40061ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 40062ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40597 ms. Remains : 28/28 places, 293/293 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40000 steps (3540 resets) in 876 ms. (45 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (290 resets) in 157 ms. (253 steps per ms) remains 14/14 properties
[2026-05-24 13:18:14] [INFO ] Flatten gal took : 60 ms
[2026-05-24 13:18:14] [INFO ] Flatten gal took : 35 ms
BEST_FIRST walk for 40003 steps (323 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
[2026-05-24 13:18:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3795561318334403702.gal : 13 ms
[2026-05-24 13:18:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5945694745141700347.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/ReachabilityCardinality3795561318334403702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5945694745141700347.prop' '--nowitness' '--gen-order' 'FOLLOW'
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 ...328
BEST_FIRST walk for 40003 steps (284 resets) in 113 ms. (350 steps per ms) remains 14/14 properties
Loading property file /tmp/ReachabilityCardinality5945694745141700347.prop.
BEST_FIRST walk for 40004 steps (322 resets) in 110 ms. (360 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :16 after 54
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :54 after 217
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :217 after 2558
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :2558 after 4005
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :4005 after 4440
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :4440 after 16277
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :16277 after 41287
BEST_FIRST walk for 40004 steps (341 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (334 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :41287 after 106166
BEST_FIRST walk for 40000 steps (1376 resets) in 81 ms. (487 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :106166 after 485240
BEST_FIRST walk for 40003 steps (352 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (316 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (344 resets) in 86 ms. (459 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (354 resets) in 74 ms. (533 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (304 resets) in 73 ms. (540 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (320 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (344 resets) in 76 ms. (519 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :485240 after 1.7387e+06
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :1.7387e+06 after 3.17186e+06
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :3.17186e+06 after 7.36379e+06
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :7.36379e+06 after 3.22368e+07
Interrupted probabilistic random walk after 493952 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 14
Probabilistic random walk after 493952 steps, saw 108205 distinct states, run finished after 3005 ms. (steps per millisecond=164 ) properties seen :0
[2026-05-24 13:18:17] [INFO ] Invariant cache hit.
[2026-05-24 13:18:17] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 233/247 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 74/321 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/321 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 58 constraints, problems are : Problem set: 0 solved, 14 unsolved in 438 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 233/247 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,14 properties remain. new max is 65536
SDD size :3.22368e+07 after 8.62898e+07
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/321 variables, and 59 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5009 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5453ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 28 /28 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running 270 sub problems to find dead transitions.
[2026-05-24 13:18:23] [INFO ] Invariant cache hit.
[2026-05-24 13:18:23] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 293/319 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 30/56 constraints. Problems are: Problem set: 0 solved, 270 unsolved
SDD proceeding with computation,14 properties remain. new max is 131072
SDD size :2.5823e+08 after 3.31322e+08
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 2/321 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.05865e+08,17.8575,381464,2,23035,22,1.12698e+06,20,0,462,2.09826e+06,0
Total reachable state count : 405864651
Verifying 14 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,17.8626,381464,1,0,22,1.12698e+06,20,0,463,2.09826e+06,0
Invariant property MIN1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,17.8638,381464,1,0,22,1.12698e+06,20,0,463,2.09826e+06,0
Invariant property MIN2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,0,17.8681,381464,1,0,22,1.12698e+06,20,0,463,2.09826e+06,0
Invariant property MIN3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,0,17.8702,381464,1,0,22,1.12698e+06,20,0,463,2.09826e+06,0
Invariant property MIN4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,0,17.8706,381464,1,0,22,1.12698e+06,20,0,463,2.09826e+06,0
Invariant property MIN5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,0,17.8732,381464,1,0,22,1.12698e+06,20,0,463,2.09826e+06,0
Invariant property MIN6 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN6,0,17.8804,381464,1,0,22,1.12698e+06,20,0,463,2.09826e+06,0
Invariant property MIN7 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN7,0,17.8836,381464,1,0,22,1.12698e+06,20,0,463,2.09826e+06,0
Invariant property MIN8 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN8,0,17.8838,381464,1,0,22,1.12698e+06,20,0,463,2.09826e+06,0
Invariant property MIN9 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN9,0,17.8839,381464,1,0,22,1.12698e+06,20,0,463,2.09826e+06,0
Invariant property MIN10 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN10,0,17.8951,381464,1,0,22,1.12698e+06,20,0,463,2.09826e+06,0
Invariant property MIN11 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN11,0,17.8967,381464,1,0,22,1.12698e+06,20,0,463,2.09826e+06,0
Invariant property MIN12 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN12,0,17.8972,381464,1,0,22,1.12698e+06,20,0,463,2.09826e+06,0
Invariant property MIN13 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN13,0,17.9095,381464,1,0,22,1.12698e+06,20,0,463,2.09826e+06,0
ITS tools runner thread asked to quit. Dying gracefully.
At refinement iteration 6 (OVERLAPS) 0/321 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 58 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10021 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 293/319 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 30/56 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 270/326 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 2/321 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/321 variables, and 328 constraints, problems are : Problem set: 0 solved, 270 unsolved in 20012 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30102ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 30103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30112 ms. Remains : 28/28 places, 293/293 transitions.
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-15 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-14 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-13 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-12 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-10 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-09 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-08 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-07 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-05 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-04 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-03 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-02 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-01 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-00 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 14 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 337973 ms.
BK_STOP 1779628733562
--------------------
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="DNAwalker-PT-12ringLLLarge"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool gold2025"
echo " Input is DNAwalker-PT-12ringLLLarge, 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 r111-tall-177955700900103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-12ringLLLarge.tgz
mv DNAwalker-PT-12ringLLLarge 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 '
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 ;
