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.r351-smll-178021502100056.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 FileSystem-PT-N03I10B10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-smll-178021502100056
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.2K May 27 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 27 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 27 10:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 27 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 27 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 27 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 236K Jun 10 11:57 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 FileSystem-PT-N03I10B10-UpperBounds-00
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-01
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-02
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-03
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-04
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-05
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-06
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-07
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-08
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-09
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-10
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-11
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-12
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-13
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-14
FORMULA_NAME FileSystem-PT-N03I10B10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1781615081298

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N03I10B10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-16 13:04:44] [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-06-16 13:04:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 13:04:44] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2026-06-16 13:04:44] [INFO ] Transformed 561 places.
[2026-06-16 13:04:44] [INFO ] Transformed 520 transitions.
[2026-06-16 13:04:44] [INFO ] Parsed PT model containing 561 places and 520 transitions and 1850 arcs in 483 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Reduce places removed 10 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 520 rows 551 cols
[2026-06-16 13:04:44] [INFO ] Computed 41 invariants in 77 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[20, 1, 1, 1, 1, 1, 1, 1, 1, 20, 1, 1, 1, 1, 1, 1]
FORMULA FileSystem-PT-N03I10B10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (151 resets) in 129 ms. (76 steps per ms)
BEST_FIRST walk for 150010 steps (505 resets) in 535 ms. (279 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[20, 1, 1, 1, 1, 1, 1, 1, 20, 1, 1, 1, 1, 1, 1]
[2026-06-16 13:04:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:04:46] [INFO ] [Real]Absence check using 31 positive place invariants in 66 ms returned sat
[2026-06-16 13:04:46] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 4 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:04:46] [INFO ] [Real]Absence check using 31 positive place invariants in 54 ms returned sat
[2026-06-16 13:04:46] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 16 ms returned sat
[2026-06-16 13:04:47] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2026-06-16 13:04:47] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-16 13:04:47] [INFO ] [Real]Added 100 Read/Feed constraints in 218 ms returned sat
[2026-06-16 13:04:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:04:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 57 ms returned sat
[2026-06-16 13:04:47] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 16 ms returned sat
[2026-06-16 13:04:48] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2026-06-16 13:04:48] [INFO ] [Nat]Added 100 Read/Feed constraints in 176 ms returned sat
[2026-06-16 13:04:48] [INFO ] Computed and/alt/rep : 410/420/410 causal constraints (skipped 100 transitions) in 53 ms.
[2026-06-16 13:04:49] [INFO ] Added : 69 causal constraints over 14 iterations in 1016 ms. Result :sat
Minimization took 514 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:04:50] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2026-06-16 13:04:50] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 21 ms returned sat
[2026-06-16 13:04:50] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2026-06-16 13:04:50] [INFO ] [Real]Added 100 Read/Feed constraints in 114 ms returned sat
[2026-06-16 13:04:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:04:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 48 ms returned sat
[2026-06-16 13:04:51] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 12 ms returned sat
[2026-06-16 13:04:51] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2026-06-16 13:04:52] [INFO ] [Nat]Added 100 Read/Feed constraints in 179 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:04:52] [INFO ] [Real]Absence check using 31 positive place invariants in 46 ms returned sat
[2026-06-16 13:04:52] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 10 ms returned sat
[2026-06-16 13:04:52] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2026-06-16 13:04:52] [INFO ] [Real]Added 100 Read/Feed constraints in 57 ms returned sat
[2026-06-16 13:04:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:04:53] [INFO ] [Nat]Absence check using 31 positive place invariants in 46 ms returned sat
[2026-06-16 13:04:53] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 10 ms returned sat
[2026-06-16 13:04:53] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2026-06-16 13:04:54] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:04:54] [INFO ] [Nat]Added 100 Read/Feed constraints in 863 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:04:54] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2026-06-16 13:04:54] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 12 ms returned sat
[2026-06-16 13:04:55] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2026-06-16 13:04:55] [INFO ] [Real]Added 100 Read/Feed constraints in 136 ms returned sat
[2026-06-16 13:04:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:04:55] [INFO ] [Nat]Absence check using 31 positive place invariants in 45 ms returned sat
[2026-06-16 13:04:55] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 12 ms returned sat
[2026-06-16 13:04:55] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2026-06-16 13:04:56] [INFO ] [Nat]Added 100 Read/Feed constraints in 255 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:04:56] [INFO ] [Real]Absence check using 31 positive place invariants in 45 ms returned sat
[2026-06-16 13:04:56] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 10 ms returned sat
[2026-06-16 13:04:56] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2026-06-16 13:04:57] [INFO ] [Real]Added 100 Read/Feed constraints in 66 ms returned sat
[2026-06-16 13:04:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:04:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 48 ms returned sat
[2026-06-16 13:04:57] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 15 ms returned sat
[2026-06-16 13:04:57] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2026-06-16 13:04:58] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 13:04:58] [INFO ] [Nat]Added 100 Read/Feed constraints in 621 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:04:58] [INFO ] [Real]Absence check using 31 positive place invariants in 32 ms returned sat
[2026-06-16 13:04:58] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 9 ms returned sat
[2026-06-16 13:04:59] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2026-06-16 13:04:59] [INFO ] [Real]Added 100 Read/Feed constraints in 105 ms returned sat
[2026-06-16 13:04:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:04:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 44 ms returned sat
[2026-06-16 13:04:59] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 12 ms returned sat
[2026-06-16 13:04:59] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2026-06-16 13:05:00] [INFO ] [Nat]Added 100 Read/Feed constraints in 297 ms returned sat
[2026-06-16 13:05:00] [INFO ] Computed and/alt/rep : 410/420/410 causal constraints (skipped 100 transitions) in 57 ms.
[2026-06-16 13:05:01] [INFO ] Added : 70 causal constraints over 14 iterations in 1019 ms. Result :sat
Minimization took 586 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:02] [INFO ] [Real]Absence check using 31 positive place invariants in 45 ms returned sat
[2026-06-16 13:05:02] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 12 ms returned sat
[2026-06-16 13:05:02] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2026-06-16 13:05:02] [INFO ] [Real]Added 100 Read/Feed constraints in 90 ms returned sat
[2026-06-16 13:05:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:02] [INFO ] [Nat]Absence check using 31 positive place invariants in 42 ms returned sat
[2026-06-16 13:05:02] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 12 ms returned sat
[2026-06-16 13:05:03] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2026-06-16 13:05:03] [INFO ] [Nat]Added 100 Read/Feed constraints in 234 ms returned sat
[2026-06-16 13:05:03] [INFO ] Computed and/alt/rep : 410/420/410 causal constraints (skipped 100 transitions) in 75 ms.
[2026-06-16 13:05:05] [INFO ] Added : 68 causal constraints over 14 iterations in 1421 ms. Result :sat
Minimization took 577 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:05] [INFO ] [Real]Absence check using 31 positive place invariants in 41 ms returned sat
[2026-06-16 13:05:05] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 10 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:06] [INFO ] [Real]Absence check using 31 positive place invariants in 54 ms returned sat
[2026-06-16 13:05:06] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 9 ms returned sat
[2026-06-16 13:05:06] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2026-06-16 13:05:06] [INFO ] [Real]Added 100 Read/Feed constraints in 139 ms returned sat
[2026-06-16 13:05:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 45 ms returned sat
[2026-06-16 13:05:06] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 11 ms returned sat
[2026-06-16 13:05:07] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2026-06-16 13:05:07] [INFO ] [Nat]Added 100 Read/Feed constraints in 279 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:07] [INFO ] [Real]Absence check using 31 positive place invariants in 41 ms returned sat
[2026-06-16 13:05:07] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 10 ms returned sat
[2026-06-16 13:05:08] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2026-06-16 13:05:08] [INFO ] [Real]Added 100 Read/Feed constraints in 113 ms returned sat
[2026-06-16 13:05:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 45 ms returned sat
[2026-06-16 13:05:08] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 15 ms returned sat
[2026-06-16 13:05:09] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2026-06-16 13:05:09] [INFO ] [Nat]Added 100 Read/Feed constraints in 271 ms returned sat
[2026-06-16 13:05:09] [INFO ] Computed and/alt/rep : 410/420/410 causal constraints (skipped 100 transitions) in 60 ms.
[2026-06-16 13:05:10] [INFO ] Added : 72 causal constraints over 15 iterations in 1314 ms. Result :sat
Minimization took 575 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:11] [INFO ] [Real]Absence check using 31 positive place invariants in 44 ms returned sat
[2026-06-16 13:05:11] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 12 ms returned sat
[2026-06-16 13:05:11] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2026-06-16 13:05:11] [INFO ] [Real]Added 100 Read/Feed constraints in 33 ms returned sat
[2026-06-16 13:05:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2026-06-16 13:05:12] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 8 ms returned sat
[2026-06-16 13:05:12] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2026-06-16 13:05:12] [INFO ] [Nat]Added 100 Read/Feed constraints in 444 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:13] [INFO ] [Real]Absence check using 31 positive place invariants in 39 ms returned sat
[2026-06-16 13:05:13] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 11 ms returned sat
[2026-06-16 13:05:13] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2026-06-16 13:05:13] [INFO ] [Real]Added 100 Read/Feed constraints in 68 ms returned sat
[2026-06-16 13:05:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:13] [INFO ] [Nat]Absence check using 31 positive place invariants in 42 ms returned sat
[2026-06-16 13:05:13] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 12 ms returned sat
[2026-06-16 13:05:14] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2026-06-16 13:05:14] [INFO ] [Nat]Added 100 Read/Feed constraints in 344 ms returned sat
[2026-06-16 13:05:14] [INFO ] Computed and/alt/rep : 410/420/410 causal constraints (skipped 100 transitions) in 63 ms.
[2026-06-16 13:05:16] [INFO ] Added : 68 causal constraints over 14 iterations in 1225 ms. Result :sat
Minimization took 572 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:16] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2026-06-16 13:05:16] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 10 ms returned sat
[2026-06-16 13:05:17] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2026-06-16 13:05:17] [INFO ] [Real]Added 100 Read/Feed constraints in 88 ms returned sat
[2026-06-16 13:05:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 47 ms returned sat
[2026-06-16 13:05:17] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 11 ms returned sat
[2026-06-16 13:05:17] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2026-06-16 13:05:18] [INFO ] [Nat]Added 100 Read/Feed constraints in 371 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:18] [INFO ] [Real]Absence check using 31 positive place invariants in 27 ms returned sat
[2026-06-16 13:05:18] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 7 ms returned sat
[2026-06-16 13:05:18] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2026-06-16 13:05:19] [INFO ] [Real]Added 100 Read/Feed constraints in 53 ms returned sat
[2026-06-16 13:05:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-16 13:05:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 43 ms returned sat
[2026-06-16 13:05:19] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 10 ms returned sat
[2026-06-16 13:05:19] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2026-06-16 13:05:20] [INFO ] [Nat]Added 100 Read/Feed constraints in 477 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0]
FORMULA FileSystem-PT-N03I10B10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N03I10B10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N03I10B10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N03I10B10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N03I10B10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N03I10B10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N03I10B10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N03I10B10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N03I10B10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N03I10B10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 520/520 transitions.
Graph (complete) has 1240 edges and 551 vertex of which 455 are kept as prefixes of interest. Removing 96 places using SCC suffix rule.6 ms
Discarding 96 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 455 transition count 510
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 445 transition count 510
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 106 place count 360 transition count 425
Iterating global reduction 2 with 85 rules applied. Total rules applied 191 place count 360 transition count 425
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 411 place count 250 transition count 315
Free-agglomeration rule (complex) applied 100 times.
Iterating global reduction 2 with 100 rules applied. Total rules applied 511 place count 250 transition count 215
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 2 with 106 rules applied. Total rules applied 617 place count 144 transition count 215
Applied a total of 617 rules in 275 ms. Remains 144 /551 variables (removed 407) and now considering 215/520 (removed 305) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 144/551 places, 215/520 transitions.
// Phase 1: matrix 215 rows 144 cols
[2026-06-16 13:05:20] [INFO ] Computed 16 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (38461 resets) in 2221 ms. (450 steps per ms)
BEST_FIRST walk for 5000002 steps (35085 resets) in 3672 ms. (1361 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-06-16 13:05:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:05:26] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-06-16 13:05:26] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2026-06-16 13:05:26] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-16 13:05:26] [INFO ] [Real]Added 100 Read/Feed constraints in 23 ms returned sat
[2026-06-16 13:05:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:05:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2026-06-16 13:05:26] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2026-06-16 13:05:26] [INFO ] [Nat]Added 100 Read/Feed constraints in 36 ms returned sat
[2026-06-16 13:05:26] [INFO ] Computed and/alt/rep : 105/115/105 causal constraints (skipped 100 transitions) in 21 ms.
[2026-06-16 13:05:26] [INFO ] Added : 11 causal constraints over 3 iterations in 98 ms. Result :sat
Minimization took 152 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:05:27] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2026-06-16 13:05:27] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2026-06-16 13:05:27] [INFO ] [Real]Added 100 Read/Feed constraints in 26 ms returned sat
[2026-06-16 13:05:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:05:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2026-06-16 13:05:27] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2026-06-16 13:05:27] [INFO ] [Nat]Added 100 Read/Feed constraints in 77 ms returned sat
[2026-06-16 13:05:27] [INFO ] Computed and/alt/rep : 105/115/105 causal constraints (skipped 100 transitions) in 28 ms.
[2026-06-16 13:05:27] [INFO ] Added : 11 causal constraints over 3 iterations in 136 ms. Result :sat
Minimization took 176 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:05:27] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2026-06-16 13:05:28] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-06-16 13:05:28] [INFO ] [Real]Added 100 Read/Feed constraints in 37 ms returned sat
[2026-06-16 13:05:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:05:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2026-06-16 13:05:28] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2026-06-16 13:05:28] [INFO ] [Nat]Added 100 Read/Feed constraints in 73 ms returned sat
[2026-06-16 13:05:28] [INFO ] Computed and/alt/rep : 105/115/105 causal constraints (skipped 100 transitions) in 23 ms.
[2026-06-16 13:05:28] [INFO ] Added : 11 causal constraints over 3 iterations in 139 ms. Result :sat
Minimization took 134 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:05:28] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2026-06-16 13:05:28] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2026-06-16 13:05:28] [INFO ] [Real]Added 100 Read/Feed constraints in 39 ms returned sat
[2026-06-16 13:05:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:05:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-06-16 13:05:29] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-06-16 13:05:29] [INFO ] [Nat]Added 100 Read/Feed constraints in 47 ms returned sat
[2026-06-16 13:05:29] [INFO ] Computed and/alt/rep : 105/115/105 causal constraints (skipped 100 transitions) in 14 ms.
[2026-06-16 13:05:29] [INFO ] Added : 10 causal constraints over 2 iterations in 71 ms. Result :sat
Minimization took 104 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:05:29] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-06-16 13:05:29] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-06-16 13:05:29] [INFO ] [Real]Added 100 Read/Feed constraints in 15 ms returned sat
[2026-06-16 13:05:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-16 13:05:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2026-06-16 13:05:29] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2026-06-16 13:05:29] [INFO ] [Nat]Added 100 Read/Feed constraints in 155 ms returned sat
[2026-06-16 13:05:29] [INFO ] Computed and/alt/rep : 105/115/105 causal constraints (skipped 100 transitions) in 36 ms.
[2026-06-16 13:05:29] [INFO ] Added : 11 causal constraints over 3 iterations in 140 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 215/215 transitions.
Applied a total of 0 rules in 18 ms. Remains 144 /144 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 144/144 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 215/215 transitions.
Applied a total of 0 rules in 19 ms. Remains 144 /144 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2026-06-16 13:05:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:05:30] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-06-16 13:05:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:05:30] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-16 13:05:32] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-06-16 13:05:32] [INFO ] Redundant transitions in 16 ms returned []
Running 205 sub problems to find dead transitions.
[2026-06-16 13:05:32] [INFO ] Invariant cache hit.
[2026-06-16 13:05:32] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 11/140 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:35] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:35] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:36] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:36] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:36] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:36] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:36] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:36] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:36] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:36] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:36] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:36] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:36] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:37] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:37] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:37] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:37] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:37] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:37] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:38] [INFO ] Deduced a trap composed of 2 places in 150 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:39] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:39] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:39] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:39] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:40] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:40] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:40] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:40] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:40] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:41] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:41] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:41] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:41] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:41] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:41] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:42] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:42] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:42] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:42] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:42] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:43] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:43] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:43] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:44] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:44] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:44] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:45] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:45] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:45] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:45] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:05:47] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 215/355 variables, 140/207 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 100/307 constraints. Problems are: Problem set: 20 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/307 constraints. Problems are: Problem set: 20 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 4/359 variables, 4/311 constraints. Problems are: Problem set: 20 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 359/359 variables, and 311 constraints, problems are : Problem set: 20 solved, 185 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 144/144 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 4/18 constraints. Problems are: Problem set: 20 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/18 constraints. Problems are: Problem set: 20 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 11/140 variables, 2/20 constraints. Problems are: Problem set: 20 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 47/67 constraints. Problems are: Problem set: 20 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:06:04] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:06:04] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-16 13:06:05] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 3/70 constraints. Problems are: Problem set: 20 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/70 constraints. Problems are: Problem set: 20 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 215/355 variables, 140/210 constraints. Problems are: Problem set: 20 solved, 185 unsolved
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 100/310 constraints. Problems are: Problem set: 170 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 19/329 constraints. Problems are: Problem set: 170 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/329 constraints. Problems are: Problem set: 170 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 4/359 variables, 4/333 constraints. Problems are: Problem set: 170 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/359 variables, 16/349 constraints. Problems are: Problem set: 170 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/359 variables, 0/349 constraints. Problems are: Problem set: 170 solved, 35 unsolved
At refinement iteration 14 (OVERLAPS) 0/359 variables, 0/349 constraints. Problems are: Problem set: 170 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 349 constraints, problems are : Problem set: 170 solved, 35 unsolved in 26881 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 144/144 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 35/205 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57127ms problems are : Problem set: 170 solved, 35 unsolved
Search for dead transitions found 170 dead transitions in 57146ms
Found 170 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 170 transitions
Dead transitions reduction (with SMT) removed 170 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 144/144 places, 45/215 transitions.
Graph (complete) has 126 edges and 144 vertex of which 9 are kept as prefixes of interest. Removing 135 places using SCC suffix rule.1 ms
Discarding 135 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Reduce places removed 4 places and 5 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 5 transition count 0
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 5 rules in 2 ms. Remains 5 /144 variables (removed 139) and now considering 0/45 (removed 45) transitions.
[2026-06-16 13:06:29] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:06:29] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-06-16 13:06:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-16 13:06:29] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 5/144 places, 0/215 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 59079 ms. Remains : 5/144 places, 0/215 transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
FORMULA FileSystem-PT-N03I10B10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 105358 ms.

BK_STOP 1781615189435

--------------------
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="FileSystem-PT-N03I10B10"
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 FileSystem-PT-N03I10B10, 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 r351-smll-178021502100056"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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